./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 c9907cb75ed84c11388be65b346c48a42942e3a6 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 21:21:08,560 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 21:21:08,562 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 21:21:08,577 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 21:21:08,577 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 21:21:08,578 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 21:21:08,580 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 21:21:08,582 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 21:21:08,584 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 21:21:08,585 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 21:21:08,586 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 21:21:08,588 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 21:21:08,588 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 21:21:08,589 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 21:21:08,590 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 21:21:08,592 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 21:21:08,593 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 21:21:08,594 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 21:21:08,596 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 21:21:08,598 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 21:21:08,600 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 21:21:08,601 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 21:21:08,602 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 21:21:08,603 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 21:21:08,606 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 21:21:08,606 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 21:21:08,606 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 21:21:08,608 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 21:21:08,608 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 21:21:08,609 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 21:21:08,610 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 21:21:08,611 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 21:21:08,612 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 21:21:08,613 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 21:21:08,614 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 21:21:08,614 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 21:21:08,615 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 21:21:08,615 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 21:21:08,616 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 21:21:08,617 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 21:21:08,618 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 21:21:08,619 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 21:21:08,636 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 21:21:08,636 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 21:21:08,638 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 21:21:08,638 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 21:21:08,639 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 21:21:08,639 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 21:21:08,639 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 21:21:08,640 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 21:21:08,640 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 21:21:08,640 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 21:21:08,641 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 21:21:08,641 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 21:21:08,641 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 21:21:08,642 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 21:21:08,642 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 21:21:08,642 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 21:21:08,643 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 21:21:08,643 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 21:21:08,643 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 21:21:08,644 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 21:21:08,644 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 21:21:08,644 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 21:21:08,644 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 21:21:08,645 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 21:21:08,645 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 21:21:08,646 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 21:21:08,646 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 21:21:08,646 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 21:21:08,647 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 21:21:08,647 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 21:21:08,647 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 21:21:08,647 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 21:21:08,649 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 21:21:08,649 INFO L138 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> c9907cb75ed84c11388be65b346c48a42942e3a6 [2019-11-28 21:21:08,985 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 21:21:09,001 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 21:21:09,007 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 21:21:09,009 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 21:21:09,010 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 21:21:09,010 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c [2019-11-28 21:21:09,086 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9eb87cb6/e7d9c6316d7f4dcd98ac6e7675912fef/FLAGbc3a815f0 [2019-11-28 21:21:09,659 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 21:21:09,660 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c [2019-11-28 21:21:09,675 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9eb87cb6/e7d9c6316d7f4dcd98ac6e7675912fef/FLAGbc3a815f0 [2019-11-28 21:21:09,989 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9eb87cb6/e7d9c6316d7f4dcd98ac6e7675912fef [2019-11-28 21:21:09,992 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 21:21:09,994 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 21:21:09,996 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 21:21:09,996 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 21:21:10,000 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 21:21:10,001 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 09:21:09" (1/1) ... [2019-11-28 21:21:10,004 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4143b3b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:21:10, skipping insertion in model container [2019-11-28 21:21:10,004 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 09:21:09" (1/1) ... [2019-11-28 21:21:10,011 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 21:21:10,061 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 21:21:10,381 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 21:21:10,391 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 21:21:10,476 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 21:21:10,505 INFO L208 MainTranslator]: Completed translation [2019-11-28 21:21:10,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:21:10 WrapperNode [2019-11-28 21:21:10,506 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 21:21:10,507 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 21:21:10,507 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 21:21:10,507 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 21:21:10,514 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:21:10" (1/1) ... [2019-11-28 21:21:10,524 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:21:10" (1/1) ... [2019-11-28 21:21:10,566 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 21:21:10,567 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 21:21:10,567 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 21:21:10,567 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 21:21:10,577 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:21:10" (1/1) ... [2019-11-28 21:21:10,577 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:21:10" (1/1) ... [2019-11-28 21:21:10,582 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:21:10" (1/1) ... [2019-11-28 21:21:10,582 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:21:10" (1/1) ... [2019-11-28 21:21:10,593 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:21:10" (1/1) ... [2019-11-28 21:21:10,602 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:21:10" (1/1) ... [2019-11-28 21:21:10,606 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:21:10" (1/1) ... [2019-11-28 21:21:10,612 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 21:21:10,612 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 21:21:10,613 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 21:21:10,613 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 21:21:10,614 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:21:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-28 21:21:10,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 21:21:10,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 21:21:11,499 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 21:21:11,501 INFO L287 CfgBuilder]: Removed 23 assume(true) statements. [2019-11-28 21:21:11,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 09:21:11 BoogieIcfgContainer [2019-11-28 21:21:11,502 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 21:21:11,503 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 21:21:11,503 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 21:21:11,507 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 21:21:11,508 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:21:11,509 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 09:21:09" (1/3) ... [2019-11-28 21:21:11,510 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@31643719 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 09:21:11, skipping insertion in model container [2019-11-28 21:21:11,510 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:21:11,511 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:21:10" (2/3) ... [2019-11-28 21:21:11,511 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@31643719 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 09:21:11, skipping insertion in model container [2019-11-28 21:21:11,511 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:21:11,511 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 09:21:11" (3/3) ... [2019-11-28 21:21:11,514 INFO L371 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c [2019-11-28 21:21:11,568 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 21:21:11,568 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 21:21:11,570 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 21:21:11,570 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 21:21:11,571 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 21:21:11,571 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 21:21:11,572 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 21:21:11,572 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 21:21:11,593 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 139 states. [2019-11-28 21:21:11,625 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2019-11-28 21:21:11,625 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:21:11,626 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:21:11,635 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 21:21:11,636 INFO L850 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] [2019-11-28 21:21:11,636 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 21:21:11,636 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 139 states. [2019-11-28 21:21:11,645 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2019-11-28 21:21:11,646 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:21:11,646 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:21:11,648 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 21:21:11,648 INFO L850 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] [2019-11-28 21:21:11,656 INFO L794 eck$LassoCheckResult]: Stem: 102#ULTIMATE.startENTRYtrue ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~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]; 12#L-1true havoc main_#res;havoc 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~nondet41, main_#t~ret42, main_#t~ret43, main_#t~post44, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~st1~0 := main_#t~nondet13;havoc main_#t~nondet13;~send1~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode1~0 := main_#t~nondet15;havoc main_#t~nondet15;~alive1~0 := main_#t~nondet16;havoc main_#t~nondet16;~id2~0 := main_#t~nondet17;havoc main_#t~nondet17;~st2~0 := main_#t~nondet18;havoc main_#t~nondet18;~send2~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode2~0 := main_#t~nondet20;havoc main_#t~nondet20;~alive2~0 := main_#t~nondet21;havoc main_#t~nondet21;~id3~0 := main_#t~nondet22;havoc main_#t~nondet22;~st3~0 := main_#t~nondet23;havoc main_#t~nondet23;~send3~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode3~0 := main_#t~nondet25;havoc main_#t~nondet25;~alive3~0 := main_#t~nondet26;havoc main_#t~nondet26;~id4~0 := main_#t~nondet27;havoc main_#t~nondet27;~st4~0 := main_#t~nondet28;havoc main_#t~nondet28;~send4~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode4~0 := main_#t~nondet30;havoc main_#t~nondet30;~alive4~0 := main_#t~nondet31;havoc main_#t~nondet31;~id5~0 := main_#t~nondet32;havoc main_#t~nondet32;~st5~0 := main_#t~nondet33;havoc main_#t~nondet33;~send5~0 := main_#t~nondet34;havoc main_#t~nondet34;~mode5~0 := main_#t~nondet35;havoc main_#t~nondet35;~alive5~0 := main_#t~nondet36;havoc main_#t~nondet36;~id6~0 := main_#t~nondet37;havoc main_#t~nondet37;~st6~0 := main_#t~nondet38;havoc main_#t~nondet38;~send6~0 := main_#t~nondet39;havoc main_#t~nondet39;~mode6~0 := main_#t~nondet40;havoc main_#t~nondet40;~alive6~0 := main_#t~nondet41;havoc main_#t~nondet41;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 15#L329true assume !(0 == ~r1~0);init_~tmp~0 := 0; 17#L329-1true init_#res := init_~tmp~0; 21#L494true main_#t~ret42 := init_#res;main_~i2~0 := main_#t~ret42;havoc main_#t~ret42;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;main_~i2~0 := 0; 69#L570-2true [2019-11-28 21:21:11,657 INFO L796 eck$LassoCheckResult]: Loop: 69#L570-2true assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 110#L126true 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 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 65#L130true assume !(node1_~m1~0 != ~nomsg~0); 64#L130-1true ~mode1~0 := 0; 107#L126-2true havoc node2_#t~ite1, node2_#t~ite2, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 24#L158true assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 29#L161true assume !(node2_~m2~0 != ~nomsg~0); 28#L161-1true ~mode2~0 := 0; 22#L158-2true havoc node3_#t~ite3, node3_#t~ite4, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 133#L192true assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 120#L195true assume !(node3_~m3~0 != ~nomsg~0); 119#L195-1true ~mode3~0 := 0; 112#L192-2true havoc node4_#t~ite5, node4_#t~ite6, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 81#L226true assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 54#L229true assume !(node4_~m4~0 != ~nomsg~0); 68#L229-1true ~mode4~0 := 0; 78#L226-2true havoc node5_#t~ite7, node5_#t~ite8, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 35#L260true assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 11#L263true assume !(node5_~m5~0 != ~nomsg~0); 6#L263-1true ~mode5~0 := 0; 33#L260-2true havoc node6_#t~ite9, node6_#t~ite10, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 106#L294true assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 100#L297true assume !(node6_~m6~0 != ~nomsg~0); 99#L297-1true ~mode6~0 := 0; 122#L294-2true ~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;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 45#L502true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1 := 0; 47#L502-1true check_#res := check_~tmp~1; 126#L514true main_#t~ret43 := check_#res;main_~c1~0 := main_#t~ret43;havoc main_#t~ret43;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 85#L603true assume !(0 == assert_~arg % 256); 58#L598true main_#t~post44 := main_~i2~0;main_~i2~0 := 1 + main_#t~post44;havoc main_#t~post44; 69#L570-2true [2019-11-28 21:21:11,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:21:11,664 INFO L82 PathProgramCache]: Analyzing trace with hash 28934070, now seen corresponding path program 1 times [2019-11-28 21:21:11,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:21:11,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967635023] [2019-11-28 21:21:11,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:21:11,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:21:11,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:21:11,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967635023] [2019-11-28 21:21:11,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:21:11,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 21:21:11,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989487663] [2019-11-28 21:21:11,961 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 21:21:11,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:21:11,962 INFO L82 PathProgramCache]: Analyzing trace with hash 448128979, now seen corresponding path program 1 times [2019-11-28 21:21:11,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:21:11,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185009952] [2019-11-28 21:21:11,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:21:12,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:21:12,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:21:12,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185009952] [2019-11-28 21:21:12,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:21:12,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 21:21:12,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227971012] [2019-11-28 21:21:12,149 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 21:21:12,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:21:12,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 21:21:12,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 21:21:12,170 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 4 states. [2019-11-28 21:21:12,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:21:12,297 INFO L93 Difference]: Finished difference Result 141 states and 236 transitions. [2019-11-28 21:21:12,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 21:21:12,299 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 141 states and 236 transitions. [2019-11-28 21:21:12,305 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2019-11-28 21:21:12,312 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 141 states to 134 states and 189 transitions. [2019-11-28 21:21:12,313 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 134 [2019-11-28 21:21:12,314 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 134 [2019-11-28 21:21:12,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 134 states and 189 transitions. [2019-11-28 21:21:12,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:21:12,317 INFO L688 BuchiCegarLoop]: Abstraction has 134 states and 189 transitions. [2019-11-28 21:21:12,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states and 189 transitions. [2019-11-28 21:21:12,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2019-11-28 21:21:12,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-11-28 21:21:12,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 189 transitions. [2019-11-28 21:21:12,352 INFO L711 BuchiCegarLoop]: Abstraction has 134 states and 189 transitions. [2019-11-28 21:21:12,352 INFO L591 BuchiCegarLoop]: Abstraction has 134 states and 189 transitions. [2019-11-28 21:21:12,352 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 21:21:12,352 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 134 states and 189 transitions. [2019-11-28 21:21:12,355 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2019-11-28 21:21:12,356 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:21:12,356 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:21:12,358 INFO L849 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] [2019-11-28 21:21:12,359 INFO L850 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] [2019-11-28 21:21:12,359 INFO L794 eck$LassoCheckResult]: Stem: 423#ULTIMATE.startENTRY ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~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]; 316#L-1 havoc main_#res;havoc 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~nondet41, main_#t~ret42, main_#t~ret43, main_#t~post44, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~st1~0 := main_#t~nondet13;havoc main_#t~nondet13;~send1~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode1~0 := main_#t~nondet15;havoc main_#t~nondet15;~alive1~0 := main_#t~nondet16;havoc main_#t~nondet16;~id2~0 := main_#t~nondet17;havoc main_#t~nondet17;~st2~0 := main_#t~nondet18;havoc main_#t~nondet18;~send2~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode2~0 := main_#t~nondet20;havoc main_#t~nondet20;~alive2~0 := main_#t~nondet21;havoc main_#t~nondet21;~id3~0 := main_#t~nondet22;havoc main_#t~nondet22;~st3~0 := main_#t~nondet23;havoc main_#t~nondet23;~send3~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode3~0 := main_#t~nondet25;havoc main_#t~nondet25;~alive3~0 := main_#t~nondet26;havoc main_#t~nondet26;~id4~0 := main_#t~nondet27;havoc main_#t~nondet27;~st4~0 := main_#t~nondet28;havoc main_#t~nondet28;~send4~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode4~0 := main_#t~nondet30;havoc main_#t~nondet30;~alive4~0 := main_#t~nondet31;havoc main_#t~nondet31;~id5~0 := main_#t~nondet32;havoc main_#t~nondet32;~st5~0 := main_#t~nondet33;havoc main_#t~nondet33;~send5~0 := main_#t~nondet34;havoc main_#t~nondet34;~mode5~0 := main_#t~nondet35;havoc main_#t~nondet35;~alive5~0 := main_#t~nondet36;havoc main_#t~nondet36;~id6~0 := main_#t~nondet37;havoc main_#t~nondet37;~st6~0 := main_#t~nondet38;havoc main_#t~nondet38;~send6~0 := main_#t~nondet39;havoc main_#t~nondet39;~mode6~0 := main_#t~nondet40;havoc main_#t~nondet40;~alive6~0 := main_#t~nondet41;havoc main_#t~nondet41;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 317#L329 assume 0 == ~r1~0; 320#L330 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; 391#L331 assume ~id1~0 >= 0; 314#L332 assume 0 == ~st1~0; 315#L333 assume ~send1~0 == ~id1~0; 362#L334 assume 0 == ~mode1~0 % 256; 363#L335 assume ~id2~0 >= 0; 415#L336 assume 0 == ~st2~0; 354#L337 assume ~send2~0 == ~id2~0; 355#L338 assume 0 == ~mode2~0 % 256; 395#L339 assume ~id3~0 >= 0; 318#L340 assume 0 == ~st3~0; 319#L341 assume ~send3~0 == ~id3~0; 390#L342 assume 0 == ~mode3~0 % 256; 310#L343 assume ~id4~0 >= 0; 311#L344 assume 0 == ~st4~0; 360#L345 assume ~send4~0 == ~id4~0; 361#L346 assume 0 == ~mode4~0 % 256; 414#L347 assume ~id5~0 >= 0; 351#L348 assume 0 == ~st5~0; 352#L349 assume ~send5~0 == ~id5~0; 394#L350 assume 0 == ~mode5~0 % 256; 343#L351 assume ~id6~0 >= 0; 344#L352 assume 0 == ~st6~0; 388#L353 assume ~send6~0 == ~id6~0; 308#L354 assume 0 == ~mode6~0 % 256; 309#L355 assume ~id1~0 != ~id2~0; 358#L356 assume ~id1~0 != ~id3~0; 359#L357 assume ~id1~0 != ~id4~0; 412#L358 assume ~id1~0 != ~id5~0; 349#L359 assume ~id1~0 != ~id6~0; 350#L360 assume ~id2~0 != ~id3~0; 393#L361 assume ~id2~0 != ~id4~0; 341#L362 assume ~id2~0 != ~id5~0; 342#L363 assume ~id2~0 != ~id6~0; 387#L364 assume ~id3~0 != ~id4~0; 303#L365 assume ~id3~0 != ~id5~0; 304#L366 assume ~id3~0 != ~id6~0; 384#L367 assume ~id4~0 != ~id5~0; 385#L368 assume ~id4~0 != ~id6~0; 410#L369 assume ~id5~0 != ~id6~0;init_~tmp~0 := 1; 327#L329-1 init_#res := init_~tmp~0; 328#L494 main_#t~ret42 := init_#res;main_~i2~0 := main_#t~ret42;havoc main_#t~ret42;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;main_~i2~0 := 0; 334#L570-2 [2019-11-28 21:21:12,360 INFO L796 eck$LassoCheckResult]: Loop: 334#L570-2 assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 400#L126 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 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 396#L130 assume !(node1_~m1~0 != ~nomsg~0); 330#L130-1 ~mode1~0 := 0; 383#L126-2 havoc node2_#t~ite1, node2_#t~ite2, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 339#L158 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 340#L161 assume !(node2_~m2~0 != ~nomsg~0); 347#L161-1 ~mode2~0 := 0; 335#L158-2 havoc node3_#t~ite3, node3_#t~ite4, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 336#L192 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 424#L195 assume !(node3_~m3~0 != ~nomsg~0); 299#L195-1 ~mode3~0 := 0; 404#L192-2 havoc node4_#t~ite5, node4_#t~ite6, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 411#L226 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 386#L229 assume !(node4_~m4~0 != ~nomsg~0); 306#L229-1 ~mode4~0 := 0; 346#L226-2 havoc node5_#t~ite7, node5_#t~ite8, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 357#L260 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 312#L263 assume !(node5_~m5~0 != ~nomsg~0); 301#L263-1 ~mode5~0 := 0; 302#L260-2 havoc node6_#t~ite9, node6_#t~ite10, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 353#L294 assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 422#L297 assume !(node6_~m6~0 != ~nomsg~0); 325#L297-1 ~mode6~0 := 0; 399#L294-2 ~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;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 372#L502 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1 := 0; 373#L502-1 check_#res := check_~tmp~1; 378#L514 main_#t~ret43 := check_#res;main_~c1~0 := main_#t~ret43;havoc main_#t~ret43;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 413#L603 assume !(0 == assert_~arg % 256); 389#L598 main_#t~post44 := main_~i2~0;main_~i2~0 := 1 + main_#t~post44;havoc main_#t~post44; 334#L570-2 [2019-11-28 21:21:12,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:21:12,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1302395264, now seen corresponding path program 1 times [2019-11-28 21:21:12,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:21:12,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465815305] [2019-11-28 21:21:12,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:21:12,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:21:12,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:21:12,530 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:21:12,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:21:12,531 INFO L82 PathProgramCache]: Analyzing trace with hash 448128979, now seen corresponding path program 2 times [2019-11-28 21:21:12,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:21:12,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864078387] [2019-11-28 21:21:12,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:21:12,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:21:12,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:21:12,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864078387] [2019-11-28 21:21:12,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:21:12,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 21:21:12,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216971065] [2019-11-28 21:21:12,683 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 21:21:12,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:21:12,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 21:21:12,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 21:21:12,684 INFO L87 Difference]: Start difference. First operand 134 states and 189 transitions. cyclomatic complexity: 56 Second operand 5 states. [2019-11-28 21:21:12,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:21:12,761 INFO L93 Difference]: Finished difference Result 137 states and 191 transitions. [2019-11-28 21:21:12,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 21:21:12,765 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 137 states and 191 transitions. [2019-11-28 21:21:12,770 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2019-11-28 21:21:12,775 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 137 states to 134 states and 187 transitions. [2019-11-28 21:21:12,778 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 134 [2019-11-28 21:21:12,779 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 134 [2019-11-28 21:21:12,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 134 states and 187 transitions. [2019-11-28 21:21:12,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:21:12,783 INFO L688 BuchiCegarLoop]: Abstraction has 134 states and 187 transitions. [2019-11-28 21:21:12,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states and 187 transitions. [2019-11-28 21:21:12,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2019-11-28 21:21:12,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-11-28 21:21:12,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 187 transitions. [2019-11-28 21:21:12,806 INFO L711 BuchiCegarLoop]: Abstraction has 134 states and 187 transitions. [2019-11-28 21:21:12,807 INFO L591 BuchiCegarLoop]: Abstraction has 134 states and 187 transitions. [2019-11-28 21:21:12,807 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 21:21:12,807 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 134 states and 187 transitions. [2019-11-28 21:21:12,809 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2019-11-28 21:21:12,809 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:21:12,810 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:21:12,814 INFO L849 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] [2019-11-28 21:21:12,815 INFO L850 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] [2019-11-28 21:21:12,816 INFO L794 eck$LassoCheckResult]: Stem: 706#ULTIMATE.startENTRY ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~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]; 599#L-1 havoc main_#res;havoc 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~nondet41, main_#t~ret42, main_#t~ret43, main_#t~post44, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~st1~0 := main_#t~nondet13;havoc main_#t~nondet13;~send1~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode1~0 := main_#t~nondet15;havoc main_#t~nondet15;~alive1~0 := main_#t~nondet16;havoc main_#t~nondet16;~id2~0 := main_#t~nondet17;havoc main_#t~nondet17;~st2~0 := main_#t~nondet18;havoc main_#t~nondet18;~send2~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode2~0 := main_#t~nondet20;havoc main_#t~nondet20;~alive2~0 := main_#t~nondet21;havoc main_#t~nondet21;~id3~0 := main_#t~nondet22;havoc main_#t~nondet22;~st3~0 := main_#t~nondet23;havoc main_#t~nondet23;~send3~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode3~0 := main_#t~nondet25;havoc main_#t~nondet25;~alive3~0 := main_#t~nondet26;havoc main_#t~nondet26;~id4~0 := main_#t~nondet27;havoc main_#t~nondet27;~st4~0 := main_#t~nondet28;havoc main_#t~nondet28;~send4~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode4~0 := main_#t~nondet30;havoc main_#t~nondet30;~alive4~0 := main_#t~nondet31;havoc main_#t~nondet31;~id5~0 := main_#t~nondet32;havoc main_#t~nondet32;~st5~0 := main_#t~nondet33;havoc main_#t~nondet33;~send5~0 := main_#t~nondet34;havoc main_#t~nondet34;~mode5~0 := main_#t~nondet35;havoc main_#t~nondet35;~alive5~0 := main_#t~nondet36;havoc main_#t~nondet36;~id6~0 := main_#t~nondet37;havoc main_#t~nondet37;~st6~0 := main_#t~nondet38;havoc main_#t~nondet38;~send6~0 := main_#t~nondet39;havoc main_#t~nondet39;~mode6~0 := main_#t~nondet40;havoc main_#t~nondet40;~alive6~0 := main_#t~nondet41;havoc main_#t~nondet41;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 600#L329 assume 0 == ~r1~0; 603#L330 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; 674#L331 assume ~id1~0 >= 0; 597#L332 assume 0 == ~st1~0; 598#L333 assume ~send1~0 == ~id1~0; 645#L334 assume 0 == ~mode1~0 % 256; 646#L335 assume ~id2~0 >= 0; 698#L336 assume 0 == ~st2~0; 637#L337 assume ~send2~0 == ~id2~0; 638#L338 assume 0 == ~mode2~0 % 256; 678#L339 assume ~id3~0 >= 0; 601#L340 assume 0 == ~st3~0; 602#L341 assume ~send3~0 == ~id3~0; 673#L342 assume 0 == ~mode3~0 % 256; 593#L343 assume ~id4~0 >= 0; 594#L344 assume 0 == ~st4~0; 643#L345 assume ~send4~0 == ~id4~0; 644#L346 assume 0 == ~mode4~0 % 256; 697#L347 assume ~id5~0 >= 0; 634#L348 assume 0 == ~st5~0; 635#L349 assume ~send5~0 == ~id5~0; 677#L350 assume 0 == ~mode5~0 % 256; 628#L351 assume ~id6~0 >= 0; 629#L352 assume 0 == ~st6~0; 671#L353 assume ~send6~0 == ~id6~0; 591#L354 assume 0 == ~mode6~0 % 256; 592#L355 assume ~id1~0 != ~id2~0; 641#L356 assume ~id1~0 != ~id3~0; 642#L357 assume ~id1~0 != ~id4~0; 695#L358 assume ~id1~0 != ~id5~0; 632#L359 assume ~id1~0 != ~id6~0; 633#L360 assume ~id2~0 != ~id3~0; 676#L361 assume ~id2~0 != ~id4~0; 624#L362 assume ~id2~0 != ~id5~0; 625#L363 assume ~id2~0 != ~id6~0; 670#L364 assume ~id3~0 != ~id4~0; 589#L365 assume ~id3~0 != ~id5~0; 590#L366 assume ~id3~0 != ~id6~0; 667#L367 assume ~id4~0 != ~id5~0; 668#L368 assume ~id4~0 != ~id6~0; 694#L369 assume ~id5~0 != ~id6~0;init_~tmp~0 := 1; 610#L329-1 init_#res := init_~tmp~0; 611#L494 main_#t~ret42 := init_#res;main_~i2~0 := main_#t~ret42;havoc main_#t~ret42;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;main_~i2~0 := 0; 617#L570-2 [2019-11-28 21:21:12,817 INFO L796 eck$LassoCheckResult]: Loop: 617#L570-2 assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 683#L126 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 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 679#L130 assume !(node1_~m1~0 != ~nomsg~0); 613#L130-1 ~mode1~0 := 0; 666#L126-2 havoc node2_#t~ite1, node2_#t~ite2, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 622#L158 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 623#L161 assume !(node2_~m2~0 != ~nomsg~0); 630#L161-1 ~mode2~0 := 0; 618#L158-2 havoc node3_#t~ite3, node3_#t~ite4, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 619#L192 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 707#L195 assume !(node3_~m3~0 != ~nomsg~0); 582#L195-1 ~mode3~0 := 0; 687#L192-2 havoc node4_#t~ite5, node4_#t~ite6, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 693#L226 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 669#L229 assume !(node4_~m4~0 != ~nomsg~0); 585#L229-1 ~mode4~0 := 0; 627#L226-2 havoc node5_#t~ite7, node5_#t~ite8, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 640#L260 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 595#L263 assume !(node5_~m5~0 != ~nomsg~0); 587#L263-1 ~mode5~0 := 0; 588#L260-2 havoc node6_#t~ite9, node6_#t~ite10, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 636#L294 assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 705#L297 assume !(node6_~m6~0 != ~nomsg~0); 608#L297-1 ~mode6~0 := 0; 682#L294-2 ~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;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 655#L502 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; 656#L503 assume ~r1~0 < 6;check_~tmp~1 := 1; 660#L502-1 check_#res := check_~tmp~1; 661#L514 main_#t~ret43 := check_#res;main_~c1~0 := main_#t~ret43;havoc main_#t~ret43;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 696#L603 assume !(0 == assert_~arg % 256); 672#L598 main_#t~post44 := main_~i2~0;main_~i2~0 := 1 + main_#t~post44;havoc main_#t~post44; 617#L570-2 [2019-11-28 21:21:12,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:21:12,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1302395264, now seen corresponding path program 2 times [2019-11-28 21:21:12,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:21:12,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299942070] [2019-11-28 21:21:12,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:21:12,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:21:12,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:21:12,965 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:21:12,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:21:12,966 INFO L82 PathProgramCache]: Analyzing trace with hash 623769500, now seen corresponding path program 1 times [2019-11-28 21:21:12,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:21:12,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109427750] [2019-11-28 21:21:12,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:21:12,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:21:13,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:21:13,036 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:21:13,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:21:13,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1738677955, now seen corresponding path program 1 times [2019-11-28 21:21:13,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:21:13,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191263028] [2019-11-28 21:21:13,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:21:13,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:21:13,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:21:13,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191263028] [2019-11-28 21:21:13,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:21:13,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 21:21:13,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693513905] [2019-11-28 21:21:13,824 WARN L192 SmtUtils]: Spent 671.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 157 [2019-11-28 21:21:14,885 WARN L192 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 139 DAG size of output: 134 [2019-11-28 21:21:14,906 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:21:14,908 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:21:14,909 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:21:14,909 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:21:14,909 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 21:21:14,909 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:21:14,909 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:21:14,910 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:21:14,910 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_Iteration3_Loop [2019-11-28 21:21:14,910 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:21:14,910 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:21:14,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:14,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:14,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:14,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:14,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:14,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:15,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:15,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:15,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:15,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:15,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:15,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:15,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:15,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:15,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:15,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:15,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:15,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:15,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:15,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:15,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:15,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:15,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:15,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:15,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:15,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:15,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:15,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:15,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:15,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:15,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:15,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:15,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:15,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:15,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:15,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:15,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:15,491 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-11-28 21:21:15,977 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-11-28 21:21:16,233 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:21:16,235 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-28 21:21:16,246 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:21:16,246 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-28 21:21:16,277 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 21:21:16,277 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 21:21:16,413 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 21:21:16,420 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:21:16,420 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:21:16,421 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:21:16,421 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:21:16,421 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 21:21:16,421 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:21:16,421 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:21:16,422 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:21:16,422 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c_Iteration3_Loop [2019-11-28 21:21:16,422 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:21:16,422 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:21:16,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:16,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:16,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:16,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:16,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:16,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:16,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:16,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:16,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:16,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:16,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:16,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:16,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:16,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:16,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:16,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:16,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:16,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:16,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:16,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:16,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:16,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:16,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:16,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:16,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:16,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:16,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:16,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:16,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:16,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:16,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:16,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:16,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:16,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:16,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:16,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:16,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:17,181 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-11-28 21:21:17,561 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-11-28 21:21:17,608 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:21:17,614 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:21:17,624 INFO L120 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 [2019-11-28 21:21:17,626 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:21:17,627 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:21:17,627 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:21:17,628 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:21:17,628 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:21:17,631 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:21:17,631 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:21:17,635 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:21:17,642 INFO L120 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 [2019-11-28 21:21:17,643 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:21:17,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:21:17,644 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:21:17,644 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:21:17,647 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:21:17,647 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:21:17,656 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:21:17,667 INFO L120 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 [2019-11-28 21:21:17,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:21:17,669 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:21:17,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:21:17,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:21:17,670 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:21:17,671 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:21:17,671 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:21:17,673 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:21:17,689 INFO L120 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 [2019-11-28 21:21:17,691 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:21:17,691 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:21:17,691 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:21:17,691 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:21:17,694 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:21:17,694 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:21:17,700 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:21:17,711 INFO L120 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 [2019-11-28 21:21:17,713 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:21:17,713 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:21:17,713 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:21:17,713 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:21:17,713 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:21:17,717 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:21:17,717 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:21:17,721 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:21:17,731 INFO L120 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 [2019-11-28 21:21:17,733 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:21:17,733 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:21:17,733 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:21:17,733 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:21:17,734 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:21:17,734 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:21:17,734 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:21:17,742 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:21:17,750 INFO L120 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 [2019-11-28 21:21:17,752 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:21:17,752 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:21:17,752 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:21:17,752 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:21:17,752 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:21:17,753 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:21:17,753 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:21:17,754 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:21:17,760 INFO L120 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 [2019-11-28 21:21:17,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:21:17,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:21:17,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:21:17,761 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:21:17,764 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:21:17,765 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:21:17,783 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:21:17,804 INFO L120 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 [2019-11-28 21:21:17,806 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:21:17,806 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:21:17,807 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:21:17,807 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 21:21:17,807 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:21:17,810 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-28 21:21:17,810 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:21:17,815 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:21:17,823 INFO L120 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 [2019-11-28 21:21:17,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:21:17,825 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:21:17,825 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:21:17,826 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:21:17,831 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:21:17,831 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:21:17,835 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:21:17,845 INFO L120 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 [2019-11-28 21:21:17,847 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:21:17,848 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:21:17,848 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:21:17,848 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:21:17,848 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:21:17,849 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:21:17,850 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:21:17,852 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:21:17,859 INFO L120 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 Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:21:17,860 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:21:17,860 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:21:17,860 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:21:17,861 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:21:17,862 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:21:17,862 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:21:17,866 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:21:17,871 INFO L120 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 [2019-11-28 21:21:17,873 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:21:17,873 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:21:17,873 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:21:17,873 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:21:17,873 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:21:17,876 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:21:17,876 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:21:17,877 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:21:17,888 INFO L120 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 [2019-11-28 21:21:17,890 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:21:17,890 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:21:17,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:21:17,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:21:17,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:21:17,892 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:21:17,892 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:21:17,893 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:21:17,908 INFO L120 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 Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:21:17,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:21:17,910 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:21:17,910 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:21:17,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:21:17,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:21:17,911 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:21:17,911 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:21:17,912 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:21:17,920 INFO L120 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 [2019-11-28 21:21:17,921 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:21:17,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:21:17,922 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:21:17,922 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:21:17,923 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 21:21:17,923 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 21:21:17,926 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:21:17,938 INFO L120 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 [2019-11-28 21:21:17,939 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:21:17,939 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:21:17,940 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:21:17,940 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:21:17,940 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:21:17,941 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:21:17,941 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:21:17,943 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:21:17,950 INFO L120 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 [2019-11-28 21:21:17,951 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:21:17,951 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:21:17,951 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:21:17,951 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:21:17,951 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:21:17,952 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:21:17,952 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:21:17,960 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 21:21:17,970 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 21:21:17,970 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:21:17,977 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 21:21:17,977 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 21:21:17,978 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 21:21:17,978 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 23 Supporting invariants [] Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:21:17,983 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 21:21:18,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:21:18,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:21:18,079 INFO L264 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 21:21:18,083 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:21:18,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:21:18,120 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 21:21:18,122 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:21:18,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:21:18,201 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 [2019-11-28 21:21:18,202 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 134 states and 187 transitions. cyclomatic complexity: 54 Second operand 3 states. [2019-11-28 21:21:18,281 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 134 states and 187 transitions. cyclomatic complexity: 54. Second operand 3 states. Result 223 states and 330 transitions. Complement of second has 4 states. [2019-11-28 21:21:18,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 21:21:18,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 21:21:18,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 187 transitions. [2019-11-28 21:21:18,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 187 transitions. Stem has 45 letters. Loop has 31 letters. [2019-11-28 21:21:18,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:21:18,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 187 transitions. Stem has 76 letters. Loop has 31 letters. [2019-11-28 21:21:18,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:21:18,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 187 transitions. Stem has 45 letters. Loop has 62 letters. [2019-11-28 21:21:18,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:21:18,290 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 223 states and 330 transitions. [2019-11-28 21:21:18,294 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 21:21:18,294 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 223 states to 0 states and 0 transitions. [2019-11-28 21:21:18,294 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 21:21:18,294 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 21:21:18,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 21:21:18,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:21:18,295 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 21:21:18,295 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 21:21:18,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:21:18,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 21:21:18,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 21:21:18,296 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2019-11-28 21:21:18,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:21:18,296 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-11-28 21:21:18,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 21:21:18,296 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-11-28 21:21:18,296 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 21:21:18,296 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 21:21:18,297 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 21:21:18,298 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 21:21:18,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 21:21:18,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:21:18,299 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 21:21:18,300 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 21:21:18,300 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 21:21:18,300 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 21:21:18,300 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 21:21:18,300 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 21:21:18,301 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 21:21:18,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 09:21:18 BoogieIcfgContainer [2019-11-28 21:21:18,306 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 21:21:18,306 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 21:21:18,306 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 21:21:18,307 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 21:21:18,307 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 09:21:11" (3/4) ... [2019-11-28 21:21:18,311 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 21:21:18,311 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 21:21:18,312 INFO L168 Benchmark]: Toolchain (without parser) took 8318.81 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 287.8 MB). Free memory was 960.4 MB in the beginning and 937.2 MB in the end (delta: 23.1 MB). Peak memory consumption was 311.0 MB. Max. memory is 11.5 GB. [2019-11-28 21:21:18,313 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 21:21:18,314 INFO L168 Benchmark]: CACSL2BoogieTranslator took 510.42 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -130.2 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. [2019-11-28 21:21:18,314 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.40 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 21:21:18,315 INFO L168 Benchmark]: Boogie Preprocessor took 45.49 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-11-28 21:21:18,315 INFO L168 Benchmark]: RCFGBuilder took 890.04 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 59.3 MB). Peak memory consumption was 59.3 MB. Max. memory is 11.5 GB. [2019-11-28 21:21:18,316 INFO L168 Benchmark]: BuchiAutomizer took 6803.12 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 186.6 MB). Free memory was 1.0 GB in the beginning and 937.2 MB in the end (delta: 85.5 MB). Peak memory consumption was 272.2 MB. Max. memory is 11.5 GB. [2019-11-28 21:21:18,316 INFO L168 Benchmark]: Witness Printer took 4.43 ms. Allocated memory is still 1.3 GB. Free memory is still 937.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 21:21:18,320 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 510.42 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -130.2 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 59.40 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.49 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 890.04 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 59.3 MB). Peak memory consumption was 59.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6803.12 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 186.6 MB). Free memory was 1.0 GB in the beginning and 937.2 MB in the end (delta: 85.5 MB). Peak memory consumption was 272.2 MB. Max. memory is 11.5 GB. * Witness Printer took 4.43 ms. Allocated memory is still 1.3 GB. Free memory is still 937.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 23 and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.7s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 5.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 134 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 606 SDtfs, 188 SDslu, 1118 SDs, 0 SdLazy, 22 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital347 mio100 ax121 hnf105 lsp16 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq229 hnf85 smp100 dnf100 smp100 tf101 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 18ms 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...