./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4_false-unreach-call.2.ufo.BOUNDED-8.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_603f22a8-8d2d-43e8-864a-044eeff1e101/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_603f22a8-8d2d-43e8-864a-044eeff1e101/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_603f22a8-8d2d-43e8-864a-044eeff1e101/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_603f22a8-8d2d-43e8-864a-044eeff1e101/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4_false-unreach-call.2.ufo.BOUNDED-8.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_603f22a8-8d2d-43e8-864a-044eeff1e101/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_603f22a8-8d2d-43e8-864a-044eeff1e101/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 c878d4c6ffd1ff0965d17e614910488cd1ba3a61 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-09 22:22:49,506 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-09 22:22:49,508 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-09 22:22:49,515 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-09 22:22:49,515 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-09 22:22:49,515 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-09 22:22:49,516 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-09 22:22:49,517 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-09 22:22:49,518 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-09 22:22:49,519 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-09 22:22:49,519 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-09 22:22:49,519 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-09 22:22:49,520 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-09 22:22:49,521 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-09 22:22:49,521 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-09 22:22:49,522 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-09 22:22:49,523 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-09 22:22:49,524 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-09 22:22:49,525 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-09 22:22:49,526 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-09 22:22:49,526 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-09 22:22:49,527 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-09 22:22:49,529 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-09 22:22:49,529 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-09 22:22:49,529 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-09 22:22:49,529 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-09 22:22:49,530 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-09 22:22:49,530 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-09 22:22:49,531 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-09 22:22:49,532 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-09 22:22:49,532 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-09 22:22:49,532 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-09 22:22:49,532 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-09 22:22:49,533 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-09 22:22:49,533 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-09 22:22:49,534 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-09 22:22:49,534 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_603f22a8-8d2d-43e8-864a-044eeff1e101/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-09 22:22:49,543 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-09 22:22:49,544 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-09 22:22:49,544 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-09 22:22:49,545 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-09 22:22:49,545 INFO L133 SettingsManager]: * Use SBE=true [2018-11-09 22:22:49,545 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-09 22:22:49,545 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-09 22:22:49,545 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-09 22:22:49,545 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-09 22:22:49,545 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-09 22:22:49,546 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-09 22:22:49,546 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-09 22:22:49,546 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-09 22:22:49,546 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-09 22:22:49,546 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-09 22:22:49,546 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-09 22:22:49,546 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-09 22:22:49,546 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-09 22:22:49,547 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-09 22:22:49,547 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-09 22:22:49,547 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-09 22:22:49,547 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-09 22:22:49,547 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-09 22:22:49,547 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-09 22:22:49,547 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-09 22:22:49,547 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-09 22:22:49,548 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-09 22:22:49,548 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-09 22:22:49,548 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-09 22:22:49,548 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-09 22:22:49,549 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-09 22:22:49,549 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_603f22a8-8d2d-43e8-864a-044eeff1e101/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 -> c878d4c6ffd1ff0965d17e614910488cd1ba3a61 [2018-11-09 22:22:49,570 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-09 22:22:49,579 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-09 22:22:49,581 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-09 22:22:49,581 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-09 22:22:49,582 INFO L276 PluginConnector]: CDTParser initialized [2018-11-09 22:22:49,582 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_603f22a8-8d2d-43e8-864a-044eeff1e101/bin-2019/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4_false-unreach-call.2.ufo.BOUNDED-8.pals_true-termination.c [2018-11-09 22:22:49,617 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_603f22a8-8d2d-43e8-864a-044eeff1e101/bin-2019/uautomizer/data/484d0bfae/7bd8c88c848f48c3ae997569c09930b0/FLAGce7d7c584 [2018-11-09 22:22:50,048 INFO L298 CDTParser]: Found 1 translation units. [2018-11-09 22:22:50,049 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_603f22a8-8d2d-43e8-864a-044eeff1e101/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4_false-unreach-call.2.ufo.BOUNDED-8.pals_true-termination.c [2018-11-09 22:22:50,058 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_603f22a8-8d2d-43e8-864a-044eeff1e101/bin-2019/uautomizer/data/484d0bfae/7bd8c88c848f48c3ae997569c09930b0/FLAGce7d7c584 [2018-11-09 22:22:50,066 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_603f22a8-8d2d-43e8-864a-044eeff1e101/bin-2019/uautomizer/data/484d0bfae/7bd8c88c848f48c3ae997569c09930b0 [2018-11-09 22:22:50,068 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-09 22:22:50,069 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-09 22:22:50,070 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-09 22:22:50,070 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-09 22:22:50,073 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-09 22:22:50,074 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:22:50" (1/1) ... [2018-11-09 22:22:50,076 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b52ac19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:50, skipping insertion in model container [2018-11-09 22:22:50,076 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:22:50" (1/1) ... [2018-11-09 22:22:50,081 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-09 22:22:50,111 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-09 22:22:50,283 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-09 22:22:50,288 INFO L189 MainTranslator]: Completed pre-run [2018-11-09 22:22:50,338 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-09 22:22:50,349 INFO L193 MainTranslator]: Completed translation [2018-11-09 22:22:50,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:50 WrapperNode [2018-11-09 22:22:50,349 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-09 22:22:50,349 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-09 22:22:50,349 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-09 22:22:50,349 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-09 22:22:50,398 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:50" (1/1) ... [2018-11-09 22:22:50,409 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:50" (1/1) ... [2018-11-09 22:22:50,441 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-09 22:22:50,441 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-09 22:22:50,442 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-09 22:22:50,442 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-09 22:22:50,447 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:50" (1/1) ... [2018-11-09 22:22:50,447 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:50" (1/1) ... [2018-11-09 22:22:50,451 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:50" (1/1) ... [2018-11-09 22:22:50,452 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:50" (1/1) ... [2018-11-09 22:22:50,463 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:50" (1/1) ... [2018-11-09 22:22:50,475 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:50" (1/1) ... [2018-11-09 22:22:50,478 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:50" (1/1) ... [2018-11-09 22:22:50,482 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-09 22:22:50,483 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-09 22:22:50,483 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-09 22:22:50,483 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-09 22:22:50,484 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_603f22a8-8d2d-43e8-864a-044eeff1e101/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-09 22:22:50,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-09 22:22:50,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-09 22:22:51,387 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-09 22:22:51,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:22:51 BoogieIcfgContainer [2018-11-09 22:22:51,388 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-09 22:22:51,388 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-09 22:22:51,388 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-09 22:22:51,391 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-09 22:22:51,391 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-09 22:22:51,391 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.11 10:22:50" (1/3) ... [2018-11-09 22:22:51,392 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6f32b4e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 10:22:51, skipping insertion in model container [2018-11-09 22:22:51,392 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-09 22:22:51,392 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:22:50" (2/3) ... [2018-11-09 22:22:51,392 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6f32b4e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 10:22:51, skipping insertion in model container [2018-11-09 22:22:51,393 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-09 22:22:51,393 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:22:51" (3/3) ... [2018-11-09 22:22:51,394 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_opt-floodmax.4_false-unreach-call.2.ufo.BOUNDED-8.pals_true-termination.c [2018-11-09 22:22:51,427 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-09 22:22:51,428 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-09 22:22:51,428 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-09 22:22:51,428 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-09 22:22:51,428 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-09 22:22:51,428 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-09 22:22:51,428 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-09 22:22:51,428 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-09 22:22:51,428 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-09 22:22:51,445 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 322 states. [2018-11-09 22:22:51,473 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 124 [2018-11-09 22:22:51,474 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 22:22:51,474 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 22:22:51,481 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:22:51,481 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:22:51,481 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-09 22:22:51,481 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 322 states. [2018-11-09 22:22:51,489 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 124 [2018-11-09 22:22:51,489 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 22:22:51,489 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 22:22:51,491 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:22:51,491 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:22:51,498 INFO L793 eck$LassoCheckResult]: Stem: 121#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~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;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~newmax4~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p13~0 := 0;~p14~0 := 0;~p21~0 := 0;~p23~0 := 0;~p24~0 := 0;~p31~0 := 0;~p32~0 := 0;~p34~0 := 0;~p41~0 := 0;~p42~0 := 0;~p43~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset]; 12#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~ret56, main_#t~ret57, main_#t~post58, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet12;havoc main_#t~nondet12;~ep13~0 := main_#t~nondet13;havoc main_#t~nondet13;~ep14~0 := main_#t~nondet14;havoc main_#t~nondet14;~ep21~0 := main_#t~nondet15;havoc main_#t~nondet15;~ep23~0 := main_#t~nondet16;havoc main_#t~nondet16;~ep24~0 := main_#t~nondet17;havoc main_#t~nondet17;~ep31~0 := main_#t~nondet18;havoc main_#t~nondet18;~ep32~0 := main_#t~nondet19;havoc main_#t~nondet19;~ep34~0 := main_#t~nondet20;havoc main_#t~nondet20;~ep41~0 := main_#t~nondet21;havoc main_#t~nondet21;~ep42~0 := main_#t~nondet22;havoc main_#t~nondet22;~ep43~0 := main_#t~nondet23;havoc main_#t~nondet23;~id1~0 := main_#t~nondet24;havoc main_#t~nondet24;~r1~0 := main_#t~nondet25;havoc main_#t~nondet25;~st1~0 := main_#t~nondet26;havoc main_#t~nondet26;~nl1~0 := main_#t~nondet27;havoc main_#t~nondet27;~m1~0 := main_#t~nondet28;havoc main_#t~nondet28;~max1~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode1~0 := main_#t~nondet30;havoc main_#t~nondet30;~newmax1~0 := main_#t~nondet31;havoc main_#t~nondet31;~id2~0 := main_#t~nondet32;havoc main_#t~nondet32;~r2~0 := main_#t~nondet33;havoc main_#t~nondet33;~st2~0 := main_#t~nondet34;havoc main_#t~nondet34;~nl2~0 := main_#t~nondet35;havoc main_#t~nondet35;~m2~0 := main_#t~nondet36;havoc main_#t~nondet36;~max2~0 := main_#t~nondet37;havoc main_#t~nondet37;~mode2~0 := main_#t~nondet38;havoc main_#t~nondet38;~newmax2~0 := main_#t~nondet39;havoc main_#t~nondet39;~id3~0 := main_#t~nondet40;havoc main_#t~nondet40;~r3~0 := main_#t~nondet41;havoc main_#t~nondet41;~st3~0 := main_#t~nondet42;havoc main_#t~nondet42;~nl3~0 := main_#t~nondet43;havoc main_#t~nondet43;~m3~0 := main_#t~nondet44;havoc main_#t~nondet44;~max3~0 := main_#t~nondet45;havoc main_#t~nondet45;~mode3~0 := main_#t~nondet46;havoc main_#t~nondet46;~newmax3~0 := main_#t~nondet47;havoc main_#t~nondet47;~id4~0 := main_#t~nondet48;havoc main_#t~nondet48;~r4~0 := main_#t~nondet49;havoc main_#t~nondet49;~st4~0 := main_#t~nondet50;havoc main_#t~nondet50;~nl4~0 := main_#t~nondet51;havoc main_#t~nondet51;~m4~0 := main_#t~nondet52;havoc main_#t~nondet52;~max4~0 := main_#t~nondet53;havoc main_#t~nondet53;~mode4~0 := main_#t~nondet54;havoc main_#t~nondet54;~newmax4~0 := main_#t~nondet55;havoc main_#t~nondet55;assume { :begin_inline_init } true;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r141~0, init_~r211~0, init_~r231~0, init_~r241~0, init_~r311~0, init_~r321~0, init_~r341~0, init_~r411~0, init_~r421~0, init_~r431~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r142~0, init_~tmp___1~0, init_~r212~0, init_~tmp___2~0, init_~r232~0, init_~tmp___3~0, init_~r242~0, init_~tmp___4~0, init_~r312~0, init_~tmp___5~0, init_~r322~0, init_~tmp___6~0, init_~r342~0, init_~tmp___7~0, init_~r412~0, init_~tmp___8~0, init_~r422~0, init_~tmp___9~0, init_~r432~0, init_~tmp___10~0, init_~r123~0, init_~tmp___11~0, init_~r133~0, init_~tmp___12~0, init_~r143~0, init_~tmp___13~0, init_~r213~0, init_~tmp___14~0, init_~r233~0, init_~tmp___15~0, init_~r243~0, init_~tmp___16~0, init_~r313~0, init_~tmp___17~0, init_~r323~0, init_~tmp___18~0, init_~r343~0, init_~tmp___19~0, init_~r413~0, init_~tmp___20~0, init_~r423~0, init_~tmp___21~0, init_~r433~0, init_~tmp___22~0, init_~tmp___23~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r141~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r241~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r341~0;havoc init_~r411~0;havoc init_~r421~0;havoc init_~r431~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r142~0;havoc init_~tmp___1~0;havoc init_~r212~0;havoc init_~tmp___2~0;havoc init_~r232~0;havoc init_~tmp___3~0;havoc init_~r242~0;havoc init_~tmp___4~0;havoc init_~r312~0;havoc init_~tmp___5~0;havoc init_~r322~0;havoc init_~tmp___6~0;havoc init_~r342~0;havoc init_~tmp___7~0;havoc init_~r412~0;havoc init_~tmp___8~0;havoc init_~r422~0;havoc init_~tmp___9~0;havoc init_~r432~0;havoc init_~tmp___10~0;havoc init_~r123~0;havoc init_~tmp___11~0;havoc init_~r133~0;havoc init_~tmp___12~0;havoc init_~r143~0;havoc init_~tmp___13~0;havoc init_~r213~0;havoc init_~tmp___14~0;havoc init_~r233~0;havoc init_~tmp___15~0;havoc init_~r243~0;havoc init_~tmp___16~0;havoc init_~r313~0;havoc init_~tmp___17~0;havoc init_~r323~0;havoc init_~tmp___18~0;havoc init_~r343~0;havoc init_~tmp___19~0;havoc init_~r413~0;havoc init_~tmp___20~0;havoc init_~r423~0;havoc init_~tmp___21~0;havoc init_~r433~0;havoc init_~tmp___22~0;havoc init_~tmp___23~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r141~0 := ~ep14~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r241~0 := ~ep24~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0;init_~r341~0 := ~ep34~0;init_~r411~0 := ~ep41~0;init_~r421~0 := ~ep42~0;init_~r431~0 := ~ep43~0; 127#L484true assume init_~r121~0 % 256 != 0;init_~tmp~0 := 1; 140#L495true init_~r122~0 := (if init_~tmp~0 == 0 then 0 else 1); 20#L505true assume init_~r131~0 % 256 != 0;init_~tmp___0~0 := 1; 18#L516true init_~r132~0 := (if init_~tmp___0~0 == 0 then 0 else 1); 248#L526true assume init_~r141~0 % 256 != 0;init_~tmp___1~0 := 1; 247#L537true init_~r142~0 := (if init_~tmp___1~0 == 0 then 0 else 1); 309#L547true assume init_~r211~0 % 256 != 0;init_~tmp___2~0 := 1; 308#L558true init_~r212~0 := (if init_~tmp___2~0 == 0 then 0 else 1); 213#L568true assume init_~r231~0 % 256 != 0;init_~tmp___3~0 := 1; 212#L579true init_~r232~0 := (if init_~tmp___3~0 == 0 then 0 else 1); 106#L589true assume init_~r241~0 % 256 != 0;init_~tmp___4~0 := 1; 105#L600true init_~r242~0 := (if init_~tmp___4~0 == 0 then 0 else 1); 7#L610true assume init_~r311~0 % 256 != 0;init_~tmp___5~0 := 1; 5#L621true init_~r312~0 := (if init_~tmp___5~0 == 0 then 0 else 1); 67#L631true assume init_~r321~0 % 256 != 0;init_~tmp___6~0 := 1; 66#L642true init_~r322~0 := (if init_~tmp___6~0 == 0 then 0 else 1); 295#L652true assume init_~r341~0 % 256 != 0;init_~tmp___7~0 := 1; 293#L663true init_~r342~0 := (if init_~tmp___7~0 == 0 then 0 else 1); 192#L673true assume init_~r411~0 % 256 != 0;init_~tmp___8~0 := 1; 190#L684true init_~r412~0 := (if init_~tmp___8~0 == 0 then 0 else 1); 85#L694true assume init_~r421~0 % 256 != 0;init_~tmp___9~0 := 1; 84#L705true init_~r422~0 := (if init_~tmp___9~0 == 0 then 0 else 1); 147#L715true assume init_~r431~0 % 256 != 0;init_~tmp___10~0 := 1; 146#L726true init_~r432~0 := (if init_~tmp___10~0 == 0 then 0 else 1); 47#L736true assume init_~r122~0 % 256 != 0;init_~tmp___11~0 := 1; 46#L747true init_~r123~0 := (if init_~tmp___11~0 == 0 then 0 else 1); 275#L757true assume init_~r132~0 % 256 != 0;init_~tmp___12~0 := 1; 274#L768true init_~r133~0 := (if init_~tmp___12~0 == 0 then 0 else 1); 179#L778true assume init_~r142~0 % 256 != 0;init_~tmp___13~0 := 1; 178#L789true init_~r143~0 := (if init_~tmp___13~0 == 0 then 0 else 1); 238#L799true assume init_~r212~0 % 256 != 0;init_~tmp___14~0 := 1; 237#L810true init_~r213~0 := (if init_~tmp___14~0 == 0 then 0 else 1); 119#L820true assume init_~r232~0 % 256 != 0;init_~tmp___15~0 := 1; 135#L831true init_~r233~0 := (if init_~tmp___15~0 == 0 then 0 else 1); 14#L841true assume init_~r242~0 % 256 != 0;init_~tmp___16~0 := 1; 13#L852true init_~r243~0 := (if init_~tmp___16~0 == 0 then 0 else 1); 72#L862true assume init_~r312~0 % 256 != 0;init_~tmp___17~0 := 1; 70#L873true init_~r313~0 := (if init_~tmp___17~0 == 0 then 0 else 1); 299#L883true assume init_~r322~0 % 256 != 0;init_~tmp___18~0 := 1; 298#L894true init_~r323~0 := (if init_~tmp___18~0 == 0 then 0 else 1); 196#L904true assume init_~r342~0 % 256 != 0;init_~tmp___19~0 := 1; 195#L915true init_~r343~0 := (if init_~tmp___19~0 == 0 then 0 else 1); 93#L925true assume init_~r412~0 % 256 != 0;init_~tmp___20~0 := 1; 92#L936true init_~r413~0 := (if init_~tmp___20~0 == 0 then 0 else 1); 160#L946true assume init_~r422~0 % 256 != 0;init_~tmp___21~0 := 1; 158#L957true init_~r423~0 := (if init_~tmp___21~0 == 0 then 0 else 1); 59#L967true assume init_~r432~0 % 256 != 0;init_~tmp___22~0 := 1; 57#L978true init_~r433~0 := (if init_~tmp___22~0 == 0 then 0 else 1); 286#L988true assume !(~id1~0 != ~id2~0);init_~tmp___23~0 := 0; 288#L988-1true init_#res := init_~tmp___23~0; 88#L1173true main_#t~ret56 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret56;havoc main_#t~ret56;assume main_~i2~0 != 0;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0 := 0; 49#L1314-3true [2018-11-09 22:22:51,498 INFO L795 eck$LassoCheckResult]: Loop: 49#L1314-3true assume true; 43#L1314-1true assume !!(main_~i2~0 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_#t~ite1, node1_#t~ite2, node1_~newmax~0;havoc node1_~newmax~0;node1_~newmax~0 := 0; 313#L156true assume !(~mode1~0 % 256 != 0); 156#L192true assume !(~r1~0 < 3); 151#L192-1true ~mode1~0 := 1; 307#L156-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite3, node2_#t~ite4, node2_#t~ite5, node2_~newmax~1;havoc node2_~newmax~1;node2_~newmax~1 := 0; 110#L220true assume !(~mode2~0 % 256 != 0); 278#L256true assume !(~r2~0 < 3); 277#L256-1true ~mode2~0 := 1; 103#L220-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6, node3_#t~ite7, node3_#t~ite8, node3_~newmax~2;havoc node3_~newmax~2;node3_~newmax~2 := 0; 68#L284true assume !(~mode3~0 % 256 != 0); 236#L320true assume !(~r3~0 < 3); 239#L320-1true ~mode3~0 := 1; 63#L284-2true assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9, node4_#t~ite10, node4_#t~ite11, node4_~newmax~3;havoc node4_~newmax~3;node4_~newmax~3 := 0; 203#L348true assume !(~mode4~0 % 256 != 0); 28#L384true assume !(~r4~0 < 3); 32#L384-1true ~mode4~0 := 1; 210#L348-2true assume { :end_inline_node4 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 257#L1181true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1 := 0; 259#L1181-1true check_#res := check_~tmp~1; 122#L1233true main_#t~ret57 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret57;havoc main_#t~ret57;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; 265#L1357true assume !(assert_~arg % 256 == 0); 77#L1352true assume { :end_inline_assert } true;main_#t~post58 := main_~i2~0;main_~i2~0 := main_#t~post58 + 1;havoc main_#t~post58; 49#L1314-3true [2018-11-09 22:22:51,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:22:51,504 INFO L82 PathProgramCache]: Analyzing trace with hash 15555676, now seen corresponding path program 1 times [2018-11-09 22:22:51,505 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:22:51,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:22:51,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:22:51,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:22:51,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:22:51,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:22:51,730 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-09 22:22:51,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:22:51,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:22:51,736 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-09 22:22:51,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:22:51,737 INFO L82 PathProgramCache]: Analyzing trace with hash -748401664, now seen corresponding path program 1 times [2018-11-09 22:22:51,737 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:22:51,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:22:51,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:22:51,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:22:51,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:22:51,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:22:51,796 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-09 22:22:51,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:22:51,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-09 22:22:51,798 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-09 22:22:51,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-09 22:22:51,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-09 22:22:51,808 INFO L87 Difference]: Start difference. First operand 322 states. Second operand 5 states. [2018-11-09 22:22:51,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:22:51,909 INFO L93 Difference]: Finished difference Result 326 states and 580 transitions. [2018-11-09 22:22:51,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-09 22:22:51,912 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 326 states and 580 transitions. [2018-11-09 22:22:51,916 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 123 [2018-11-09 22:22:51,922 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 326 states to 317 states and 563 transitions. [2018-11-09 22:22:51,924 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 317 [2018-11-09 22:22:51,924 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 317 [2018-11-09 22:22:51,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 317 states and 563 transitions. [2018-11-09 22:22:51,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-09 22:22:51,927 INFO L705 BuchiCegarLoop]: Abstraction has 317 states and 563 transitions. [2018-11-09 22:22:51,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states and 563 transitions. [2018-11-09 22:22:51,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2018-11-09 22:22:51,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-11-09 22:22:51,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 563 transitions. [2018-11-09 22:22:51,963 INFO L728 BuchiCegarLoop]: Abstraction has 317 states and 563 transitions. [2018-11-09 22:22:51,963 INFO L608 BuchiCegarLoop]: Abstraction has 317 states and 563 transitions. [2018-11-09 22:22:51,963 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-09 22:22:51,963 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 317 states and 563 transitions. [2018-11-09 22:22:51,965 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 123 [2018-11-09 22:22:51,965 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 22:22:51,965 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 22:22:51,967 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:22:51,967 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:22:51,967 INFO L793 eck$LassoCheckResult]: Stem: 873#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~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;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~newmax4~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p13~0 := 0;~p14~0 := 0;~p21~0 := 0;~p23~0 := 0;~p24~0 := 0;~p31~0 := 0;~p32~0 := 0;~p34~0 := 0;~p41~0 := 0;~p42~0 := 0;~p43~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset]; 686#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~ret56, main_#t~ret57, main_#t~post58, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet12;havoc main_#t~nondet12;~ep13~0 := main_#t~nondet13;havoc main_#t~nondet13;~ep14~0 := main_#t~nondet14;havoc main_#t~nondet14;~ep21~0 := main_#t~nondet15;havoc main_#t~nondet15;~ep23~0 := main_#t~nondet16;havoc main_#t~nondet16;~ep24~0 := main_#t~nondet17;havoc main_#t~nondet17;~ep31~0 := main_#t~nondet18;havoc main_#t~nondet18;~ep32~0 := main_#t~nondet19;havoc main_#t~nondet19;~ep34~0 := main_#t~nondet20;havoc main_#t~nondet20;~ep41~0 := main_#t~nondet21;havoc main_#t~nondet21;~ep42~0 := main_#t~nondet22;havoc main_#t~nondet22;~ep43~0 := main_#t~nondet23;havoc main_#t~nondet23;~id1~0 := main_#t~nondet24;havoc main_#t~nondet24;~r1~0 := main_#t~nondet25;havoc main_#t~nondet25;~st1~0 := main_#t~nondet26;havoc main_#t~nondet26;~nl1~0 := main_#t~nondet27;havoc main_#t~nondet27;~m1~0 := main_#t~nondet28;havoc main_#t~nondet28;~max1~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode1~0 := main_#t~nondet30;havoc main_#t~nondet30;~newmax1~0 := main_#t~nondet31;havoc main_#t~nondet31;~id2~0 := main_#t~nondet32;havoc main_#t~nondet32;~r2~0 := main_#t~nondet33;havoc main_#t~nondet33;~st2~0 := main_#t~nondet34;havoc main_#t~nondet34;~nl2~0 := main_#t~nondet35;havoc main_#t~nondet35;~m2~0 := main_#t~nondet36;havoc main_#t~nondet36;~max2~0 := main_#t~nondet37;havoc main_#t~nondet37;~mode2~0 := main_#t~nondet38;havoc main_#t~nondet38;~newmax2~0 := main_#t~nondet39;havoc main_#t~nondet39;~id3~0 := main_#t~nondet40;havoc main_#t~nondet40;~r3~0 := main_#t~nondet41;havoc main_#t~nondet41;~st3~0 := main_#t~nondet42;havoc main_#t~nondet42;~nl3~0 := main_#t~nondet43;havoc main_#t~nondet43;~m3~0 := main_#t~nondet44;havoc main_#t~nondet44;~max3~0 := main_#t~nondet45;havoc main_#t~nondet45;~mode3~0 := main_#t~nondet46;havoc main_#t~nondet46;~newmax3~0 := main_#t~nondet47;havoc main_#t~nondet47;~id4~0 := main_#t~nondet48;havoc main_#t~nondet48;~r4~0 := main_#t~nondet49;havoc main_#t~nondet49;~st4~0 := main_#t~nondet50;havoc main_#t~nondet50;~nl4~0 := main_#t~nondet51;havoc main_#t~nondet51;~m4~0 := main_#t~nondet52;havoc main_#t~nondet52;~max4~0 := main_#t~nondet53;havoc main_#t~nondet53;~mode4~0 := main_#t~nondet54;havoc main_#t~nondet54;~newmax4~0 := main_#t~nondet55;havoc main_#t~nondet55;assume { :begin_inline_init } true;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r141~0, init_~r211~0, init_~r231~0, init_~r241~0, init_~r311~0, init_~r321~0, init_~r341~0, init_~r411~0, init_~r421~0, init_~r431~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r142~0, init_~tmp___1~0, init_~r212~0, init_~tmp___2~0, init_~r232~0, init_~tmp___3~0, init_~r242~0, init_~tmp___4~0, init_~r312~0, init_~tmp___5~0, init_~r322~0, init_~tmp___6~0, init_~r342~0, init_~tmp___7~0, init_~r412~0, init_~tmp___8~0, init_~r422~0, init_~tmp___9~0, init_~r432~0, init_~tmp___10~0, init_~r123~0, init_~tmp___11~0, init_~r133~0, init_~tmp___12~0, init_~r143~0, init_~tmp___13~0, init_~r213~0, init_~tmp___14~0, init_~r233~0, init_~tmp___15~0, init_~r243~0, init_~tmp___16~0, init_~r313~0, init_~tmp___17~0, init_~r323~0, init_~tmp___18~0, init_~r343~0, init_~tmp___19~0, init_~r413~0, init_~tmp___20~0, init_~r423~0, init_~tmp___21~0, init_~r433~0, init_~tmp___22~0, init_~tmp___23~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r141~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r241~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r341~0;havoc init_~r411~0;havoc init_~r421~0;havoc init_~r431~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r142~0;havoc init_~tmp___1~0;havoc init_~r212~0;havoc init_~tmp___2~0;havoc init_~r232~0;havoc init_~tmp___3~0;havoc init_~r242~0;havoc init_~tmp___4~0;havoc init_~r312~0;havoc init_~tmp___5~0;havoc init_~r322~0;havoc init_~tmp___6~0;havoc init_~r342~0;havoc init_~tmp___7~0;havoc init_~r412~0;havoc init_~tmp___8~0;havoc init_~r422~0;havoc init_~tmp___9~0;havoc init_~r432~0;havoc init_~tmp___10~0;havoc init_~r123~0;havoc init_~tmp___11~0;havoc init_~r133~0;havoc init_~tmp___12~0;havoc init_~r143~0;havoc init_~tmp___13~0;havoc init_~r213~0;havoc init_~tmp___14~0;havoc init_~r233~0;havoc init_~tmp___15~0;havoc init_~r243~0;havoc init_~tmp___16~0;havoc init_~r313~0;havoc init_~tmp___17~0;havoc init_~r323~0;havoc init_~tmp___18~0;havoc init_~r343~0;havoc init_~tmp___19~0;havoc init_~r413~0;havoc init_~tmp___20~0;havoc init_~r423~0;havoc init_~tmp___21~0;havoc init_~r433~0;havoc init_~tmp___22~0;havoc init_~tmp___23~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r141~0 := ~ep14~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r241~0 := ~ep24~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0;init_~r341~0 := ~ep34~0;init_~r411~0 := ~ep41~0;init_~r421~0 := ~ep42~0;init_~r431~0 := ~ep43~0; 687#L484 assume init_~r121~0 % 256 != 0;init_~tmp~0 := 1; 712#L495 init_~r122~0 := (if init_~tmp~0 == 0 then 0 else 1); 706#L505 assume init_~r131~0 % 256 != 0;init_~tmp___0~0 := 1; 702#L516 init_~r132~0 := (if init_~tmp___0~0 == 0 then 0 else 1); 703#L526 assume init_~r141~0 % 256 != 0;init_~tmp___1~0 := 1; 741#L537 init_~r142~0 := (if init_~tmp___1~0 == 0 then 0 else 1); 970#L547 assume init_~r211~0 % 256 != 0;init_~tmp___2~0 := 1; 955#L558 init_~r212~0 := (if init_~tmp___2~0 == 0 then 0 else 1); 953#L568 assume init_~r231~0 % 256 != 0;init_~tmp___3~0 := 1; 853#L579 init_~r232~0 := (if init_~tmp___3~0 == 0 then 0 else 1); 851#L589 assume init_~r241~0 % 256 != 0;init_~tmp___4~0 := 1; 678#L600 init_~r242~0 := (if init_~tmp___4~0 == 0 then 0 else 1); 675#L610 assume init_~r311~0 % 256 != 0;init_~tmp___5~0 := 1; 673#L621 init_~r312~0 := (if init_~tmp___5~0 == 0 then 0 else 1); 674#L631 assume init_~r321~0 % 256 != 0;init_~tmp___6~0 := 1; 669#L642 init_~r322~0 := (if init_~tmp___6~0 == 0 then 0 else 1); 790#L652 assume init_~r341~0 % 256 != 0;init_~tmp___7~0 := 1; 789#L663 init_~r342~0 := (if init_~tmp___7~0 == 0 then 0 else 1); 943#L673 assume init_~r411~0 % 256 != 0;init_~tmp___8~0 := 1; 823#L684 init_~r412~0 := (if init_~tmp___8~0 == 0 then 0 else 1); 821#L694 assume init_~r421~0 % 256 != 0;init_~tmp___9~0 := 1; 698#L705 init_~r422~0 := (if init_~tmp___9~0 == 0 then 0 else 1); 819#L715 assume init_~r431~0 % 256 != 0;init_~tmp___10~0 := 1; 761#L726 init_~r432~0 := (if init_~tmp___10~0 == 0 then 0 else 1); 757#L736 assume init_~r122~0 % 256 != 0;init_~tmp___11~0 := 1; 755#L747 init_~r123~0 := (if init_~tmp___11~0 == 0 then 0 else 1); 756#L757 assume init_~r132~0 % 256 != 0;init_~tmp___12~0 := 1; 754#L768 init_~r133~0 := (if init_~tmp___12~0 == 0 then 0 else 1); 927#L778 assume init_~r142~0 % 256 != 0;init_~tmp___13~0 := 1; 814#L789 init_~r143~0 := (if init_~tmp___13~0 == 0 then 0 else 1); 926#L799 assume init_~r212~0 % 256 != 0;init_~tmp___14~0 := 1; 871#L810 init_~r213~0 := (if init_~tmp___14~0 == 0 then 0 else 1); 869#L820 assume init_~r232~0 % 256 != 0;init_~tmp___15~0 := 1; 694#L831 init_~r233~0 := (if init_~tmp___15~0 == 0 then 0 else 1); 690#L841 assume init_~r242~0 % 256 != 0;init_~tmp___16~0 := 1; 688#L852 init_~r243~0 := (if init_~tmp___16~0 == 0 then 0 else 1); 689#L862 assume init_~r312~0 % 256 != 0;init_~tmp___17~0 := 1; 730#L873 init_~r313~0 := (if init_~tmp___17~0 == 0 then 0 else 1); 799#L883 assume init_~r322~0 % 256 != 0;init_~tmp___18~0 := 1; 949#L894 init_~r323~0 := (if init_~tmp___18~0 == 0 then 0 else 1); 946#L904 assume init_~r342~0 % 256 != 0;init_~tmp___19~0 := 1; 834#L915 init_~r343~0 := (if init_~tmp___19~0 == 0 then 0 else 1); 831#L925 assume init_~r412~0 % 256 != 0;init_~tmp___20~0 := 1; 716#L936 init_~r413~0 := (if init_~tmp___20~0 == 0 then 0 else 1); 830#L946 assume init_~r422~0 % 256 != 0;init_~tmp___21~0 := 1; 783#L957 init_~r423~0 := (if init_~tmp___21~0 == 0 then 0 else 1); 780#L967 assume init_~r432~0 % 256 != 0;init_~tmp___22~0 := 1; 775#L978 init_~r433~0 := (if init_~tmp___22~0 == 0 then 0 else 1); 776#L988 assume !(~id1~0 != ~id2~0);init_~tmp___23~0 := 0; 684#L988-1 init_#res := init_~tmp___23~0; 824#L1173 main_#t~ret56 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret56;havoc main_#t~ret56;assume main_~i2~0 != 0;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0 := 0; 762#L1314-3 [2018-11-09 22:22:51,968 INFO L795 eck$LassoCheckResult]: Loop: 762#L1314-3 assume true; 750#L1314-1 assume !!(main_~i2~0 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_#t~ite1, node1_#t~ite2, node1_~newmax~0;havoc node1_~newmax~0;node1_~newmax~0 := 0; 751#L156 assume !(~mode1~0 % 256 != 0); 904#L192 assume !(~r1~0 < 3); 839#L192-1 ~mode1~0 := 1; 902#L156-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite3, node2_#t~ite4, node2_#t~ite5, node2_~newmax~1;havoc node2_~newmax~1;node2_~newmax~1 := 0; 855#L220 assume !(~mode2~0 % 256 != 0); 857#L256 assume !(~r2~0 < 3); 779#L256-1 ~mode2~0 := 1; 849#L220-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6, node3_#t~ite7, node3_#t~ite8, node3_~newmax~2;havoc node3_~newmax~2;node3_~newmax~2 := 0; 791#L284 assume !(~mode3~0 % 256 != 0); 793#L320 assume !(~r3~0 < 3); 920#L320-1 ~mode3~0 := 1; 785#L284-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9, node4_#t~ite10, node4_#t~ite11, node4_~newmax~3;havoc node4_~newmax~3;node4_~newmax~3 := 0; 786#L348 assume !(~mode4~0 % 256 != 0); 724#L384 assume !(~r4~0 < 3); 725#L384-1 ~mode4~0 := 1; 731#L348-2 assume { :end_inline_node4 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 952#L1181 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 734#L1182 assume ~st1~0 + ~nl1~0 <= 1; 735#L1183 assume ~st2~0 + ~nl2~0 <= 1; 825#L1184 assume ~st3~0 + ~nl3~0 <= 1; 826#L1185 assume ~st4~0 + ~nl4~0 <= 1; 942#L1186 assume ~r1~0 >= 3; 877#L1190 assume ~r1~0 < 3; 820#L1195 assume ~r1~0 >= 3; 696#L1200 assume ~r1~0 < 3;check_~tmp~1 := 1; 733#L1181-1 check_#res := check_~tmp~1; 874#L1233 main_#t~ret57 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret57;havoc main_#t~ret57;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; 875#L1357 assume !(assert_~arg % 256 == 0); 808#L1352 assume { :end_inline_assert } true;main_#t~post58 := main_~i2~0;main_~i2~0 := main_#t~post58 + 1;havoc main_#t~post58; 762#L1314-3 [2018-11-09 22:22:51,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:22:51,968 INFO L82 PathProgramCache]: Analyzing trace with hash 15555676, now seen corresponding path program 2 times [2018-11-09 22:22:51,968 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:22:51,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:22:51,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:22:51,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:22:51,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:22:51,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:22:52,050 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-09 22:22:52,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:22:52,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:22:52,051 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-09 22:22:52,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:22:52,052 INFO L82 PathProgramCache]: Analyzing trace with hash 323529167, now seen corresponding path program 1 times [2018-11-09 22:22:52,053 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:22:52,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:22:52,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:22:52,054 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 22:22:52,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:22:52,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:22:52,086 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-09 22:22:52,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:22:52,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:22:52,087 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-09 22:22:52,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-09 22:22:52,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-09 22:22:52,088 INFO L87 Difference]: Start difference. First operand 317 states and 563 transitions. cyclomatic complexity: 247 Second operand 3 states. [2018-11-09 22:22:52,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:22:52,161 INFO L93 Difference]: Finished difference Result 414 states and 718 transitions. [2018-11-09 22:22:52,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-09 22:22:52,162 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 414 states and 718 transitions. [2018-11-09 22:22:52,164 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 220 [2018-11-09 22:22:52,167 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 414 states to 414 states and 718 transitions. [2018-11-09 22:22:52,167 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 414 [2018-11-09 22:22:52,168 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 414 [2018-11-09 22:22:52,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 414 states and 718 transitions. [2018-11-09 22:22:52,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-09 22:22:52,170 INFO L705 BuchiCegarLoop]: Abstraction has 414 states and 718 transitions. [2018-11-09 22:22:52,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states and 718 transitions. [2018-11-09 22:22:52,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 414. [2018-11-09 22:22:52,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2018-11-09 22:22:52,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 718 transitions. [2018-11-09 22:22:52,183 INFO L728 BuchiCegarLoop]: Abstraction has 414 states and 718 transitions. [2018-11-09 22:22:52,183 INFO L608 BuchiCegarLoop]: Abstraction has 414 states and 718 transitions. [2018-11-09 22:22:52,183 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-09 22:22:52,184 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 414 states and 718 transitions. [2018-11-09 22:22:52,185 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 220 [2018-11-09 22:22:52,186 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 22:22:52,189 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 22:22:52,190 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:22:52,190 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:22:52,191 INFO L793 eck$LassoCheckResult]: Stem: 1616#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~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;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~newmax4~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p13~0 := 0;~p14~0 := 0;~p21~0 := 0;~p23~0 := 0;~p24~0 := 0;~p31~0 := 0;~p32~0 := 0;~p34~0 := 0;~p41~0 := 0;~p42~0 := 0;~p43~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset]; 1427#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~ret56, main_#t~ret57, main_#t~post58, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet12;havoc main_#t~nondet12;~ep13~0 := main_#t~nondet13;havoc main_#t~nondet13;~ep14~0 := main_#t~nondet14;havoc main_#t~nondet14;~ep21~0 := main_#t~nondet15;havoc main_#t~nondet15;~ep23~0 := main_#t~nondet16;havoc main_#t~nondet16;~ep24~0 := main_#t~nondet17;havoc main_#t~nondet17;~ep31~0 := main_#t~nondet18;havoc main_#t~nondet18;~ep32~0 := main_#t~nondet19;havoc main_#t~nondet19;~ep34~0 := main_#t~nondet20;havoc main_#t~nondet20;~ep41~0 := main_#t~nondet21;havoc main_#t~nondet21;~ep42~0 := main_#t~nondet22;havoc main_#t~nondet22;~ep43~0 := main_#t~nondet23;havoc main_#t~nondet23;~id1~0 := main_#t~nondet24;havoc main_#t~nondet24;~r1~0 := main_#t~nondet25;havoc main_#t~nondet25;~st1~0 := main_#t~nondet26;havoc main_#t~nondet26;~nl1~0 := main_#t~nondet27;havoc main_#t~nondet27;~m1~0 := main_#t~nondet28;havoc main_#t~nondet28;~max1~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode1~0 := main_#t~nondet30;havoc main_#t~nondet30;~newmax1~0 := main_#t~nondet31;havoc main_#t~nondet31;~id2~0 := main_#t~nondet32;havoc main_#t~nondet32;~r2~0 := main_#t~nondet33;havoc main_#t~nondet33;~st2~0 := main_#t~nondet34;havoc main_#t~nondet34;~nl2~0 := main_#t~nondet35;havoc main_#t~nondet35;~m2~0 := main_#t~nondet36;havoc main_#t~nondet36;~max2~0 := main_#t~nondet37;havoc main_#t~nondet37;~mode2~0 := main_#t~nondet38;havoc main_#t~nondet38;~newmax2~0 := main_#t~nondet39;havoc main_#t~nondet39;~id3~0 := main_#t~nondet40;havoc main_#t~nondet40;~r3~0 := main_#t~nondet41;havoc main_#t~nondet41;~st3~0 := main_#t~nondet42;havoc main_#t~nondet42;~nl3~0 := main_#t~nondet43;havoc main_#t~nondet43;~m3~0 := main_#t~nondet44;havoc main_#t~nondet44;~max3~0 := main_#t~nondet45;havoc main_#t~nondet45;~mode3~0 := main_#t~nondet46;havoc main_#t~nondet46;~newmax3~0 := main_#t~nondet47;havoc main_#t~nondet47;~id4~0 := main_#t~nondet48;havoc main_#t~nondet48;~r4~0 := main_#t~nondet49;havoc main_#t~nondet49;~st4~0 := main_#t~nondet50;havoc main_#t~nondet50;~nl4~0 := main_#t~nondet51;havoc main_#t~nondet51;~m4~0 := main_#t~nondet52;havoc main_#t~nondet52;~max4~0 := main_#t~nondet53;havoc main_#t~nondet53;~mode4~0 := main_#t~nondet54;havoc main_#t~nondet54;~newmax4~0 := main_#t~nondet55;havoc main_#t~nondet55;assume { :begin_inline_init } true;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r141~0, init_~r211~0, init_~r231~0, init_~r241~0, init_~r311~0, init_~r321~0, init_~r341~0, init_~r411~0, init_~r421~0, init_~r431~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r142~0, init_~tmp___1~0, init_~r212~0, init_~tmp___2~0, init_~r232~0, init_~tmp___3~0, init_~r242~0, init_~tmp___4~0, init_~r312~0, init_~tmp___5~0, init_~r322~0, init_~tmp___6~0, init_~r342~0, init_~tmp___7~0, init_~r412~0, init_~tmp___8~0, init_~r422~0, init_~tmp___9~0, init_~r432~0, init_~tmp___10~0, init_~r123~0, init_~tmp___11~0, init_~r133~0, init_~tmp___12~0, init_~r143~0, init_~tmp___13~0, init_~r213~0, init_~tmp___14~0, init_~r233~0, init_~tmp___15~0, init_~r243~0, init_~tmp___16~0, init_~r313~0, init_~tmp___17~0, init_~r323~0, init_~tmp___18~0, init_~r343~0, init_~tmp___19~0, init_~r413~0, init_~tmp___20~0, init_~r423~0, init_~tmp___21~0, init_~r433~0, init_~tmp___22~0, init_~tmp___23~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r141~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r241~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r341~0;havoc init_~r411~0;havoc init_~r421~0;havoc init_~r431~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r142~0;havoc init_~tmp___1~0;havoc init_~r212~0;havoc init_~tmp___2~0;havoc init_~r232~0;havoc init_~tmp___3~0;havoc init_~r242~0;havoc init_~tmp___4~0;havoc init_~r312~0;havoc init_~tmp___5~0;havoc init_~r322~0;havoc init_~tmp___6~0;havoc init_~r342~0;havoc init_~tmp___7~0;havoc init_~r412~0;havoc init_~tmp___8~0;havoc init_~r422~0;havoc init_~tmp___9~0;havoc init_~r432~0;havoc init_~tmp___10~0;havoc init_~r123~0;havoc init_~tmp___11~0;havoc init_~r133~0;havoc init_~tmp___12~0;havoc init_~r143~0;havoc init_~tmp___13~0;havoc init_~r213~0;havoc init_~tmp___14~0;havoc init_~r233~0;havoc init_~tmp___15~0;havoc init_~r243~0;havoc init_~tmp___16~0;havoc init_~r313~0;havoc init_~tmp___17~0;havoc init_~r323~0;havoc init_~tmp___18~0;havoc init_~r343~0;havoc init_~tmp___19~0;havoc init_~r413~0;havoc init_~tmp___20~0;havoc init_~r423~0;havoc init_~tmp___21~0;havoc init_~r433~0;havoc init_~tmp___22~0;havoc init_~tmp___23~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r141~0 := ~ep14~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r241~0 := ~ep24~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0;init_~r341~0 := ~ep34~0;init_~r411~0 := ~ep41~0;init_~r421~0 := ~ep42~0;init_~r431~0 := ~ep43~0; 1428#L484 assume init_~r121~0 % 256 != 0;init_~tmp~0 := 1; 1451#L495 init_~r122~0 := (if init_~tmp~0 == 0 then 0 else 1); 1445#L505 assume init_~r131~0 % 256 != 0;init_~tmp___0~0 := 1; 1441#L516 init_~r132~0 := (if init_~tmp___0~0 == 0 then 0 else 1); 1442#L526 assume init_~r141~0 % 256 != 0;init_~tmp___1~0 := 1; 1480#L537 init_~r142~0 := (if init_~tmp___1~0 == 0 then 0 else 1); 1720#L547 assume init_~r211~0 % 256 != 0;init_~tmp___2~0 := 1; 1704#L558 init_~r212~0 := (if init_~tmp___2~0 == 0 then 0 else 1); 1701#L568 assume init_~r231~0 % 256 != 0;init_~tmp___3~0 := 1; 1596#L579 init_~r232~0 := (if init_~tmp___3~0 == 0 then 0 else 1); 1594#L589 assume init_~r241~0 % 256 != 0;init_~tmp___4~0 := 1; 1417#L600 init_~r242~0 := (if init_~tmp___4~0 == 0 then 0 else 1); 1414#L610 assume init_~r311~0 % 256 != 0;init_~tmp___5~0 := 1; 1409#L621 init_~r312~0 := (if init_~tmp___5~0 == 0 then 0 else 1); 1410#L631 assume init_~r321~0 % 256 != 0;init_~tmp___6~0 := 1; 1408#L642 init_~r322~0 := (if init_~tmp___6~0 == 0 then 0 else 1); 1530#L652 assume init_~r341~0 % 256 != 0;init_~tmp___7~0 := 1; 1528#L663 init_~r342~0 := (if init_~tmp___7~0 == 0 then 0 else 1); 1687#L673 assume init_~r411~0 % 256 != 0;init_~tmp___8~0 := 1; 1564#L684 init_~r412~0 := (if init_~tmp___8~0 == 0 then 0 else 1); 1560#L694 assume init_~r421~0 % 256 != 0;init_~tmp___9~0 := 1; 1435#L705 init_~r422~0 := (if init_~tmp___9~0 == 0 then 0 else 1); 1559#L715 assume init_~r431~0 % 256 != 0;init_~tmp___10~0 := 1; 1500#L726 init_~r432~0 := (if init_~tmp___10~0 == 0 then 0 else 1); 1496#L736 assume init_~r122~0 % 256 != 0;init_~tmp___11~0 := 1; 1494#L747 init_~r123~0 := (if init_~tmp___11~0 == 0 then 0 else 1); 1495#L757 assume init_~r132~0 % 256 != 0;init_~tmp___12~0 := 1; 1492#L768 init_~r133~0 := (if init_~tmp___12~0 == 0 then 0 else 1); 1671#L778 assume init_~r142~0 % 256 != 0;init_~tmp___13~0 := 1; 1554#L789 init_~r143~0 := (if init_~tmp___13~0 == 0 then 0 else 1); 1670#L799 assume init_~r212~0 % 256 != 0;init_~tmp___14~0 := 1; 1614#L810 init_~r213~0 := (if init_~tmp___14~0 == 0 then 0 else 1); 1612#L820 assume init_~r232~0 % 256 != 0;init_~tmp___15~0 := 1; 1433#L831 init_~r233~0 := (if init_~tmp___15~0 == 0 then 0 else 1); 1429#L841 assume init_~r242~0 % 256 != 0;init_~tmp___16~0 := 1; 1425#L852 init_~r243~0 := (if init_~tmp___16~0 == 0 then 0 else 1); 1426#L862 assume init_~r312~0 % 256 != 0;init_~tmp___17~0 := 1; 1469#L873 init_~r313~0 := (if init_~tmp___17~0 == 0 then 0 else 1); 1537#L883 assume init_~r322~0 % 256 != 0;init_~tmp___18~0 := 1; 1692#L894 init_~r323~0 := (if init_~tmp___18~0 == 0 then 0 else 1); 1688#L904 assume init_~r342~0 % 256 != 0;init_~tmp___19~0 := 1; 1575#L915 init_~r343~0 := (if init_~tmp___19~0 == 0 then 0 else 1); 1573#L925 assume init_~r412~0 % 256 != 0;init_~tmp___20~0 := 1; 1455#L936 init_~r413~0 := (if init_~tmp___20~0 == 0 then 0 else 1); 1572#L946 assume init_~r422~0 % 256 != 0;init_~tmp___21~0 := 1; 1522#L957 init_~r423~0 := (if init_~tmp___21~0 == 0 then 0 else 1); 1516#L967 assume init_~r432~0 % 256 != 0;init_~tmp___22~0 := 1; 1512#L978 init_~r433~0 := (if init_~tmp___22~0 == 0 then 0 else 1); 1513#L988 assume !(~id1~0 != ~id2~0);init_~tmp___23~0 := 0; 1423#L988-1 init_#res := init_~tmp___23~0; 1565#L1173 main_#t~ret56 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret56;havoc main_#t~ret56;assume main_~i2~0 != 0;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0 := 0; 1566#L1314-3 [2018-11-09 22:22:52,191 INFO L795 eck$LassoCheckResult]: Loop: 1566#L1314-3 assume true; 1736#L1314-1 assume !!(main_~i2~0 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_#t~ite1, node1_#t~ite2, node1_~newmax~0;havoc node1_~newmax~0;node1_~newmax~0 := 0; 1735#L156 assume !(~mode1~0 % 256 != 0); 1734#L192 assume ~r1~0 < 3; 1577#L193 assume !(~ep12~0 % 256 != 0); 1569#L193-1 assume !(~ep13~0 % 256 != 0); 1570#L198 assume !(~ep14~0 % 256 != 0); 1581#L192-1 ~mode1~0 := 1; 1694#L156-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite3, node2_#t~ite4, node2_#t~ite5, node2_~newmax~1;havoc node2_~newmax~1;node2_~newmax~1 := 0; 1790#L220 assume !(~mode2~0 % 256 != 0); 1778#L256 assume !(~r2~0 < 3); 1777#L256-1 ~mode2~0 := 1; 1775#L220-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6, node3_#t~ite7, node3_#t~ite8, node3_~newmax~2;havoc node3_~newmax~2;node3_~newmax~2 := 0; 1773#L284 assume !(~mode3~0 % 256 != 0); 1772#L320 assume !(~r3~0 < 3); 1768#L320-1 ~mode3~0 := 1; 1766#L284-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite9, node4_#t~ite10, node4_#t~ite11, node4_~newmax~3;havoc node4_~newmax~3;node4_~newmax~3 := 0; 1761#L348 assume !(~mode4~0 % 256 != 0); 1756#L384 assume !(~r4~0 < 3); 1750#L384-1 ~mode4~0 := 1; 1748#L348-2 assume { :end_inline_node4 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 1747#L1181 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 1746#L1182 assume ~st1~0 + ~nl1~0 <= 1; 1745#L1183 assume ~st2~0 + ~nl2~0 <= 1; 1744#L1184 assume ~st3~0 + ~nl3~0 <= 1; 1743#L1185 assume ~st4~0 + ~nl4~0 <= 1; 1742#L1186 assume !(~r1~0 >= 3); 1619#L1189 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 == 0; 1620#L1190 assume ~r1~0 < 3; 1741#L1195 assume !(~r1~0 >= 3); 1437#L1199 assume ~nl1~0 + ~nl2~0 + ~nl3~0 + ~nl4~0 == 0; 1438#L1200 assume ~r1~0 < 3;check_~tmp~1 := 1; 1740#L1181-1 check_#res := check_~tmp~1; 1739#L1233 main_#t~ret57 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret57;havoc main_#t~ret57;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; 1738#L1357 assume !(assert_~arg % 256 == 0); 1737#L1352 assume { :end_inline_assert } true;main_#t~post58 := main_~i2~0;main_~i2~0 := main_#t~post58 + 1;havoc main_#t~post58; 1566#L1314-3 [2018-11-09 22:22:52,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:22:52,191 INFO L82 PathProgramCache]: Analyzing trace with hash 15555676, now seen corresponding path program 3 times [2018-11-09 22:22:52,191 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:22:52,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:22:52,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:22:52,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:22:52,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:22:52,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:22:52,266 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-09 22:22:52,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-09 22:22:52,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-09 22:22:52,266 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-09 22:22:52,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:22:52,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1433143412, now seen corresponding path program 1 times [2018-11-09 22:22:52,267 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:22:52,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:22:52,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:22:52,268 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-09 22:22:52,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:22:52,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:22:52,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:22:52,616 WARN L179 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 152 [2018-11-09 22:22:52,769 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 152 [2018-11-09 22:22:52,777 INFO L214 LassoAnalysis]: Preferences: [2018-11-09 22:22:52,778 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-09 22:22:52,778 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-09 22:22:52,779 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-09 22:22:52,779 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-09 22:22:52,779 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 22:22:52,779 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-09 22:22:52,779 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-09 22:22:52,779 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_opt-floodmax.4_false-unreach-call.2.ufo.BOUNDED-8.pals_true-termination.c_Iteration3_Loop [2018-11-09 22:22:52,779 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-09 22:22:52,780 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-09 22:22:52,798 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-09 22:22:52,803 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-09 22:22:52,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:22:52,807 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-09 22:22:52,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:22:52,809 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-09 22:22:52,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:22:52,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:22:52,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:22:52,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:22:52,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:22:52,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:22:52,824 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-09 22:22:52,826 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-09 22:22:52,827 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-09 22:22:52,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:22:52,829 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-09 22:22:52,834 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-09 22:22:52,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:22:52,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:22:52,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:22:52,838 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-09 22:22:52,840 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-09 22:22:52,841 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-09 22:22:52,846 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-09 22:22:52,848 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-09 22:22:52,850 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-09 22:22:52,851 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-09 22:22:52,859 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-09 22:22:52,861 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-09 22:22:52,863 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-09 22:22:52,864 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-09 22:22:52,891 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-09 22:22:52,892 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-09 22:22:52,893 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-09 22:22:52,894 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-09 22:22:52,897 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-09 22:22:52,898 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-09 22:22:52,899 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-09 22:22:52,900 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-09 22:22:52,901 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-09 22:22:53,306 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-09 22:22:53,307 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_603f22a8-8d2d-43e8-864a-044eeff1e101/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-09 22:22:53,319 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-09 22:22:53,319 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-09 22:22:53,324 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-09 22:22:53,324 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_node4_~newmax~3=0} Honda state: {ULTIMATE.start_node4_~newmax~3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_603f22a8-8d2d-43e8-864a-044eeff1e101/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-09 22:22:53,350 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-09 22:22:53,350 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_603f22a8-8d2d-43e8-864a-044eeff1e101/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-09 22:22:53,382 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-09 22:22:53,382 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-09 22:22:53,510 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-09 22:22:53,512 INFO L214 LassoAnalysis]: Preferences: [2018-11-09 22:22:53,512 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-09 22:22:53,512 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-09 22:22:53,512 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-09 22:22:53,512 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-09 22:22:53,512 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 22:22:53,512 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-09 22:22:53,512 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-09 22:22:53,512 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_opt-floodmax.4_false-unreach-call.2.ufo.BOUNDED-8.pals_true-termination.c_Iteration3_Loop [2018-11-09 22:22:53,512 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-09 22:22:53,512 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-09 22:22:53,516 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-09 22:22:53,527 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-09 22:22:53,530 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-09 22:22:53,534 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-09 22:22:53,535 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-09 22:22:53,538 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-09 22:22:53,540 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-09 22:22:53,541 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-09 22:22:53,543 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-09 22:22:53,546 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-09 22:22:53,547 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-09 22:22:53,548 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-09 22:22:53,549 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-09 22:22:53,553 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-09 22:22:53,554 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-09 22:22:53,555 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-09 22:22:53,556 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-09 22:22:53,586 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-09 22:22:53,588 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-09 22:22:53,590 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-09 22:22:53,592 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-09 22:22:53,597 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-09 22:22:53,599 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-09 22:22:53,605 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-09 22:22:53,626 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-09 22:22:53,629 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-09 22:22:53,631 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-09 22:22:53,637 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-09 22:22:53,642 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-09 22:22:53,643 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-09 22:22:53,649 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-09 22:22:53,651 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-09 22:22:53,652 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-09 22:22:53,653 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-09 22:22:53,658 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-09 22:22:53,659 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-09 22:22:53,661 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-09 22:22:53,664 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-09 22:22:53,669 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-09 22:22:53,671 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-09 22:22:53,673 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-09 22:22:54,107 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2018-11-09 22:22:54,162 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-09 22:22:54,167 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-09 22:22:54,168 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-09 22:22:54,169 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:22:54,169 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:22:54,169 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:22:54,170 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:22:54,170 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:22:54,172 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:22:54,172 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:22:54,176 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:22:54,176 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-09 22:22:54,177 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:22:54,177 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:22:54,177 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:22:54,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:22:54,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:22:54,179 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:22:54,180 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:22:54,182 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:22:54,182 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-09 22:22:54,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:22:54,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:22:54,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:22:54,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:22:54,184 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:22:54,184 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:22:54,186 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:22:54,186 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-09 22:22:54,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:22:54,187 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:22:54,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:22:54,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:22:54,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:22:54,187 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:22:54,188 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:22:54,188 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:22:54,189 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-09 22:22:54,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:22:54,193 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:22:54,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:22:54,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:22:54,193 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:22:54,194 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:22:54,194 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:22:54,194 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:22:54,195 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-09 22:22:54,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:22:54,195 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:22:54,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:22:54,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:22:54,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:22:54,196 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:22:54,196 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:22:54,196 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:22:54,197 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-09 22:22:54,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:22:54,199 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:22:54,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:22:54,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:22:54,199 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:22:54,200 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:22:54,200 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:22:54,201 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:22:54,201 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-09 22:22:54,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:22:54,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:22:54,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:22:54,201 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:22:54,202 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:22:54,203 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:22:54,204 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:22:54,205 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-09 22:22:54,208 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:22:54,208 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:22:54,208 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:22:54,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:22:54,208 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:22:54,209 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:22:54,209 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:22:54,210 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:22:54,211 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-09 22:22:54,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:22:54,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:22:54,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:22:54,212 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:22:54,212 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:22:54,213 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:22:54,215 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:22:54,215 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-09 22:22:54,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:22:54,215 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:22:54,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:22:54,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:22:54,216 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:22:54,216 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:22:54,216 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:22:54,217 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:22:54,217 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-09 22:22:54,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:22:54,217 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:22:54,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:22:54,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:22:54,218 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:22:54,218 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:22:54,218 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:22:54,219 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:22:54,219 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-09 22:22:54,219 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:22:54,219 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:22:54,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:22:54,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:22:54,220 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:22:54,220 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:22:54,220 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:22:54,220 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:22:54,221 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-09 22:22:54,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:22:54,221 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:22:54,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:22:54,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:22:54,222 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:22:54,222 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:22:54,222 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:22:54,223 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:22:54,223 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-09 22:22:54,223 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:22:54,223 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:22:54,223 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:22:54,223 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:22:54,224 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:22:54,224 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:22:54,226 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:22:54,227 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-09 22:22:54,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:22:54,227 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:22:54,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:22:54,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:22:54,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:22:54,228 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:22:54,228 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:22:54,228 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:22:54,229 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-09 22:22:54,229 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:22:54,229 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:22:54,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:22:54,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:22:54,230 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:22:54,232 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:22:54,232 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:22:54,236 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:22:54,236 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-09 22:22:54,237 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:22:54,237 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:22:54,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:22:54,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:22:54,237 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:22:54,238 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:22:54,238 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:22:54,239 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:22:54,239 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-09 22:22:54,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:22:54,239 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:22:54,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:22:54,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:22:54,240 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:22:54,240 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:22:54,240 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:22:54,241 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:22:54,241 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-09 22:22:54,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:22:54,241 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:22:54,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:22:54,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:22:54,242 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:22:54,242 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:22:54,242 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:22:54,242 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:22:54,243 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-09 22:22:54,243 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:22:54,243 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:22:54,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:22:54,243 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:22:54,243 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:22:54,244 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:22:54,244 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:22:54,245 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-09 22:22:54,248 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-09 22:22:54,248 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-09 22:22:54,249 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-09 22:22:54,249 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-09 22:22:54,250 INFO L517 LassoAnalysis]: Proved termination. [2018-11-09 22:22:54,250 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 15 Supporting invariants [] [2018-11-09 22:22:54,251 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-09 22:22:54,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:22:54,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:22:54,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 22:22:54,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:22:54,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 22:22:54,414 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-09 22:22:54,417 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-09 22:22:54,418 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 414 states and 718 transitions. cyclomatic complexity: 305 Second operand 4 states. [2018-11-09 22:22:54,511 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 414 states and 718 transitions. cyclomatic complexity: 305. Second operand 4 states. Result 633 states and 1076 transitions. Complement of second has 6 states. [2018-11-09 22:22:54,512 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-09 22:22:54,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-09 22:22:54,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 563 transitions. [2018-11-09 22:22:54,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 563 transitions. Stem has 53 letters. Loop has 36 letters. [2018-11-09 22:22:54,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 22:22:54,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 563 transitions. Stem has 89 letters. Loop has 36 letters. [2018-11-09 22:22:54,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 22:22:54,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 563 transitions. Stem has 53 letters. Loop has 72 letters. [2018-11-09 22:22:54,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 22:22:54,519 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 633 states and 1076 transitions. [2018-11-09 22:22:54,523 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-09 22:22:54,523 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 633 states to 0 states and 0 transitions. [2018-11-09 22:22:54,523 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-09 22:22:54,523 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-09 22:22:54,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-09 22:22:54,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-09 22:22:54,524 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-09 22:22:54,524 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-09 22:22:54,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-09 22:22:54,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-09 22:22:54,524 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 4 states. [2018-11-09 22:22:54,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-09 22:22:54,524 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-09 22:22:54,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-09 22:22:54,525 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-09 22:22:54,525 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-09 22:22:54,525 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-09 22:22:54,525 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-09 22:22:54,525 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-09 22:22:54,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-09 22:22:54,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-09 22:22:54,525 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-09 22:22:54,525 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-09 22:22:54,525 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-09 22:22:54,525 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-09 22:22:54,525 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-09 22:22:54,526 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-09 22:22:54,526 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-09 22:22:54,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.11 10:22:54 BoogieIcfgContainer [2018-11-09 22:22:54,531 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-09 22:22:54,532 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-09 22:22:54,532 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-09 22:22:54,532 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-09 22:22:54,532 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:22:51" (3/4) ... [2018-11-09 22:22:54,535 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-09 22:22:54,535 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-09 22:22:54,536 INFO L168 Benchmark]: Toolchain (without parser) took 4467.09 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 348.1 MB). Free memory was 952.2 MB in the beginning and 1.2 GB in the end (delta: -287.4 MB). Peak memory consumption was 60.8 MB. Max. memory is 11.5 GB. [2018-11-09 22:22:54,536 INFO L168 Benchmark]: CDTParser took 0.11 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-09 22:22:54,537 INFO L168 Benchmark]: CACSL2BoogieTranslator took 278.84 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 924.1 MB in the end (delta: 28.1 MB). Peak memory consumption was 28.1 MB. Max. memory is 11.5 GB. [2018-11-09 22:22:54,538 INFO L168 Benchmark]: Boogie Procedure Inliner took 92.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 173.0 MB). Free memory was 924.1 MB in the beginning and 1.2 GB in the end (delta: -239.3 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2018-11-09 22:22:54,538 INFO L168 Benchmark]: Boogie Preprocessor took 41.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-09 22:22:54,539 INFO L168 Benchmark]: RCFGBuilder took 904.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 106.2 MB). Peak memory consumption was 106.2 MB. Max. memory is 11.5 GB. [2018-11-09 22:22:54,539 INFO L168 Benchmark]: BuchiAutomizer took 3143.26 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 175.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -185.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-09 22:22:54,539 INFO L168 Benchmark]: Witness Printer took 3.60 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-09 22:22:54,542 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.11 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 278.84 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 924.1 MB in the end (delta: 28.1 MB). Peak memory consumption was 28.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 92.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 173.0 MB). Free memory was 924.1 MB in the beginning and 1.2 GB in the end (delta: -239.3 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 904.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 106.2 MB). Peak memory consumption was 106.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3143.26 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 175.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -185.6 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 3.60 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 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 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 15 and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.1s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 414 states and ocurred in iteration 2. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1697 SDtfs, 902 SDslu, 2457 SDs, 0 SdLazy, 36 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI2 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital210 mio100 ax122 hnf105 lsp27 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq229 hnf85 smp100 dnf100 smp100 tf101 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 4ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 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...