./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.4_false-unreach-call.4.ufo.BOUNDED-8.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e4935f4f-8af5-49d6-8e19-9ed63d1a2d70/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e4935f4f-8af5-49d6-8e19-9ed63d1a2d70/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e4935f4f-8af5-49d6-8e19-9ed63d1a2d70/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e4935f4f-8af5-49d6-8e19-9ed63d1a2d70/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.4_false-unreach-call.4.ufo.BOUNDED-8.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_e4935f4f-8af5-49d6-8e19-9ed63d1a2d70/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e4935f4f-8af5-49d6-8e19-9ed63d1a2d70/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1eb74577d089f346a0faa51ee035b452800af0a7 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 12:25:40,543 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 12:25:40,544 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 12:25:40,550 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 12:25:40,551 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 12:25:40,551 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 12:25:40,552 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 12:25:40,553 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 12:25:40,554 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 12:25:40,555 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 12:25:40,556 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 12:25:40,556 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 12:25:40,556 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 12:25:40,557 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 12:25:40,558 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 12:25:40,558 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 12:25:40,559 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 12:25:40,560 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 12:25:40,561 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 12:25:40,563 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 12:25:40,563 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 12:25:40,564 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 12:25:40,566 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 12:25:40,566 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 12:25:40,566 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 12:25:40,566 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 12:25:40,567 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 12:25:40,568 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 12:25:40,568 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 12:25:40,569 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 12:25:40,569 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 12:25:40,570 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 12:25:40,570 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 12:25:40,570 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 12:25:40,571 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 12:25:40,571 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 12:25:40,571 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e4935f4f-8af5-49d6-8e19-9ed63d1a2d70/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 12:25:40,582 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 12:25:40,582 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 12:25:40,583 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 12:25:40,583 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 12:25:40,583 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 12:25:40,583 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 12:25:40,583 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 12:25:40,583 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 12:25:40,584 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 12:25:40,584 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 12:25:40,584 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 12:25:40,584 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 12:25:40,584 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 12:25:40,584 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 12:25:40,585 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 12:25:40,585 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 12:25:40,585 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 12:25:40,585 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 12:25:40,585 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 12:25:40,585 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 12:25:40,585 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 12:25:40,586 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 12:25:40,586 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 12:25:40,586 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 12:25:40,586 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 12:25:40,586 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 12:25:40,586 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 12:25:40,587 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 12:25:40,587 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 12:25:40,587 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 12:25:40,588 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 12:25:40,588 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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_e4935f4f-8af5-49d6-8e19-9ed63d1a2d70/bin-2019/uautomizer 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(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer 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 -> 1eb74577d089f346a0faa51ee035b452800af0a7 [2018-11-10 12:25:40,609 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 12:25:40,617 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 12:25:40,620 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 12:25:40,621 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 12:25:40,621 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 12:25:40,621 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e4935f4f-8af5-49d6-8e19-9ed63d1a2d70/bin-2019/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_floodmax.4_false-unreach-call.4.ufo.BOUNDED-8.pals_true-termination.c [2018-11-10 12:25:40,659 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e4935f4f-8af5-49d6-8e19-9ed63d1a2d70/bin-2019/uautomizer/data/1d5f5d6d0/f871da0e24844ff68e756fb6e6e50546/FLAGc11798ff6 [2018-11-10 12:25:41,091 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 12:25:41,092 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e4935f4f-8af5-49d6-8e19-9ed63d1a2d70/sv-benchmarks/c/seq-mthreaded/pals_floodmax.4_false-unreach-call.4.ufo.BOUNDED-8.pals_true-termination.c [2018-11-10 12:25:41,104 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e4935f4f-8af5-49d6-8e19-9ed63d1a2d70/bin-2019/uautomizer/data/1d5f5d6d0/f871da0e24844ff68e756fb6e6e50546/FLAGc11798ff6 [2018-11-10 12:25:41,114 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e4935f4f-8af5-49d6-8e19-9ed63d1a2d70/bin-2019/uautomizer/data/1d5f5d6d0/f871da0e24844ff68e756fb6e6e50546 [2018-11-10 12:25:41,116 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 12:25:41,117 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 12:25:41,118 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 12:25:41,118 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 12:25:41,121 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 12:25:41,121 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:25:41" (1/1) ... [2018-11-10 12:25:41,123 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70607c0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:25:41, skipping insertion in model container [2018-11-10 12:25:41,123 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:25:41" (1/1) ... [2018-11-10 12:25:41,129 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 12:25:41,165 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 12:25:41,341 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:25:41,346 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 12:25:41,392 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:25:41,402 INFO L193 MainTranslator]: Completed translation [2018-11-10 12:25:41,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:25:41 WrapperNode [2018-11-10 12:25:41,403 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 12:25:41,404 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 12:25:41,404 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 12:25:41,404 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 12:25:41,451 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:25:41" (1/1) ... [2018-11-10 12:25:41,463 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:25:41" (1/1) ... [2018-11-10 12:25:41,497 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 12:25:41,497 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 12:25:41,498 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 12:25:41,498 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 12:25:41,506 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:25:41" (1/1) ... [2018-11-10 12:25:41,506 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:25:41" (1/1) ... [2018-11-10 12:25:41,510 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:25:41" (1/1) ... [2018-11-10 12:25:41,510 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:25:41" (1/1) ... [2018-11-10 12:25:41,519 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:25:41" (1/1) ... [2018-11-10 12:25:41,531 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:25:41" (1/1) ... [2018-11-10 12:25:41,534 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:25:41" (1/1) ... [2018-11-10 12:25:41,539 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 12:25:41,539 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 12:25:41,539 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 12:25:41,539 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 12:25:41,540 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:25:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e4935f4f-8af5-49d6-8e19-9ed63d1a2d70/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:25:41,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 12:25:41,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 12:25:42,434 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 12:25:42,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:25:42 BoogieIcfgContainer [2018-11-10 12:25:42,435 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 12:25:42,435 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 12:25:42,435 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 12:25:42,439 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 12:25:42,439 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:25:42,440 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 12:25:41" (1/3) ... [2018-11-10 12:25:42,440 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9e3fb29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:25:42, skipping insertion in model container [2018-11-10 12:25:42,441 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:25:42,441 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:25:41" (2/3) ... [2018-11-10 12:25:42,441 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9e3fb29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:25:42, skipping insertion in model container [2018-11-10 12:25:42,441 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:25:42,441 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:25:42" (3/3) ... [2018-11-10 12:25:42,443 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_floodmax.4_false-unreach-call.4.ufo.BOUNDED-8.pals_true-termination.c [2018-11-10 12:25:42,491 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 12:25:42,491 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 12:25:42,491 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 12:25:42,492 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 12:25:42,492 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 12:25:42,492 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 12:25:42,492 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 12:25:42,492 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 12:25:42,492 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 12:25:42,510 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 302 states. [2018-11-10 12:25:42,541 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 108 [2018-11-10 12:25:42,541 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:25:42,541 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:25:42,550 INFO L866 BuchiCegarLoop]: Counterexample stem 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:25:42,550 INFO L867 BuchiCegarLoop]: Counterexample loop 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-10 12:25:42,550 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 12:25:42,550 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 302 states. [2018-11-10 12:25:42,557 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 108 [2018-11-10 12:25:42,558 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:25:42,558 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:25:42,559 INFO L866 BuchiCegarLoop]: Counterexample stem 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:25:42,560 INFO L867 BuchiCegarLoop]: Counterexample loop 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-10 12:25:42,567 INFO L793 eck$LassoCheckResult]: Stem: 108#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p13~0 := 0;~p14~0 := 0;~p21~0 := 0;~p23~0 := 0;~p24~0 := 0;~p31~0 := 0;~p32~0 := 0;~p34~0 := 0;~p41~0 := 0;~p42~0 := 0;~p43~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset]; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~ret52, main_#t~ret53, main_#t~post54, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet12;havoc main_#t~nondet12;~ep13~0 := main_#t~nondet13;havoc main_#t~nondet13;~ep14~0 := main_#t~nondet14;havoc main_#t~nondet14;~ep21~0 := main_#t~nondet15;havoc main_#t~nondet15;~ep23~0 := main_#t~nondet16;havoc main_#t~nondet16;~ep24~0 := main_#t~nondet17;havoc main_#t~nondet17;~ep31~0 := main_#t~nondet18;havoc main_#t~nondet18;~ep32~0 := main_#t~nondet19;havoc main_#t~nondet19;~ep34~0 := main_#t~nondet20;havoc main_#t~nondet20;~ep41~0 := main_#t~nondet21;havoc main_#t~nondet21;~ep42~0 := main_#t~nondet22;havoc main_#t~nondet22;~ep43~0 := main_#t~nondet23;havoc main_#t~nondet23;~id1~0 := main_#t~nondet24;havoc main_#t~nondet24;~r1~0 := main_#t~nondet25;havoc main_#t~nondet25;~st1~0 := main_#t~nondet26;havoc main_#t~nondet26;~nl1~0 := main_#t~nondet27;havoc main_#t~nondet27;~m1~0 := main_#t~nondet28;havoc main_#t~nondet28;~max1~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode1~0 := main_#t~nondet30;havoc main_#t~nondet30;~id2~0 := main_#t~nondet31;havoc main_#t~nondet31;~r2~0 := main_#t~nondet32;havoc main_#t~nondet32;~st2~0 := main_#t~nondet33;havoc main_#t~nondet33;~nl2~0 := main_#t~nondet34;havoc main_#t~nondet34;~m2~0 := main_#t~nondet35;havoc main_#t~nondet35;~max2~0 := main_#t~nondet36;havoc main_#t~nondet36;~mode2~0 := main_#t~nondet37;havoc main_#t~nondet37;~id3~0 := main_#t~nondet38;havoc main_#t~nondet38;~r3~0 := main_#t~nondet39;havoc main_#t~nondet39;~st3~0 := main_#t~nondet40;havoc main_#t~nondet40;~nl3~0 := main_#t~nondet41;havoc main_#t~nondet41;~m3~0 := main_#t~nondet42;havoc main_#t~nondet42;~max3~0 := main_#t~nondet43;havoc main_#t~nondet43;~mode3~0 := main_#t~nondet44;havoc main_#t~nondet44;~id4~0 := main_#t~nondet45;havoc main_#t~nondet45;~r4~0 := main_#t~nondet46;havoc main_#t~nondet46;~st4~0 := main_#t~nondet47;havoc main_#t~nondet47;~nl4~0 := main_#t~nondet48;havoc main_#t~nondet48;~m4~0 := main_#t~nondet49;havoc main_#t~nondet49;~max4~0 := main_#t~nondet50;havoc main_#t~nondet50;~mode4~0 := main_#t~nondet51;havoc main_#t~nondet51;assume { :begin_inline_init } true;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r141~0, init_~r211~0, init_~r231~0, init_~r241~0, init_~r311~0, init_~r321~0, init_~r341~0, init_~r411~0, init_~r421~0, init_~r431~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r142~0, init_~tmp___1~0, init_~r212~0, init_~tmp___2~0, init_~r232~0, init_~tmp___3~0, init_~r242~0, init_~tmp___4~0, init_~r312~0, init_~tmp___5~0, init_~r322~0, init_~tmp___6~0, init_~r342~0, init_~tmp___7~0, init_~r412~0, init_~tmp___8~0, init_~r422~0, init_~tmp___9~0, init_~r432~0, init_~tmp___10~0, init_~r123~0, init_~tmp___11~0, init_~r133~0, init_~tmp___12~0, init_~r143~0, init_~tmp___13~0, init_~r213~0, init_~tmp___14~0, init_~r233~0, init_~tmp___15~0, init_~r243~0, init_~tmp___16~0, init_~r313~0, init_~tmp___17~0, init_~r323~0, init_~tmp___18~0, init_~r343~0, init_~tmp___19~0, init_~r413~0, init_~tmp___20~0, init_~r423~0, init_~tmp___21~0, init_~r433~0, init_~tmp___22~0, init_~tmp___23~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r141~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r241~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r341~0;havoc init_~r411~0;havoc init_~r421~0;havoc init_~r431~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r142~0;havoc init_~tmp___1~0;havoc init_~r212~0;havoc init_~tmp___2~0;havoc init_~r232~0;havoc init_~tmp___3~0;havoc init_~r242~0;havoc init_~tmp___4~0;havoc init_~r312~0;havoc init_~tmp___5~0;havoc init_~r322~0;havoc init_~tmp___6~0;havoc init_~r342~0;havoc init_~tmp___7~0;havoc init_~r412~0;havoc init_~tmp___8~0;havoc init_~r422~0;havoc init_~tmp___9~0;havoc init_~r432~0;havoc init_~tmp___10~0;havoc init_~r123~0;havoc init_~tmp___11~0;havoc init_~r133~0;havoc init_~tmp___12~0;havoc init_~r143~0;havoc init_~tmp___13~0;havoc init_~r213~0;havoc init_~tmp___14~0;havoc init_~r233~0;havoc init_~tmp___15~0;havoc init_~r243~0;havoc init_~tmp___16~0;havoc init_~r313~0;havoc init_~tmp___17~0;havoc init_~r323~0;havoc init_~tmp___18~0;havoc init_~r343~0;havoc init_~tmp___19~0;havoc init_~r413~0;havoc init_~tmp___20~0;havoc init_~r423~0;havoc init_~tmp___21~0;havoc init_~r433~0;havoc init_~tmp___22~0;havoc init_~tmp___23~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r141~0 := ~ep14~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r241~0 := ~ep24~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0;init_~r341~0 := ~ep34~0;init_~r411~0 := ~ep41~0;init_~r421~0 := ~ep42~0;init_~r431~0 := ~ep43~0; 177#L436true assume init_~r121~0 % 256 != 0;init_~tmp~0 := 1; 199#L447true init_~r122~0 := (if init_~tmp~0 == 0 then 0 else 1); 83#L457true assume init_~r131~0 % 256 != 0;init_~tmp___0~0 := 1; 81#L468true init_~r132~0 := (if init_~tmp___0~0 == 0 then 0 else 1); 139#L478true assume init_~r141~0 % 256 != 0;init_~tmp___1~0 := 1; 137#L489true init_~r142~0 := (if init_~tmp___1~0 == 0 then 0 else 1); 47#L499true assume init_~r211~0 % 256 != 0;init_~tmp___2~0 := 1; 45#L510true init_~r212~0 := (if init_~tmp___2~0 == 0 then 0 else 1); 254#L520true assume init_~r231~0 % 256 != 0;init_~tmp___3~0 := 1; 252#L531true init_~r232~0 := (if init_~tmp___3~0 == 0 then 0 else 1); 164#L541true assume init_~r241~0 % 256 != 0;init_~tmp___4~0 := 1; 163#L552true init_~r242~0 := (if init_~tmp___4~0 == 0 then 0 else 1); 224#L562true assume init_~r311~0 % 256 != 0;init_~tmp___5~0 := 1; 223#L573true init_~r312~0 := (if init_~tmp___5~0 == 0 then 0 else 1); 128#L583true assume init_~r321~0 % 256 != 0;init_~tmp___6~0 := 1; 127#L594true init_~r322~0 := (if init_~tmp___6~0 == 0 then 0 else 1); 33#L604true assume init_~r341~0 % 256 != 0;init_~tmp___7~0 := 1; 32#L615true init_~r342~0 := (if init_~tmp___7~0 == 0 then 0 else 1); 237#L625true assume init_~r411~0 % 256 != 0;init_~tmp___8~0 := 1; 235#L636true init_~r412~0 := (if init_~tmp___8~0 == 0 then 0 else 1); 299#L646true assume init_~r421~0 % 256 != 0;init_~tmp___9~0 := 1; 298#L657true init_~r422~0 := (if init_~tmp___9~0 == 0 then 0 else 1); 207#L667true assume init_~r431~0 % 256 != 0;init_~tmp___10~0 := 1; 206#L678true init_~r432~0 := (if init_~tmp___10~0 == 0 then 0 else 1); 113#L688true assume init_~r122~0 % 256 != 0;init_~tmp___11~0 := 1; 112#L699true init_~r123~0 := (if init_~tmp___11~0 == 0 then 0 else 1); 17#L709true assume init_~r132~0 % 256 != 0;init_~tmp___12~0 := 1; 16#L720true init_~r133~0 := (if init_~tmp___12~0 == 0 then 0 else 1); 73#L730true assume init_~r142~0 % 256 != 0;init_~tmp___13~0 := 1; 71#L741true init_~r143~0 := (if init_~tmp___13~0 == 0 then 0 else 1); 279#L751true assume init_~r212~0 % 256 != 0;init_~tmp___14~0 := 1; 278#L762true init_~r213~0 := (if init_~tmp___14~0 == 0 then 0 else 1); 170#L772true assume init_~r232~0 % 256 != 0;init_~tmp___15~0 := 1; 190#L783true init_~r233~0 := (if init_~tmp___15~0 == 0 then 0 else 1); 77#L793true assume init_~r242~0 % 256 != 0;init_~tmp___16~0 := 1; 76#L804true init_~r243~0 := (if init_~tmp___16~0 == 0 then 0 else 1); 133#L814true assume init_~r312~0 % 256 != 0;init_~tmp___17~0 := 1; 131#L825true init_~r313~0 := (if init_~tmp___17~0 == 0 then 0 else 1); 38#L835true assume init_~r322~0 % 256 != 0;init_~tmp___18~0 := 1; 36#L846true init_~r323~0 := (if init_~tmp___18~0 == 0 then 0 else 1); 243#L856true assume init_~r342~0 % 256 != 0;init_~tmp___19~0 := 1; 242#L867true init_~r343~0 := (if init_~tmp___19~0 == 0 then 0 else 1); 156#L877true assume init_~r412~0 % 256 != 0;init_~tmp___20~0 := 1; 155#L888true init_~r413~0 := (if init_~tmp___20~0 == 0 then 0 else 1); 215#L898true assume init_~r422~0 % 256 != 0;init_~tmp___21~0 := 1; 214#L909true init_~r423~0 := (if init_~tmp___21~0 == 0 then 0 else 1); 121#L919true assume init_~r432~0 % 256 != 0;init_~tmp___22~0 := 1; 120#L930true init_~r433~0 := (if init_~tmp___22~0 == 0 then 0 else 1); 25#L940true assume !(~id1~0 != ~id2~0);init_~tmp___23~0 := 0; 28#L940-1true init_#res := init_~tmp___23~0; 266#L1109true main_#t~ret52 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret52;havoc main_#t~ret52;assume main_~i2~0 != 0;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0 := 0; 300#L1246-3true [2018-11-10 12:25:42,568 INFO L795 eck$LassoCheckResult]: Loop: 300#L1246-3true assume true; 295#L1246-1true assume !!(main_~i2~0 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_#t~ite1, node1_#t~ite2; 272#L151true assume !(~mode1~0 % 256 != 0); 182#L183true assume !(~r1~0 < 2); 179#L183-1true ~mode1~0 := 1; 269#L151-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite3, node2_#t~ite4, node2_#t~ite5; 91#L204true assume !(~mode2~0 % 256 != 0); 147#L236true assume !(~r2~0 < 3); 142#L236-1true ~mode2~0 := 1; 84#L204-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6, node3_#t~ite7, node3_#t~ite8; 50#L257true assume !(~mode3~0 % 256 != 0); 256#L289true assume !(~r3~0 < 3); 253#L289-1true ~mode3~0 := 1; 44#L257-2true assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9, node4_#t~ite10, node4_#t~ite11; 159#L310true assume !(~mode4~0 % 256 != 0); 217#L342true assume !(~r4~0 < 3); 218#L342-1true ~mode4~0 := 1; 292#L310-2true assume { :end_inline_node4 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 126#L1117true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1 := 0; 130#L1117-1true check_#res := check_~tmp~1; 297#L1169true main_#t~ret53 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret53;havoc main_#t~ret53;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 202#L1289true assume !(assert_~arg % 256 == 0); 172#L1284true assume { :end_inline_assert } true;main_#t~post54 := main_~i2~0;main_~i2~0 := main_#t~post54 + 1;havoc main_#t~post54; 300#L1246-3true [2018-11-10 12:25:42,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:25:42,573 INFO L82 PathProgramCache]: Analyzing trace with hash 15531844, now seen corresponding path program 1 times [2018-11-10 12:25:42,575 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:25:42,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:25:42,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:25:42,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:25:42,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:25:42,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:25:42,788 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-10 12:25:42,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:25:42,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:25:42,792 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 12:25:42,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:25:42,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1536994972, now seen corresponding path program 1 times [2018-11-10 12:25:42,793 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:25:42,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:25:42,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:25:42,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:25:42,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:25:42,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:25:42,863 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-10 12:25:42,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:25:42,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 12:25:42,865 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:25:42,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 12:25:42,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:25:42,877 INFO L87 Difference]: Start difference. First operand 302 states. Second operand 5 states. [2018-11-10 12:25:42,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:25:42,976 INFO L93 Difference]: Finished difference Result 306 states and 544 transitions. [2018-11-10 12:25:42,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 12:25:42,978 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 306 states and 544 transitions. [2018-11-10 12:25:42,983 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 107 [2018-11-10 12:25:42,990 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 306 states to 297 states and 527 transitions. [2018-11-10 12:25:42,991 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 297 [2018-11-10 12:25:42,992 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 297 [2018-11-10 12:25:42,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 297 states and 527 transitions. [2018-11-10 12:25:42,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:25:42,994 INFO L705 BuchiCegarLoop]: Abstraction has 297 states and 527 transitions. [2018-11-10 12:25:43,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states and 527 transitions. [2018-11-10 12:25:43,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2018-11-10 12:25:43,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-11-10 12:25:43,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 527 transitions. [2018-11-10 12:25:43,033 INFO L728 BuchiCegarLoop]: Abstraction has 297 states and 527 transitions. [2018-11-10 12:25:43,033 INFO L608 BuchiCegarLoop]: Abstraction has 297 states and 527 transitions. [2018-11-10 12:25:43,033 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 12:25:43,033 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 297 states and 527 transitions. [2018-11-10 12:25:43,036 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 107 [2018-11-10 12:25:43,036 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:25:43,036 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:25:43,038 INFO L866 BuchiCegarLoop]: Counterexample stem 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:25:43,038 INFO L867 BuchiCegarLoop]: Counterexample loop 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-10 12:25:43,038 INFO L793 eck$LassoCheckResult]: Stem: 826#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p13~0 := 0;~p14~0 := 0;~p21~0 := 0;~p23~0 := 0;~p24~0 := 0;~p31~0 := 0;~p32~0 := 0;~p34~0 := 0;~p41~0 := 0;~p42~0 := 0;~p43~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset]; 641#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~ret52, main_#t~ret53, main_#t~post54, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet12;havoc main_#t~nondet12;~ep13~0 := main_#t~nondet13;havoc main_#t~nondet13;~ep14~0 := main_#t~nondet14;havoc main_#t~nondet14;~ep21~0 := main_#t~nondet15;havoc main_#t~nondet15;~ep23~0 := main_#t~nondet16;havoc main_#t~nondet16;~ep24~0 := main_#t~nondet17;havoc main_#t~nondet17;~ep31~0 := main_#t~nondet18;havoc main_#t~nondet18;~ep32~0 := main_#t~nondet19;havoc main_#t~nondet19;~ep34~0 := main_#t~nondet20;havoc main_#t~nondet20;~ep41~0 := main_#t~nondet21;havoc main_#t~nondet21;~ep42~0 := main_#t~nondet22;havoc main_#t~nondet22;~ep43~0 := main_#t~nondet23;havoc main_#t~nondet23;~id1~0 := main_#t~nondet24;havoc main_#t~nondet24;~r1~0 := main_#t~nondet25;havoc main_#t~nondet25;~st1~0 := main_#t~nondet26;havoc main_#t~nondet26;~nl1~0 := main_#t~nondet27;havoc main_#t~nondet27;~m1~0 := main_#t~nondet28;havoc main_#t~nondet28;~max1~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode1~0 := main_#t~nondet30;havoc main_#t~nondet30;~id2~0 := main_#t~nondet31;havoc main_#t~nondet31;~r2~0 := main_#t~nondet32;havoc main_#t~nondet32;~st2~0 := main_#t~nondet33;havoc main_#t~nondet33;~nl2~0 := main_#t~nondet34;havoc main_#t~nondet34;~m2~0 := main_#t~nondet35;havoc main_#t~nondet35;~max2~0 := main_#t~nondet36;havoc main_#t~nondet36;~mode2~0 := main_#t~nondet37;havoc main_#t~nondet37;~id3~0 := main_#t~nondet38;havoc main_#t~nondet38;~r3~0 := main_#t~nondet39;havoc main_#t~nondet39;~st3~0 := main_#t~nondet40;havoc main_#t~nondet40;~nl3~0 := main_#t~nondet41;havoc main_#t~nondet41;~m3~0 := main_#t~nondet42;havoc main_#t~nondet42;~max3~0 := main_#t~nondet43;havoc main_#t~nondet43;~mode3~0 := main_#t~nondet44;havoc main_#t~nondet44;~id4~0 := main_#t~nondet45;havoc main_#t~nondet45;~r4~0 := main_#t~nondet46;havoc main_#t~nondet46;~st4~0 := main_#t~nondet47;havoc main_#t~nondet47;~nl4~0 := main_#t~nondet48;havoc main_#t~nondet48;~m4~0 := main_#t~nondet49;havoc main_#t~nondet49;~max4~0 := main_#t~nondet50;havoc main_#t~nondet50;~mode4~0 := main_#t~nondet51;havoc main_#t~nondet51;assume { :begin_inline_init } true;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r141~0, init_~r211~0, init_~r231~0, init_~r241~0, init_~r311~0, init_~r321~0, init_~r341~0, init_~r411~0, init_~r421~0, init_~r431~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r142~0, init_~tmp___1~0, init_~r212~0, init_~tmp___2~0, init_~r232~0, init_~tmp___3~0, init_~r242~0, init_~tmp___4~0, init_~r312~0, init_~tmp___5~0, init_~r322~0, init_~tmp___6~0, init_~r342~0, init_~tmp___7~0, init_~r412~0, init_~tmp___8~0, init_~r422~0, init_~tmp___9~0, init_~r432~0, init_~tmp___10~0, init_~r123~0, init_~tmp___11~0, init_~r133~0, init_~tmp___12~0, init_~r143~0, init_~tmp___13~0, init_~r213~0, init_~tmp___14~0, init_~r233~0, init_~tmp___15~0, init_~r243~0, init_~tmp___16~0, init_~r313~0, init_~tmp___17~0, init_~r323~0, init_~tmp___18~0, init_~r343~0, init_~tmp___19~0, init_~r413~0, init_~tmp___20~0, init_~r423~0, init_~tmp___21~0, init_~r433~0, init_~tmp___22~0, init_~tmp___23~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r141~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r241~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r341~0;havoc init_~r411~0;havoc init_~r421~0;havoc init_~r431~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r142~0;havoc init_~tmp___1~0;havoc init_~r212~0;havoc init_~tmp___2~0;havoc init_~r232~0;havoc init_~tmp___3~0;havoc init_~r242~0;havoc init_~tmp___4~0;havoc init_~r312~0;havoc init_~tmp___5~0;havoc init_~r322~0;havoc init_~tmp___6~0;havoc init_~r342~0;havoc init_~tmp___7~0;havoc init_~r412~0;havoc init_~tmp___8~0;havoc init_~r422~0;havoc init_~tmp___9~0;havoc init_~r432~0;havoc init_~tmp___10~0;havoc init_~r123~0;havoc init_~tmp___11~0;havoc init_~r133~0;havoc init_~tmp___12~0;havoc init_~r143~0;havoc init_~tmp___13~0;havoc init_~r213~0;havoc init_~tmp___14~0;havoc init_~r233~0;havoc init_~tmp___15~0;havoc init_~r243~0;havoc init_~tmp___16~0;havoc init_~r313~0;havoc init_~tmp___17~0;havoc init_~r323~0;havoc init_~tmp___18~0;havoc init_~r343~0;havoc init_~tmp___19~0;havoc init_~r413~0;havoc init_~tmp___20~0;havoc init_~r423~0;havoc init_~tmp___21~0;havoc init_~r433~0;havoc init_~tmp___22~0;havoc init_~tmp___23~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r141~0 := ~ep14~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r241~0 := ~ep24~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0;init_~r341~0 := ~ep34~0;init_~r411~0 := ~ep41~0;init_~r421~0 := ~ep42~0;init_~r431~0 := ~ep43~0; 642#L436 assume init_~r121~0 % 256 != 0;init_~tmp~0 := 1; 794#L447 init_~r122~0 := (if init_~tmp~0 == 0 then 0 else 1); 789#L457 assume init_~r131~0 % 256 != 0;init_~tmp___0~0 := 1; 669#L468 init_~r132~0 := (if init_~tmp___0~0 == 0 then 0 else 1); 785#L478 assume init_~r141~0 % 256 != 0;init_~tmp___1~0 := 1; 731#L489 init_~r142~0 := (if init_~tmp___1~0 == 0 then 0 else 1); 727#L499 assume init_~r211~0 % 256 != 0;init_~tmp___2~0 := 1; 640#L510 init_~r212~0 := (if init_~tmp___2~0 == 0 then 0 else 1); 723#L520 assume init_~r231~0 % 256 != 0;init_~tmp___3~0 := 1; 718#L531 init_~r232~0 := (if init_~tmp___3~0 == 0 then 0 else 1); 866#L541 assume init_~r241~0 % 256 != 0;init_~tmp___4~0 := 1; 821#L552 init_~r242~0 := (if init_~tmp___4~0 == 0 then 0 else 1); 865#L562 assume init_~r311~0 % 256 != 0;init_~tmp___5~0 := 1; 634#L573 init_~r312~0 := (if init_~tmp___5~0 == 0 then 0 else 1); 846#L583 assume init_~r321~0 % 256 != 0;init_~tmp___6~0 := 1; 697#L594 init_~r322~0 := (if init_~tmp___6~0 == 0 then 0 else 1); 694#L604 assume init_~r341~0 % 256 != 0;init_~tmp___7~0 := 1; 692#L615 init_~r342~0 := (if init_~tmp___7~0 == 0 then 0 else 1); 693#L625 assume init_~r411~0 % 256 != 0;init_~tmp___8~0 := 1; 691#L636 init_~r412~0 := (if init_~tmp___8~0 == 0 then 0 else 1); 916#L646 assume init_~r421~0 % 256 != 0;init_~tmp___9~0 := 1; 781#L657 init_~r422~0 := (if init_~tmp___9~0 == 0 then 0 else 1); 902#L667 assume init_~r431~0 % 256 != 0;init_~tmp___10~0 := 1; 833#L678 init_~r432~0 := (if init_~tmp___10~0 == 0 then 0 else 1); 830#L688 assume init_~r122~0 % 256 != 0;init_~tmp___11~0 := 1; 661#L699 init_~r123~0 := (if init_~tmp___11~0 == 0 then 0 else 1); 658#L709 assume init_~r132~0 % 256 != 0;init_~tmp___12~0 := 1; 656#L720 init_~r133~0 := (if init_~tmp___12~0 == 0 then 0 else 1); 657#L730 assume init_~r142~0 % 256 != 0;init_~tmp___13~0 := 1; 652#L741 init_~r143~0 := (if init_~tmp___13~0 == 0 then 0 else 1); 768#L751 assume init_~r212~0 % 256 != 0;init_~tmp___14~0 := 1; 767#L762 init_~r213~0 := (if init_~tmp___14~0 == 0 then 0 else 1); 875#L772 assume init_~r232~0 % 256 != 0;init_~tmp___15~0 := 1; 779#L783 init_~r233~0 := (if init_~tmp___15~0 == 0 then 0 else 1); 777#L793 assume init_~r242~0 % 256 != 0;init_~tmp___16~0 := 1; 646#L804 init_~r243~0 := (if init_~tmp___16~0 == 0 then 0 else 1); 774#L814 assume init_~r312~0 % 256 != 0;init_~tmp___17~0 := 1; 712#L825 init_~r313~0 := (if init_~tmp___17~0 == 0 then 0 else 1); 705#L835 assume init_~r322~0 % 256 != 0;init_~tmp___18~0 := 1; 703#L846 init_~r323~0 := (if init_~tmp___18~0 == 0 then 0 else 1); 704#L856 assume init_~r342~0 % 256 != 0;init_~tmp___19~0 := 1; 700#L867 init_~r343~0 := (if init_~tmp___19~0 == 0 then 0 else 1); 859#L877 assume init_~r412~0 % 256 != 0;init_~tmp___20~0 := 1; 806#L888 init_~r413~0 := (if init_~tmp___20~0 == 0 then 0 else 1); 858#L898 assume init_~r422~0 % 256 != 0;init_~tmp___21~0 := 1; 840#L909 init_~r423~0 := (if init_~tmp___21~0 == 0 then 0 else 1); 838#L919 assume init_~r432~0 % 256 != 0;init_~tmp___22~0 := 1; 681#L930 init_~r433~0 := (if init_~tmp___22~0 == 0 then 0 else 1); 678#L940 assume !(~id1~0 != ~id2~0);init_~tmp___23~0 := 0; 667#L940-1 init_#res := init_~tmp___23~0; 685#L1109 main_#t~ret52 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret52;havoc main_#t~ret52;assume main_~i2~0 != 0;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0 := 0; 877#L1246-3 [2018-11-10 12:25:43,039 INFO L795 eck$LassoCheckResult]: Loop: 877#L1246-3 assume true; 921#L1246-1 assume !!(main_~i2~0 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_#t~ite1, node1_#t~ite2; 919#L151 assume !(~mode1~0 % 256 != 0); 888#L183 assume !(~r1~0 < 2); 684#L183-1 ~mode1~0 := 1; 769#L151-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite3, node2_#t~ite4, node2_#t~ite5; 800#L204 assume !(~mode2~0 % 256 != 0); 802#L236 assume !(~r2~0 < 3); 749#L236-1 ~mode2~0 := 1; 786#L204-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6, node3_#t~ite7, node3_#t~ite8; 732#L257 assume !(~mode3~0 % 256 != 0); 734#L289 assume !(~r3~0 < 3); 820#L289-1 ~mode3~0 := 1; 715#L257-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9, node4_#t~ite10, node4_#t~ite11; 716#L310 assume !(~mode4~0 % 256 != 0); 863#L342 assume !(~r4~0 < 3); 762#L342-1 ~mode4~0 := 1; 907#L310-2 assume { :end_inline_node4 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 843#L1117 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 844#L1118 assume ~st1~0 + ~nl1~0 <= 1; 880#L1119 assume ~st2~0 + ~nl2~0 <= 1; 881#L1120 assume ~st3~0 + ~nl3~0 <= 1; 756#L1121 assume ~st4~0 + ~nl4~0 <= 1; 630#L1122 assume ~r1~0 >= 3; 631#L1126 assume ~r1~0 < 3; 883#L1131 assume ~r1~0 >= 3; 905#L1136 assume ~r1~0 < 3;check_~tmp~1 := 1; 849#L1117-1 check_#res := check_~tmp~1; 850#L1169 main_#t~ret53 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret53;havoc main_#t~ret53;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 899#L1289 assume !(assert_~arg % 256 == 0); 876#L1284 assume { :end_inline_assert } true;main_#t~post54 := main_~i2~0;main_~i2~0 := main_#t~post54 + 1;havoc main_#t~post54; 877#L1246-3 [2018-11-10 12:25:43,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:25:43,039 INFO L82 PathProgramCache]: Analyzing trace with hash 15531844, now seen corresponding path program 2 times [2018-11-10 12:25:43,039 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:25:43,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:25:43,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:25:43,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:25:43,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:25:43,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:25:43,132 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-10 12:25:43,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:25:43,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:25:43,133 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 12:25:43,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:25:43,134 INFO L82 PathProgramCache]: Analyzing trace with hash -940271309, now seen corresponding path program 1 times [2018-11-10 12:25:43,134 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:25:43,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:25:43,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:25:43,135 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:25:43,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:25:43,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:25:43,164 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-10 12:25:43,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:25:43,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:25:43,165 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:25:43,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:25:43,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:25:43,165 INFO L87 Difference]: Start difference. First operand 297 states and 527 transitions. cyclomatic complexity: 231 Second operand 3 states. [2018-11-10 12:25:43,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:25:43,215 INFO L93 Difference]: Finished difference Result 383 states and 662 transitions. [2018-11-10 12:25:43,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:25:43,216 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 383 states and 662 transitions. [2018-11-10 12:25:43,219 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 193 [2018-11-10 12:25:43,222 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 383 states to 383 states and 662 transitions. [2018-11-10 12:25:43,222 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 383 [2018-11-10 12:25:43,223 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 383 [2018-11-10 12:25:43,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 383 states and 662 transitions. [2018-11-10 12:25:43,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:25:43,225 INFO L705 BuchiCegarLoop]: Abstraction has 383 states and 662 transitions. [2018-11-10 12:25:43,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states and 662 transitions. [2018-11-10 12:25:43,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 383. [2018-11-10 12:25:43,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-11-10 12:25:43,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 662 transitions. [2018-11-10 12:25:43,237 INFO L728 BuchiCegarLoop]: Abstraction has 383 states and 662 transitions. [2018-11-10 12:25:43,237 INFO L608 BuchiCegarLoop]: Abstraction has 383 states and 662 transitions. [2018-11-10 12:25:43,237 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 12:25:43,238 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 383 states and 662 transitions. [2018-11-10 12:25:43,240 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 193 [2018-11-10 12:25:43,240 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:25:43,241 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:25:43,243 INFO L866 BuchiCegarLoop]: Counterexample stem 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:25:43,243 INFO L867 BuchiCegarLoop]: Counterexample loop 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] [2018-11-10 12:25:43,243 INFO L793 eck$LassoCheckResult]: Stem: 1513#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p13~0 := 0;~p14~0 := 0;~p21~0 := 0;~p23~0 := 0;~p24~0 := 0;~p31~0 := 0;~p32~0 := 0;~p34~0 := 0;~p41~0 := 0;~p42~0 := 0;~p43~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset]; 1328#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~ret52, main_#t~ret53, main_#t~post54, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet12;havoc main_#t~nondet12;~ep13~0 := main_#t~nondet13;havoc main_#t~nondet13;~ep14~0 := main_#t~nondet14;havoc main_#t~nondet14;~ep21~0 := main_#t~nondet15;havoc main_#t~nondet15;~ep23~0 := main_#t~nondet16;havoc main_#t~nondet16;~ep24~0 := main_#t~nondet17;havoc main_#t~nondet17;~ep31~0 := main_#t~nondet18;havoc main_#t~nondet18;~ep32~0 := main_#t~nondet19;havoc main_#t~nondet19;~ep34~0 := main_#t~nondet20;havoc main_#t~nondet20;~ep41~0 := main_#t~nondet21;havoc main_#t~nondet21;~ep42~0 := main_#t~nondet22;havoc main_#t~nondet22;~ep43~0 := main_#t~nondet23;havoc main_#t~nondet23;~id1~0 := main_#t~nondet24;havoc main_#t~nondet24;~r1~0 := main_#t~nondet25;havoc main_#t~nondet25;~st1~0 := main_#t~nondet26;havoc main_#t~nondet26;~nl1~0 := main_#t~nondet27;havoc main_#t~nondet27;~m1~0 := main_#t~nondet28;havoc main_#t~nondet28;~max1~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode1~0 := main_#t~nondet30;havoc main_#t~nondet30;~id2~0 := main_#t~nondet31;havoc main_#t~nondet31;~r2~0 := main_#t~nondet32;havoc main_#t~nondet32;~st2~0 := main_#t~nondet33;havoc main_#t~nondet33;~nl2~0 := main_#t~nondet34;havoc main_#t~nondet34;~m2~0 := main_#t~nondet35;havoc main_#t~nondet35;~max2~0 := main_#t~nondet36;havoc main_#t~nondet36;~mode2~0 := main_#t~nondet37;havoc main_#t~nondet37;~id3~0 := main_#t~nondet38;havoc main_#t~nondet38;~r3~0 := main_#t~nondet39;havoc main_#t~nondet39;~st3~0 := main_#t~nondet40;havoc main_#t~nondet40;~nl3~0 := main_#t~nondet41;havoc main_#t~nondet41;~m3~0 := main_#t~nondet42;havoc main_#t~nondet42;~max3~0 := main_#t~nondet43;havoc main_#t~nondet43;~mode3~0 := main_#t~nondet44;havoc main_#t~nondet44;~id4~0 := main_#t~nondet45;havoc main_#t~nondet45;~r4~0 := main_#t~nondet46;havoc main_#t~nondet46;~st4~0 := main_#t~nondet47;havoc main_#t~nondet47;~nl4~0 := main_#t~nondet48;havoc main_#t~nondet48;~m4~0 := main_#t~nondet49;havoc main_#t~nondet49;~max4~0 := main_#t~nondet50;havoc main_#t~nondet50;~mode4~0 := main_#t~nondet51;havoc main_#t~nondet51;assume { :begin_inline_init } true;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r141~0, init_~r211~0, init_~r231~0, init_~r241~0, init_~r311~0, init_~r321~0, init_~r341~0, init_~r411~0, init_~r421~0, init_~r431~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r142~0, init_~tmp___1~0, init_~r212~0, init_~tmp___2~0, init_~r232~0, init_~tmp___3~0, init_~r242~0, init_~tmp___4~0, init_~r312~0, init_~tmp___5~0, init_~r322~0, init_~tmp___6~0, init_~r342~0, init_~tmp___7~0, init_~r412~0, init_~tmp___8~0, init_~r422~0, init_~tmp___9~0, init_~r432~0, init_~tmp___10~0, init_~r123~0, init_~tmp___11~0, init_~r133~0, init_~tmp___12~0, init_~r143~0, init_~tmp___13~0, init_~r213~0, init_~tmp___14~0, init_~r233~0, init_~tmp___15~0, init_~r243~0, init_~tmp___16~0, init_~r313~0, init_~tmp___17~0, init_~r323~0, init_~tmp___18~0, init_~r343~0, init_~tmp___19~0, init_~r413~0, init_~tmp___20~0, init_~r423~0, init_~tmp___21~0, init_~r433~0, init_~tmp___22~0, init_~tmp___23~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r141~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r241~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r341~0;havoc init_~r411~0;havoc init_~r421~0;havoc init_~r431~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r142~0;havoc init_~tmp___1~0;havoc init_~r212~0;havoc init_~tmp___2~0;havoc init_~r232~0;havoc init_~tmp___3~0;havoc init_~r242~0;havoc init_~tmp___4~0;havoc init_~r312~0;havoc init_~tmp___5~0;havoc init_~r322~0;havoc init_~tmp___6~0;havoc init_~r342~0;havoc init_~tmp___7~0;havoc init_~r412~0;havoc init_~tmp___8~0;havoc init_~r422~0;havoc init_~tmp___9~0;havoc init_~r432~0;havoc init_~tmp___10~0;havoc init_~r123~0;havoc init_~tmp___11~0;havoc init_~r133~0;havoc init_~tmp___12~0;havoc init_~r143~0;havoc init_~tmp___13~0;havoc init_~r213~0;havoc init_~tmp___14~0;havoc init_~r233~0;havoc init_~tmp___15~0;havoc init_~r243~0;havoc init_~tmp___16~0;havoc init_~r313~0;havoc init_~tmp___17~0;havoc init_~r323~0;havoc init_~tmp___18~0;havoc init_~r343~0;havoc init_~tmp___19~0;havoc init_~r413~0;havoc init_~tmp___20~0;havoc init_~r423~0;havoc init_~tmp___21~0;havoc init_~r433~0;havoc init_~tmp___22~0;havoc init_~tmp___23~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r141~0 := ~ep14~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r241~0 := ~ep24~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0;init_~r341~0 := ~ep34~0;init_~r411~0 := ~ep41~0;init_~r421~0 := ~ep42~0;init_~r431~0 := ~ep43~0; 1329#L436 assume init_~r121~0 % 256 != 0;init_~tmp~0 := 1; 1481#L447 init_~r122~0 := (if init_~tmp~0 == 0 then 0 else 1); 1476#L457 assume init_~r131~0 % 256 != 0;init_~tmp___0~0 := 1; 1356#L468 init_~r132~0 := (if init_~tmp___0~0 == 0 then 0 else 1); 1472#L478 assume init_~r141~0 % 256 != 0;init_~tmp___1~0 := 1; 1418#L489 init_~r142~0 := (if init_~tmp___1~0 == 0 then 0 else 1); 1414#L499 assume init_~r211~0 % 256 != 0;init_~tmp___2~0 := 1; 1327#L510 init_~r212~0 := (if init_~tmp___2~0 == 0 then 0 else 1); 1410#L520 assume init_~r231~0 % 256 != 0;init_~tmp___3~0 := 1; 1406#L531 init_~r232~0 := (if init_~tmp___3~0 == 0 then 0 else 1); 1553#L541 assume init_~r241~0 % 256 != 0;init_~tmp___4~0 := 1; 1508#L552 init_~r242~0 := (if init_~tmp___4~0 == 0 then 0 else 1); 1552#L562 assume init_~r311~0 % 256 != 0;init_~tmp___5~0 := 1; 1321#L573 init_~r312~0 := (if init_~tmp___5~0 == 0 then 0 else 1); 1533#L583 assume init_~r321~0 % 256 != 0;init_~tmp___6~0 := 1; 1384#L594 init_~r322~0 := (if init_~tmp___6~0 == 0 then 0 else 1); 1381#L604 assume init_~r341~0 % 256 != 0;init_~tmp___7~0 := 1; 1379#L615 init_~r342~0 := (if init_~tmp___7~0 == 0 then 0 else 1); 1380#L625 assume init_~r411~0 % 256 != 0;init_~tmp___8~0 := 1; 1378#L636 init_~r412~0 := (if init_~tmp___8~0 == 0 then 0 else 1); 1603#L646 assume init_~r421~0 % 256 != 0;init_~tmp___9~0 := 1; 1468#L657 init_~r422~0 := (if init_~tmp___9~0 == 0 then 0 else 1); 1589#L667 assume init_~r431~0 % 256 != 0;init_~tmp___10~0 := 1; 1520#L678 init_~r432~0 := (if init_~tmp___10~0 == 0 then 0 else 1); 1517#L688 assume init_~r122~0 % 256 != 0;init_~tmp___11~0 := 1; 1350#L699 init_~r123~0 := (if init_~tmp___11~0 == 0 then 0 else 1); 1345#L709 assume init_~r132~0 % 256 != 0;init_~tmp___12~0 := 1; 1343#L720 init_~r133~0 := (if init_~tmp___12~0 == 0 then 0 else 1); 1344#L730 assume init_~r142~0 % 256 != 0;init_~tmp___13~0 := 1; 1339#L741 init_~r143~0 := (if init_~tmp___13~0 == 0 then 0 else 1); 1456#L751 assume init_~r212~0 % 256 != 0;init_~tmp___14~0 := 1; 1454#L762 init_~r213~0 := (if init_~tmp___14~0 == 0 then 0 else 1); 1562#L772 assume init_~r232~0 % 256 != 0;init_~tmp___15~0 := 1; 1466#L783 init_~r233~0 := (if init_~tmp___15~0 == 0 then 0 else 1); 1462#L793 assume init_~r242~0 % 256 != 0;init_~tmp___16~0 := 1; 1333#L804 init_~r243~0 := (if init_~tmp___16~0 == 0 then 0 else 1); 1461#L814 assume init_~r312~0 % 256 != 0;init_~tmp___17~0 := 1; 1396#L825 init_~r313~0 := (if init_~tmp___17~0 == 0 then 0 else 1); 1392#L835 assume init_~r322~0 % 256 != 0;init_~tmp___18~0 := 1; 1388#L846 init_~r323~0 := (if init_~tmp___18~0 == 0 then 0 else 1); 1389#L856 assume init_~r342~0 % 256 != 0;init_~tmp___19~0 := 1; 1387#L867 init_~r343~0 := (if init_~tmp___19~0 == 0 then 0 else 1); 1546#L877 assume init_~r412~0 % 256 != 0;init_~tmp___20~0 := 1; 1491#L888 init_~r413~0 := (if init_~tmp___20~0 == 0 then 0 else 1); 1545#L898 assume init_~r422~0 % 256 != 0;init_~tmp___21~0 := 1; 1527#L909 init_~r423~0 := (if init_~tmp___21~0 == 0 then 0 else 1); 1525#L919 assume init_~r432~0 % 256 != 0;init_~tmp___22~0 := 1; 1368#L930 init_~r433~0 := (if init_~tmp___22~0 == 0 then 0 else 1); 1365#L940 assume !(~id1~0 != ~id2~0);init_~tmp___23~0 := 0; 1354#L940-1 init_#res := init_~tmp___23~0; 1372#L1109 main_#t~ret52 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret52;havoc main_#t~ret52;assume main_~i2~0 != 0;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0 := 0; 1607#L1246-3 [2018-11-10 12:25:43,244 INFO L795 eck$LassoCheckResult]: Loop: 1607#L1246-3 assume true; 1681#L1246-1 assume !!(main_~i2~0 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_#t~ite1, node1_#t~ite2; 1680#L151 assume !(~mode1~0 % 256 != 0); 1679#L183 assume !(~r1~0 < 2); 1371#L183-1 ~mode1~0 := 1; 1676#L151-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite3, node2_#t~ite4, node2_#t~ite5; 1671#L204 assume !(~mode2~0 % 256 != 0); 1672#L236 assume !(~r2~0 < 3); 1657#L236-1 ~mode2~0 := 1; 1656#L204-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6, node3_#t~ite7, node3_#t~ite8; 1654#L257 assume !(~mode3~0 % 256 != 0); 1655#L289 assume !(~r3~0 < 3); 1643#L289-1 ~mode3~0 := 1; 1640#L257-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9, node4_#t~ite10, node4_#t~ite11; 1636#L310 assume !(~mode4~0 % 256 != 0); 1626#L342 assume !(~r4~0 < 3); 1622#L342-1 ~mode4~0 := 1; 1621#L310-2 assume { :end_inline_node4 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 1620#L1117 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 1619#L1118 assume ~st1~0 + ~nl1~0 <= 1; 1618#L1119 assume ~st2~0 + ~nl2~0 <= 1; 1617#L1120 assume ~st3~0 + ~nl3~0 <= 1; 1616#L1121 assume ~st4~0 + ~nl4~0 <= 1; 1615#L1122 assume !(~r1~0 >= 3); 1613#L1125 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 == 0; 1614#L1126 assume ~r1~0 < 3; 1695#L1131 assume !(~r1~0 >= 3); 1591#L1135 assume ~nl1~0 + ~nl2~0 + ~nl3~0 + ~nl4~0 == 0; 1592#L1136 assume ~r1~0 < 3;check_~tmp~1 := 1; 1689#L1117-1 check_#res := check_~tmp~1; 1684#L1169 main_#t~ret53 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret53;havoc main_#t~ret53;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 1683#L1289 assume !(assert_~arg % 256 == 0); 1682#L1284 assume { :end_inline_assert } true;main_#t~post54 := main_~i2~0;main_~i2~0 := main_#t~post54 + 1;havoc main_#t~post54; 1607#L1246-3 [2018-11-10 12:25:43,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:25:43,244 INFO L82 PathProgramCache]: Analyzing trace with hash 15531844, now seen corresponding path program 3 times [2018-11-10 12:25:43,244 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:25:43,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:25:43,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:25:43,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:25:43,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:25:43,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:25:43,304 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-10 12:25:43,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:25:43,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:25:43,305 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 12:25:43,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:25:43,305 INFO L82 PathProgramCache]: Analyzing trace with hash -630585581, now seen corresponding path program 1 times [2018-11-10 12:25:43,305 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:25:43,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:25:43,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:25:43,306 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:25:43,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:25:43,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:25:43,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:25:43,623 WARN L179 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 138 [2018-11-10 12:25:43,726 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2018-11-10 12:25:43,733 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:25:43,734 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:25:43,734 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:25:43,734 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:25:43,734 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 12:25:43,734 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:25:43,735 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:25:43,735 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:25:43,735 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.4_false-unreach-call.4.ufo.BOUNDED-8.pals_true-termination.c_Iteration3_Loop [2018-11-10 12:25:43,735 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:25:43,735 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:25:43,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:25:43,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:25:43,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:25:43,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:25:43,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:25:43,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:25:43,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:25:43,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:25:43,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:25:43,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:25:43,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:25:43,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:25:43,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:25:43,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:25:43,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:25:43,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:25:43,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:25:43,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:25:43,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:25:43,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:25:43,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:25:43,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:25:43,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:25:43,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:25:43,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:25:43,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:25:43,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:25:43,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:25:43,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:25:43,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:25:43,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:25:43,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:25:43,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:25:43,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:25:44,241 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:25:44,241 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e4935f4f-8af5-49d6-8e19-9ed63d1a2d70/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:25:44,245 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:25:44,245 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e4935f4f-8af5-49d6-8e19-9ed63d1a2d70/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:25:44,268 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 12:25:44,268 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:25:44,383 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 12:25:44,385 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:25:44,385 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:25:44,385 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:25:44,385 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:25:44,385 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:25:44,385 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:25:44,385 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:25:44,385 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:25:44,385 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.4_false-unreach-call.4.ufo.BOUNDED-8.pals_true-termination.c_Iteration3_Loop [2018-11-10 12:25:44,385 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:25:44,385 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:25:44,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:25:44,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:25:44,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:25:44,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:25:44,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:25:44,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:25:44,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:25:44,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:25:44,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:25:44,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:25:44,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:25:44,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:25:44,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:25:44,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:25:44,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:25:44,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:25:44,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:25:44,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:25:44,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:25:44,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:25:44,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:25:44,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:25:44,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:25:44,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:25:44,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:25:44,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:25:44,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:25:44,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:25:44,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:25:44,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:25:44,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:25:44,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:25:44,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:25:44,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:25:44,843 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:25:44,848 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:25:44,849 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:25:44,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:25:44,851 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:25:44,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:25:44,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:25:44,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:25:44,853 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:25:44,853 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:25:44,857 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:25:44,857 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:25:44,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:25:44,858 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:25:44,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:25:44,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:25:44,858 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:25:44,858 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:25:44,859 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:25:44,861 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:25:44,861 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:25:44,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:25:44,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:25:44,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:25:44,862 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:25:44,863 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:25:44,863 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:25:44,865 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:25:44,866 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:25:44,866 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:25:44,866 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:25:44,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:25:44,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:25:44,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:25:44,867 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:25:44,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:25:44,867 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:25:44,868 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:25:44,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:25:44,868 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:25:44,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:25:44,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:25:44,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:25:44,869 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:25:44,869 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:25:44,869 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:25:44,870 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:25:44,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:25:44,870 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:25:44,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:25:44,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:25:44,870 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:25:44,871 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:25:44,871 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:25:44,871 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:25:44,872 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:25:44,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:25:44,872 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:25:44,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:25:44,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:25:44,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:25:44,873 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:25:44,873 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:25:44,873 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:25:44,873 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:25:44,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:25:44,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:25:44,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:25:44,874 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:25:44,875 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:25:44,875 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:25:44,877 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:25:44,878 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:25:44,878 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:25:44,878 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:25:44,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:25:44,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:25:44,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:25:44,879 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:25:44,879 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:25:44,880 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:25:44,881 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:25:44,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:25:44,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:25:44,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:25:44,882 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:25:44,883 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:25:44,883 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:25:44,885 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:25:44,885 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:25:44,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:25:44,885 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:25:44,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:25:44,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:25:44,886 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:25:44,886 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:25:44,886 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:25:44,887 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:25:44,887 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:25:44,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:25:44,887 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:25:44,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:25:44,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:25:44,888 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:25:44,888 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:25:44,888 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:25:44,889 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:25:44,889 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:25:44,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:25:44,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:25:44,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:25:44,890 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:25:44,891 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:25:44,891 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:25:44,893 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:25:44,893 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:25:44,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:25:44,894 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:25:44,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:25:44,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:25:44,894 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:25:44,894 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:25:44,895 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:25:44,895 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:25:44,895 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:25:44,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:25:44,896 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:25:44,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:25:44,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:25:44,896 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:25:44,900 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:25:44,901 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:25:44,905 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:25:44,905 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:25:44,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:25:44,905 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:25:44,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:25:44,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:25:44,906 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:25:44,906 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:25:44,906 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:25:44,907 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:25:44,907 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:25:44,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:25:44,907 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:25:44,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:25:44,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:25:44,908 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:25:44,908 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:25:44,908 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:25:44,909 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:25:44,909 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:25:44,909 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:25:44,909 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:25:44,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:25:44,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:25:44,910 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:25:44,910 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:25:44,910 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:25:44,911 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:25:44,911 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:25:44,911 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:25:44,911 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:25:44,911 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:25:44,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:25:44,912 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:25:44,912 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:25:44,912 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:25:44,913 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:25:44,916 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 12:25:44,916 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 12:25:44,917 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:25:44,917 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 12:25:44,918 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:25:44,918 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 15 Supporting invariants [] [2018-11-10 12:25:44,919 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 12:25:44,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:25:45,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:25:45,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:25:45,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:25:45,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:25:45,048 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-10 12:25:45,052 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 12:25:45,053 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 383 states and 662 transitions. cyclomatic complexity: 280 Second operand 4 states. [2018-11-10 12:25:45,116 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 383 states and 662 transitions. cyclomatic complexity: 280. Second operand 4 states. Result 575 states and 972 transitions. Complement of second has 6 states. [2018-11-10 12:25:45,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 12:25:45,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 12:25:45,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 527 transitions. [2018-11-10 12:25:45,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 527 transitions. Stem has 53 letters. Loop has 33 letters. [2018-11-10 12:25:45,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:25:45,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 527 transitions. Stem has 86 letters. Loop has 33 letters. [2018-11-10 12:25:45,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:25:45,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 527 transitions. Stem has 53 letters. Loop has 66 letters. [2018-11-10 12:25:45,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:25:45,122 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 575 states and 972 transitions. [2018-11-10 12:25:45,125 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 12:25:45,125 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 575 states to 0 states and 0 transitions. [2018-11-10 12:25:45,126 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 12:25:45,126 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 12:25:45,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 12:25:45,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:25:45,126 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:25:45,126 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:25:45,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 12:25:45,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 12:25:45,126 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 4 states. [2018-11-10 12:25:45,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:25:45,127 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-10 12:25:45,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 12:25:45,127 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-10 12:25:45,127 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 12:25:45,127 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 12:25:45,127 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 12:25:45,127 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 12:25:45,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 12:25:45,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:25:45,127 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:25:45,127 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:25:45,128 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:25:45,128 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 12:25:45,128 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 12:25:45,128 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 12:25:45,128 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 12:25:45,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 12:25:45 BoogieIcfgContainer [2018-11-10 12:25:45,134 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 12:25:45,134 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 12:25:45,134 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 12:25:45,134 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 12:25:45,135 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:25:42" (3/4) ... [2018-11-10 12:25:45,137 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 12:25:45,137 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 12:25:45,138 INFO L168 Benchmark]: Toolchain (without parser) took 4021.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 190.8 MB). Free memory was 956.6 MB in the beginning and 980.0 MB in the end (delta: -23.5 MB). Peak memory consumption was 167.4 MB. Max. memory is 11.5 GB. [2018-11-10 12:25:45,139 INFO L168 Benchmark]: CDTParser took 0.10 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-10 12:25:45,139 INFO L168 Benchmark]: CACSL2BoogieTranslator took 285.56 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 929.6 MB in the end (delta: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 11.5 GB. [2018-11-10 12:25:45,139 INFO L168 Benchmark]: Boogie Procedure Inliner took 93.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 929.6 MB in the beginning and 1.1 GB in the end (delta: -201.3 MB). Peak memory consumption was 16.8 MB. Max. memory is 11.5 GB. [2018-11-10 12:25:45,140 INFO L168 Benchmark]: Boogie Preprocessor took 41.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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-10 12:25:45,140 INFO L168 Benchmark]: RCFGBuilder took 895.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 106.1 MB). Peak memory consumption was 106.1 MB. Max. memory is 11.5 GB. [2018-11-10 12:25:45,140 INFO L168 Benchmark]: BuchiAutomizer took 2698.68 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 53.5 MB). Free memory was 1.0 GB in the beginning and 980.0 MB in the end (delta: 39.4 MB). Peak memory consumption was 92.9 MB. Max. memory is 11.5 GB. [2018-11-10 12:25:45,141 INFO L168 Benchmark]: Witness Printer took 3.10 ms. Allocated memory is still 1.2 GB. Free memory is still 980.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:25:45,143 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.10 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 285.56 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 929.6 MB in the end (delta: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 93.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 929.6 MB in the beginning and 1.1 GB in the end (delta: -201.3 MB). Peak memory consumption was 16.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 895.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 106.1 MB). Peak memory consumption was 106.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2698.68 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 53.5 MB). Free memory was 1.0 GB in the beginning and 980.0 MB in the end (delta: 39.4 MB). Peak memory consumption was 92.9 MB. Max. memory is 11.5 GB. * Witness Printer took 3.10 ms. Allocated memory is still 1.2 GB. Free memory is still 980.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 15 and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.6s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 383 states and ocurred in iteration 2. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1712 SDtfs, 667 SDslu, 2283 SDs, 0 SdLazy, 36 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI2 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital187 mio100 ax125 hnf105 lsp29 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq229 hnf85 smp100 dnf100 smp100 tf101 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 4ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...