./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.8_false-unreach-call.1.ufo.BOUNDED-16.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ccb63e21-9999-4875-af5f-135c7389d65e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ccb63e21-9999-4875-af5f-135c7389d65e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ccb63e21-9999-4875-af5f-135c7389d65e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ccb63e21-9999-4875-af5f-135c7389d65e/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.8_false-unreach-call.1.ufo.BOUNDED-16.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_ccb63e21-9999-4875-af5f-135c7389d65e/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ccb63e21-9999-4875-af5f-135c7389d65e/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 36ada961451c422997ebdc91d5950f95195b7888 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 16:43:45,668 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 16:43:45,669 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 16:43:45,676 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 16:43:45,676 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 16:43:45,677 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 16:43:45,677 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 16:43:45,678 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 16:43:45,679 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 16:43:45,680 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 16:43:45,681 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 16:43:45,681 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 16:43:45,681 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 16:43:45,682 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 16:43:45,683 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 16:43:45,683 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 16:43:45,684 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 16:43:45,685 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 16:43:45,686 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 16:43:45,687 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 16:43:45,688 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 16:43:45,689 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 16:43:45,690 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 16:43:45,691 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 16:43:45,691 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 16:43:45,691 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 16:43:45,692 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 16:43:45,693 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 16:43:45,693 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 16:43:45,694 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 16:43:45,694 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 16:43:45,694 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 16:43:45,695 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 16:43:45,695 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 16:43:45,695 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 16:43:45,696 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 16:43:45,696 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ccb63e21-9999-4875-af5f-135c7389d65e/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 16:43:45,706 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 16:43:45,707 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 16:43:45,707 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 16:43:45,708 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 16:43:45,708 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 16:43:45,708 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 16:43:45,708 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 16:43:45,708 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 16:43:45,708 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 16:43:45,708 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 16:43:45,709 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 16:43:45,709 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 16:43:45,709 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 16:43:45,709 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 16:43:45,709 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 16:43:45,709 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 16:43:45,709 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 16:43:45,709 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 16:43:45,709 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 16:43:45,709 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 16:43:45,710 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 16:43:45,710 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 16:43:45,710 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 16:43:45,710 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 16:43:45,710 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 16:43:45,710 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 16:43:45,710 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 16:43:45,710 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 16:43:45,710 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 16:43:45,710 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 16:43:45,711 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 16:43:45,711 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 16:43:45,711 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_ccb63e21-9999-4875-af5f-135c7389d65e/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 -> 36ada961451c422997ebdc91d5950f95195b7888 [2018-11-18 16:43:45,733 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 16:43:45,741 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 16:43:45,743 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 16:43:45,743 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 16:43:45,743 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 16:43:45,744 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ccb63e21-9999-4875-af5f-135c7389d65e/bin-2019/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.8_false-unreach-call.1.ufo.BOUNDED-16.pals_true-termination.c [2018-11-18 16:43:45,778 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ccb63e21-9999-4875-af5f-135c7389d65e/bin-2019/uautomizer/data/58260a63a/d61ec25c97f940e29b52d124aaed53f2/FLAGf69dc461f [2018-11-18 16:43:46,224 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 16:43:46,224 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ccb63e21-9999-4875-af5f-135c7389d65e/sv-benchmarks/c/seq-mthreaded/pals_lcr.8_false-unreach-call.1.ufo.BOUNDED-16.pals_true-termination.c [2018-11-18 16:43:46,233 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ccb63e21-9999-4875-af5f-135c7389d65e/bin-2019/uautomizer/data/58260a63a/d61ec25c97f940e29b52d124aaed53f2/FLAGf69dc461f [2018-11-18 16:43:46,244 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ccb63e21-9999-4875-af5f-135c7389d65e/bin-2019/uautomizer/data/58260a63a/d61ec25c97f940e29b52d124aaed53f2 [2018-11-18 16:43:46,247 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 16:43:46,248 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 16:43:46,249 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 16:43:46,249 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 16:43:46,252 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 16:43:46,252 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:43:46" (1/1) ... [2018-11-18 16:43:46,254 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11c3b532 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:43:46, skipping insertion in model container [2018-11-18 16:43:46,255 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:43:46" (1/1) ... [2018-11-18 16:43:46,263 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 16:43:46,297 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 16:43:46,474 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:43:46,483 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 16:43:46,568 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:43:46,582 INFO L195 MainTranslator]: Completed translation [2018-11-18 16:43:46,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:43:46 WrapperNode [2018-11-18 16:43:46,582 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 16:43:46,583 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 16:43:46,583 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 16:43:46,583 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 16:43:46,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:43:46" (1/1) ... [2018-11-18 16:43:46,595 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:43:46" (1/1) ... [2018-11-18 16:43:46,615 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 16:43:46,616 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 16:43:46,616 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 16:43:46,616 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 16:43:46,621 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:43:46" (1/1) ... [2018-11-18 16:43:46,621 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:43:46" (1/1) ... [2018-11-18 16:43:46,623 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:43:46" (1/1) ... [2018-11-18 16:43:46,623 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:43:46" (1/1) ... [2018-11-18 16:43:46,629 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:43:46" (1/1) ... [2018-11-18 16:43:46,635 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:43:46" (1/1) ... [2018-11-18 16:43:46,637 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:43:46" (1/1) ... [2018-11-18 16:43:46,639 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 16:43:46,640 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 16:43:46,640 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 16:43:46,640 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 16:43:46,640 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:43:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ccb63e21-9999-4875-af5f-135c7389d65e/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-18 16:43:46,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 16:43:46,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 16:43:47,195 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 16:43:47,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:43:47 BoogieIcfgContainer [2018-11-18 16:43:47,196 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 16:43:47,196 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 16:43:47,196 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 16:43:47,198 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 16:43:47,199 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 16:43:47,199 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 04:43:46" (1/3) ... [2018-11-18 16:43:47,200 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4e54be4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 04:43:47, skipping insertion in model container [2018-11-18 16:43:47,200 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 16:43:47,200 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:43:46" (2/3) ... [2018-11-18 16:43:47,200 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4e54be4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 04:43:47, skipping insertion in model container [2018-11-18 16:43:47,200 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 16:43:47,200 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:43:47" (3/3) ... [2018-11-18 16:43:47,202 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_lcr.8_false-unreach-call.1.ufo.BOUNDED-16.pals_true-termination.c [2018-11-18 16:43:47,235 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 16:43:47,235 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 16:43:47,235 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 16:43:47,235 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 16:43:47,235 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 16:43:47,235 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 16:43:47,235 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 16:43:47,235 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 16:43:47,235 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 16:43:47,248 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 145 states. [2018-11-18 16:43:47,269 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 76 [2018-11-18 16:43:47,269 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:43:47,269 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:43:47,275 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 16:43:47,275 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, 1, 1, 1] [2018-11-18 16:43:47,275 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 16:43:47,276 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 145 states. [2018-11-18 16:43:47,281 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 76 [2018-11-18 16:43:47,281 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:43:47,281 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:43:47,282 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 16:43:47,282 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, 1, 1, 1] [2018-11-18 16:43:47,287 INFO L794 eck$LassoCheckResult]: Stem: 107#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;~r1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~mode1~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~mode2~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~mode3~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~mode4~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~mode5~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~mode6~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~mode7~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~mode8~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~0 := 0;~p4~0 := 0;~send4~0 := 0;~p5~0 := 0;~send5~0 := 0;~p6~0 := 0;~send6~0 := 0;~p7~0 := 0;~send7~0 := 0;~p8~0 := 0;~send8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.base(), ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.offset();~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset]; 13#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~ret41, main_#t~ret42, main_#t~post43, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet8;havoc main_#t~nondet8;~id1~0 := main_#t~nondet9;havoc main_#t~nondet9;~st1~0 := main_#t~nondet10;havoc main_#t~nondet10;~send1~0 := main_#t~nondet11;havoc main_#t~nondet11;~mode1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id2~0 := main_#t~nondet13;havoc main_#t~nondet13;~st2~0 := main_#t~nondet14;havoc main_#t~nondet14;~send2~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode2~0 := main_#t~nondet16;havoc main_#t~nondet16;~id3~0 := main_#t~nondet17;havoc main_#t~nondet17;~st3~0 := main_#t~nondet18;havoc main_#t~nondet18;~send3~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode3~0 := main_#t~nondet20;havoc main_#t~nondet20;~id4~0 := main_#t~nondet21;havoc main_#t~nondet21;~st4~0 := main_#t~nondet22;havoc main_#t~nondet22;~send4~0 := main_#t~nondet23;havoc main_#t~nondet23;~mode4~0 := main_#t~nondet24;havoc main_#t~nondet24;~id5~0 := main_#t~nondet25;havoc main_#t~nondet25;~st5~0 := main_#t~nondet26;havoc main_#t~nondet26;~send5~0 := main_#t~nondet27;havoc main_#t~nondet27;~mode5~0 := main_#t~nondet28;havoc main_#t~nondet28;~id6~0 := main_#t~nondet29;havoc main_#t~nondet29;~st6~0 := main_#t~nondet30;havoc main_#t~nondet30;~send6~0 := main_#t~nondet31;havoc main_#t~nondet31;~mode6~0 := main_#t~nondet32;havoc main_#t~nondet32;~id7~0 := main_#t~nondet33;havoc main_#t~nondet33;~st7~0 := main_#t~nondet34;havoc main_#t~nondet34;~send7~0 := main_#t~nondet35;havoc main_#t~nondet35;~mode7~0 := main_#t~nondet36;havoc main_#t~nondet36;~id8~0 := main_#t~nondet37;havoc main_#t~nondet37;~st8~0 := main_#t~nondet38;havoc main_#t~nondet38;~send8~0 := main_#t~nondet39;havoc main_#t~nondet39;~mode8~0 := main_#t~nondet40;havoc main_#t~nondet40;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 69#L339true assume !(0 == ~r1~0);init_~tmp~0 := 0; 71#L339-1true init_#res := init_~tmp~0; 70#L584true main_#t~ret41 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret41;havoc main_#t~ret41;assume 0 != main_~i2~0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~i2~0 := 0; 122#L674-3true [2018-11-18 16:43:47,288 INFO L796 eck$LassoCheckResult]: Loop: 122#L674-3true assume true; 115#L674-1true assume !!(main_~i2~0 < 16);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 133#L134true assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p8_old~0;~p8_old~0 := ~nomsg~0; 80#L138true assume !(node1_~m1~0 != ~nomsg~0); 64#L138-1true ~mode1~0 := 0; 147#L134-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 131#L162true assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 98#L165true assume !(node2_~m2~0 != ~nomsg~0); 110#L165-1true ~mode2~0 := 0; 126#L162-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 102#L187true assume !(0 != ~mode3~0 % 256); 135#L200true assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; 134#L200-2true ~p3_new~0 := (if node3_#t~ite2 % 256 <= 127 then node3_#t~ite2 % 256 else node3_#t~ite2 % 256 - 256);havoc node3_#t~ite2;~mode3~0 := 1; 109#L187-2true assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 78#L212true assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 86#L215true assume !(node4_~m4~0 != ~nomsg~0); 83#L215-1true ~mode4~0 := 0; 74#L212-2true assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 90#L237true assume !(0 != ~mode5~0 % 256); 112#L250true assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite4 := ~send5~0; 132#L250-2true ~p5_new~0 := (if node5_#t~ite4 % 256 <= 127 then node5_#t~ite4 % 256 else node5_#t~ite4 % 256 - 256);havoc node5_#t~ite4;~mode5~0 := 1; 82#L237-2true assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite5, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 57#L262true assume !(0 != ~mode6~0 % 256); 104#L275true assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite5 := ~send6~0; 103#L275-2true ~p6_new~0 := (if node6_#t~ite5 % 256 <= 127 then node6_#t~ite5 % 256 else node6_#t~ite5 % 256 - 256);havoc node6_#t~ite5;~mode6~0 := 1; 72#L262-2true assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite6, node7_~m7~0;havoc node7_~m7~0;node7_~m7~0 := ~nomsg~0; 65#L287true assume 0 != ~mode7~0 % 256;node7_~m7~0 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 50#L290true assume !(node7_~m7~0 != ~nomsg~0); 49#L290-1true ~mode7~0 := 0; 44#L287-2true assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite7, node8_~m8~0;havoc node8_~m8~0;node8_~m8~0 := ~nomsg~0; 42#L312true assume 0 != ~mode8~0 % 256;node8_~m8~0 := ~p7_old~0;~p7_old~0 := ~nomsg~0; 36#L315true assume !(node8_~m8~0 != ~nomsg~0); 37#L315-1true ~mode8~0 := 0; 45#L312-2true assume { :end_inline_node8 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 93#L592true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1 := 0; 95#L592-1true check_#res := check_~tmp~1; 39#L612true main_#t~ret42 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret42;havoc main_#t~ret42;assume { :begin_inline_assert } true;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 81#L713true assume !(0 == assert_~arg % 256); 55#L708true assume { :end_inline_assert } true;main_#t~post43 := main_~i2~0;main_~i2~0 := 1 + main_#t~post43;havoc main_#t~post43; 122#L674-3true [2018-11-18 16:43:47,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:43:47,293 INFO L82 PathProgramCache]: Analyzing trace with hash 29053230, now seen corresponding path program 1 times [2018-11-18 16:43:47,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:43:47,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:43:47,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:43:47,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:43:47,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:43:47,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:43:47,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:43:47,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:43:47,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:43:47,424 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 16:43:47,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:43:47,424 INFO L82 PathProgramCache]: Analyzing trace with hash 517282752, now seen corresponding path program 1 times [2018-11-18 16:43:47,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:43:47,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:43:47,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:43:47,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:43:47,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:43:47,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:43:47,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:43:47,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:43:47,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 16:43:47,539 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 16:43:47,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 16:43:47,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 16:43:47,550 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 4 states. [2018-11-18 16:43:47,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:43:47,629 INFO L93 Difference]: Finished difference Result 147 states and 252 transitions. [2018-11-18 16:43:47,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 16:43:47,631 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 147 states and 252 transitions. [2018-11-18 16:43:47,634 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 75 [2018-11-18 16:43:47,638 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 147 states to 140 states and 185 transitions. [2018-11-18 16:43:47,639 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 140 [2018-11-18 16:43:47,640 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 140 [2018-11-18 16:43:47,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 140 states and 185 transitions. [2018-11-18 16:43:47,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 16:43:47,642 INFO L705 BuchiCegarLoop]: Abstraction has 140 states and 185 transitions. [2018-11-18 16:43:47,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states and 185 transitions. [2018-11-18 16:43:47,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-11-18 16:43:47,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-18 16:43:47,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 185 transitions. [2018-11-18 16:43:47,666 INFO L728 BuchiCegarLoop]: Abstraction has 140 states and 185 transitions. [2018-11-18 16:43:47,666 INFO L608 BuchiCegarLoop]: Abstraction has 140 states and 185 transitions. [2018-11-18 16:43:47,666 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 16:43:47,666 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 140 states and 185 transitions. [2018-11-18 16:43:47,668 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 75 [2018-11-18 16:43:47,668 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:43:47,668 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:43:47,670 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:43:47,670 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, 1, 1, 1] [2018-11-18 16:43:47,671 INFO L794 eck$LassoCheckResult]: Stem: 438#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~r1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~mode1~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~mode2~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~mode3~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~mode4~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~mode5~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~mode6~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~mode7~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~mode8~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~0 := 0;~p4~0 := 0;~send4~0 := 0;~p5~0 := 0;~send5~0 := 0;~p6~0 := 0;~send6~0 := 0;~p7~0 := 0;~send7~0 := 0;~p8~0 := 0;~send8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.base(), ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.offset();~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset]; 331#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~ret41, main_#t~ret42, main_#t~post43, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet8;havoc main_#t~nondet8;~id1~0 := main_#t~nondet9;havoc main_#t~nondet9;~st1~0 := main_#t~nondet10;havoc main_#t~nondet10;~send1~0 := main_#t~nondet11;havoc main_#t~nondet11;~mode1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id2~0 := main_#t~nondet13;havoc main_#t~nondet13;~st2~0 := main_#t~nondet14;havoc main_#t~nondet14;~send2~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode2~0 := main_#t~nondet16;havoc main_#t~nondet16;~id3~0 := main_#t~nondet17;havoc main_#t~nondet17;~st3~0 := main_#t~nondet18;havoc main_#t~nondet18;~send3~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode3~0 := main_#t~nondet20;havoc main_#t~nondet20;~id4~0 := main_#t~nondet21;havoc main_#t~nondet21;~st4~0 := main_#t~nondet22;havoc main_#t~nondet22;~send4~0 := main_#t~nondet23;havoc main_#t~nondet23;~mode4~0 := main_#t~nondet24;havoc main_#t~nondet24;~id5~0 := main_#t~nondet25;havoc main_#t~nondet25;~st5~0 := main_#t~nondet26;havoc main_#t~nondet26;~send5~0 := main_#t~nondet27;havoc main_#t~nondet27;~mode5~0 := main_#t~nondet28;havoc main_#t~nondet28;~id6~0 := main_#t~nondet29;havoc main_#t~nondet29;~st6~0 := main_#t~nondet30;havoc main_#t~nondet30;~send6~0 := main_#t~nondet31;havoc main_#t~nondet31;~mode6~0 := main_#t~nondet32;havoc main_#t~nondet32;~id7~0 := main_#t~nondet33;havoc main_#t~nondet33;~st7~0 := main_#t~nondet34;havoc main_#t~nondet34;~send7~0 := main_#t~nondet35;havoc main_#t~nondet35;~mode7~0 := main_#t~nondet36;havoc main_#t~nondet36;~id8~0 := main_#t~nondet37;havoc main_#t~nondet37;~st8~0 := main_#t~nondet38;havoc main_#t~nondet38;~send8~0 := main_#t~nondet39;havoc main_#t~nondet39;~mode8~0 := main_#t~nondet40;havoc main_#t~nondet40;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 332#L339 assume 0 == ~r1~0; 333#L340 assume ~id1~0 >= 0; 334#L341 assume 0 == ~st1~0; 408#L342 assume ~send1~0 == ~id1~0; 324#L343 assume 0 == ~mode1~0 % 256; 325#L344 assume ~id2~0 >= 0; 378#L345 assume 0 == ~st2~0; 379#L346 assume ~send2~0 == ~id2~0; 432#L347 assume 0 == ~mode2~0 % 256; 363#L348 assume ~id3~0 >= 0; 364#L349 assume 0 == ~st3~0; 413#L350 assume ~send3~0 == ~id3~0; 351#L351 assume 0 == ~mode3~0 % 256; 352#L352 assume ~id4~0 >= 0; 407#L353 assume 0 == ~st4~0; 322#L354 assume ~send4~0 == ~id4~0; 323#L355 assume 0 == ~mode4~0 % 256; 375#L356 assume ~id5~0 >= 0; 376#L357 assume 0 == ~st5~0; 431#L358 assume ~send5~0 == ~id5~0; 361#L359 assume 0 == ~mode5~0 % 256; 362#L360 assume ~id6~0 >= 0; 412#L361 assume 0 == ~st6~0; 347#L362 assume ~send6~0 == ~id6~0; 348#L363 assume 0 == ~mode6~0 % 256; 406#L364 assume ~id7~0 >= 0; 317#L365 assume 0 == ~st7~0; 318#L366 assume ~send7~0 == ~id7~0; 395#L367 assume 0 == ~mode7~0 % 256; 396#L368 assume ~id8~0 >= 0; 429#L369 assume 0 == ~st8~0; 359#L370 assume ~send8~0 == ~id8~0; 360#L371 assume 0 == ~mode8~0 % 256; 411#L372 assume ~id1~0 != ~id2~0; 345#L373 assume ~id1~0 != ~id3~0; 346#L374 assume ~id1~0 != ~id4~0; 405#L375 assume ~id1~0 != ~id5~0; 315#L376 assume ~id1~0 != ~id6~0; 316#L377 assume ~id1~0 != ~id7~0; 393#L378 assume ~id1~0 != ~id8~0; 394#L379 assume ~id2~0 != ~id3~0; 428#L380 assume ~id2~0 != ~id4~0; 356#L381 assume ~id2~0 != ~id5~0; 357#L382 assume ~id2~0 != ~id6~0; 425#L383 assume ~id2~0 != ~id7~0; 343#L384 assume ~id2~0 != ~id8~0; 344#L385 assume ~id3~0 != ~id4~0; 404#L386 assume ~id3~0 != ~id5~0; 311#L387 assume ~id3~0 != ~id6~0; 312#L388 assume ~id3~0 != ~id7~0; 391#L389 assume ~id3~0 != ~id8~0; 392#L390 assume ~id4~0 != ~id5~0; 427#L391 assume ~id4~0 != ~id6~0; 353#L392 assume ~id4~0 != ~id7~0; 354#L393 assume ~id4~0 != ~id8~0; 421#L394 assume ~id5~0 != ~id6~0; 341#L395 assume ~id5~0 != ~id7~0; 342#L396 assume ~id5~0 != ~id8~0; 403#L397 assume ~id6~0 != ~id7~0; 309#L398 assume ~id6~0 != ~id8~0; 310#L399 assume ~id7~0 != ~id8~0;init_~tmp~0 := 1; 415#L339-1 init_#res := init_~tmp~0; 414#L584 main_#t~ret41 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret41;havoc main_#t~ret41;assume 0 != main_~i2~0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~i2~0 := 0; 399#L674-3 [2018-11-18 16:43:47,671 INFO L796 eck$LassoCheckResult]: Loop: 399#L674-3 assume true; 441#L674-1 assume !!(main_~i2~0 < 16);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 442#L134 assume !(0 != ~mode1~0 % 256); 358#L150 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite0 := ~send1~0; 326#L150-2 ~p1_new~0 := (if node1_#t~ite0 % 256 <= 127 then node1_#t~ite0 % 256 else node1_#t~ite0 % 256 - 256);havoc node1_#t~ite0;~mode1~0 := 1; 327#L134-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 444#L162 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 433#L165 assume !(node2_~m2~0 != ~nomsg~0); 350#L165-1 ~mode2~0 := 0; 338#L162-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 434#L187 assume !(0 != ~mode3~0 % 256); 435#L200 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; 445#L200-2 ~p3_new~0 := (if node3_#t~ite2 % 256 <= 127 then node3_#t~ite2 % 256 else node3_#t~ite2 % 256 - 256);havoc node3_#t~ite2;~mode3~0 := 1; 419#L187-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 422#L212 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 423#L215 assume !(node4_~m4~0 != ~nomsg~0); 314#L215-1 ~mode4~0 := 0; 417#L212-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 418#L237 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 400#L240 assume !(node5_~m5~0 != ~nomsg~0); 320#L240-1 ~mode5~0 := 0; 397#L237-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite5, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 401#L262 assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 386#L265 assume !(node6_~m6~0 != ~nomsg~0); 336#L265-1 ~mode6~0 := 0; 385#L262-2 assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite6, node7_~m7~0;havoc node7_~m7~0;node7_~m7~0 := ~nomsg~0; 409#L287 assume 0 != ~mode7~0 % 256;node7_~m7~0 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 389#L290 assume !(node7_~m7~0 != ~nomsg~0); 388#L290-1 ~mode7~0 := 0; 383#L287-2 assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite7, node8_~m8~0;havoc node8_~m8~0;node8_~m8~0 := ~nomsg~0; 380#L312 assume 0 != ~mode8~0 % 256;node8_~m8~0 := ~p7_old~0;~p7_old~0 := ~nomsg~0; 369#L315 assume !(node8_~m8~0 != ~nomsg~0); 370#L315-1 ~mode8~0 := 0; 372#L312-2 assume { :end_inline_node8 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 384#L592 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1 := 0; 330#L592-1 check_#res := check_~tmp~1; 373#L612 main_#t~ret42 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret42;havoc main_#t~ret42;assume { :begin_inline_assert } true;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 374#L713 assume !(0 == assert_~arg % 256); 398#L708 assume { :end_inline_assert } true;main_#t~post43 := main_~i2~0;main_~i2~0 := 1 + main_#t~post43;havoc main_#t~post43; 399#L674-3 [2018-11-18 16:43:47,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:43:47,671 INFO L82 PathProgramCache]: Analyzing trace with hash 326625054, now seen corresponding path program 1 times [2018-11-18 16:43:47,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:43:47,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:43:47,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:43:47,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:43:47,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:43:47,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:43:47,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:43:47,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:43:47,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1173637706, now seen corresponding path program 1 times [2018-11-18 16:43:47,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:43:47,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:43:47,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:43:47,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:43:47,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:43:47,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:43:47,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:43:47,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:43:47,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 16:43:47,832 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 16:43:47,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 16:43:47,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 16:43:47,833 INFO L87 Difference]: Start difference. First operand 140 states and 185 transitions. cyclomatic complexity: 46 Second operand 5 states. [2018-11-18 16:43:47,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:43:47,891 INFO L93 Difference]: Finished difference Result 143 states and 187 transitions. [2018-11-18 16:43:47,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 16:43:47,893 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 143 states and 187 transitions. [2018-11-18 16:43:47,895 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 75 [2018-11-18 16:43:47,896 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 143 states to 140 states and 182 transitions. [2018-11-18 16:43:47,897 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 140 [2018-11-18 16:43:47,897 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 140 [2018-11-18 16:43:47,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 140 states and 182 transitions. [2018-11-18 16:43:47,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 16:43:47,898 INFO L705 BuchiCegarLoop]: Abstraction has 140 states and 182 transitions. [2018-11-18 16:43:47,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states and 182 transitions. [2018-11-18 16:43:47,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-11-18 16:43:47,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-18 16:43:47,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 182 transitions. [2018-11-18 16:43:47,905 INFO L728 BuchiCegarLoop]: Abstraction has 140 states and 182 transitions. [2018-11-18 16:43:47,905 INFO L608 BuchiCegarLoop]: Abstraction has 140 states and 182 transitions. [2018-11-18 16:43:47,905 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 16:43:47,905 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 140 states and 182 transitions. [2018-11-18 16:43:47,907 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 75 [2018-11-18 16:43:47,907 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:43:47,907 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:43:47,909 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:43:47,909 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, 1, 1, 1, 1, 1] [2018-11-18 16:43:47,909 INFO L794 eck$LassoCheckResult]: Stem: 733#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~r1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~mode1~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~mode2~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~mode3~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~mode4~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~mode5~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~mode6~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~mode7~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~mode8~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~0 := 0;~p4~0 := 0;~send4~0 := 0;~p5~0 := 0;~send5~0 := 0;~p6~0 := 0;~send6~0 := 0;~p7~0 := 0;~send7~0 := 0;~p8~0 := 0;~send8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.base(), ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.offset();~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset]; 625#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~ret41, main_#t~ret42, main_#t~post43, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet8;havoc main_#t~nondet8;~id1~0 := main_#t~nondet9;havoc main_#t~nondet9;~st1~0 := main_#t~nondet10;havoc main_#t~nondet10;~send1~0 := main_#t~nondet11;havoc main_#t~nondet11;~mode1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id2~0 := main_#t~nondet13;havoc main_#t~nondet13;~st2~0 := main_#t~nondet14;havoc main_#t~nondet14;~send2~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode2~0 := main_#t~nondet16;havoc main_#t~nondet16;~id3~0 := main_#t~nondet17;havoc main_#t~nondet17;~st3~0 := main_#t~nondet18;havoc main_#t~nondet18;~send3~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode3~0 := main_#t~nondet20;havoc main_#t~nondet20;~id4~0 := main_#t~nondet21;havoc main_#t~nondet21;~st4~0 := main_#t~nondet22;havoc main_#t~nondet22;~send4~0 := main_#t~nondet23;havoc main_#t~nondet23;~mode4~0 := main_#t~nondet24;havoc main_#t~nondet24;~id5~0 := main_#t~nondet25;havoc main_#t~nondet25;~st5~0 := main_#t~nondet26;havoc main_#t~nondet26;~send5~0 := main_#t~nondet27;havoc main_#t~nondet27;~mode5~0 := main_#t~nondet28;havoc main_#t~nondet28;~id6~0 := main_#t~nondet29;havoc main_#t~nondet29;~st6~0 := main_#t~nondet30;havoc main_#t~nondet30;~send6~0 := main_#t~nondet31;havoc main_#t~nondet31;~mode6~0 := main_#t~nondet32;havoc main_#t~nondet32;~id7~0 := main_#t~nondet33;havoc main_#t~nondet33;~st7~0 := main_#t~nondet34;havoc main_#t~nondet34;~send7~0 := main_#t~nondet35;havoc main_#t~nondet35;~mode7~0 := main_#t~nondet36;havoc main_#t~nondet36;~id8~0 := main_#t~nondet37;havoc main_#t~nondet37;~st8~0 := main_#t~nondet38;havoc main_#t~nondet38;~send8~0 := main_#t~nondet39;havoc main_#t~nondet39;~mode8~0 := main_#t~nondet40;havoc main_#t~nondet40;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 626#L339 assume 0 == ~r1~0; 627#L340 assume ~id1~0 >= 0; 628#L341 assume 0 == ~st1~0; 703#L342 assume ~send1~0 == ~id1~0; 619#L343 assume 0 == ~mode1~0 % 256; 620#L344 assume ~id2~0 >= 0; 673#L345 assume 0 == ~st2~0; 674#L346 assume ~send2~0 == ~id2~0; 727#L347 assume 0 == ~mode2~0 % 256; 657#L348 assume ~id3~0 >= 0; 658#L349 assume 0 == ~st3~0; 708#L350 assume ~send3~0 == ~id3~0; 645#L351 assume 0 == ~mode3~0 % 256; 646#L352 assume ~id4~0 >= 0; 702#L353 assume 0 == ~st4~0; 617#L354 assume ~send4~0 == ~id4~0; 618#L355 assume 0 == ~mode4~0 % 256; 669#L356 assume ~id5~0 >= 0; 670#L357 assume 0 == ~st5~0; 726#L358 assume ~send5~0 == ~id5~0; 655#L359 assume 0 == ~mode5~0 % 256; 656#L360 assume ~id6~0 >= 0; 707#L361 assume 0 == ~st6~0; 643#L362 assume ~send6~0 == ~id6~0; 644#L363 assume 0 == ~mode6~0 % 256; 701#L364 assume ~id7~0 >= 0; 612#L365 assume 0 == ~st7~0; 613#L366 assume ~send7~0 == ~id7~0; 690#L367 assume 0 == ~mode7~0 % 256; 691#L368 assume ~id8~0 >= 0; 724#L369 assume 0 == ~st8~0; 653#L370 assume ~send8~0 == ~id8~0; 654#L371 assume 0 == ~mode8~0 % 256; 706#L372 assume ~id1~0 != ~id2~0; 639#L373 assume ~id1~0 != ~id3~0; 640#L374 assume ~id1~0 != ~id4~0; 700#L375 assume ~id1~0 != ~id5~0; 610#L376 assume ~id1~0 != ~id6~0; 611#L377 assume ~id1~0 != ~id7~0; 688#L378 assume ~id1~0 != ~id8~0; 689#L379 assume ~id2~0 != ~id3~0; 723#L380 assume ~id2~0 != ~id4~0; 651#L381 assume ~id2~0 != ~id5~0; 652#L382 assume ~id2~0 != ~id6~0; 720#L383 assume ~id2~0 != ~id7~0; 637#L384 assume ~id2~0 != ~id8~0; 638#L385 assume ~id3~0 != ~id4~0; 699#L386 assume ~id3~0 != ~id5~0; 606#L387 assume ~id3~0 != ~id6~0; 607#L388 assume ~id3~0 != ~id7~0; 686#L389 assume ~id3~0 != ~id8~0; 687#L390 assume ~id4~0 != ~id5~0; 722#L391 assume ~id4~0 != ~id6~0; 648#L392 assume ~id4~0 != ~id7~0; 649#L393 assume ~id4~0 != ~id8~0; 716#L394 assume ~id5~0 != ~id6~0; 635#L395 assume ~id5~0 != ~id7~0; 636#L396 assume ~id5~0 != ~id8~0; 696#L397 assume ~id6~0 != ~id7~0; 604#L398 assume ~id6~0 != ~id8~0; 605#L399 assume ~id7~0 != ~id8~0;init_~tmp~0 := 1; 710#L339-1 init_#res := init_~tmp~0; 709#L584 main_#t~ret41 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret41;havoc main_#t~ret41;assume 0 != main_~i2~0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~i2~0 := 0; 694#L674-3 [2018-11-18 16:43:47,910 INFO L796 eck$LassoCheckResult]: Loop: 694#L674-3 assume true; 736#L674-1 assume !!(main_~i2~0 < 16);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 737#L134 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p8_old~0;~p8_old~0 := ~nomsg~0; 721#L138 assume !(node1_~m1~0 != ~nomsg~0); 634#L138-1 ~mode1~0 := 0; 622#L134-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 739#L162 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 728#L165 assume !(node2_~m2~0 != ~nomsg~0); 642#L165-1 ~mode2~0 := 0; 632#L162-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 729#L187 assume !(0 != ~mode3~0 % 256); 730#L200 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; 740#L200-2 ~p3_new~0 := (if node3_#t~ite2 % 256 <= 127 then node3_#t~ite2 % 256 else node3_#t~ite2 % 256 - 256);havoc node3_#t~ite2;~mode3~0 := 1; 714#L187-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 717#L212 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 718#L215 assume !(node4_~m4~0 != ~nomsg~0); 609#L215-1 ~mode4~0 := 0; 712#L212-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 713#L237 assume !(0 != ~mode5~0 % 256); 725#L250 assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite4 := ~send5~0; 734#L250-2 ~p5_new~0 := (if node5_#t~ite4 % 256 <= 127 then node5_#t~ite4 % 256 else node5_#t~ite4 % 256 - 256);havoc node5_#t~ite4;~mode5~0 := 1; 692#L237-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite5, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 697#L262 assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 681#L265 assume !(node6_~m6~0 != ~nomsg~0); 630#L265-1 ~mode6~0 := 0; 680#L262-2 assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite6, node7_~m7~0;havoc node7_~m7~0;node7_~m7~0 := ~nomsg~0; 704#L287 assume !(0 != ~mode7~0 % 256); 705#L300 assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite6 := ~send7~0; 732#L300-2 ~p7_new~0 := (if node7_#t~ite6 % 256 <= 127 then node7_#t~ite6 % 256 else node7_#t~ite6 % 256 - 256);havoc node7_#t~ite6;~mode7~0 := 1; 678#L287-2 assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite7, node8_~m8~0;havoc node8_~m8~0;node8_~m8~0 := ~nomsg~0; 675#L312 assume !(0 != ~mode8~0 % 256); 676#L325 assume !(~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0);node8_#t~ite7 := ~p8_new~0; 711#L325-2 ~p8_new~0 := (if node8_#t~ite7 % 256 <= 127 then node8_#t~ite7 % 256 else node8_#t~ite7 % 256 - 256);havoc node8_#t~ite7;~mode8~0 := 1; 666#L312-2 assume { :end_inline_node8 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 679#L592 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1; 661#L593 assume ~r1~0 >= 8; 624#L597 assume ~r1~0 < 8;check_~tmp~1 := 1; 672#L592-1 check_#res := check_~tmp~1; 667#L612 main_#t~ret42 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret42;havoc main_#t~ret42;assume { :begin_inline_assert } true;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 668#L713 assume !(0 == assert_~arg % 256); 693#L708 assume { :end_inline_assert } true;main_#t~post43 := main_~i2~0;main_~i2~0 := 1 + main_#t~post43;havoc main_#t~post43; 694#L674-3 [2018-11-18 16:43:47,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:43:47,910 INFO L82 PathProgramCache]: Analyzing trace with hash 326625054, now seen corresponding path program 2 times [2018-11-18 16:43:47,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:43:47,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:43:47,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:43:47,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:43:47,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:43:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:43:47,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:43:47,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:43:47,970 INFO L82 PathProgramCache]: Analyzing trace with hash 637461380, now seen corresponding path program 1 times [2018-11-18 16:43:47,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:43:47,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:43:47,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:43:47,972 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:43:47,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:43:47,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:43:48,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:43:48,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:43:48,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:43:48,027 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 16:43:48,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:43:48,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:43:48,028 INFO L87 Difference]: Start difference. First operand 140 states and 182 transitions. cyclomatic complexity: 43 Second operand 3 states. [2018-11-18 16:43:48,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:43:48,056 INFO L93 Difference]: Finished difference Result 209 states and 288 transitions. [2018-11-18 16:43:48,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:43:48,057 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 209 states and 288 transitions. [2018-11-18 16:43:48,058 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 144 [2018-11-18 16:43:48,060 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 209 states to 209 states and 288 transitions. [2018-11-18 16:43:48,060 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 209 [2018-11-18 16:43:48,060 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 209 [2018-11-18 16:43:48,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 209 states and 288 transitions. [2018-11-18 16:43:48,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 16:43:48,061 INFO L705 BuchiCegarLoop]: Abstraction has 209 states and 288 transitions. [2018-11-18 16:43:48,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states and 288 transitions. [2018-11-18 16:43:48,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2018-11-18 16:43:48,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-11-18 16:43:48,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 288 transitions. [2018-11-18 16:43:48,072 INFO L728 BuchiCegarLoop]: Abstraction has 209 states and 288 transitions. [2018-11-18 16:43:48,072 INFO L608 BuchiCegarLoop]: Abstraction has 209 states and 288 transitions. [2018-11-18 16:43:48,072 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 16:43:48,072 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 209 states and 288 transitions. [2018-11-18 16:43:48,073 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 144 [2018-11-18 16:43:48,073 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:43:48,074 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:43:48,075 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:43:48,075 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, 1, 1, 1, 1, 1, 1] [2018-11-18 16:43:48,075 INFO L794 eck$LassoCheckResult]: Stem: 1094#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~r1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~mode1~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~mode2~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~mode3~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~mode4~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~mode5~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~mode6~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~mode7~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~mode8~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~0 := 0;~p4~0 := 0;~send4~0 := 0;~p5~0 := 0;~send5~0 := 0;~p6~0 := 0;~send6~0 := 0;~p7~0 := 0;~send7~0 := 0;~p8~0 := 0;~send8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.base(), ~const~array~~LB~int~RB~~LC~base~COL~int~COM~offset~COL~int~RC~.offset();~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset]; 978#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~ret41, main_#t~ret42, main_#t~post43, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet8;havoc main_#t~nondet8;~id1~0 := main_#t~nondet9;havoc main_#t~nondet9;~st1~0 := main_#t~nondet10;havoc main_#t~nondet10;~send1~0 := main_#t~nondet11;havoc main_#t~nondet11;~mode1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id2~0 := main_#t~nondet13;havoc main_#t~nondet13;~st2~0 := main_#t~nondet14;havoc main_#t~nondet14;~send2~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode2~0 := main_#t~nondet16;havoc main_#t~nondet16;~id3~0 := main_#t~nondet17;havoc main_#t~nondet17;~st3~0 := main_#t~nondet18;havoc main_#t~nondet18;~send3~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode3~0 := main_#t~nondet20;havoc main_#t~nondet20;~id4~0 := main_#t~nondet21;havoc main_#t~nondet21;~st4~0 := main_#t~nondet22;havoc main_#t~nondet22;~send4~0 := main_#t~nondet23;havoc main_#t~nondet23;~mode4~0 := main_#t~nondet24;havoc main_#t~nondet24;~id5~0 := main_#t~nondet25;havoc main_#t~nondet25;~st5~0 := main_#t~nondet26;havoc main_#t~nondet26;~send5~0 := main_#t~nondet27;havoc main_#t~nondet27;~mode5~0 := main_#t~nondet28;havoc main_#t~nondet28;~id6~0 := main_#t~nondet29;havoc main_#t~nondet29;~st6~0 := main_#t~nondet30;havoc main_#t~nondet30;~send6~0 := main_#t~nondet31;havoc main_#t~nondet31;~mode6~0 := main_#t~nondet32;havoc main_#t~nondet32;~id7~0 := main_#t~nondet33;havoc main_#t~nondet33;~st7~0 := main_#t~nondet34;havoc main_#t~nondet34;~send7~0 := main_#t~nondet35;havoc main_#t~nondet35;~mode7~0 := main_#t~nondet36;havoc main_#t~nondet36;~id8~0 := main_#t~nondet37;havoc main_#t~nondet37;~st8~0 := main_#t~nondet38;havoc main_#t~nondet38;~send8~0 := main_#t~nondet39;havoc main_#t~nondet39;~mode8~0 := main_#t~nondet40;havoc main_#t~nondet40;assume { :begin_inline_init } true;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 979#L339 assume 0 == ~r1~0; 980#L340 assume ~id1~0 >= 0; 981#L341 assume 0 == ~st1~0; 1059#L342 assume ~send1~0 == ~id1~0; 974#L343 assume 0 == ~mode1~0 % 256; 975#L344 assume ~id2~0 >= 0; 1027#L345 assume 0 == ~st2~0; 1028#L346 assume ~send2~0 == ~id2~0; 1088#L347 assume 0 == ~mode2~0 % 256; 1012#L348 assume ~id3~0 >= 0; 1013#L349 assume 0 == ~st3~0; 1065#L350 assume ~send3~0 == ~id3~0; 1000#L351 assume 0 == ~mode3~0 % 256; 1001#L352 assume ~id4~0 >= 0; 1058#L353 assume 0 == ~st4~0; 969#L354 assume ~send4~0 == ~id4~0; 970#L355 assume 0 == ~mode4~0 % 256; 1023#L356 assume ~id5~0 >= 0; 1024#L357 assume 0 == ~st5~0; 1085#L358 assume ~send5~0 == ~id5~0; 1010#L359 assume 0 == ~mode5~0 % 256; 1011#L360 assume ~id6~0 >= 0; 1064#L361 assume 0 == ~st6~0; 996#L362 assume ~send6~0 == ~id6~0; 997#L363 assume 0 == ~mode6~0 % 256; 1057#L364 assume ~id7~0 >= 0; 967#L365 assume 0 == ~st7~0; 968#L366 assume ~send7~0 == ~id7~0; 1046#L367 assume 0 == ~mode7~0 % 256; 1047#L368 assume ~id8~0 >= 0; 1084#L369 assume 0 == ~st8~0; 1008#L370 assume ~send8~0 == ~id8~0; 1009#L371 assume 0 == ~mode8~0 % 256; 1061#L372 assume ~id1~0 != ~id2~0; 994#L373 assume ~id1~0 != ~id3~0; 995#L374 assume ~id1~0 != ~id4~0; 1056#L375 assume ~id1~0 != ~id5~0; 963#L376 assume ~id1~0 != ~id6~0; 964#L377 assume ~id1~0 != ~id7~0; 1044#L378 assume ~id1~0 != ~id8~0; 1045#L379 assume ~id2~0 != ~id3~0; 1082#L380 assume ~id2~0 != ~id4~0; 1005#L381 assume ~id2~0 != ~id5~0; 1006#L382 assume ~id2~0 != ~id6~0; 1075#L383 assume ~id2~0 != ~id7~0; 992#L384 assume ~id2~0 != ~id8~0; 993#L385 assume ~id3~0 != ~id4~0; 1055#L386 assume ~id3~0 != ~id5~0; 961#L387 assume ~id3~0 != ~id6~0; 962#L388 assume ~id3~0 != ~id7~0; 1042#L389 assume ~id3~0 != ~id8~0; 1043#L390 assume ~id4~0 != ~id5~0; 1081#L391 assume ~id4~0 != ~id6~0; 1002#L392 assume ~id4~0 != ~id7~0; 1003#L393 assume ~id4~0 != ~id8~0; 1074#L394 assume ~id5~0 != ~id6~0; 990#L395 assume ~id5~0 != ~id7~0; 991#L396 assume ~id5~0 != ~id8~0; 1052#L397 assume ~id6~0 != ~id7~0; 959#L398 assume ~id6~0 != ~id8~0; 960#L399 assume ~id7~0 != ~id8~0;init_~tmp~0 := 1; 1068#L339-1 init_#res := init_~tmp~0; 1066#L584 main_#t~ret41 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret41;havoc main_#t~ret41;assume 0 != main_~i2~0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main_~i2~0 := 0; 1067#L674-3 [2018-11-18 16:43:48,075 INFO L796 eck$LassoCheckResult]: Loop: 1067#L674-3 assume true; 1160#L674-1 assume !!(main_~i2~0 < 16);assume { :begin_inline_node1 } true;havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 1159#L134 assume !(0 != ~mode1~0 % 256); 1158#L150 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite0 := ~send1~0; 1157#L150-2 ~p1_new~0 := (if node1_#t~ite0 % 256 <= 127 then node1_#t~ite0 % 256 else node1_#t~ite0 % 256 - 256);havoc node1_#t~ite0;~mode1~0 := 1; 1060#L134-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 1156#L162 assume !(0 != ~mode2~0 % 256); 1152#L175 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; 1151#L175-2 ~p2_new~0 := (if node2_#t~ite1 % 256 <= 127 then node2_#t~ite1 % 256 else node2_#t~ite1 % 256 - 256);havoc node2_#t~ite1;~mode2~0 := 1; 1149#L162-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 1090#L187 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 1073#L190 assume !(node3_~m3~0 != ~nomsg~0); 1015#L190-1 ~mode3~0 := 0; 1072#L187-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 1076#L212 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 1077#L215 assume !(node4_~m4~0 != ~nomsg~0); 1080#L215-1 ~mode4~0 := 0; 1070#L212-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 1071#L237 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 1086#L240 assume !(node5_~m5~0 != ~nomsg~0); 1133#L240-1 ~mode5~0 := 0; 1131#L237-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite5, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 1130#L262 assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 1127#L265 assume !(node6_~m6~0 != ~nomsg~0); 1125#L265-1 ~mode6~0 := 0; 1123#L262-2 assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite6, node7_~m7~0;havoc node7_~m7~0;node7_~m7~0 := ~nomsg~0; 1122#L287 assume 0 != ~mode7~0 % 256;node7_~m7~0 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 1120#L290 assume !(node7_~m7~0 != ~nomsg~0); 1117#L290-1 ~mode7~0 := 0; 1115#L287-2 assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite7, node8_~m8~0;havoc node8_~m8~0;node8_~m8~0 := ~nomsg~0; 1114#L312 assume !(0 != ~mode8~0 % 256); 1110#L325 assume !(~send8~0 != ~nomsg~0 && ~p8_new~0 == ~nomsg~0);node8_#t~ite7 := ~p8_new~0; 1108#L325-2 ~p8_new~0 := (if node8_#t~ite7 % 256 <= 127 then node8_#t~ite7 % 256 else node8_#t~ite7 % 256 - 256);havoc node8_#t~ite7;~mode8~0 := 1; 1107#L312-2 assume { :end_inline_node8 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 1106#L592 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1; 1105#L593 assume !(~r1~0 >= 8); 982#L596 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0; 983#L597 assume ~r1~0 < 8;check_~tmp~1 := 1; 1132#L592-1 check_#res := check_~tmp~1; 1163#L612 main_#t~ret42 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret42;havoc main_#t~ret42;assume { :begin_inline_assert } true;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 1162#L713 assume !(0 == assert_~arg % 256); 1161#L708 assume { :end_inline_assert } true;main_#t~post43 := main_~i2~0;main_~i2~0 := 1 + main_#t~post43;havoc main_#t~post43; 1067#L674-3 [2018-11-18 16:43:48,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:43:48,076 INFO L82 PathProgramCache]: Analyzing trace with hash 326625054, now seen corresponding path program 3 times [2018-11-18 16:43:48,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:43:48,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:43:48,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:43:48,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:43:48,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:43:48,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:43:48,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:43:48,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:43:48,122 INFO L82 PathProgramCache]: Analyzing trace with hash 212804372, now seen corresponding path program 1 times [2018-11-18 16:43:48,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:43:48,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:43:48,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:43:48,123 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:43:48,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:43:48,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:43:48,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:43:48,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:43:48,144 INFO L82 PathProgramCache]: Analyzing trace with hash -557853199, now seen corresponding path program 1 times [2018-11-18 16:43:48,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:43:48,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:43:48,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:43:48,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:43:48,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:43:48,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:43:48,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:43:48,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:43:48,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:43:48,717 WARN L180 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 206 [2018-11-18 16:43:54,247 WARN L180 SmtUtils]: Spent 5.46 s on a formula simplification. DAG size of input: 208 DAG size of output: 189 [2018-11-18 16:43:54,255 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 16:43:54,256 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 16:43:54,256 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 16:43:54,256 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 16:43:54,256 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 16:43:54,256 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:43:54,256 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 16:43:54,256 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 16:43:54,256 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr.8_false-unreach-call.1.ufo.BOUNDED-16.pals_true-termination.c_Iteration4_Loop [2018-11-18 16:43:54,256 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 16:43:54,257 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 16:43:54,274 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-11-18 16:43:54,377 WARN L177 XnfTransformerHelper]: Simplifying conjuction of 11205 disjunctions. This might take some time... [2018-11-18 16:43:54,702 INFO L193 XnfTransformerHelper]: Simplified to conjuction of 68 disjunctions. [2018-11-18 16:43:54,707 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-18 16:43:54,717 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-18 16:43:54,720 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-18 16:43:54,722 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-18 16:43:54,726 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-18 16:43:54,727 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-18 16:43:54,728 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-18 16:43:54,733 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-18 16:43:54,737 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-18 16:43:54,739 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-18 16:43:54,740 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-18 16:43:54,741 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-18 16:43:54,744 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-18 16:43:54,926 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 104 [2018-11-18 16:43:54,926 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-18 16:43:54,927 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-18 16:43:54,931 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-18 16:43:54,932 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-18 16:43:54,933 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-18 16:43:54,936 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-18 16:43:54,939 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-18 16:43:54,940 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-18 16:43:54,941 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-18 16:43:54,942 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-18 16:43:54,949 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-18 16:43:54,953 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-18 16:43:54,960 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-18 16:43:54,962 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-18 16:43:54,968 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-18 16:43:54,970 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-18 16:43:54,974 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-18 16:43:54,975 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-18 16:43:54,976 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-18 16:43:54,977 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-18 16:43:54,979 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-18 16:43:54,984 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-18 16:43:54,988 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-18 16:43:54,990 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-18 16:43:54,996 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-18 16:43:54,999 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-18 16:43:55,001 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-18 16:43:55,296 WARN L180 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2018-11-18 16:43:55,414 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-18 16:45:04,308 WARN L180 SmtUtils]: Spent 1.14 m on a formula simplification. DAG size of input: 929 DAG size of output: 257 [2018-11-18 16:45:04,478 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 16:45:04,479 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ccb63e21-9999-4875-af5f-135c7389d65e/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-18 16:45:04,483 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 16:45:04,483 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ccb63e21-9999-4875-af5f-135c7389d65e/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-18 16:45:04,502 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 16:45:04,502 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 16:45:04,587 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 16:45:04,589 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 16:45:04,589 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 16:45:04,589 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 16:45:04,589 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 16:45:04,589 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 16:45:04,589 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:45:04,589 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 16:45:04,589 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 16:45:04,589 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr.8_false-unreach-call.1.ufo.BOUNDED-16.pals_true-termination.c_Iteration4_Loop [2018-11-18 16:45:04,589 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 16:45:04,590 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 16:45:04,594 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-11-18 16:45:04,643 WARN L177 XnfTransformerHelper]: Simplifying conjuction of 11205 disjunctions. This might take some time... [2018-11-18 16:45:05,016 INFO L193 XnfTransformerHelper]: Simplified to conjuction of 68 disjunctions. [2018-11-18 16:45:05,017 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-18 16:45:05,033 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-18 16:45:05,034 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-18 16:45:05,036 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-18 16:45:05,043 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-18 16:45:05,044 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-18 16:45:05,046 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-18 16:45:05,052 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-18 16:45:05,054 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-18 16:45:05,055 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-18 16:45:05,057 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-18 16:45:05,060 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-18 16:45:05,061 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-18 16:45:05,063 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-18 16:45:05,065 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-18 16:45:05,068 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-18 16:45:05,070 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-18 16:45:05,072 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-18 16:45:05,073 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-18 16:45:05,076 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-18 16:45:05,078 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-18 16:45:05,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:45:05,080 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-18 16:45:05,082 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-18 16:45:05,084 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-18 16:45:05,088 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-18 16:45:05,090 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-18 16:45:05,092 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-18 16:45:05,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:45:05,097 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-18 16:45:05,288 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 104 [2018-11-18 16:45:05,288 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-18 16:45:05,290 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-18 16:45:05,291 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-18 16:45:05,292 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-18 16:45:05,293 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-18 16:45:05,296 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-18 16:45:05,298 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-18 16:45:05,305 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-18 16:45:05,307 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-18 16:45:05,309 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-18 16:45:05,654 WARN L180 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2018-11-18 16:45:05,701 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-18 16:46:16,501 WARN L180 SmtUtils]: Spent 1.18 m on a formula simplification. DAG size of input: 929 DAG size of output: 257 [2018-11-18 16:46:16,564 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 16:46:16,569 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 16:46:16,570 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-18 16:46:16,571 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:46:16,571 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:46:16,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:46:16,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:46:16,572 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:46:16,574 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:46:16,574 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:46:16,577 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:46:16,577 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-18 16:46:16,577 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:46:16,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:46:16,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:46:16,578 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:46:16,579 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:46:16,579 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:46:16,580 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:46:16,581 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-18 16:46:16,581 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:46:16,581 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:46:16,581 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:46:16,581 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:46:16,581 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:46:16,582 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:46:16,582 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:46:16,582 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:46:16,582 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-18 16:46:16,583 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:46:16,583 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:46:16,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:46:16,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:46:16,583 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:46:16,583 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:46:16,584 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:46:16,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:46:16,585 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-18 16:46:16,585 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:46:16,585 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:46:16,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:46:16,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:46:16,586 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:46:16,586 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:46:16,586 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:46:16,586 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:46:16,587 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-18 16:46:16,587 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:46:16,587 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:46:16,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:46:16,587 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:46:16,588 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:46:16,588 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:46:16,590 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:46:16,590 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-18 16:46:16,591 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:46:16,591 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:46:16,591 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:46:16,591 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:46:16,591 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:46:16,591 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:46:16,591 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:46:16,593 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:46:16,593 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-18 16:46:16,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:46:16,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:46:16,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:46:16,594 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:46:16,596 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:46:16,596 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:46:16,597 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:46:16,598 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-18 16:46:16,598 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:46:16,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:46:16,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:46:16,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:46:16,599 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:46:16,599 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:46:16,601 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:46:16,601 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-18 16:46:16,601 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:46:16,601 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:46:16,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:46:16,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:46:16,602 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:46:16,602 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:46:16,602 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:46:16,603 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:46:16,603 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-18 16:46:16,603 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:46:16,603 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:46:16,603 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:46:16,603 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:46:16,604 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:46:16,604 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:46:16,604 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:46:16,605 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:46:16,606 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-18 16:46:16,606 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:46:16,606 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:46:16,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:46:16,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:46:16,607 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:46:16,607 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:46:16,607 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:46:16,607 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:46:16,608 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-18 16:46:16,608 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:46:16,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:46:16,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:46:16,608 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:46:16,614 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:46:16,614 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:46:16,616 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:46:16,616 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-18 16:46:16,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:46:16,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:46:16,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:46:16,617 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:46:16,619 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:46:16,620 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:46:16,621 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:46:16,622 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-18 16:46:16,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:46:16,622 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:46:16,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:46:16,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:46:16,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:46:16,623 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:46:16,623 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:46:16,624 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 16:46:16,628 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 16:46:16,628 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 16:46:16,630 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 16:46:16,630 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 16:46:16,630 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 16:46:16,630 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 31 Supporting invariants [] [2018-11-18 16:46:16,631 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 16:46:16,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:46:16,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:46:16,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:46:16,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:46:16,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:46:16,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:46:16,781 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-18 16:46:16,782 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 209 states and 288 transitions. cyclomatic complexity: 80 Second operand 4 states. [2018-11-18 16:46:16,850 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 209 states and 288 transitions. cyclomatic complexity: 80. Second operand 4 states. Result 352 states and 511 transitions. Complement of second has 6 states. [2018-11-18 16:46:16,851 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-18 16:46:16,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 16:46:16,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 182 transitions. [2018-11-18 16:46:16,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 182 transitions. Stem has 65 letters. Loop has 42 letters. [2018-11-18 16:46:16,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:46:16,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 182 transitions. Stem has 107 letters. Loop has 42 letters. [2018-11-18 16:46:16,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:46:16,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 182 transitions. Stem has 65 letters. Loop has 84 letters. [2018-11-18 16:46:16,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:46:16,857 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 352 states and 511 transitions. [2018-11-18 16:46:16,860 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 16:46:16,860 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 352 states to 0 states and 0 transitions. [2018-11-18 16:46:16,860 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 16:46:16,861 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 16:46:16,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 16:46:16,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 16:46:16,861 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 16:46:16,861 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 16:46:16,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:46:16,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:46:16,862 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2018-11-18 16:46:16,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:46:16,862 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-18 16:46:16,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 16:46:16,862 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-18 16:46:16,862 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 16:46:16,862 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 16:46:16,862 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 16:46:16,863 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 16:46:16,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 16:46:16,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 16:46:16,863 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 16:46:16,863 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 16:46:16,863 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 16:46:16,863 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 16:46:16,863 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 16:46:16,863 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 16:46:16,863 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 16:46:16,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 04:46:16 BoogieIcfgContainer [2018-11-18 16:46:16,868 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 16:46:16,869 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 16:46:16,869 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 16:46:16,869 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 16:46:16,869 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:43:47" (3/4) ... [2018-11-18 16:46:16,872 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 16:46:16,872 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 16:46:16,873 INFO L168 Benchmark]: Toolchain (without parser) took 150625.45 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 328.2 MB). Free memory was 956.6 MB in the beginning and 835.3 MB in the end (delta: 121.3 MB). Peak memory consumption was 449.5 MB. Max. memory is 11.5 GB. [2018-11-18 16:46:16,873 INFO L168 Benchmark]: CDTParser took 0.12 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-18 16:46:16,874 INFO L168 Benchmark]: CACSL2BoogieTranslator took 333.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -173.1 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. [2018-11-18 16:46:16,874 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 16:46:16,874 INFO L168 Benchmark]: Boogie Preprocessor took 23.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 16:46:16,875 INFO L168 Benchmark]: RCFGBuilder took 555.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 61.1 MB). Peak memory consumption was 61.1 MB. Max. memory is 11.5 GB. [2018-11-18 16:46:16,875 INFO L168 Benchmark]: BuchiAutomizer took 149672.25 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 192.9 MB). Free memory was 1.1 GB in the beginning and 835.3 MB in the end (delta: 227.8 MB). Peak memory consumption was 420.8 MB. Max. memory is 11.5 GB. [2018-11-18 16:46:16,876 INFO L168 Benchmark]: Witness Printer took 3.43 ms. Allocated memory is still 1.4 GB. Free memory is still 835.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:46:16,878 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.12 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 333.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -173.1 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 555.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 61.1 MB). Peak memory consumption was 61.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 149672.25 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 192.9 MB). Free memory was 1.1 GB in the beginning and 835.3 MB in the end (delta: 227.8 MB). Peak memory consumption was 420.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.43 ms. Allocated memory is still 1.4 GB. Free memory is still 835.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 31 and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 149.6s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 149.0s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 209 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 893 SDtfs, 288 SDslu, 1266 SDs, 0 SdLazy, 32 SolverSat, 66 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital3770 mio100 ax102 hnf100 lsp6 ukn70 mio100 lsp100 div156 bol100 ite100 ukn100 eq175 hnf70 smp100 dnf62042 smp12 tf100 neg98 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 3ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...