./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/elevator_spec2_product24_false-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: 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 /storage/repos/svcomp/c/product-lines/elevator_spec2_product24_false-unreach-call_true-termination.cil.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 093479089abdaadb7e9be964d84aa50a0bea01c9 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 04:01:18,544 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:01:18,546 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:01:18,560 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:01:18,560 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:01:18,561 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:01:18,565 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:01:18,568 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:01:18,570 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:01:18,571 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:01:18,581 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:01:18,581 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:01:18,582 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:01:18,583 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:01:18,584 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:01:18,588 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:01:18,589 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:01:18,592 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:01:18,597 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:01:18,599 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:01:18,600 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:01:18,601 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:01:18,603 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:01:18,603 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:01:18,603 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:01:18,604 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:01:18,605 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:01:18,605 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:01:18,606 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:01:18,607 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:01:18,607 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:01:18,608 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:01:18,608 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:01:18,608 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:01:18,609 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:01:18,610 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:01:18,610 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 04:01:18,626 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:01:18,626 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:01:18,628 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:01:18,628 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:01:18,628 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:01:18,628 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:01:18,628 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:01:18,629 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:01:18,629 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:01:18,629 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:01:18,629 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:01:18,629 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:01:18,630 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:01:18,630 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:01:18,630 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:01:18,630 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:01:18,630 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:01:18,630 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:01:18,631 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:01:18,631 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:01:18,631 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:01:18,631 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:01:18,631 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:01:18,631 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:01:18,632 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:01:18,632 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:01:18,632 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:01:18,632 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:01:18,632 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:01:18,633 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:01:18,633 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:01:18,634 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:01:18,634 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /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 -> 093479089abdaadb7e9be964d84aa50a0bea01c9 [2019-01-14 04:01:18,672 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:01:18,690 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:01:18,696 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:01:18,698 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:01:18,699 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:01:18,700 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/elevator_spec2_product24_false-unreach-call_true-termination.cil.c [2019-01-14 04:01:18,771 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae37cb647/26609a37e9664e179319046dc1198245/FLAG329817970 [2019-01-14 04:01:19,355 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:01:19,359 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/elevator_spec2_product24_false-unreach-call_true-termination.cil.c [2019-01-14 04:01:19,397 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae37cb647/26609a37e9664e179319046dc1198245/FLAG329817970 [2019-01-14 04:01:19,569 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae37cb647/26609a37e9664e179319046dc1198245 [2019-01-14 04:01:19,573 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:01:19,574 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:01:19,575 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:01:19,575 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:01:19,578 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:01:19,579 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:01:19" (1/1) ... [2019-01-14 04:01:19,582 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@204310e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:01:19, skipping insertion in model container [2019-01-14 04:01:19,582 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:01:19" (1/1) ... [2019-01-14 04:01:19,590 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:01:19,685 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:01:20,382 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:01:20,486 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:01:20,623 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:01:20,705 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:01:20,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:01:20 WrapperNode [2019-01-14 04:01:20,706 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:01:20,707 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:01:20,707 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:01:20,707 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:01:20,716 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:01:20" (1/1) ... [2019-01-14 04:01:20,755 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:01:20" (1/1) ... [2019-01-14 04:01:21,143 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:01:21,144 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:01:21,144 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:01:21,144 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:01:21,156 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:01:20" (1/1) ... [2019-01-14 04:01:21,156 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:01:20" (1/1) ... [2019-01-14 04:01:21,208 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:01:20" (1/1) ... [2019-01-14 04:01:21,208 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:01:20" (1/1) ... [2019-01-14 04:01:21,337 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:01:20" (1/1) ... [2019-01-14 04:01:21,455 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:01:20" (1/1) ... [2019-01-14 04:01:21,499 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:01:20" (1/1) ... [2019-01-14 04:01:21,565 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:01:21,566 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:01:21,566 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:01:21,566 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:01:21,567 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:01:20" (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-01-14 04:01:21,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 04:01:21,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-14 04:01:21,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:01:21,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:01:37,741 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:01:37,741 INFO L286 CfgBuilder]: Removed 1613 assue(true) statements. [2019-01-14 04:01:37,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:01:37 BoogieIcfgContainer [2019-01-14 04:01:37,747 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:01:37,747 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:01:37,747 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:01:37,752 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:01:37,753 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:01:37,753 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:01:19" (1/3) ... [2019-01-14 04:01:37,754 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@563d3296 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:01:37, skipping insertion in model container [2019-01-14 04:01:37,755 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:01:37,755 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:01:20" (2/3) ... [2019-01-14 04:01:37,755 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@563d3296 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:01:37, skipping insertion in model container [2019-01-14 04:01:37,755 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:01:37,756 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:01:37" (3/3) ... [2019-01-14 04:01:37,759 INFO L375 chiAutomizerObserver]: Analyzing ICFG elevator_spec2_product24_false-unreach-call_true-termination.cil.c [2019-01-14 04:01:37,811 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:01:37,812 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:01:37,812 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:01:37,812 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:01:37,812 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:01:37,812 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:01:37,812 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:01:37,812 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:01:37,813 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:01:37,924 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6967 states. [2019-01-14 04:01:38,096 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3473 [2019-01-14 04:01:38,097 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:01:38,097 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:01:38,123 INFO L867 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] [2019-01-14 04:01:38,124 INFO L868 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] [2019-01-14 04:01:38,124 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:01:38,125 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6967 states. [2019-01-14 04:01:38,216 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3473 [2019-01-14 04:01:38,216 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:01:38,216 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:01:38,223 INFO L867 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] [2019-01-14 04:01:38,225 INFO L868 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] [2019-01-14 04:01:38,240 INFO L794 eck$LassoCheckResult]: Stem: 1363#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~0 := 0;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0;call #t~string60.base, #t~string60.offset := #Ultimate.allocOnStack(10);call #t~string62.base, #t~string62.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string62.base, #t~string62.offset, 1);call write~init~int(95, #t~string62.base, 1 + #t~string62.offset, 1);call write~init~int(93, #t~string62.base, 2 + #t~string62.offset, 1);call write~init~int(0, #t~string62.base, 3 + #t~string62.offset, 1);call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string64.base, #t~string64.offset, 1);call write~init~int(93, #t~string64.base, 1 + #t~string64.offset, 1);call write~init~int(32, #t~string64.base, 2 + #t~string64.offset, 1);call write~init~int(0, #t~string64.base, 3 + #t~string64.offset, 1);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string66.base, #t~string66.offset, 1);call write~init~int(97, #t~string66.base, 1 + #t~string66.offset, 1);call write~init~int(116, #t~string66.base, 2 + #t~string66.offset, 1);call write~init~int(32, #t~string66.base, 3 + #t~string66.offset, 1);call write~init~int(0, #t~string66.base, 4 + #t~string66.offset, 1);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string68.base, #t~string68.offset, 1);call write~init~int(105, #t~string68.base, 1 + #t~string68.offset, 1);call write~init~int(0, #t~string68.base, 2 + #t~string68.offset, 1);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(10);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string72.base, #t~string72.offset, 1);call write~init~int(112, #t~string72.base, 1 + #t~string72.offset, 1);call write~init~int(0, #t~string72.base, 2 + #t~string72.offset, 1);call #t~string74.base, #t~string74.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string74.base, #t~string74.offset, 1);call write~init~int(111, #t~string74.base, 1 + #t~string74.offset, 1);call write~init~int(119, #t~string74.base, 2 + #t~string74.offset, 1);call write~init~int(110, #t~string74.base, 3 + #t~string74.offset, 1);call write~init~int(0, #t~string74.base, 4 + #t~string74.offset, 1);call #t~string76.base, #t~string76.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string76.base, #t~string76.offset, 1);call write~init~int(73, #t~string76.base, 1 + #t~string76.offset, 1);call write~init~int(76, #t~string76.base, 2 + #t~string76.offset, 1);call write~init~int(95, #t~string76.base, 3 + #t~string76.offset, 1);call write~init~int(112, #t~string76.base, 4 + #t~string76.offset, 1);call write~init~int(58, #t~string76.base, 5 + #t~string76.offset, 1);call write~init~int(0, #t~string76.base, 6 + #t~string76.offset, 1);call #t~string78.base, #t~string78.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string78.base, #t~string78.offset, 1);call write~init~int(37, #t~string78.base, 1 + #t~string78.offset, 1);call write~init~int(105, #t~string78.base, 2 + #t~string78.offset, 1);call write~init~int(0, #t~string78.base, 3 + #t~string78.offset, 1);call #t~string80.base, #t~string80.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string80.base, #t~string80.offset, 1);call write~init~int(37, #t~string80.base, 1 + #t~string80.offset, 1);call write~init~int(105, #t~string80.base, 2 + #t~string80.offset, 1);call write~init~int(0, #t~string80.base, 3 + #t~string80.offset, 1);call #t~string82.base, #t~string82.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string82.base, #t~string82.offset, 1);call write~init~int(37, #t~string82.base, 1 + #t~string82.offset, 1);call write~init~int(105, #t~string82.base, 2 + #t~string82.offset, 1);call write~init~int(0, #t~string82.base, 3 + #t~string82.offset, 1);call #t~string84.base, #t~string84.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string84.base, #t~string84.offset, 1);call write~init~int(37, #t~string84.base, 1 + #t~string84.offset, 1);call write~init~int(105, #t~string84.base, 2 + #t~string84.offset, 1);call write~init~int(0, #t~string84.base, 3 + #t~string84.offset, 1);call #t~string86.base, #t~string86.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string86.base, #t~string86.offset, 1);call write~init~int(37, #t~string86.base, 1 + #t~string86.offset, 1);call write~init~int(105, #t~string86.base, 2 + #t~string86.offset, 1);call write~init~int(0, #t~string86.base, 3 + #t~string86.offset, 1);call #t~string88.base, #t~string88.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string88.base, #t~string88.offset, 1);call write~init~int(70, #t~string88.base, 1 + #t~string88.offset, 1);call write~init~int(95, #t~string88.base, 2 + #t~string88.offset, 1);call write~init~int(112, #t~string88.base, 3 + #t~string88.offset, 1);call write~init~int(58, #t~string88.base, 4 + #t~string88.offset, 1);call write~init~int(0, #t~string88.base, 5 + #t~string88.offset, 1);call #t~string91.base, #t~string91.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string91.base, #t~string91.offset, 1);call write~init~int(37, #t~string91.base, 1 + #t~string91.offset, 1);call write~init~int(105, #t~string91.base, 2 + #t~string91.offset, 1);call write~init~int(0, #t~string91.base, 3 + #t~string91.offset, 1);call #t~string94.base, #t~string94.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string94.base, #t~string94.offset, 1);call write~init~int(37, #t~string94.base, 1 + #t~string94.offset, 1);call write~init~int(105, #t~string94.base, 2 + #t~string94.offset, 1);call write~init~int(0, #t~string94.base, 3 + #t~string94.offset, 1);call #t~string97.base, #t~string97.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string97.base, #t~string97.offset, 1);call write~init~int(37, #t~string97.base, 1 + #t~string97.offset, 1);call write~init~int(105, #t~string97.base, 2 + #t~string97.offset, 1);call write~init~int(0, #t~string97.base, 3 + #t~string97.offset, 1);call #t~string100.base, #t~string100.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string100.base, #t~string100.offset, 1);call write~init~int(37, #t~string100.base, 1 + #t~string100.offset, 1);call write~init~int(105, #t~string100.base, 2 + #t~string100.offset, 1);call write~init~int(0, #t~string100.base, 3 + #t~string100.offset, 1);call #t~string103.base, #t~string103.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string103.base, #t~string103.offset, 1);call write~init~int(37, #t~string103.base, 1 + #t~string103.offset, 1);call write~init~int(105, #t~string103.base, 2 + #t~string103.offset, 1);call write~init~int(0, #t~string103.base, 3 + #t~string103.offset, 1);call #t~string105.base, #t~string105.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string105.base, #t~string105.offset, 1);call write~init~int(0, #t~string105.base, 1 + #t~string105.offset, 1);call #t~string108.base, #t~string108.offset := #Ultimate.allocOnStack(9);~floorButtons_spc2_0~0 := 0;~floorButtons_spc2_1~0 := 0;~floorButtons_spc2_2~0 := 0;~floorButtons_spc2_3~0 := 0;~floorButtons_spc2_4~0 := 0;~cleanupTimeShifts~0 := 12;~head~0.base, ~head~0.offset := 0, 0;call #t~string156.base, #t~string156.offset := #Ultimate.allocOnStack(30);call #t~string157.base, #t~string157.offset := #Ultimate.allocOnStack(9);call #t~string158.base, #t~string158.offset := #Ultimate.allocOnStack(21);call #t~string159.base, #t~string159.offset := #Ultimate.allocOnStack(30);call #t~string160.base, #t~string160.offset := #Ultimate.allocOnStack(9);call #t~string161.base, #t~string161.offset := #Ultimate.allocOnStack(21);call #t~string165.base, #t~string165.offset := #Ultimate.allocOnStack(30);call #t~string166.base, #t~string166.offset := #Ultimate.allocOnStack(9);call #t~string167.base, #t~string167.offset := #Ultimate.allocOnStack(25);call #t~string168.base, #t~string168.offset := #Ultimate.allocOnStack(30);call #t~string169.base, #t~string169.offset := #Ultimate.allocOnStack(9);call #t~string170.base, #t~string170.offset := #Ultimate.allocOnStack(25); 6297#L-1true havoc main_#res;havoc main_#t~ret130, main_~retValue_acc~23, main_~tmp~25;havoc main_~retValue_acc~23;havoc main_~tmp~25; 685#L3055true havoc valid_product_#res;havoc valid_product_~retValue_acc~28;havoc valid_product_~retValue_acc~28;valid_product_~retValue_acc~28 := 1;valid_product_#res := valid_product_~retValue_acc~28; 49#L3063true main_#t~ret130 := valid_product_#res;main_~tmp~25 := main_#t~ret130;havoc main_#t~ret130; 9#L2889true assume 0 != main_~tmp~25; 635#L2860true ~floorButtons_spc2_0~0 := 0;~floorButtons_spc2_1~0 := 0;~floorButtons_spc2_2~0 := 0;~floorButtons_spc2_3~0 := 0;~floorButtons_spc2_4~0 := 0; 1914#L2380true havoc bigMacCall_#t~ret123, bigMacCall_~tmp~22;havoc bigMacCall_~tmp~22;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~25;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~25; 4373#L2946true assume 0 == getOrigin_~person;getOrigin_~retValue_acc~25 := 4;getOrigin_#res := getOrigin_~retValue_acc~25; 3040#L2971true bigMacCall_#t~ret123 := getOrigin_#res;bigMacCall_~tmp~22 := bigMacCall_#t~ret123;havoc bigMacCall_#t~ret123;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~22;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 534#L399true assume 0 == initPersonOnFloor_~floor; 435#L400true assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 2900#L507-1true callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 6612#L191true assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 5593#L203-2true havoc cleanup_#t~ret124, cleanup_#t~ret125, cleanup_~i~1, cleanup_~tmp~23, cleanup_~tmp___0~10, cleanup_~__cil_tmp4~1;havoc cleanup_~i~1;havoc cleanup_~tmp~23;havoc cleanup_~tmp___0~10;havoc cleanup_~__cil_tmp4~1;havoc timeShift_#t~ret59, timeShift_~tmp~13;havoc timeShift_~tmp~13;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~5;havoc areDoorsOpen_~retValue_acc~5;areDoorsOpen_~retValue_acc~5 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~5; 301#L960true timeShift_#t~ret59 := areDoorsOpen_#res;timeShift_~tmp~13 := timeShift_#t~ret59;havoc timeShift_#t~ret59; 6089#L1971true assume 0 != timeShift_~tmp~13; 6013#L1972true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 6088#L1616-11true havoc __utac_acc__Specification2_spec__3_#t~ret111, __utac_acc__Specification2_spec__3_#t~ret112, __utac_acc__Specification2_spec__3_#t~ret113, __utac_acc__Specification2_spec__3_#t~ret114, __utac_acc__Specification2_spec__3_#t~ret115, __utac_acc__Specification2_spec__3_#t~ret116, __utac_acc__Specification2_spec__3_~floor~0, __utac_acc__Specification2_spec__3_~tmp~16, __utac_acc__Specification2_spec__3_~tmp___0~9, __utac_acc__Specification2_spec__3_~tmp___1~5, __utac_acc__Specification2_spec__3_~tmp___2~5, __utac_acc__Specification2_spec__3_~tmp___3~5, __utac_acc__Specification2_spec__3_~tmp___4~3;havoc __utac_acc__Specification2_spec__3_~floor~0;havoc __utac_acc__Specification2_spec__3_~tmp~16;havoc __utac_acc__Specification2_spec__3_~tmp___0~9;havoc __utac_acc__Specification2_spec__3_~tmp___1~5;havoc __utac_acc__Specification2_spec__3_~tmp___2~5;havoc __utac_acc__Specification2_spec__3_~tmp___3~5;havoc __utac_acc__Specification2_spec__3_~tmp___4~3;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~4;havoc getCurrentFloorID_~retValue_acc~4;getCurrentFloorID_~retValue_acc~4 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~4; 4#L951-10true __utac_acc__Specification2_spec__3_#t~ret111 := getCurrentFloorID_#res;__utac_acc__Specification2_spec__3_~tmp~16 := __utac_acc__Specification2_spec__3_#t~ret111;havoc __utac_acc__Specification2_spec__3_#t~ret111;__utac_acc__Specification2_spec__3_~floor~0 := __utac_acc__Specification2_spec__3_~tmp~16; 4057#L2425true assume 0 == __utac_acc__Specification2_spec__3_~floor~0; 3786#L2426true assume 0 != ~floorButtons_spc2_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~5;havoc areDoorsOpen_~retValue_acc~5;areDoorsOpen_~retValue_acc~5 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~5; 302#L960-1true __utac_acc__Specification2_spec__3_#t~ret112 := areDoorsOpen_#res;__utac_acc__Specification2_spec__3_~tmp___4~3 := __utac_acc__Specification2_spec__3_#t~ret112;havoc __utac_acc__Specification2_spec__3_#t~ret112; 5459#L2430true assume 0 != __utac_acc__Specification2_spec__3_~tmp___4~3;~floorButtons_spc2_0~0 := 0; 5900#L2485true cleanup_~i~1 := 0; 461#L2692-2true [2019-01-14 04:01:38,241 INFO L796 eck$LassoCheckResult]: Loop: 461#L2692-2true assume !false; 874#L2693true cleanup_~__cil_tmp4~1 := ~cleanupTimeShifts~0 - 1; 780#L2696true assume cleanup_~i~1 < cleanup_~__cil_tmp4~1;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~3;havoc isBlocked_~retValue_acc~3;isBlocked_~retValue_acc~3 := ~blocked~0;isBlocked_#res := isBlocked_~retValue_acc~3; 2038#L793true cleanup_#t~ret124 := isBlocked_#res;cleanup_~tmp___0~10 := cleanup_#t~ret124;havoc cleanup_#t~ret124; 750#L2700true assume 1 != cleanup_~tmp___0~10; 749#L2700-1true havoc isIdle_#res;havoc isIdle_#t~ret7, isIdle_~retValue_acc~10, isIdle_~tmp~3;havoc isIdle_~retValue_acc~10;havoc isIdle_~tmp~3;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret2, anyStopRequested_#t~ret3, anyStopRequested_#t~ret4, anyStopRequested_#t~ret5, anyStopRequested_#t~ret6, anyStopRequested_~retValue_acc~9, anyStopRequested_~tmp~2, anyStopRequested_~tmp___0~0, anyStopRequested_~tmp___1~0, anyStopRequested_~tmp___2~0, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~9;havoc anyStopRequested_~tmp~2;havoc anyStopRequested_~tmp___0~0;havoc anyStopRequested_~tmp___1~0;havoc anyStopRequested_~tmp___2~0;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~0;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~0; 4274#L128-130true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~0 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~0; 2769#L155-130true anyStopRequested_#t~ret2 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret2;havoc anyStopRequested_#t~ret2; 6286#L1059true assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~9 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~9; 115#L1123true isIdle_#t~ret7 := anyStopRequested_#res;isIdle_~tmp~3 := isIdle_#t~ret7;havoc isIdle_#t~ret7;isIdle_~retValue_acc~10 := (if 0 == isIdle_~tmp~3 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~10; 303#L1136true cleanup_#t~ret125 := isIdle_#res;cleanup_~tmp~23 := cleanup_#t~ret125;havoc cleanup_#t~ret125; 19#L2712true assume !(0 != cleanup_~tmp~23);havoc timeShift_#t~ret59, timeShift_~tmp~13;havoc timeShift_~tmp~13;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~5;havoc areDoorsOpen_~retValue_acc~5;areDoorsOpen_~retValue_acc~5 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~5; 300#L960-6true timeShift_#t~ret59 := areDoorsOpen_#res;timeShift_~tmp~13 := timeShift_#t~ret59;havoc timeShift_#t~ret59; 6090#L1971-1true assume 0 != timeShift_~tmp~13; 6014#L1972-2true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 6087#L1616-23true havoc __utac_acc__Specification2_spec__3_#t~ret111, __utac_acc__Specification2_spec__3_#t~ret112, __utac_acc__Specification2_spec__3_#t~ret113, __utac_acc__Specification2_spec__3_#t~ret114, __utac_acc__Specification2_spec__3_#t~ret115, __utac_acc__Specification2_spec__3_#t~ret116, __utac_acc__Specification2_spec__3_~floor~0, __utac_acc__Specification2_spec__3_~tmp~16, __utac_acc__Specification2_spec__3_~tmp___0~9, __utac_acc__Specification2_spec__3_~tmp___1~5, __utac_acc__Specification2_spec__3_~tmp___2~5, __utac_acc__Specification2_spec__3_~tmp___3~5, __utac_acc__Specification2_spec__3_~tmp___4~3;havoc __utac_acc__Specification2_spec__3_~floor~0;havoc __utac_acc__Specification2_spec__3_~tmp~16;havoc __utac_acc__Specification2_spec__3_~tmp___0~9;havoc __utac_acc__Specification2_spec__3_~tmp___1~5;havoc __utac_acc__Specification2_spec__3_~tmp___2~5;havoc __utac_acc__Specification2_spec__3_~tmp___3~5;havoc __utac_acc__Specification2_spec__3_~tmp___4~3;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~4;havoc getCurrentFloorID_~retValue_acc~4;getCurrentFloorID_~retValue_acc~4 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~4; 22#L951-21true __utac_acc__Specification2_spec__3_#t~ret111 := getCurrentFloorID_#res;__utac_acc__Specification2_spec__3_~tmp~16 := __utac_acc__Specification2_spec__3_#t~ret111;havoc __utac_acc__Specification2_spec__3_#t~ret111;__utac_acc__Specification2_spec__3_~floor~0 := __utac_acc__Specification2_spec__3_~tmp~16; 4063#L2425-1true assume 0 == __utac_acc__Specification2_spec__3_~floor~0; 3767#L2426-1true assume 0 != ~floorButtons_spc2_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~5;havoc areDoorsOpen_~retValue_acc~5;areDoorsOpen_~retValue_acc~5 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~5; 289#L960-7true __utac_acc__Specification2_spec__3_#t~ret112 := areDoorsOpen_#res;__utac_acc__Specification2_spec__3_~tmp___4~3 := __utac_acc__Specification2_spec__3_#t~ret112;havoc __utac_acc__Specification2_spec__3_#t~ret112; 5472#L2430-2true assume 0 != __utac_acc__Specification2_spec__3_~tmp___4~3;~floorButtons_spc2_0~0 := 0; 5892#L2485-1true cleanup_~i~1 := 1 + cleanup_~i~1; 461#L2692-2true [2019-01-14 04:01:38,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:01:38,261 INFO L82 PathProgramCache]: Analyzing trace with hash 618203043, now seen corresponding path program 1 times [2019-01-14 04:01:38,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:01:38,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:01:38,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:01:38,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:01:38,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:01:38,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:01:38,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:01:38,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:01:38,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:01:38,699 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:01:38,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:01:38,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1317289327, now seen corresponding path program 1 times [2019-01-14 04:01:38,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:01:38,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:01:38,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:01:38,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:01:38,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:01:38,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:01:38,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:01:39,799 WARN L181 SmtUtils]: Spent 985.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 84 [2019-01-14 04:01:40,308 WARN L181 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2019-01-14 04:01:40,336 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:01:40,338 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:01:40,338 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:01:40,338 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:01:40,338 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:01:40,339 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:01:40,339 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:01:40,339 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:01:40,339 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec2_product24_false-unreach-call_true-termination.cil.c_Iteration1_Loop [2019-01-14 04:01:40,339 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:01:40,339 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:01:40,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:40,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:40,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:40,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:40,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:40,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-01-14 04:01:40,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:40,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:40,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-01-14 04:01:40,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:40,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:40,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:40,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:40,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:40,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:40,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:40,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:40,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:40,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:40,827 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-14 04:01:40,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:40,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:40,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:40,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:40,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:41,112 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-14 04:01:41,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:41,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:41,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:41,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:41,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:41,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:41,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:41,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:41,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:41,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:41,799 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-14 04:01:42,022 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:01:42,023 INFO L412 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-01-14 04:01:42,031 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:01:42,031 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:01:42,042 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:01:42,042 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_~tmp___1~0=0} Honda state: {ULTIMATE.start_anyStopRequested_~tmp___1~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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-01-14 04:01:42,067 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:01:42,067 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:01:42,076 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:01:42,076 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_#res=1, ULTIMATE.start_anyStopRequested_~retValue_acc~9=1, ULTIMATE.start_isIdle_~tmp~3=1} Honda state: {ULTIMATE.start_anyStopRequested_#res=1, ULTIMATE.start_anyStopRequested_~retValue_acc~9=1, ULTIMATE.start_isIdle_~tmp~3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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-01-14 04:01:42,098 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:01:42,098 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:01:42,148 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:01:42,148 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~weight~0=1, ~maximumWeight~0=0} Honda state: {~weight~0=1, ~maximumWeight~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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-01-14 04:01:42,172 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:01:42,173 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:01:42,190 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:01:42,190 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isIdle_#res=0, ULTIMATE.start_isIdle_~retValue_acc~10=0} Honda state: {ULTIMATE.start_isIdle_#res=0, ULTIMATE.start_isIdle_~retValue_acc~10=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) [2019-01-14 04:01:42,248 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:01:42,248 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:01:42,265 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:01:42,265 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_#t~ret59=0} Honda state: {ULTIMATE.start_timeShift_#t~ret59=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:01:42,303 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:01:42,303 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:01:42,321 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:01:42,322 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_areDoorsOpen_#res=-8, ULTIMATE.start_areDoorsOpen_~retValue_acc~5=-8, ~doorState~0=-8, ULTIMATE.start___utac_acc__Specification2_spec__3_~tmp___4~3=-8, ULTIMATE.start_timeShift_~tmp~13=-8} Honda state: {ULTIMATE.start_areDoorsOpen_#res=-8, ULTIMATE.start_areDoorsOpen_~retValue_acc~5=-8, ~doorState~0=-8, ULTIMATE.start___utac_acc__Specification2_spec__3_~tmp___4~3=-8, ULTIMATE.start_timeShift_~tmp~13=-8} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:01:42,346 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:01:42,346 INFO L163 nArgumentSynthesizer]: Using integer mode. 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-01-14 04:01:42,376 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:01:42,376 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:01:42,402 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:01:42,406 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:01:42,406 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:01:42,406 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:01:42,406 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:01:42,406 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:01:42,407 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:01:42,407 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:01:42,407 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:01:42,407 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec2_product24_false-unreach-call_true-termination.cil.c_Iteration1_Loop [2019-01-14 04:01:42,408 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:01:42,408 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:01:42,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:42,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-01-14 04:01:42,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-01-14 04:01:42,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:42,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:42,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:42,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:42,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-01-14 04:01:42,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:42,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:42,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:42,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-01-14 04:01:42,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-01-14 04:01:42,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:42,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:42,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:42,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:42,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:42,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:42,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:42,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:42,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:42,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:42,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:42,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:42,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:42,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:42,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:42,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:42,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:42,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:42,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:42,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:42,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:01:43,011 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-14 04:01:43,168 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-14 04:01:43,549 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-14 04:01:43,730 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-14 04:01:43,958 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:01:43,964 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:01:43,966 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:01:43,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:01:43,970 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:01:43,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:01:43,971 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:01:43,971 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:01:43,975 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:01:43,975 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:01:43,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:01:43,989 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:01:43,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:01:43,990 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:01:43,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:01:43,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:01:43,990 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:01:43,993 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:01:43,993 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:01:43,994 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:01:43,995 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:01:43,995 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:01:43,995 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:01:43,996 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:01:43,996 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:01:43,996 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:01:43,997 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:01:43,999 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:01:44,004 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:01:44,004 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:01:44,006 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:01:44,006 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:01:44,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:01:44,007 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:01:44,007 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:01:44,010 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:01:44,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:01:44,020 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:01:44,020 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:01:44,022 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:01:44,022 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:01:44,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:01:44,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:01:44,023 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:01:44,024 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:01:44,025 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:01:44,027 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:01:44,027 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:01:44,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:01:44,029 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:01:44,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:01:44,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:01:44,030 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:01:44,030 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:01:44,030 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:01:44,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:01:44,032 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:01:44,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:01:44,035 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:01:44,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:01:44,035 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:01:44,035 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:01:44,036 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:01:44,036 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:01:44,042 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:01:44,042 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:01:44,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:01:44,043 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:01:44,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:01:44,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:01:44,043 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:01:44,044 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:01:44,044 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:01:44,045 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:01:44,049 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:01:44,051 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:01:44,051 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:01:44,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:01:44,051 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:01:44,051 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:01:44,052 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:01:44,053 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:01:44,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:01:44,054 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:01:44,054 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:01:44,055 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:01:44,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:01:44,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:01:44,057 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:01:44,059 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:01:44,059 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:01:44,061 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:01:44,062 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:01:44,062 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:01:44,063 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:01:44,065 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:01:44,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:01:44,065 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:01:44,065 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:01:44,065 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:01:44,068 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:01:44,068 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:01:44,070 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:01:44,070 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:01:44,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:01:44,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:01:44,071 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:01:44,072 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:01:44,072 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:01:44,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:01:44,073 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:01:44,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:01:44,074 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:01:44,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:01:44,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:01:44,074 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:01:44,079 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:01:44,079 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:01:44,080 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:01:44,081 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:01:44,081 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:01:44,082 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:01:44,082 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:01:44,082 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:01:44,082 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:01:44,083 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:01:44,085 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:01:44,086 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:01:44,087 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:01:44,087 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:01:44,087 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:01:44,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:01:44,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:01:44,090 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:01:44,091 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:01:44,092 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:01:44,093 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:01:44,094 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:01:44,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:01:44,094 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:01:44,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:01:44,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:01:44,095 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:01:44,095 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:01:44,095 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:01:44,096 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:01:44,097 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:01:44,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:01:44,101 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:01:44,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:01:44,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:01:44,101 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:01:44,102 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:01:44,102 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:01:44,106 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:01:44,106 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:01:44,107 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:01:44,107 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:01:44,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:01:44,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:01:44,110 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:01:44,110 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:01:44,110 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:01:44,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:01:44,112 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:01:44,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:01:44,113 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:01:44,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:01:44,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:01:44,114 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:01:44,116 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:01:44,116 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:01:44,117 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:01:44,119 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:01:44,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:01:44,119 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:01:44,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:01:44,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:01:44,120 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:01:44,120 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:01:44,120 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:01:44,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:01:44,125 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:01:44,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:01:44,125 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:01:44,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:01:44,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:01:44,128 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:01:44,128 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:01:44,128 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:01:44,130 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:01:44,131 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:01:44,131 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:01:44,131 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:01:44,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:01:44,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:01:44,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:01:44,135 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:01:44,135 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:01:44,137 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:01:44,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:01:44,140 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:01:44,140 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:01:44,140 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:01:44,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:01:44,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:01:44,141 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:01:44,141 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:01:44,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:01:44,144 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:01:44,145 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:01:44,145 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:01:44,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:01:44,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:01:44,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:01:44,149 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:01:44,149 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:01:44,150 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:01:44,151 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:01:44,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:01:44,152 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:01:44,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:01:44,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:01:44,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:01:44,153 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:01:44,153 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:01:44,157 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:01:44,158 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:01:44,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:01:44,158 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:01:44,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:01:44,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:01:44,161 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:01:44,161 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:01:44,162 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:01:44,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:01:44,165 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:01:44,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:01:44,165 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:01:44,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:01:44,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:01:44,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:01:44,168 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:01:44,168 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:01:44,169 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:01:44,171 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:01:44,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:01:44,172 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:01:44,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:01:44,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:01:44,172 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:01:44,175 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:01:44,175 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:01:44,177 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:01:44,177 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:01:44,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:01:44,178 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:01:44,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:01:44,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:01:44,178 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:01:44,182 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:01:44,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:01:44,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:01:44,184 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:01:44,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:01:44,184 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:01:44,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:01:44,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:01:44,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:01:44,188 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:01:44,188 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:01:44,189 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:01:44,189 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:01:44,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:01:44,193 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:01:44,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:01:44,193 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:01:44,193 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:01:44,196 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:01:44,196 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:01:44,204 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:01:44,205 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:01:44,205 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:01:44,205 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:01:44,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:01:44,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:01:44,206 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:01:44,206 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:01:44,206 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:01:44,210 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:01:44,211 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:01:44,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:01:44,211 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:01:44,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:01:44,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:01:44,214 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:01:44,214 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:01:44,215 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:01:44,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:01:44,216 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:01:44,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:01:44,222 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:01:44,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:01:44,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:01:44,222 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:01:44,223 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:01:44,223 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:01:44,230 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:01:44,241 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 04:01:44,243 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:01:44,245 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:01:44,246 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:01:44,246 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:01:44,246 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~cleanupTimeShifts~0, ULTIMATE.start_cleanup_~i~1) = 1*~cleanupTimeShifts~0 - 1*ULTIMATE.start_cleanup_~i~1 Supporting invariants [] [2019-01-14 04:01:44,248 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:01:44,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:01:44,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:01:44,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:01:44,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:01:44,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:01:45,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:01:45,057 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-14 04:01:45,059 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6967 states. Second operand 5 states. [2019-01-14 04:01:46,080 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6967 states.. Second operand 5 states. Result 10500 states and 19802 transitions. Complement of second has 9 states. [2019-01-14 04:01:46,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 04:01:46,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 04:01:46,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13207 transitions. [2019-01-14 04:01:46,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13207 transitions. Stem has 24 letters. Loop has 22 letters. [2019-01-14 04:01:46,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:01:46,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13207 transitions. Stem has 46 letters. Loop has 22 letters. [2019-01-14 04:01:46,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:01:46,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13207 transitions. Stem has 24 letters. Loop has 44 letters. [2019-01-14 04:01:46,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:01:46,121 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10500 states and 19802 transitions. [2019-01-14 04:01:46,220 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:01:46,224 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10500 states to 0 states and 0 transitions. [2019-01-14 04:01:46,225 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:01:46,225 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:01:46,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:01:46,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:01:46,227 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:01:46,227 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:01:46,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:01:46,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:01:46,235 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2019-01-14 04:01:46,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:01:46,238 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-14 04:01:46,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 04:01:46,239 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-14 04:01:46,239 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:01:46,239 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 04:01:46,239 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:01:46,239 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:01:46,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:01:46,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:01:46,240 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:01:46,240 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:01:46,240 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:01:46,240 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:01:46,240 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 04:01:46,240 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:01:46,240 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 04:01:46,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:01:46 BoogieIcfgContainer [2019-01-14 04:01:46,251 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:01:46,251 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:01:46,251 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:01:46,251 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:01:46,253 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:01:37" (3/4) ... [2019-01-14 04:01:46,258 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 04:01:46,258 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:01:46,259 INFO L168 Benchmark]: Toolchain (without parser) took 26686.28 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 630.2 MB). Free memory was 946.0 MB in the beginning and 1.2 GB in the end (delta: -284.3 MB). Peak memory consumption was 345.9 MB. Max. memory is 11.5 GB. [2019-01-14 04:01:46,261 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:01:46,263 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1131.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -157.1 MB). Peak memory consumption was 51.4 MB. Max. memory is 11.5 GB. [2019-01-14 04:01:46,265 INFO L168 Benchmark]: Boogie Procedure Inliner took 437.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 74.3 MB). Peak memory consumption was 74.3 MB. Max. memory is 11.5 GB. [2019-01-14 04:01:46,267 INFO L168 Benchmark]: Boogie Preprocessor took 421.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 954.6 MB in the end (delta: 74.3 MB). Peak memory consumption was 74.3 MB. Max. memory is 11.5 GB. [2019-01-14 04:01:46,269 INFO L168 Benchmark]: RCFGBuilder took 16180.66 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 493.9 MB). Free memory was 954.6 MB in the beginning and 1.3 GB in the end (delta: -356.3 MB). Peak memory consumption was 437.3 MB. Max. memory is 11.5 GB. [2019-01-14 04:01:46,270 INFO L168 Benchmark]: BuchiAutomizer took 8503.59 ms. Allocated memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: -1.6 MB). Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 80.5 MB). Peak memory consumption was 78.9 MB. Max. memory is 11.5 GB. [2019-01-14 04:01:46,273 INFO L168 Benchmark]: Witness Printer took 6.79 ms. Allocated memory is still 1.7 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:01:46,279 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1131.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -157.1 MB). Peak memory consumption was 51.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 437.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 74.3 MB). Peak memory consumption was 74.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 421.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 954.6 MB in the end (delta: 74.3 MB). Peak memory consumption was 74.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 16180.66 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 493.9 MB). Free memory was 954.6 MB in the beginning and 1.3 GB in the end (delta: -356.3 MB). Peak memory consumption was 437.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8503.59 ms. Allocated memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: -1.6 MB). Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 80.5 MB). Peak memory consumption was 78.9 MB. Max. memory is 11.5 GB. * Witness Printer took 6.79 ms. Allocated memory is still 1.7 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function cleanupTimeShifts + -1 * i and consists of 6 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.4s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 6.0s. Construction of modules took 0.1s. Büchi inclusion checks took 1.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 13173 SDtfs, 26312 SDslu, 6603 SDs, 0 SdLazy, 9 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital109 mio100 ax100 hnf100 lsp16 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq211 hnf89 smp100 dnf176 smp100 tf103 neg96 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 23ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...