./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.1.ufo.BOUNDED-6.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_6895b9d7-8df3-4b52-9601-a5d2e194163c/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6895b9d7-8df3-4b52-9601-a5d2e194163c/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6895b9d7-8df3-4b52-9601-a5d2e194163c/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6895b9d7-8df3-4b52-9601-a5d2e194163c/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_6895b9d7-8df3-4b52-9601-a5d2e194163c/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6895b9d7-8df3-4b52-9601-a5d2e194163c/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 64424a1c8c8e4b1dfa6f86e97492679716532609 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 04:52:44,602 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 04:52:44,604 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 04:52:44,613 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 04:52:44,613 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 04:52:44,614 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 04:52:44,615 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 04:52:44,616 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 04:52:44,617 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 04:52:44,618 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 04:52:44,619 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 04:52:44,619 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 04:52:44,619 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 04:52:44,620 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 04:52:44,621 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 04:52:44,621 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 04:52:44,622 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 04:52:44,623 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 04:52:44,625 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 04:52:44,626 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 04:52:44,627 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 04:52:44,627 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 04:52:44,629 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 04:52:44,629 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 04:52:44,629 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 04:52:44,630 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 04:52:44,631 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 04:52:44,631 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 04:52:44,632 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 04:52:44,633 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 04:52:44,633 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 04:52:44,633 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 04:52:44,634 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 04:52:44,634 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 04:52:44,634 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 04:52:44,635 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 04:52:44,635 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6895b9d7-8df3-4b52-9601-a5d2e194163c/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 04:52:44,646 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 04:52:44,647 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 04:52:44,647 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 04:52:44,648 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 04:52:44,648 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 04:52:44,648 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 04:52:44,648 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 04:52:44,648 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 04:52:44,648 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 04:52:44,649 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 04:52:44,649 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 04:52:44,649 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 04:52:44,649 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 04:52:44,649 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 04:52:44,649 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 04:52:44,649 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 04:52:44,650 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 04:52:44,650 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 04:52:44,650 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 04:52:44,650 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 04:52:44,650 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 04:52:44,650 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 04:52:44,650 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 04:52:44,650 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 04:52:44,651 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 04:52:44,651 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 04:52:44,651 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 04:52:44,651 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 04:52:44,651 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 04:52:44,651 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 04:52:44,652 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 04:52:44,652 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_6895b9d7-8df3-4b52-9601-a5d2e194163c/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 -> 64424a1c8c8e4b1dfa6f86e97492679716532609 [2018-11-10 04:52:44,676 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 04:52:44,686 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 04:52:44,689 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 04:52:44,690 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 04:52:44,690 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 04:52:44,691 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6895b9d7-8df3-4b52-9601-a5d2e194163c/bin-2019/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c [2018-11-10 04:52:44,731 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6895b9d7-8df3-4b52-9601-a5d2e194163c/bin-2019/uautomizer/data/a34a68b14/c01301bfbad244179199b6b918a8dea1/FLAGa33a4efcb [2018-11-10 04:52:45,124 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 04:52:45,125 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6895b9d7-8df3-4b52-9601-a5d2e194163c/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c [2018-11-10 04:52:45,134 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6895b9d7-8df3-4b52-9601-a5d2e194163c/bin-2019/uautomizer/data/a34a68b14/c01301bfbad244179199b6b918a8dea1/FLAGa33a4efcb [2018-11-10 04:52:45,143 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6895b9d7-8df3-4b52-9601-a5d2e194163c/bin-2019/uautomizer/data/a34a68b14/c01301bfbad244179199b6b918a8dea1 [2018-11-10 04:52:45,145 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 04:52:45,146 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 04:52:45,147 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 04:52:45,147 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 04:52:45,150 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 04:52:45,151 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:52:45" (1/1) ... [2018-11-10 04:52:45,153 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11bcb58d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:52:45, skipping insertion in model container [2018-11-10 04:52:45,154 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:52:45" (1/1) ... [2018-11-10 04:52:45,160 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 04:52:45,186 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 04:52:45,334 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:52:45,341 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 04:52:45,378 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:52:45,392 INFO L193 MainTranslator]: Completed translation [2018-11-10 04:52:45,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:52:45 WrapperNode [2018-11-10 04:52:45,392 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 04:52:45,393 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 04:52:45,393 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 04:52:45,393 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 04:52:45,400 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:52:45" (1/1) ... [2018-11-10 04:52:45,409 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:52:45" (1/1) ... [2018-11-10 04:52:45,483 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 04:52:45,483 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 04:52:45,483 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 04:52:45,483 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 04:52:45,492 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:52:45" (1/1) ... [2018-11-10 04:52:45,492 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:52:45" (1/1) ... [2018-11-10 04:52:45,495 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:52:45" (1/1) ... [2018-11-10 04:52:45,495 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:52:45" (1/1) ... [2018-11-10 04:52:45,501 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:52:45" (1/1) ... [2018-11-10 04:52:45,509 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:52:45" (1/1) ... [2018-11-10 04:52:45,511 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:52:45" (1/1) ... [2018-11-10 04:52:45,514 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 04:52:45,515 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 04:52:45,515 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 04:52:45,515 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 04:52:45,516 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:52:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6895b9d7-8df3-4b52-9601-a5d2e194163c/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 04:52:45,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 04:52:45,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 04:52:46,149 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 04:52:46,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:52:46 BoogieIcfgContainer [2018-11-10 04:52:46,149 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 04:52:46,150 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 04:52:46,150 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 04:52:46,152 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 04:52:46,154 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 04:52:46,154 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 04:52:45" (1/3) ... [2018-11-10 04:52:46,155 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6d9a8d4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 04:52:46, skipping insertion in model container [2018-11-10 04:52:46,155 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 04:52:46,155 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:52:45" (2/3) ... [2018-11-10 04:52:46,156 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6d9a8d4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 04:52:46, skipping insertion in model container [2018-11-10 04:52:46,156 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 04:52:46,156 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:52:46" (3/3) ... [2018-11-10 04:52:46,157 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_opt-floodmax.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c [2018-11-10 04:52:46,194 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 04:52:46,195 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 04:52:46,195 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 04:52:46,195 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 04:52:46,195 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 04:52:46,195 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 04:52:46,195 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 04:52:46,195 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 04:52:46,195 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 04:52:46,208 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 135 states. [2018-11-10 04:52:46,228 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 79 [2018-11-10 04:52:46,228 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:52:46,228 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:52:46,234 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:52:46,235 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] [2018-11-10 04:52:46,235 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 04:52:46,235 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 135 states. [2018-11-10 04:52:46,239 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 79 [2018-11-10 04:52:46,239 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:52:46,239 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:52:46,240 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:52:46,240 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] [2018-11-10 04:52:46,247 INFO L793 eck$LassoCheckResult]: Stem: 96#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;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p13~0 := 0;~p21~0 := 0;~p23~0 := 0;~p31~0 := 0;~p32~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]; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, 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~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet6;havoc main_#t~nondet6;~ep13~0 := main_#t~nondet7;havoc main_#t~nondet7;~ep21~0 := main_#t~nondet8;havoc main_#t~nondet8;~ep23~0 := main_#t~nondet9;havoc main_#t~nondet9;~ep31~0 := main_#t~nondet10;havoc main_#t~nondet10;~ep32~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~nl1~0 := main_#t~nondet15;havoc main_#t~nondet15;~m1~0 := main_#t~nondet16;havoc main_#t~nondet16;~max1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~0 := main_#t~nondet18;havoc main_#t~nondet18;~newmax1~0 := main_#t~nondet19;havoc main_#t~nondet19;~id2~0 := main_#t~nondet20;havoc main_#t~nondet20;~r2~0 := main_#t~nondet21;havoc main_#t~nondet21;~st2~0 := main_#t~nondet22;havoc main_#t~nondet22;~nl2~0 := main_#t~nondet23;havoc main_#t~nondet23;~m2~0 := main_#t~nondet24;havoc main_#t~nondet24;~max2~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode2~0 := main_#t~nondet26;havoc main_#t~nondet26;~newmax2~0 := main_#t~nondet27;havoc main_#t~nondet27;~id3~0 := main_#t~nondet28;havoc main_#t~nondet28;~r3~0 := main_#t~nondet29;havoc main_#t~nondet29;~st3~0 := main_#t~nondet30;havoc main_#t~nondet30;~nl3~0 := main_#t~nondet31;havoc main_#t~nondet31;~m3~0 := main_#t~nondet32;havoc main_#t~nondet32;~max3~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode3~0 := main_#t~nondet34;havoc main_#t~nondet34;~newmax3~0 := main_#t~nondet35;havoc main_#t~nondet35;assume { :begin_inline_init } true;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r211~0, init_~r231~0, init_~r311~0, init_~r321~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r212~0, init_~tmp___1~0, init_~r232~0, init_~tmp___2~0, init_~r312~0, init_~tmp___3~0, init_~r322~0, init_~tmp___4~0, init_~tmp___5~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r212~0;havoc init_~tmp___1~0;havoc init_~r232~0;havoc init_~tmp___2~0;havoc init_~r312~0;havoc init_~tmp___3~0;havoc init_~r322~0;havoc init_~tmp___4~0;havoc init_~tmp___5~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0; 49#L301true assume init_~r121~0 % 256 != 0;init_~tmp~0 := 1; 28#L304-1true init_~r122~0 := (if init_~tmp~0 == 0 then 0 else 1); 86#L314true assume init_~r131~0 % 256 != 0;init_~tmp___0~0 := 1; 62#L317-1true init_~r132~0 := (if init_~tmp___0~0 == 0 then 0 else 1); 116#L327true assume init_~r211~0 % 256 != 0;init_~tmp___1~0 := 1; 94#L330-1true init_~r212~0 := (if init_~tmp___1~0 == 0 then 0 else 1); 10#L340true assume init_~r231~0 % 256 != 0;init_~tmp___2~0 := 1; 8#L343-1true init_~r232~0 := (if init_~tmp___2~0 == 0 then 0 else 1); 56#L353true assume init_~r311~0 % 256 != 0;init_~tmp___3~0 := 1; 31#L356-1true init_~r312~0 := (if init_~tmp___3~0 == 0 then 0 else 1); 90#L366true assume init_~r321~0 % 256 != 0;init_~tmp___4~0 := 1; 84#L369-1true init_~r322~0 := (if init_~tmp___4~0 == 0 then 0 else 1); 135#L379true assume !(~id1~0 != ~id2~0);init_~tmp___5~0 := 0; 137#L379-1true init_#res := init_~tmp___5~0; 99#L476true main_#t~ret36 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;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;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0 := 0; 44#L587-3true [2018-11-10 04:52:46,248 INFO L795 eck$LassoCheckResult]: Loop: 44#L587-3true assume true; 59#L587-1true assume !!(main_~i2~0 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_#t~ite1, node1_~newmax~0;havoc node1_~newmax~0;node1_~newmax~0 := 0; 70#L124true assume !(~mode1~0 % 256 != 0); 64#L152true assume !(~r1~0 < 2); 63#L152-1true ~mode1~0 := 1; 69#L124-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite2, node2_#t~ite3, node2_~newmax~1;havoc node2_~newmax~1;node2_~newmax~1 := 0; 3#L175true assume !(~mode2~0 % 256 != 0); 131#L203true assume !(~r2~0 < 2); 130#L203-1true ~mode2~0 := 1; 14#L175-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite4, node3_#t~ite5, node3_~newmax~2;havoc node3_~newmax~2;node3_~newmax~2 := 0; 83#L226true assume !(~mode3~0 % 256 != 0); 41#L254true assume !(~r3~0 < 2); 38#L254-1true ~mode3~0 := 1; 75#L226-2true assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_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;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 103#L484true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 105#L484-1true check_#res := check_~tmp~1; 43#L532true main_#t~ret37 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;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; 60#L617true assume !(assert_~arg % 256 == 0); 30#L612true assume { :end_inline_assert } true;main_#t~post38 := main_~i2~0;main_~i2~0 := main_#t~post38 + 1;havoc main_#t~post38; 44#L587-3true [2018-11-10 04:52:46,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:52:46,253 INFO L82 PathProgramCache]: Analyzing trace with hash -2018329694, now seen corresponding path program 1 times [2018-11-10 04:52:46,255 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:52:46,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:52:46,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:52:46,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:52:46,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:52:46,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:52:46,404 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 04:52:46,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:52:46,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:52:46,411 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 04:52:46,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:52:46,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1452283605, now seen corresponding path program 1 times [2018-11-10 04:52:46,412 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:52:46,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:52:46,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:52:46,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:52:46,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:52:46,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:52:46,471 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 04:52:46,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:52:46,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 04:52:46,473 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 04:52:46,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:52:46,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:52:46,486 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 4 states. [2018-11-10 04:52:46,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:52:46,563 INFO L93 Difference]: Finished difference Result 137 states and 232 transitions. [2018-11-10 04:52:46,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:52:46,565 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 137 states and 232 transitions. [2018-11-10 04:52:46,567 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2018-11-10 04:52:46,571 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 137 states to 130 states and 202 transitions. [2018-11-10 04:52:46,572 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 130 [2018-11-10 04:52:46,572 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 130 [2018-11-10 04:52:46,573 INFO L73 IsDeterministic]: Start isDeterministic. Operand 130 states and 202 transitions. [2018-11-10 04:52:46,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 04:52:46,574 INFO L705 BuchiCegarLoop]: Abstraction has 130 states and 202 transitions. [2018-11-10 04:52:46,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states and 202 transitions. [2018-11-10 04:52:46,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-11-10 04:52:46,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-10 04:52:46,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 202 transitions. [2018-11-10 04:52:46,604 INFO L728 BuchiCegarLoop]: Abstraction has 130 states and 202 transitions. [2018-11-10 04:52:46,604 INFO L608 BuchiCegarLoop]: Abstraction has 130 states and 202 transitions. [2018-11-10 04:52:46,604 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 04:52:46,604 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 130 states and 202 transitions. [2018-11-10 04:52:46,606 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2018-11-10 04:52:46,606 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:52:46,606 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:52:46,607 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] [2018-11-10 04:52:46,607 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] [2018-11-10 04:52:46,608 INFO L793 eck$LassoCheckResult]: Stem: 405#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;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p13~0 := 0;~p21~0 := 0;~p23~0 := 0;~p31~0 := 0;~p32~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]; 301#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, 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~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet6;havoc main_#t~nondet6;~ep13~0 := main_#t~nondet7;havoc main_#t~nondet7;~ep21~0 := main_#t~nondet8;havoc main_#t~nondet8;~ep23~0 := main_#t~nondet9;havoc main_#t~nondet9;~ep31~0 := main_#t~nondet10;havoc main_#t~nondet10;~ep32~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~nl1~0 := main_#t~nondet15;havoc main_#t~nondet15;~m1~0 := main_#t~nondet16;havoc main_#t~nondet16;~max1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~0 := main_#t~nondet18;havoc main_#t~nondet18;~newmax1~0 := main_#t~nondet19;havoc main_#t~nondet19;~id2~0 := main_#t~nondet20;havoc main_#t~nondet20;~r2~0 := main_#t~nondet21;havoc main_#t~nondet21;~st2~0 := main_#t~nondet22;havoc main_#t~nondet22;~nl2~0 := main_#t~nondet23;havoc main_#t~nondet23;~m2~0 := main_#t~nondet24;havoc main_#t~nondet24;~max2~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode2~0 := main_#t~nondet26;havoc main_#t~nondet26;~newmax2~0 := main_#t~nondet27;havoc main_#t~nondet27;~id3~0 := main_#t~nondet28;havoc main_#t~nondet28;~r3~0 := main_#t~nondet29;havoc main_#t~nondet29;~st3~0 := main_#t~nondet30;havoc main_#t~nondet30;~nl3~0 := main_#t~nondet31;havoc main_#t~nondet31;~m3~0 := main_#t~nondet32;havoc main_#t~nondet32;~max3~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode3~0 := main_#t~nondet34;havoc main_#t~nondet34;~newmax3~0 := main_#t~nondet35;havoc main_#t~nondet35;assume { :begin_inline_init } true;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r211~0, init_~r231~0, init_~r311~0, init_~r321~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r212~0, init_~tmp___1~0, init_~r232~0, init_~tmp___2~0, init_~r312~0, init_~tmp___3~0, init_~r322~0, init_~tmp___4~0, init_~tmp___5~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r212~0;havoc init_~tmp___1~0;havoc init_~r232~0;havoc init_~tmp___2~0;havoc init_~r312~0;havoc init_~tmp___3~0;havoc init_~r322~0;havoc init_~tmp___4~0;havoc init_~tmp___5~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0; 302#L301 assume init_~r121~0 % 256 != 0;init_~tmp~0 := 1; 338#L304-1 init_~r122~0 := (if init_~tmp~0 == 0 then 0 else 1); 340#L314 assume init_~r131~0 % 256 != 0;init_~tmp___0~0 := 1; 305#L317-1 init_~r132~0 := (if init_~tmp___0~0 == 0 then 0 else 1); 383#L327 assume init_~r211~0 % 256 != 0;init_~tmp___1~0 := 1; 379#L330-1 init_~r212~0 := (if init_~tmp___1~0 == 0 then 0 else 1); 303#L340 assume init_~r231~0 % 256 != 0;init_~tmp___2~0 := 1; 296#L343-1 init_~r232~0 := (if init_~tmp___2~0 == 0 then 0 else 1); 297#L353 assume init_~r311~0 % 256 != 0;init_~tmp___3~0 := 1; 345#L356-1 init_~r312~0 := (if init_~tmp___3~0 == 0 then 0 else 1); 346#L366 assume init_~r321~0 % 256 != 0;init_~tmp___4~0 := 1; 330#L369-1 init_~r322~0 := (if init_~tmp___4~0 == 0 then 0 else 1); 400#L379 assume ~id1~0 != ~id2~0; 397#L380 assume ~id1~0 != ~id3~0; 327#L381 assume ~id2~0 != ~id3~0; 328#L382 assume ~id1~0 >= 0; 390#L383 assume ~id2~0 >= 0; 321#L384 assume ~id3~0 >= 0; 322#L385 assume ~r1~0 == 0; 377#L386 assume ~r2~0 == 0; 292#L387 assume ~r3~0 == 0; 293#L388 assume ~max1~0 == ~id1~0; 372#L389 assume ~max2~0 == ~id2~0; 373#L390 assume ~max3~0 == ~id3~0; 395#L391 assume ~st1~0 == 0; 325#L392 assume ~st2~0 == 0; 326#L393 assume ~st3~0 == 0; 389#L394 assume ~nl1~0 == 0; 319#L395 assume ~nl2~0 == 0; 320#L396 assume ~nl3~0 == 0; 376#L397 assume ~mode1~0 % 256 == 0; 290#L398 assume ~mode2~0 % 256 == 0; 291#L399 assume ~mode3~0 % 256 == 0; 370#L400 assume ~newmax1~0 % 256 != 0; 371#L401 assume ~newmax2~0 % 256 != 0; 393#L402 assume ~newmax3~0 % 256 != 0;init_~tmp___5~0 := 1; 394#L379-1 init_#res := init_~tmp___5~0; 406#L476 main_#t~ret36 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;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;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0 := 0; 342#L587-3 [2018-11-10 04:52:46,608 INFO L795 eck$LassoCheckResult]: Loop: 342#L587-3 assume true; 366#L587-1 assume !!(main_~i2~0 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_#t~ite1, node1_~newmax~0;havoc node1_~newmax~0;node1_~newmax~0 := 0; 381#L124 assume !(~mode1~0 % 256 != 0); 385#L152 assume !(~r1~0 < 2); 315#L152-1 ~mode1~0 := 1; 384#L124-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite2, node2_#t~ite3, node2_~newmax~1;havoc node2_~newmax~1;node2_~newmax~1 := 0; 287#L175 assume !(~mode2~0 % 256 != 0); 288#L203 assume !(~r2~0 < 2); 354#L203-1 ~mode2~0 := 1; 312#L175-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite4, node3_#t~ite5, node3_~newmax~2;havoc node3_~newmax~2;node3_~newmax~2 := 0; 313#L226 assume !(~mode3~0 % 256 != 0); 361#L254 assume !(~r3~0 < 2); 357#L254-1 ~mode3~0 := 1; 358#L226-2 assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_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;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 391#L484 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 311#L484-1 check_#res := check_~tmp~1; 363#L532 main_#t~ret37 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;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; 364#L617 assume !(assert_~arg % 256 == 0); 341#L612 assume { :end_inline_assert } true;main_#t~post38 := main_~i2~0;main_~i2~0 := main_#t~post38 + 1;havoc main_#t~post38; 342#L587-3 [2018-11-10 04:52:46,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:52:46,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1427963683, now seen corresponding path program 1 times [2018-11-10 04:52:46,609 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:52:46,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:52:46,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:52:46,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:52:46,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:52:46,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:52:46,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:52:46,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:52:46,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1452283605, now seen corresponding path program 2 times [2018-11-10 04:52:46,691 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:52:46,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:52:46,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:52:46,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:52:46,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:52:46,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:52:46,747 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 04:52:46,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:52:46,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 04:52:46,747 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 04:52:46,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 04:52:46,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 04:52:46,748 INFO L87 Difference]: Start difference. First operand 130 states and 202 transitions. cyclomatic complexity: 73 Second operand 5 states. [2018-11-10 04:52:46,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:52:46,799 INFO L93 Difference]: Finished difference Result 133 states and 204 transitions. [2018-11-10 04:52:46,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 04:52:46,800 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 133 states and 204 transitions. [2018-11-10 04:52:46,801 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2018-11-10 04:52:46,802 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 133 states to 130 states and 194 transitions. [2018-11-10 04:52:46,802 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 130 [2018-11-10 04:52:46,803 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 130 [2018-11-10 04:52:46,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 130 states and 194 transitions. [2018-11-10 04:52:46,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 04:52:46,804 INFO L705 BuchiCegarLoop]: Abstraction has 130 states and 194 transitions. [2018-11-10 04:52:46,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states and 194 transitions. [2018-11-10 04:52:46,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-11-10 04:52:46,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-10 04:52:46,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 194 transitions. [2018-11-10 04:52:46,809 INFO L728 BuchiCegarLoop]: Abstraction has 130 states and 194 transitions. [2018-11-10 04:52:46,810 INFO L608 BuchiCegarLoop]: Abstraction has 130 states and 194 transitions. [2018-11-10 04:52:46,810 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 04:52:46,810 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 130 states and 194 transitions. [2018-11-10 04:52:46,811 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2018-11-10 04:52:46,811 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:52:46,811 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:52:46,812 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] [2018-11-10 04:52:46,812 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] [2018-11-10 04:52:46,813 INFO L793 eck$LassoCheckResult]: Stem: 680#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;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p13~0 := 0;~p21~0 := 0;~p23~0 := 0;~p31~0 := 0;~p32~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]; 576#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, 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~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet6;havoc main_#t~nondet6;~ep13~0 := main_#t~nondet7;havoc main_#t~nondet7;~ep21~0 := main_#t~nondet8;havoc main_#t~nondet8;~ep23~0 := main_#t~nondet9;havoc main_#t~nondet9;~ep31~0 := main_#t~nondet10;havoc main_#t~nondet10;~ep32~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~nl1~0 := main_#t~nondet15;havoc main_#t~nondet15;~m1~0 := main_#t~nondet16;havoc main_#t~nondet16;~max1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~0 := main_#t~nondet18;havoc main_#t~nondet18;~newmax1~0 := main_#t~nondet19;havoc main_#t~nondet19;~id2~0 := main_#t~nondet20;havoc main_#t~nondet20;~r2~0 := main_#t~nondet21;havoc main_#t~nondet21;~st2~0 := main_#t~nondet22;havoc main_#t~nondet22;~nl2~0 := main_#t~nondet23;havoc main_#t~nondet23;~m2~0 := main_#t~nondet24;havoc main_#t~nondet24;~max2~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode2~0 := main_#t~nondet26;havoc main_#t~nondet26;~newmax2~0 := main_#t~nondet27;havoc main_#t~nondet27;~id3~0 := main_#t~nondet28;havoc main_#t~nondet28;~r3~0 := main_#t~nondet29;havoc main_#t~nondet29;~st3~0 := main_#t~nondet30;havoc main_#t~nondet30;~nl3~0 := main_#t~nondet31;havoc main_#t~nondet31;~m3~0 := main_#t~nondet32;havoc main_#t~nondet32;~max3~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode3~0 := main_#t~nondet34;havoc main_#t~nondet34;~newmax3~0 := main_#t~nondet35;havoc main_#t~nondet35;assume { :begin_inline_init } true;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r211~0, init_~r231~0, init_~r311~0, init_~r321~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r212~0, init_~tmp___1~0, init_~r232~0, init_~tmp___2~0, init_~r312~0, init_~tmp___3~0, init_~r322~0, init_~tmp___4~0, init_~tmp___5~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r212~0;havoc init_~tmp___1~0;havoc init_~r232~0;havoc init_~tmp___2~0;havoc init_~r312~0;havoc init_~tmp___3~0;havoc init_~r322~0;havoc init_~tmp___4~0;havoc init_~tmp___5~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0; 577#L301 assume init_~r121~0 % 256 != 0;init_~tmp~0 := 1; 612#L304-1 init_~r122~0 := (if init_~tmp~0 == 0 then 0 else 1); 614#L314 assume init_~r131~0 % 256 != 0;init_~tmp___0~0 := 1; 580#L317-1 init_~r132~0 := (if init_~tmp___0~0 == 0 then 0 else 1); 658#L327 assume init_~r211~0 % 256 != 0;init_~tmp___1~0 := 1; 654#L330-1 init_~r212~0 := (if init_~tmp___1~0 == 0 then 0 else 1); 578#L340 assume init_~r231~0 % 256 != 0;init_~tmp___2~0 := 1; 571#L343-1 init_~r232~0 := (if init_~tmp___2~0 == 0 then 0 else 1); 572#L353 assume init_~r311~0 % 256 != 0;init_~tmp___3~0 := 1; 619#L356-1 init_~r312~0 := (if init_~tmp___3~0 == 0 then 0 else 1); 620#L366 assume init_~r321~0 % 256 != 0;init_~tmp___4~0 := 1; 605#L369-1 init_~r322~0 := (if init_~tmp___4~0 == 0 then 0 else 1); 675#L379 assume ~id1~0 != ~id2~0; 672#L380 assume ~id1~0 != ~id3~0; 601#L381 assume ~id2~0 != ~id3~0; 602#L382 assume ~id1~0 >= 0; 665#L383 assume ~id2~0 >= 0; 595#L384 assume ~id3~0 >= 0; 596#L385 assume ~r1~0 == 0; 652#L386 assume ~r2~0 == 0; 567#L387 assume ~r3~0 == 0; 568#L388 assume ~max1~0 == ~id1~0; 647#L389 assume ~max2~0 == ~id2~0; 648#L390 assume ~max3~0 == ~id3~0; 670#L391 assume ~st1~0 == 0; 599#L392 assume ~st2~0 == 0; 600#L393 assume ~st3~0 == 0; 664#L394 assume ~nl1~0 == 0; 593#L395 assume ~nl2~0 == 0; 594#L396 assume ~nl3~0 == 0; 651#L397 assume ~mode1~0 % 256 == 0; 565#L398 assume ~mode2~0 % 256 == 0; 566#L399 assume ~mode3~0 % 256 == 0; 645#L400 assume ~newmax1~0 % 256 != 0; 646#L401 assume ~newmax2~0 % 256 != 0; 668#L402 assume ~newmax3~0 % 256 != 0;init_~tmp___5~0 := 1; 669#L379-1 init_#res := init_~tmp___5~0; 681#L476 main_#t~ret36 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;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;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0 := 0; 616#L587-3 [2018-11-10 04:52:46,813 INFO L795 eck$LassoCheckResult]: Loop: 616#L587-3 assume true; 641#L587-1 assume !!(main_~i2~0 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_#t~ite1, node1_~newmax~0;havoc node1_~newmax~0;node1_~newmax~0 := 0; 656#L124 assume !(~mode1~0 % 256 != 0); 660#L152 assume !(~r1~0 < 2); 589#L152-1 ~mode1~0 := 1; 659#L124-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite2, node2_#t~ite3, node2_~newmax~1;havoc node2_~newmax~1;node2_~newmax~1 := 0; 562#L175 assume !(~mode2~0 % 256 != 0); 563#L203 assume !(~r2~0 < 2); 628#L203-1 ~mode2~0 := 1; 586#L175-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite4, node3_#t~ite5, node3_~newmax~2;havoc node3_~newmax~2;node3_~newmax~2 := 0; 587#L226 assume !(~mode3~0 % 256 != 0); 636#L254 assume !(~r3~0 < 2); 630#L254-1 ~mode3~0 := 1; 631#L226-2 assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_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;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 666#L484 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 662#L485 assume ~st1~0 + ~nl1~0 <= 1; 584#L486 assume ~st2~0 + ~nl2~0 <= 1; 585#L487 assume ~st3~0 + ~nl3~0 <= 1; 640#L488 assume ~r1~0 >= 2; 635#L492 assume ~r1~0 < 2; 581#L497 assume ~r1~0 >= 2; 582#L502 assume ~r1~0 < 2;check_~tmp~1 := 1; 632#L484-1 check_#res := check_~tmp~1; 638#L532 main_#t~ret37 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;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; 639#L617 assume !(assert_~arg % 256 == 0); 615#L612 assume { :end_inline_assert } true;main_#t~post38 := main_~i2~0;main_~i2~0 := main_#t~post38 + 1;havoc main_#t~post38; 616#L587-3 [2018-11-10 04:52:46,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:52:46,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1427963683, now seen corresponding path program 2 times [2018-11-10 04:52:46,814 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:52:46,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:52:46,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:52:46,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:52:46,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:52:46,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:52:46,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:52:46,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:52:46,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1920330381, now seen corresponding path program 1 times [2018-11-10 04:52:46,860 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:52:46,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:52:46,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:52:46,861 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:52:46,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:52:46,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:52:46,887 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 04:52:46,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:52:46,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:52:46,887 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 04:52:46,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:52:46,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:52:46,888 INFO L87 Difference]: Start difference. First operand 130 states and 194 transitions. cyclomatic complexity: 65 Second operand 3 states. [2018-11-10 04:52:46,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:52:46,931 INFO L93 Difference]: Finished difference Result 189 states and 282 transitions. [2018-11-10 04:52:46,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:52:46,931 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 189 states and 282 transitions. [2018-11-10 04:52:46,933 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 137 [2018-11-10 04:52:46,934 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 189 states to 189 states and 282 transitions. [2018-11-10 04:52:46,935 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 189 [2018-11-10 04:52:46,935 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 189 [2018-11-10 04:52:46,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 189 states and 282 transitions. [2018-11-10 04:52:46,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 04:52:46,936 INFO L705 BuchiCegarLoop]: Abstraction has 189 states and 282 transitions. [2018-11-10 04:52:46,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states and 282 transitions. [2018-11-10 04:52:46,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-11-10 04:52:46,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-11-10 04:52:46,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 282 transitions. [2018-11-10 04:52:46,945 INFO L728 BuchiCegarLoop]: Abstraction has 189 states and 282 transitions. [2018-11-10 04:52:46,945 INFO L608 BuchiCegarLoop]: Abstraction has 189 states and 282 transitions. [2018-11-10 04:52:46,945 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 04:52:46,946 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 189 states and 282 transitions. [2018-11-10 04:52:46,947 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 137 [2018-11-10 04:52:46,947 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:52:46,947 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:52:46,948 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] [2018-11-10 04:52:46,948 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] [2018-11-10 04:52:46,948 INFO L793 eck$LassoCheckResult]: Stem: 1010#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;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p13~0 := 0;~p21~0 := 0;~p23~0 := 0;~p31~0 := 0;~p32~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]; 901#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, 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~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet6;havoc main_#t~nondet6;~ep13~0 := main_#t~nondet7;havoc main_#t~nondet7;~ep21~0 := main_#t~nondet8;havoc main_#t~nondet8;~ep23~0 := main_#t~nondet9;havoc main_#t~nondet9;~ep31~0 := main_#t~nondet10;havoc main_#t~nondet10;~ep32~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~nl1~0 := main_#t~nondet15;havoc main_#t~nondet15;~m1~0 := main_#t~nondet16;havoc main_#t~nondet16;~max1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~0 := main_#t~nondet18;havoc main_#t~nondet18;~newmax1~0 := main_#t~nondet19;havoc main_#t~nondet19;~id2~0 := main_#t~nondet20;havoc main_#t~nondet20;~r2~0 := main_#t~nondet21;havoc main_#t~nondet21;~st2~0 := main_#t~nondet22;havoc main_#t~nondet22;~nl2~0 := main_#t~nondet23;havoc main_#t~nondet23;~m2~0 := main_#t~nondet24;havoc main_#t~nondet24;~max2~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode2~0 := main_#t~nondet26;havoc main_#t~nondet26;~newmax2~0 := main_#t~nondet27;havoc main_#t~nondet27;~id3~0 := main_#t~nondet28;havoc main_#t~nondet28;~r3~0 := main_#t~nondet29;havoc main_#t~nondet29;~st3~0 := main_#t~nondet30;havoc main_#t~nondet30;~nl3~0 := main_#t~nondet31;havoc main_#t~nondet31;~m3~0 := main_#t~nondet32;havoc main_#t~nondet32;~max3~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode3~0 := main_#t~nondet34;havoc main_#t~nondet34;~newmax3~0 := main_#t~nondet35;havoc main_#t~nondet35;assume { :begin_inline_init } true;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r211~0, init_~r231~0, init_~r311~0, init_~r321~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r212~0, init_~tmp___1~0, init_~r232~0, init_~tmp___2~0, init_~r312~0, init_~tmp___3~0, init_~r322~0, init_~tmp___4~0, init_~tmp___5~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r212~0;havoc init_~tmp___1~0;havoc init_~r232~0;havoc init_~tmp___2~0;havoc init_~r312~0;havoc init_~tmp___3~0;havoc init_~r322~0;havoc init_~tmp___4~0;havoc init_~tmp___5~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0; 902#L301 assume init_~r121~0 % 256 != 0;init_~tmp~0 := 1; 936#L304-1 init_~r122~0 := (if init_~tmp~0 == 0 then 0 else 1); 938#L314 assume init_~r131~0 % 256 != 0;init_~tmp___0~0 := 1; 905#L317-1 init_~r132~0 := (if init_~tmp___0~0 == 0 then 0 else 1); 983#L327 assume init_~r211~0 % 256 != 0;init_~tmp___1~0 := 1; 978#L330-1 init_~r212~0 := (if init_~tmp___1~0 == 0 then 0 else 1); 903#L340 assume init_~r231~0 % 256 != 0;init_~tmp___2~0 := 1; 896#L343-1 init_~r232~0 := (if init_~tmp___2~0 == 0 then 0 else 1); 897#L353 assume init_~r311~0 % 256 != 0;init_~tmp___3~0 := 1; 943#L356-1 init_~r312~0 := (if init_~tmp___3~0 == 0 then 0 else 1); 948#L366 assume init_~r321~0 % 256 != 0;init_~tmp___4~0 := 1; 929#L369-1 init_~r322~0 := (if init_~tmp___4~0 == 0 then 0 else 1); 1002#L379 assume ~id1~0 != ~id2~0; 999#L380 assume ~id1~0 != ~id3~0; 925#L381 assume ~id2~0 != ~id3~0; 926#L382 assume ~id1~0 >= 0; 992#L383 assume ~id2~0 >= 0; 919#L384 assume ~id3~0 >= 0; 920#L385 assume ~r1~0 == 0; 976#L386 assume ~r2~0 == 0; 892#L387 assume ~r3~0 == 0; 893#L388 assume ~max1~0 == ~id1~0; 971#L389 assume ~max2~0 == ~id2~0; 972#L390 assume ~max3~0 == ~id3~0; 998#L391 assume ~st1~0 == 0; 923#L392 assume ~st2~0 == 0; 924#L393 assume ~st3~0 == 0; 991#L394 assume ~nl1~0 == 0; 917#L395 assume ~nl2~0 == 0; 918#L396 assume ~nl3~0 == 0; 975#L397 assume ~mode1~0 % 256 == 0; 890#L398 assume ~mode2~0 % 256 == 0; 891#L399 assume ~mode3~0 % 256 == 0; 969#L400 assume ~newmax1~0 % 256 != 0; 970#L401 assume ~newmax2~0 % 256 != 0; 995#L402 assume ~newmax3~0 % 256 != 0;init_~tmp___5~0 := 1; 996#L379-1 init_#res := init_~tmp___5~0; 1011#L476 main_#t~ret36 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;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;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0 := 0; 1012#L587-3 [2018-11-10 04:52:46,948 INFO L795 eck$LassoCheckResult]: Loop: 1012#L587-3 assume true; 1073#L587-1 assume !!(main_~i2~0 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_#t~ite1, node1_~newmax~0;havoc node1_~newmax~0;node1_~newmax~0 := 0; 1072#L124 assume !(~mode1~0 % 256 != 0); 1071#L152 assume ~r1~0 < 2; 915#L153 assume !(~ep12~0 % 256 != 0); 912#L153-1 assume !(~ep13~0 % 256 != 0); 913#L152-1 ~mode1~0 := 1; 984#L124-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite2, node2_#t~ite3, node2_~newmax~1;havoc node2_~newmax~1;node2_~newmax~1 := 0; 887#L175 assume !(~mode2~0 % 256 != 0); 888#L203 assume !(~r2~0 < 2); 952#L203-1 ~mode2~0 := 1; 908#L175-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite4, node3_#t~ite5, node3_~newmax~2;havoc node3_~newmax~2;node3_~newmax~2 := 0; 909#L226 assume !(~mode3~0 % 256 != 0); 959#L254 assume !(~r3~0 < 2); 954#L254-1 ~mode3~0 := 1; 955#L226-2 assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_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;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 994#L484 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 988#L485 assume ~st1~0 + ~nl1~0 <= 1; 989#L486 assume ~st2~0 + ~nl2~0 <= 1; 1028#L487 assume ~st3~0 + ~nl3~0 <= 1; 1027#L488 assume !(~r1~0 >= 2); 957#L491 assume ~st1~0 + ~st2~0 + ~st3~0 == 0; 958#L492 assume ~r1~0 < 2; 1029#L497 assume !(~r1~0 >= 2); 1007#L501 assume ~nl1~0 + ~nl2~0 + ~nl3~0 == 0; 1008#L502 assume ~r1~0 < 2;check_~tmp~1 := 1; 1016#L484-1 check_#res := check_~tmp~1; 961#L532 main_#t~ret37 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;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; 962#L617 assume !(assert_~arg % 256 == 0); 981#L612 assume { :end_inline_assert } true;main_#t~post38 := main_~i2~0;main_~i2~0 := main_#t~post38 + 1;havoc main_#t~post38; 1012#L587-3 [2018-11-10 04:52:46,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:52:46,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1427963683, now seen corresponding path program 3 times [2018-11-10 04:52:46,949 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:52:46,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:52:46,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:52:46,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:52:46,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:52:46,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:52:46,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:52:46,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:52:46,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1611508744, now seen corresponding path program 1 times [2018-11-10 04:52:46,989 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:52:46,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:52:46,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:52:46,990 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:52:46,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:52:46,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:52:47,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:52:47,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:52:47,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1032737894, now seen corresponding path program 1 times [2018-11-10 04:52:47,008 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:52:47,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:52:47,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:52:47,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:52:47,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:52:47,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:52:47,062 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 04:52:47,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:52:47,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:52:47,298 WARN L179 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 106 [2018-11-10 04:52:47,388 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:52:47,389 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:52:47,389 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:52:47,389 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:52:47,389 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 04:52:47,389 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:52:47,390 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:52:47,390 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:52:47,390 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_opt-floodmax.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c_Iteration4_Loop [2018-11-10 04:52:47,390 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:52:47,390 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:52:47,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 04:52:47,414 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 04:52:47,418 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 04:52:47,419 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 04:52:47,431 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 04:52:47,433 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 04:52:47,441 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 04:52:47,445 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 04:52:47,447 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 04:52:47,449 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 04:52:47,450 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 04:52:47,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 04:52:47,454 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 04:52:47,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 04:52:47,458 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 04:52:47,459 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 04:52:47,467 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 04:52:47,469 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 04:52:47,470 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 04:52:47,473 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 04:52:47,475 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 04:52:47,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 04:52:47,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 04:52:47,495 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 04:52:47,510 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 04:52:47,511 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 04:52:47,512 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 04:52:47,514 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 04:52:47,515 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 04:52:47,848 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:52:47,848 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6895b9d7-8df3-4b52-9601-a5d2e194163c/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 04:52:47,853 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 04:52:47,853 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 04:52:47,864 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 04:52:47,864 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~ep12~0=-256} Honda state: {~ep12~0=-256} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6895b9d7-8df3-4b52-9601-a5d2e194163c/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 04:52:47,883 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 04:52:47,883 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6895b9d7-8df3-4b52-9601-a5d2e194163c/bin-2019/uautomizer/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:52:47,907 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 04:52:47,907 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 04:52:48,053 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 04:52:48,055 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:52:48,055 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:52:48,055 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:52:48,055 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:52:48,055 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 04:52:48,055 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:52:48,055 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:52:48,055 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:52:48,055 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_opt-floodmax.3_false-unreach-call.1.ufo.BOUNDED-6.pals_true-termination.c_Iteration4_Loop [2018-11-10 04:52:48,055 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:52:48,056 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:52:48,059 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 04:52:48,074 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 04:52:48,079 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 04:52:48,086 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 04:52:48,093 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 04:52:48,095 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 04:52:48,099 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 04:52:48,105 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 04:52:48,109 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 04:52:48,111 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 04:52:48,112 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 04:52:48,114 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 04:52:48,117 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 04:52:48,118 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 04:52:48,119 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 04:52:48,123 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 04:52:48,124 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 04:52:48,125 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 04:52:48,127 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 04:52:48,131 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 04:52:48,133 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 04:52:48,135 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 04:52:48,136 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 04:52:48,139 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 04:52:48,140 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 04:52:48,141 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 04:52:48,142 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 04:52:48,145 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 04:52:48,161 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 04:52:48,467 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:52:48,474 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 04:52:48,475 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 04:52:48,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:52:48,476 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:52:48,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:52:48,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:52:48,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:52:48,478 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:52:48,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:52:48,481 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:52:48,481 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 04:52:48,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:52:48,482 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:52:48,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:52:48,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:52:48,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:52:48,482 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:52:48,483 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:52:48,485 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:52:48,485 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 04:52:48,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:52:48,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:52:48,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:52:48,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:52:48,488 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:52:48,488 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:52:48,490 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:52:48,490 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 04:52:48,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:52:48,491 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:52:48,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:52:48,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:52:48,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:52:48,492 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:52:48,492 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:52:48,493 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:52:48,494 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 04:52:48,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:52:48,494 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:52:48,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:52:48,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:52:48,494 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:52:48,495 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:52:48,495 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:52:48,496 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:52:48,496 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 04:52:48,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:52:48,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:52:48,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:52:48,497 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:52:48,498 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:52:48,498 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:52:48,501 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:52:48,501 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 04:52:48,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:52:48,501 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:52:48,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:52:48,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:52:48,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:52:48,503 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:52:48,503 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:52:48,505 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:52:48,509 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 04:52:48,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:52:48,510 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:52:48,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:52:48,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:52:48,511 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:52:48,511 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:52:48,511 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:52:48,513 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:52:48,518 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 04:52:48,518 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:52:48,518 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:52:48,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:52:48,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:52:48,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:52:48,519 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:52:48,519 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:52:48,520 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:52:48,520 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 04:52:48,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:52:48,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:52:48,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:52:48,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:52:48,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:52:48,522 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:52:48,522 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:52:48,522 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:52:48,523 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 04:52:48,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:52:48,523 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:52:48,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:52:48,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:52:48,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:52:48,524 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:52:48,524 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:52:48,525 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:52:48,525 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 04:52:48,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:52:48,526 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:52:48,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:52:48,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:52:48,526 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:52:48,527 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:52:48,527 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:52:48,527 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:52:48,528 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 04:52:48,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:52:48,528 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:52:48,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:52:48,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:52:48,529 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:52:48,529 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:52:48,529 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:52:48,530 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:52:48,530 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 04:52:48,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:52:48,530 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:52:48,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:52:48,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:52:48,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:52:48,531 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:52:48,531 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:52:48,532 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:52:48,532 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 04:52:48,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:52:48,533 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:52:48,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:52:48,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:52:48,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:52:48,533 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:52:48,534 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:52:48,535 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 04:52:48,537 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 04:52:48,537 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 04:52:48,539 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 04:52:48,539 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 04:52:48,539 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 04:52:48,540 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 11 Supporting invariants [] [2018-11-10 04:52:48,541 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 04:52:48,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:52:48,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:52:48,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:52:48,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:52:48,661 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:52:48,685 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 04:52:48,689 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 04:52:48,690 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 189 states and 282 transitions. cyclomatic complexity: 94 Second operand 4 states. [2018-11-10 04:52:48,739 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 189 states and 282 transitions. cyclomatic complexity: 94. Second operand 4 states. Result 325 states and 494 transitions. Complement of second has 6 states. [2018-11-10 04:52:48,740 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 04:52:48,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 04:52:48,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 194 transitions. [2018-11-10 04:52:48,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 194 transitions. Stem has 40 letters. Loop has 30 letters. [2018-11-10 04:52:48,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:52:48,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 194 transitions. Stem has 70 letters. Loop has 30 letters. [2018-11-10 04:52:48,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:52:48,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 194 transitions. Stem has 40 letters. Loop has 60 letters. [2018-11-10 04:52:48,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:52:48,745 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 325 states and 494 transitions. [2018-11-10 04:52:48,748 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 04:52:48,748 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 325 states to 0 states and 0 transitions. [2018-11-10 04:52:48,748 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 04:52:48,748 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 04:52:48,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 04:52:48,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 04:52:48,749 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 04:52:48,749 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 04:52:48,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:52:48,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:52:48,749 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2018-11-10 04:52:48,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:52:48,749 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-10 04:52:48,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 04:52:48,749 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-10 04:52:48,750 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 04:52:48,754 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 04:52:48,755 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 04:52:48,755 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 04:52:48,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 04:52:48,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 04:52:48,755 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 04:52:48,755 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 04:52:48,755 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 04:52:48,755 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 04:52:48,755 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 04:52:48,755 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 04:52:48,755 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 04:52:48,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 04:52:48 BoogieIcfgContainer [2018-11-10 04:52:48,765 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 04:52:48,765 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 04:52:48,765 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 04:52:48,765 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 04:52:48,766 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:52:46" (3/4) ... [2018-11-10 04:52:48,769 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 04:52:48,769 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 04:52:48,770 INFO L168 Benchmark]: Toolchain (without parser) took 3624.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 211.8 MB). Free memory was 959.2 MB in the beginning and 1.0 GB in the end (delta: -58.5 MB). Peak memory consumption was 153.4 MB. Max. memory is 11.5 GB. [2018-11-10 04:52:48,770 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:52:48,771 INFO L168 Benchmark]: CACSL2BoogieTranslator took 245.75 ms. Allocated memory is still 1.0 GB. Free memory was 956.5 MB in the beginning and 940.4 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-10 04:52:48,771 INFO L168 Benchmark]: Boogie Procedure Inliner took 90.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 940.4 MB in the beginning and 1.1 GB in the end (delta: -184.8 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2018-11-10 04:52:48,772 INFO L168 Benchmark]: Boogie Preprocessor took 31.33 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-10 04:52:48,772 INFO L168 Benchmark]: RCFGBuilder took 634.76 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: 52.1 MB). Peak memory consumption was 52.1 MB. Max. memory is 11.5 GB. [2018-11-10 04:52:48,773 INFO L168 Benchmark]: BuchiAutomizer took 2615.00 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 80.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 51.9 MB). Peak memory consumption was 132.2 MB. Max. memory is 11.5 GB. [2018-11-10 04:52:48,773 INFO L168 Benchmark]: Witness Printer took 4.02 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:52:48,778 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 245.75 ms. Allocated memory is still 1.0 GB. Free memory was 956.5 MB in the beginning and 940.4 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 90.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 940.4 MB in the beginning and 1.1 GB in the end (delta: -184.8 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.33 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 634.76 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: 52.1 MB). Peak memory consumption was 52.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2615.00 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 80.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 51.9 MB). Peak memory consumption was 132.2 MB. Max. memory is 11.5 GB. * Witness Printer took 4.02 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. 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 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 11 and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.5s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 2.0s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 189 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 816 SDtfs, 270 SDslu, 1317 SDs, 0 SdLazy, 39 SolverSat, 41 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital148 mio100 ax124 hnf104 lsp19 ukn100 mio100 lsp100 div128 bol100 ite100 ukn100 eq175 hnf86 smp100 dnf100 smp100 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 4ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 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...