./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/forester-heap/sll-01_false-unreach-call_false-valid-deref.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_36a1dd9a-f06e-42bb-839d-82a9c3355dd8/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_36a1dd9a-f06e-42bb-839d-82a9c3355dd8/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_36a1dd9a-f06e-42bb-839d-82a9c3355dd8/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_36a1dd9a-f06e-42bb-839d-82a9c3355dd8/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/forester-heap/sll-01_false-unreach-call_false-valid-deref.i -s /tmp/vcloud-vcloud-master/worker/working_dir_36a1dd9a-f06e-42bb-839d-82a9c3355dd8/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_36a1dd9a-f06e-42bb-839d-82a9c3355dd8/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 31de2fb67e84e52bb7705ac8720e6b139fef2d91 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 09:44:21,157 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 09:44:21,158 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 09:44:21,164 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 09:44:21,165 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 09:44:21,165 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 09:44:21,166 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 09:44:21,166 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 09:44:21,167 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 09:44:21,168 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 09:44:21,168 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 09:44:21,169 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 09:44:21,169 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 09:44:21,170 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 09:44:21,171 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 09:44:21,171 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 09:44:21,172 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 09:44:21,173 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 09:44:21,174 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 09:44:21,174 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 09:44:21,175 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 09:44:21,176 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 09:44:21,177 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 09:44:21,178 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 09:44:21,178 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 09:44:21,178 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 09:44:21,179 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 09:44:21,179 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 09:44:21,180 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 09:44:21,181 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 09:44:21,181 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 09:44:21,181 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 09:44:21,181 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 09:44:21,182 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 09:44:21,182 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 09:44:21,183 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 09:44:21,183 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_36a1dd9a-f06e-42bb-839d-82a9c3355dd8/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 09:44:21,193 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 09:44:21,193 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 09:44:21,194 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 09:44:21,194 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 09:44:21,194 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 09:44:21,194 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 09:44:21,194 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 09:44:21,194 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 09:44:21,195 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 09:44:21,195 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 09:44:21,195 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 09:44:21,195 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 09:44:21,195 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 09:44:21,195 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 09:44:21,196 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 09:44:21,196 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 09:44:21,196 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 09:44:21,196 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 09:44:21,196 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 09:44:21,196 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 09:44:21,196 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 09:44:21,196 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 09:44:21,197 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 09:44:21,197 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 09:44:21,197 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 09:44:21,197 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 09:44:21,197 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 09:44:21,197 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 09:44:21,197 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 09:44:21,198 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 09:44:21,198 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 09:44:21,198 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 09:44:21,198 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 09:44:21,198 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 09:44:21,198 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 09:44:21,198 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 09:44:21,198 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 09:44:21,198 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_36a1dd9a-f06e-42bb-839d-82a9c3355dd8/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 31de2fb67e84e52bb7705ac8720e6b139fef2d91 [2018-11-18 09:44:21,223 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 09:44:21,233 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 09:44:21,235 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 09:44:21,236 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 09:44:21,236 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 09:44:21,237 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_36a1dd9a-f06e-42bb-839d-82a9c3355dd8/bin-2019/utaipan/../../sv-benchmarks/c/forester-heap/sll-01_false-unreach-call_false-valid-deref.i [2018-11-18 09:44:21,279 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_36a1dd9a-f06e-42bb-839d-82a9c3355dd8/bin-2019/utaipan/data/5042f6439/9582656ebe394dc898aef2eb0f751233/FLAG119829d82 [2018-11-18 09:44:21,631 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 09:44:21,631 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_36a1dd9a-f06e-42bb-839d-82a9c3355dd8/sv-benchmarks/c/forester-heap/sll-01_false-unreach-call_false-valid-deref.i [2018-11-18 09:44:21,639 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_36a1dd9a-f06e-42bb-839d-82a9c3355dd8/bin-2019/utaipan/data/5042f6439/9582656ebe394dc898aef2eb0f751233/FLAG119829d82 [2018-11-18 09:44:21,647 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_36a1dd9a-f06e-42bb-839d-82a9c3355dd8/bin-2019/utaipan/data/5042f6439/9582656ebe394dc898aef2eb0f751233 [2018-11-18 09:44:21,649 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 09:44:21,651 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 09:44:21,651 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 09:44:21,651 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 09:44:21,654 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 09:44:21,655 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:44:21" (1/1) ... [2018-11-18 09:44:21,657 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2713e74a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:44:21, skipping insertion in model container [2018-11-18 09:44:21,657 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:44:21" (1/1) ... [2018-11-18 09:44:21,666 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 09:44:21,698 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 09:44:21,892 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:44:21,898 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 09:44:21,929 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:44:21,999 INFO L195 MainTranslator]: Completed translation [2018-11-18 09:44:22,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:44:22 WrapperNode [2018-11-18 09:44:22,000 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 09:44:22,001 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 09:44:22,001 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 09:44:22,001 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 09:44:22,008 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:44:22" (1/1) ... [2018-11-18 09:44:22,017 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:44:22" (1/1) ... [2018-11-18 09:44:22,022 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 09:44:22,022 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 09:44:22,022 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 09:44:22,022 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 09:44:22,028 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:44:22" (1/1) ... [2018-11-18 09:44:22,028 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:44:22" (1/1) ... [2018-11-18 09:44:22,030 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:44:22" (1/1) ... [2018-11-18 09:44:22,030 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:44:22" (1/1) ... [2018-11-18 09:44:22,038 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:44:22" (1/1) ... [2018-11-18 09:44:22,044 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:44:22" (1/1) ... [2018-11-18 09:44:22,045 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:44:22" (1/1) ... [2018-11-18 09:44:22,047 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 09:44:22,047 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 09:44:22,047 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 09:44:22,047 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 09:44:22,048 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:44:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_36a1dd9a-f06e-42bb-839d-82a9c3355dd8/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 09:44:22,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 09:44:22,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 09:44:22,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 09:44:22,080 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 09:44:22,080 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 09:44:22,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 09:44:22,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 09:44:22,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 09:44:22,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 09:44:22,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 09:44:22,394 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 09:44:22,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:44:22 BoogieIcfgContainer [2018-11-18 09:44:22,395 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 09:44:22,395 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 09:44:22,395 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 09:44:22,398 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 09:44:22,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:44:21" (1/3) ... [2018-11-18 09:44:22,399 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3314d996 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:44:22, skipping insertion in model container [2018-11-18 09:44:22,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:44:22" (2/3) ... [2018-11-18 09:44:22,400 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3314d996 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:44:22, skipping insertion in model container [2018-11-18 09:44:22,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:44:22" (3/3) ... [2018-11-18 09:44:22,402 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-01_false-unreach-call_false-valid-deref.i [2018-11-18 09:44:22,410 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 09:44:22,416 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-11-18 09:44:22,428 INFO L257 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2018-11-18 09:44:22,453 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 09:44:22,453 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 09:44:22,453 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 09:44:22,454 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 09:44:22,454 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 09:44:22,454 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 09:44:22,454 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 09:44:22,454 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 09:44:22,469 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states. [2018-11-18 09:44:22,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-18 09:44:22,474 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:44:22,474 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:44:22,476 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:44:22,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:44:22,480 INFO L82 PathProgramCache]: Analyzing trace with hash 627106702, now seen corresponding path program 1 times [2018-11-18 09:44:22,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:44:22,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:44:22,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:44:22,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:44:22,515 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:44:22,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:44:22,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:44:22,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:44:22,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:44:22,577 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:44:22,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:44:22,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:44:22,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:44:22,589 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 3 states. [2018-11-18 09:44:22,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:44:22,632 INFO L93 Difference]: Finished difference Result 212 states and 330 transitions. [2018-11-18 09:44:22,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:44:22,633 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-11-18 09:44:22,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:44:22,639 INFO L225 Difference]: With dead ends: 212 [2018-11-18 09:44:22,639 INFO L226 Difference]: Without dead ends: 113 [2018-11-18 09:44:22,642 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:44:22,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-18 09:44:22,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 93. [2018-11-18 09:44:22,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-18 09:44:22,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2018-11-18 09:44:22,670 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 9 [2018-11-18 09:44:22,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:44:22,670 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2018-11-18 09:44:22,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:44:22,670 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2018-11-18 09:44:22,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-18 09:44:22,670 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:44:22,671 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:44:22,671 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:44:22,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:44:22,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1534523960, now seen corresponding path program 1 times [2018-11-18 09:44:22,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:44:22,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:44:22,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:44:22,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:44:22,673 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:44:22,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:44:22,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:44:22,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:44:22,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:44:22,710 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:44:22,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:44:22,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:44:22,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:44:22,711 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand 3 states. [2018-11-18 09:44:22,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:44:22,722 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2018-11-18 09:44:22,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:44:22,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-18 09:44:22,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:44:22,723 INFO L225 Difference]: With dead ends: 96 [2018-11-18 09:44:22,723 INFO L226 Difference]: Without dead ends: 94 [2018-11-18 09:44:22,724 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:44:22,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-18 09:44:22,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-11-18 09:44:22,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-18 09:44:22,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2018-11-18 09:44:22,731 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 15 [2018-11-18 09:44:22,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:44:22,732 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2018-11-18 09:44:22,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:44:22,732 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2018-11-18 09:44:22,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-18 09:44:22,732 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:44:22,732 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:44:22,733 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:44:22,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:44:22,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1534525882, now seen corresponding path program 1 times [2018-11-18 09:44:22,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:44:22,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:44:22,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:44:22,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:44:22,735 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:44:22,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:44:22,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:44:22,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:44:22,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 09:44:22,787 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:44:22,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 09:44:22,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 09:44:22,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:44:22,787 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand 4 states. [2018-11-18 09:44:22,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:44:22,836 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2018-11-18 09:44:22,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 09:44:22,837 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-18 09:44:22,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:44:22,838 INFO L225 Difference]: With dead ends: 95 [2018-11-18 09:44:22,838 INFO L226 Difference]: Without dead ends: 93 [2018-11-18 09:44:22,838 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:44:22,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-18 09:44:22,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2018-11-18 09:44:22,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-18 09:44:22,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2018-11-18 09:44:22,844 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 15 [2018-11-18 09:44:22,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:44:22,844 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2018-11-18 09:44:22,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 09:44:22,844 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2018-11-18 09:44:22,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 09:44:22,845 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:44:22,845 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:44:22,845 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:44:22,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:44:22,846 INFO L82 PathProgramCache]: Analyzing trace with hash 615762310, now seen corresponding path program 1 times [2018-11-18 09:44:22,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:44:22,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:44:22,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:44:22,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:44:22,847 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:44:22,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:44:22,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:44:22,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:44:22,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:44:22,881 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:44:22,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:44:22,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:44:22,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:44:22,882 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand 3 states. [2018-11-18 09:44:22,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:44:22,927 INFO L93 Difference]: Finished difference Result 95 states and 106 transitions. [2018-11-18 09:44:22,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:44:22,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-18 09:44:22,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:44:22,929 INFO L225 Difference]: With dead ends: 95 [2018-11-18 09:44:22,929 INFO L226 Difference]: Without dead ends: 91 [2018-11-18 09:44:22,929 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:44:22,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-18 09:44:22,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2018-11-18 09:44:22,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-18 09:44:22,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 97 transitions. [2018-11-18 09:44:22,934 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 97 transitions. Word has length 22 [2018-11-18 09:44:22,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:44:22,935 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 97 transitions. [2018-11-18 09:44:22,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:44:22,935 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions. [2018-11-18 09:44:22,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 09:44:22,936 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:44:22,936 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:44:22,936 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:44:22,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:44:22,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1909102183, now seen corresponding path program 1 times [2018-11-18 09:44:22,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:44:22,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:44:22,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:44:22,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:44:22,938 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:44:22,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:44:22,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:44:22,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:44:22,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 09:44:22,988 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:44:22,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 09:44:22,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 09:44:22,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:44:22,989 INFO L87 Difference]: Start difference. First operand 87 states and 97 transitions. Second operand 4 states. [2018-11-18 09:44:23,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:44:23,038 INFO L93 Difference]: Finished difference Result 155 states and 171 transitions. [2018-11-18 09:44:23,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 09:44:23,039 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-11-18 09:44:23,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:44:23,039 INFO L225 Difference]: With dead ends: 155 [2018-11-18 09:44:23,039 INFO L226 Difference]: Without dead ends: 133 [2018-11-18 09:44:23,040 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 09:44:23,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-18 09:44:23,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 87. [2018-11-18 09:44:23,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-18 09:44:23,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 97 transitions. [2018-11-18 09:44:23,043 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 97 transitions. Word has length 23 [2018-11-18 09:44:23,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:44:23,044 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 97 transitions. [2018-11-18 09:44:23,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 09:44:23,044 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions. [2018-11-18 09:44:23,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 09:44:23,044 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:44:23,045 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:44:23,045 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:44:23,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:44:23,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1854876944, now seen corresponding path program 1 times [2018-11-18 09:44:23,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:44:23,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:44:23,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:44:23,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:44:23,046 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:44:23,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:44:23,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:44:23,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:44:23,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 09:44:23,109 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:44:23,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 09:44:23,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 09:44:23,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:44:23,110 INFO L87 Difference]: Start difference. First operand 87 states and 97 transitions. Second operand 4 states. [2018-11-18 09:44:23,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:44:23,166 INFO L93 Difference]: Finished difference Result 223 states and 248 transitions. [2018-11-18 09:44:23,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 09:44:23,166 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-11-18 09:44:23,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:44:23,168 INFO L225 Difference]: With dead ends: 223 [2018-11-18 09:44:23,168 INFO L226 Difference]: Without dead ends: 149 [2018-11-18 09:44:23,169 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 09:44:23,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-11-18 09:44:23,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 89. [2018-11-18 09:44:23,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-18 09:44:23,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2018-11-18 09:44:23,176 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 30 [2018-11-18 09:44:23,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:44:23,176 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2018-11-18 09:44:23,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 09:44:23,176 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2018-11-18 09:44:23,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 09:44:23,177 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:44:23,177 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:44:23,177 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:44:23,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:44:23,177 INFO L82 PathProgramCache]: Analyzing trace with hash -139267762, now seen corresponding path program 1 times [2018-11-18 09:44:23,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:44:23,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:44:23,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:44:23,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:44:23,178 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:44:23,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:44:23,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:44:23,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:44:23,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:44:23,214 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:44:23,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:44:23,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:44:23,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:44:23,214 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand 3 states. [2018-11-18 09:44:23,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:44:23,226 INFO L93 Difference]: Finished difference Result 166 states and 186 transitions. [2018-11-18 09:44:23,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:44:23,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-18 09:44:23,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:44:23,227 INFO L225 Difference]: With dead ends: 166 [2018-11-18 09:44:23,227 INFO L226 Difference]: Without dead ends: 118 [2018-11-18 09:44:23,227 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:44:23,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-11-18 09:44:23,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 94. [2018-11-18 09:44:23,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-18 09:44:23,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 105 transitions. [2018-11-18 09:44:23,233 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 105 transitions. Word has length 30 [2018-11-18 09:44:23,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:44:23,233 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 105 transitions. [2018-11-18 09:44:23,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:44:23,233 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 105 transitions. [2018-11-18 09:44:23,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 09:44:23,234 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:44:23,234 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:44:23,235 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:44:23,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:44:23,235 INFO L82 PathProgramCache]: Analyzing trace with hash -22730209, now seen corresponding path program 1 times [2018-11-18 09:44:23,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:44:23,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:44:23,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:44:23,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:44:23,237 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:44:23,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:44:23,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:44:23,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:44:23,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:44:23,275 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:44:23,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:44:23,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:44:23,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:44:23,276 INFO L87 Difference]: Start difference. First operand 94 states and 105 transitions. Second operand 3 states. [2018-11-18 09:44:23,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:44:23,286 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2018-11-18 09:44:23,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:44:23,286 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-18 09:44:23,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:44:23,287 INFO L225 Difference]: With dead ends: 94 [2018-11-18 09:44:23,287 INFO L226 Difference]: Without dead ends: 92 [2018-11-18 09:44:23,287 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:44:23,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-18 09:44:23,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-11-18 09:44:23,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-18 09:44:23,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2018-11-18 09:44:23,292 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 31 [2018-11-18 09:44:23,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:44:23,292 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2018-11-18 09:44:23,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:44:23,292 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2018-11-18 09:44:23,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 09:44:23,293 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:44:23,293 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:44:23,294 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:44:23,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:44:23,294 INFO L82 PathProgramCache]: Analyzing trace with hash 394872672, now seen corresponding path program 1 times [2018-11-18 09:44:23,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:44:23,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:44:23,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:44:23,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:44:23,295 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:44:23,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:44:23,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:44:23,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:44:23,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:44:23,326 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:44:23,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:44:23,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:44:23,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:44:23,326 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand 3 states. [2018-11-18 09:44:23,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:44:23,346 INFO L93 Difference]: Finished difference Result 95 states and 106 transitions. [2018-11-18 09:44:23,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:44:23,346 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-18 09:44:23,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:44:23,347 INFO L225 Difference]: With dead ends: 95 [2018-11-18 09:44:23,347 INFO L226 Difference]: Without dead ends: 93 [2018-11-18 09:44:23,347 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:44:23,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-18 09:44:23,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-11-18 09:44:23,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-18 09:44:23,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 104 transitions. [2018-11-18 09:44:23,352 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 104 transitions. Word has length 31 [2018-11-18 09:44:23,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:44:23,352 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 104 transitions. [2018-11-18 09:44:23,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:44:23,353 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 104 transitions. [2018-11-18 09:44:23,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 09:44:23,353 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:44:23,353 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:44:23,354 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:44:23,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:44:23,354 INFO L82 PathProgramCache]: Analyzing trace with hash 394874594, now seen corresponding path program 1 times [2018-11-18 09:44:23,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:44:23,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:44:23,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:44:23,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:44:23,356 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:44:23,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:44:23,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:44:23,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:44:23,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 09:44:23,400 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:44:23,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 09:44:23,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 09:44:23,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:44:23,400 INFO L87 Difference]: Start difference. First operand 93 states and 104 transitions. Second operand 4 states. [2018-11-18 09:44:23,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:44:23,448 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2018-11-18 09:44:23,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 09:44:23,449 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-11-18 09:44:23,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:44:23,449 INFO L225 Difference]: With dead ends: 94 [2018-11-18 09:44:23,449 INFO L226 Difference]: Without dead ends: 92 [2018-11-18 09:44:23,450 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 09:44:23,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-18 09:44:23,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2018-11-18 09:44:23,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-18 09:44:23,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 101 transitions. [2018-11-18 09:44:23,454 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 101 transitions. Word has length 31 [2018-11-18 09:44:23,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:44:23,454 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 101 transitions. [2018-11-18 09:44:23,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 09:44:23,454 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 101 transitions. [2018-11-18 09:44:23,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-18 09:44:23,455 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:44:23,455 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:44:23,456 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:44:23,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:44:23,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1453288690, now seen corresponding path program 1 times [2018-11-18 09:44:23,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:44:23,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:44:23,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:44:23,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:44:23,457 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:44:23,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:44:23,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:44:23,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:44:23,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 09:44:23,584 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:44:23,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 09:44:23,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 09:44:23,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 09:44:23,585 INFO L87 Difference]: Start difference. First operand 90 states and 101 transitions. Second operand 7 states. [2018-11-18 09:44:23,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:44:23,744 INFO L93 Difference]: Finished difference Result 246 states and 275 transitions. [2018-11-18 09:44:23,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 09:44:23,744 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-11-18 09:44:23,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:44:23,745 INFO L225 Difference]: With dead ends: 246 [2018-11-18 09:44:23,745 INFO L226 Difference]: Without dead ends: 195 [2018-11-18 09:44:23,746 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-11-18 09:44:23,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-11-18 09:44:23,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 119. [2018-11-18 09:44:23,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-18 09:44:23,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 134 transitions. [2018-11-18 09:44:23,751 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 134 transitions. Word has length 34 [2018-11-18 09:44:23,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:44:23,751 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 134 transitions. [2018-11-18 09:44:23,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 09:44:23,751 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 134 transitions. [2018-11-18 09:44:23,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-18 09:44:23,752 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:44:23,752 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:44:23,752 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:44:23,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:44:23,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1100420466, now seen corresponding path program 1 times [2018-11-18 09:44:23,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:44:23,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:44:23,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:44:23,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:44:23,754 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:44:23,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:44:23,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:44:23,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:44:23,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 09:44:23,927 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:44:23,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 09:44:23,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 09:44:23,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 09:44:23,927 INFO L87 Difference]: Start difference. First operand 119 states and 134 transitions. Second operand 7 states. [2018-11-18 09:44:24,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:44:24,207 INFO L93 Difference]: Finished difference Result 302 states and 333 transitions. [2018-11-18 09:44:24,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 09:44:24,208 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-11-18 09:44:24,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:44:24,209 INFO L225 Difference]: With dead ends: 302 [2018-11-18 09:44:24,209 INFO L226 Difference]: Without dead ends: 300 [2018-11-18 09:44:24,210 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-11-18 09:44:24,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-11-18 09:44:24,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 136. [2018-11-18 09:44:24,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-18 09:44:24,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 153 transitions. [2018-11-18 09:44:24,216 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 153 transitions. Word has length 34 [2018-11-18 09:44:24,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:44:24,216 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 153 transitions. [2018-11-18 09:44:24,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 09:44:24,216 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 153 transitions. [2018-11-18 09:44:24,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-18 09:44:24,217 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:44:24,217 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:44:24,217 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:44:24,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:44:24,218 INFO L82 PathProgramCache]: Analyzing trace with hash -855136654, now seen corresponding path program 1 times [2018-11-18 09:44:24,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:44:24,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:44:24,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:44:24,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:44:24,219 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:44:24,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:44:24,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:44:24,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:44:24,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 09:44:24,385 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:44:24,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 09:44:24,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 09:44:24,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 09:44:24,386 INFO L87 Difference]: Start difference. First operand 136 states and 153 transitions. Second operand 7 states. [2018-11-18 09:44:24,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:44:24,660 INFO L93 Difference]: Finished difference Result 300 states and 331 transitions. [2018-11-18 09:44:24,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 09:44:24,660 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2018-11-18 09:44:24,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:44:24,661 INFO L225 Difference]: With dead ends: 300 [2018-11-18 09:44:24,661 INFO L226 Difference]: Without dead ends: 298 [2018-11-18 09:44:24,662 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-11-18 09:44:24,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-11-18 09:44:24,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 139. [2018-11-18 09:44:24,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-18 09:44:24,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 156 transitions. [2018-11-18 09:44:24,670 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 156 transitions. Word has length 37 [2018-11-18 09:44:24,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:44:24,670 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 156 transitions. [2018-11-18 09:44:24,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 09:44:24,671 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 156 transitions. [2018-11-18 09:44:24,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-18 09:44:24,671 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:44:24,671 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:44:24,672 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:44:24,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:44:24,672 INFO L82 PathProgramCache]: Analyzing trace with hash 152101170, now seen corresponding path program 1 times [2018-11-18 09:44:24,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:44:24,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:44:24,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:44:24,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:44:24,673 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:44:24,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:44:24,717 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 09:44:24,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:44:24,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 09:44:24,717 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:44:24,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 09:44:24,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 09:44:24,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-18 09:44:24,718 INFO L87 Difference]: Start difference. First operand 139 states and 156 transitions. Second operand 5 states. [2018-11-18 09:44:24,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:44:24,809 INFO L93 Difference]: Finished difference Result 204 states and 228 transitions. [2018-11-18 09:44:24,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 09:44:24,810 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-11-18 09:44:24,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:44:24,811 INFO L225 Difference]: With dead ends: 204 [2018-11-18 09:44:24,811 INFO L226 Difference]: Without dead ends: 184 [2018-11-18 09:44:24,811 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-18 09:44:24,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-11-18 09:44:24,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 175. [2018-11-18 09:44:24,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-11-18 09:44:24,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 200 transitions. [2018-11-18 09:44:24,820 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 200 transitions. Word has length 39 [2018-11-18 09:44:24,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:44:24,820 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 200 transitions. [2018-11-18 09:44:24,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 09:44:24,820 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 200 transitions. [2018-11-18 09:44:24,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-18 09:44:24,821 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:44:24,821 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:44:24,821 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:44:24,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:44:24,821 INFO L82 PathProgramCache]: Analyzing trace with hash -384923470, now seen corresponding path program 1 times [2018-11-18 09:44:24,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:44:24,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:44:24,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:44:24,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:44:24,823 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:44:24,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:44:24,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 09:44:24,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:44:24,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:44:24,838 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:44:24,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:44:24,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:44:24,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:44:24,838 INFO L87 Difference]: Start difference. First operand 175 states and 200 transitions. Second operand 3 states. [2018-11-18 09:44:24,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:44:24,870 INFO L93 Difference]: Finished difference Result 175 states and 200 transitions. [2018-11-18 09:44:24,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:44:24,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-18 09:44:24,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:44:24,871 INFO L225 Difference]: With dead ends: 175 [2018-11-18 09:44:24,871 INFO L226 Difference]: Without dead ends: 173 [2018-11-18 09:44:24,873 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:44:24,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-11-18 09:44:24,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-11-18 09:44:24,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-11-18 09:44:24,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 198 transitions. [2018-11-18 09:44:24,885 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 198 transitions. Word has length 39 [2018-11-18 09:44:24,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:44:24,885 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 198 transitions. [2018-11-18 09:44:24,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:44:24,885 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 198 transitions. [2018-11-18 09:44:24,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 09:44:24,886 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:44:24,886 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:44:24,886 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:44:24,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:44:24,887 INFO L82 PathProgramCache]: Analyzing trace with hash 413609883, now seen corresponding path program 1 times [2018-11-18 09:44:24,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:44:24,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:44:24,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:44:24,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:44:24,887 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:44:24,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:44:24,953 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:44:24,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:44:24,953 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 09:44:24,954 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 43 with the following transitions: [2018-11-18 09:44:24,955 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [16], [20], [26], [29], [35], [40], [48], [52], [58], [62], [64], [67], [144], [148], [155], [159], [167], [173], [177], [181], [183], [186], [192], [199], [203], [211], [214], [215], [259], [266], [270], [276], [360], [361], [362] [2018-11-18 09:44:24,991 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 09:44:24,991 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 09:44:25,153 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 09:44:25,155 INFO L272 AbstractInterpreter]: Visited 39 different actions 55 times. Merged at 16 different actions 16 times. Never widened. Performed 292 root evaluator evaluations with a maximum evaluation depth of 3. Performed 292 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 34 variables. [2018-11-18 09:44:25,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:44:25,161 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 09:44:25,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:44:25,161 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_36a1dd9a-f06e-42bb-839d-82a9c3355dd8/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:44:25,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:44:25,175 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 09:44:25,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:44:25,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:44:25,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 09:44:25,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 09:44:25,257 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 09:44:25,261 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:44:25,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 09:44:25,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 09:44:25,277 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 09:44:25,279 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:44:25,283 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:44:25,283 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-11-18 09:44:25,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-18 09:44:25,311 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:44:25,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-18 09:44:25,313 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 09:44:25,317 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:44:25,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-18 09:44:25,348 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:44:25,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-18 09:44:25,350 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 09:44:25,355 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:44:25,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:44:25,363 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2018-11-18 09:44:25,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-18 09:44:25,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-11-18 09:44:25,395 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 09:44:25,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:44:25,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-18 09:44:25,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-11-18 09:44:25,405 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 09:44:25,408 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:44:25,410 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:44:25,410 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:7 [2018-11-18 09:44:25,418 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:44:25,418 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 09:44:25,438 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:44:25,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 09:44:25,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 8 [2018-11-18 09:44:25,455 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 09:44:25,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 09:44:25,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 09:44:25,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-18 09:44:25,455 INFO L87 Difference]: Start difference. First operand 173 states and 198 transitions. Second operand 8 states. [2018-11-18 09:44:25,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:44:25,619 INFO L93 Difference]: Finished difference Result 303 states and 342 transitions. [2018-11-18 09:44:25,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 09:44:25,620 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-11-18 09:44:25,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:44:25,620 INFO L225 Difference]: With dead ends: 303 [2018-11-18 09:44:25,621 INFO L226 Difference]: Without dead ends: 226 [2018-11-18 09:44:25,621 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 78 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-11-18 09:44:25,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-11-18 09:44:25,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 176. [2018-11-18 09:44:25,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-11-18 09:44:25,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 199 transitions. [2018-11-18 09:44:25,638 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 199 transitions. Word has length 42 [2018-11-18 09:44:25,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:44:25,638 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 199 transitions. [2018-11-18 09:44:25,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 09:44:25,638 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 199 transitions. [2018-11-18 09:44:25,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 09:44:25,639 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:44:25,639 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:44:25,639 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:44:25,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:44:25,640 INFO L82 PathProgramCache]: Analyzing trace with hash 311800070, now seen corresponding path program 1 times [2018-11-18 09:44:25,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:44:25,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:44:25,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:44:25,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:44:25,641 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:44:25,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:44:25,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:44:25,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:44:25,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 09:44:25,787 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:44:25,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 09:44:25,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 09:44:25,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 09:44:25,787 INFO L87 Difference]: Start difference. First operand 176 states and 199 transitions. Second operand 6 states. [2018-11-18 09:44:25,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:44:25,895 INFO L93 Difference]: Finished difference Result 224 states and 246 transitions. [2018-11-18 09:44:25,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 09:44:25,895 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-11-18 09:44:25,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:44:25,896 INFO L225 Difference]: With dead ends: 224 [2018-11-18 09:44:25,896 INFO L226 Difference]: Without dead ends: 200 [2018-11-18 09:44:25,896 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-18 09:44:25,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-11-18 09:44:25,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 174. [2018-11-18 09:44:25,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-11-18 09:44:25,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 196 transitions. [2018-11-18 09:44:25,903 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 196 transitions. Word has length 42 [2018-11-18 09:44:25,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:44:25,903 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 196 transitions. [2018-11-18 09:44:25,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 09:44:25,904 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 196 transitions. [2018-11-18 09:44:25,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-18 09:44:25,904 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:44:25,904 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:44:25,904 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:44:25,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:44:25,905 INFO L82 PathProgramCache]: Analyzing trace with hash -108742968, now seen corresponding path program 1 times [2018-11-18 09:44:25,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:44:25,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:44:25,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:44:25,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:44:25,906 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:44:25,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:44:25,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:44:25,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:44:25,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:44:25,922 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:44:25,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:44:25,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:44:25,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:44:25,923 INFO L87 Difference]: Start difference. First operand 174 states and 196 transitions. Second operand 3 states. [2018-11-18 09:44:25,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:44:25,937 INFO L93 Difference]: Finished difference Result 305 states and 351 transitions. [2018-11-18 09:44:25,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:44:25,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-11-18 09:44:25,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:44:25,938 INFO L225 Difference]: With dead ends: 305 [2018-11-18 09:44:25,938 INFO L226 Difference]: Without dead ends: 236 [2018-11-18 09:44:25,939 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:44:25,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-11-18 09:44:25,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 204. [2018-11-18 09:44:25,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-11-18 09:44:25,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 232 transitions. [2018-11-18 09:44:25,946 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 232 transitions. Word has length 44 [2018-11-18 09:44:25,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:44:25,946 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 232 transitions. [2018-11-18 09:44:25,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:44:25,946 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 232 transitions. [2018-11-18 09:44:25,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-18 09:44:25,947 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:44:25,947 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:44:25,947 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:44:25,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:44:25,947 INFO L82 PathProgramCache]: Analyzing trace with hash 236789566, now seen corresponding path program 1 times [2018-11-18 09:44:25,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:44:25,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:44:25,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:44:25,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:44:25,948 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:44:25,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:44:26,018 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:44:26,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:44:26,018 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 09:44:26,018 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 47 with the following transitions: [2018-11-18 09:44:26,019 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [16], [20], [26], [29], [35], [40], [48], [52], [58], [62], [64], [67], [144], [148], [155], [159], [167], [171], [173], [177], [181], [259], [266], [270], [276], [282], [288], [291], [295], [302], [306], [314], [317], [318], [352], [354], [360], [361], [362] [2018-11-18 09:44:26,020 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 09:44:26,020 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 09:44:26,096 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 09:44:26,096 INFO L272 AbstractInterpreter]: Visited 43 different actions 63 times. Merged at 19 different actions 19 times. Never widened. Performed 350 root evaluator evaluations with a maximum evaluation depth of 3. Performed 350 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 38 variables. [2018-11-18 09:44:26,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:44:26,116 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 09:44:26,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:44:26,116 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_36a1dd9a-f06e-42bb-839d-82a9c3355dd8/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:44:26,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:44:26,124 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 09:44:26,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:44:26,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:44:26,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-18 09:44:26,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-18 09:44:26,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 09:44:26,158 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:44:26,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-18 09:44:26,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-18 09:44:26,173 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 09:44:26,175 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:44:26,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:44:26,178 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2018-11-18 09:44:26,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-18 09:44:26,240 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:44:26,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-18 09:44:26,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 09:44:26,284 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:44:26,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-18 09:44:26,311 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:44:26,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-18 09:44:26,313 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 09:44:26,316 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:44:26,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 09:44:26,319 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:7 [2018-11-18 09:44:26,325 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:44:26,326 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 09:44:26,413 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:44:26,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 09:44:26,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 12 [2018-11-18 09:44:26,439 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 09:44:26,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 09:44:26,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 09:44:26,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-11-18 09:44:26,439 INFO L87 Difference]: Start difference. First operand 204 states and 232 transitions. Second operand 10 states. [2018-11-18 09:44:26,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:44:26,755 INFO L93 Difference]: Finished difference Result 500 states and 564 transitions. [2018-11-18 09:44:26,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 09:44:26,756 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 46 [2018-11-18 09:44:26,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:44:26,757 INFO L225 Difference]: With dead ends: 500 [2018-11-18 09:44:26,757 INFO L226 Difference]: Without dead ends: 439 [2018-11-18 09:44:26,758 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2018-11-18 09:44:26,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2018-11-18 09:44:26,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 272. [2018-11-18 09:44:26,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-11-18 09:44:26,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 314 transitions. [2018-11-18 09:44:26,769 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 314 transitions. Word has length 46 [2018-11-18 09:44:26,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:44:26,769 INFO L480 AbstractCegarLoop]: Abstraction has 272 states and 314 transitions. [2018-11-18 09:44:26,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 09:44:26,769 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 314 transitions. [2018-11-18 09:44:26,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-18 09:44:26,770 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:44:26,770 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:44:26,770 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:44:26,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:44:26,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1351244782, now seen corresponding path program 1 times [2018-11-18 09:44:26,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:44:26,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:44:26,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:44:26,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:44:26,772 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:44:26,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:44:26,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:44:26,798 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 09:44:26,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 09:44:26 BoogieIcfgContainer [2018-11-18 09:44:26,831 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 09:44:26,831 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 09:44:26,831 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 09:44:26,831 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 09:44:26,832 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:44:22" (3/4) ... [2018-11-18 09:44:26,835 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-18 09:44:26,870 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_36a1dd9a-f06e-42bb-839d-82a9c3355dd8/bin-2019/utaipan/witness.graphml [2018-11-18 09:44:26,870 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 09:44:26,871 INFO L168 Benchmark]: Toolchain (without parser) took 5220.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 190.3 MB). Free memory was 956.6 MB in the beginning and 1.2 GB in the end (delta: -201.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:44:26,871 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:44:26,872 INFO L168 Benchmark]: CACSL2BoogieTranslator took 349.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -186.0 MB). Peak memory consumption was 42.0 MB. Max. memory is 11.5 GB. [2018-11-18 09:44:26,872 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 09:44:26,872 INFO L168 Benchmark]: Boogie Preprocessor took 24.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 09:44:26,872 INFO L168 Benchmark]: RCFGBuilder took 347.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.7 MB). Peak memory consumption was 38.7 MB. Max. memory is 11.5 GB. [2018-11-18 09:44:26,873 INFO L168 Benchmark]: TraceAbstraction took 4435.37 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 46.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -65.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:44:26,873 INFO L168 Benchmark]: Witness Printer took 39.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 11.5 GB. [2018-11-18 09:44:26,875 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 349.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -186.0 MB). Peak memory consumption was 42.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 347.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.7 MB). Peak memory consumption was 38.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4435.37 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 46.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -65.0 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 39.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1025]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L991] EXPR, FCALL malloc(sizeof(SLL)) [L991] SLL* list = malloc(sizeof(SLL)); [L992] FCALL list->next = ((void*)0) VAL [list={13:0}, malloc(sizeof(SLL))={13:0}] [L993] COND FALSE !(!(list != ((void*)0))) VAL [list={13:0}, malloc(sizeof(SLL))={13:0}] [L993] COND FALSE !(0) VAL [list={13:0}, malloc(sizeof(SLL))={13:0}] [L993] COND FALSE !(__VERIFIER_nondet_int()) [L993] EXPR, FCALL malloc(sizeof(SLL)) [L993] FCALL list->inner = malloc(sizeof(SLL)) [L993] EXPR, FCALL list->inner [L993] FCALL list->inner->next = ((void*)0) [L993] EXPR, FCALL list->inner [L993] FCALL list->inner->inner = ((void*)0) [L993] EXPR, FCALL list->inner [L993] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={13:0}, list->inner={15:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={13:0}] [L993] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L993] COND FALSE !(0) VAL [list={13:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={13:0}] [L995] SLL* end = list; VAL [end={13:0}, list={13:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={13:0}] [L998] COND FALSE !(__VERIFIER_nondet_int()) [L1008] end = ((void*)0) [L1009] end = list VAL [end={13:0}, list={13:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={13:0}] [L1012] COND FALSE !(!(((void*)0) != end)) VAL [end={13:0}, list={13:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={13:0}] [L1012] COND FALSE !(0) VAL [end={13:0}, list={13:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={13:0}] [L1014] COND TRUE ((void*)0) != end [L1016] int len = 0; [L1017] EXPR, FCALL end->inner [L1017] SLL* inner = end->inner; [L1018] COND TRUE ((void*)0) != inner VAL [end={13:0}, inner={15:0}, len=0, list={13:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={13:0}] [L1020] COND TRUE len == 0 [L1021] len = 1 VAL [end={13:0}, inner={15:0}, len=1, list={13:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={13:0}] [L1024] COND FALSE !(!(((void*)0) != inner)) VAL [end={13:0}, inner={15:0}, len=1, list={13:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={13:0}] [L1024] COND FALSE !(0) VAL [end={13:0}, inner={15:0}, len=1, list={13:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={13:0}] [L1025] EXPR, FCALL inner->inner VAL [end={13:0}, inner={15:0}, inner->inner={0:0}, len=1, list={13:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={13:0}] [L1025] COND FALSE !(!(((void*)0) == inner->inner)) [L1025] COND FALSE !(0) VAL [end={13:0}, inner={15:0}, len=1, list={13:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={13:0}] [L1026] EXPR, FCALL inner->next VAL [end={13:0}, inner={15:0}, inner->next={0:0}, len=1, list={13:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={13:0}] [L1026] COND FALSE !(!(((void*)0) == inner->next)) [L1026] COND FALSE !(0) VAL [end={13:0}, inner={15:0}, len=1, list={13:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={13:0}] [L1027] EXPR, FCALL inner->inner [L1027] inner = inner->inner [L1028] COND TRUE len == 1 [L1029] EXPR, FCALL inner->inner [L1029] inner = inner->inner [L1018] COND TRUE ((void*)0) != inner VAL [end={13:0}, inner={12:1}, len=1, list={13:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={13:0}] [L1020] COND FALSE !(len == 0) [L1023] len = 2 VAL [end={13:0}, inner={12:1}, len=2, list={13:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={13:0}] [L1024] COND FALSE !(!(((void*)0) != inner)) VAL [end={13:0}, inner={12:1}, len=2, list={13:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={13:0}] [L1024] COND FALSE !(0) VAL [end={13:0}, inner={12:1}, len=2, list={13:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={13:0}] [L1025] EXPR, FCALL inner->inner VAL [end={13:0}, inner={12:1}, inner->inner={11:9}, len=2, list={13:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={13:0}] [L1025] COND TRUE !(((void*)0) == inner->inner) [L1025] __VERIFIER_error() VAL [end={13:0}, inner={12:1}, len=2, list={13:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={13:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 100 locations, 13 error locations. UNSAFE Result, 4.3s OverallTime, 20 OverallIterations, 2 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1783 SDtfs, 2141 SDslu, 3247 SDs, 0 SdLazy, 1351 SolverSat, 161 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 301 GetRequests, 201 SyntacticMatches, 16 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=272occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 841 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 730 NumberOfCodeBlocks, 730 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 747 ConstructedInterpolants, 0 QuantifiedInterpolants, 271797 SizeOfPredicates, 17 NumberOfNonLiveVariables, 261 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 23 InterpolantComputations, 17 PerfectInterpolantSequences, 17/35 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...