./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/elevator_spec1_product22_false-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa 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_spec1_product22_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 7de9141af96153b285955ba42fc7413bef264932 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 23:15:42,553 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:15:42,554 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:15:42,567 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:15:42,567 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:15:42,568 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:15:42,569 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:15:42,572 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:15:42,574 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:15:42,575 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:15:42,576 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:15:42,576 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:15:42,577 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:15:42,578 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:15:42,579 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:15:42,580 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:15:42,581 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:15:42,583 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:15:42,585 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:15:42,587 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:15:42,588 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:15:42,590 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:15:42,593 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:15:42,593 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:15:42,593 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:15:42,594 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:15:42,596 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:15:42,596 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:15:42,598 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:15:42,599 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:15:42,599 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:15:42,600 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:15:42,601 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:15:42,601 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:15:42,602 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:15:42,602 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:15:42,603 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-01 23:15:42,621 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:15:42,621 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:15:42,625 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:15:42,625 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:15:42,625 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:15:42,626 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:15:42,626 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:15:42,626 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:15:42,626 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:15:42,626 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:15:42,627 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:15:42,628 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:15:42,628 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:15:42,628 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:15:42,628 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:15:42,628 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:15:42,629 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:15:42,629 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:15:42,629 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:15:42,630 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:15:42,630 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:15:42,630 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:15:42,630 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:15:42,630 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:15:42,630 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:15:42,631 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:15:42,631 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:15:42,631 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:15:42,631 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:15:42,631 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:15:42,633 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:15:42,634 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:15:42,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 -> 7de9141af96153b285955ba42fc7413bef264932 [2019-01-01 23:15:42,702 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:15:42,717 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:15:42,725 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:15:42,728 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:15:42,729 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:15:42,730 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/elevator_spec1_product22_false-unreach-call_true-termination.cil.c [2019-01-01 23:15:42,804 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f2a1cddf/7af6a308403c4e78b67b22f793d31a5a/FLAG4f8b882a4 [2019-01-01 23:15:43,449 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:15:43,450 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/elevator_spec1_product22_false-unreach-call_true-termination.cil.c [2019-01-01 23:15:43,472 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f2a1cddf/7af6a308403c4e78b67b22f793d31a5a/FLAG4f8b882a4 [2019-01-01 23:15:43,657 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f2a1cddf/7af6a308403c4e78b67b22f793d31a5a [2019-01-01 23:15:43,661 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:15:43,662 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:15:43,663 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:15:43,663 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:15:43,667 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:15:43,669 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:15:43" (1/1) ... [2019-01-01 23:15:43,672 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5251650b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:15:43, skipping insertion in model container [2019-01-01 23:15:43,672 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:15:43" (1/1) ... [2019-01-01 23:15:43,681 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:15:43,770 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:15:44,465 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:15:44,489 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:15:44,766 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:15:44,840 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:15:44,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:15:44 WrapperNode [2019-01-01 23:15:44,842 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:15:44,843 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:15:44,843 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:15:44,843 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:15:44,853 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:15:44" (1/1) ... [2019-01-01 23:15:44,889 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:15:44" (1/1) ... [2019-01-01 23:15:45,197 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:15:45,197 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:15:45,198 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:15:45,198 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:15:45,210 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:15:44" (1/1) ... [2019-01-01 23:15:45,210 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:15:44" (1/1) ... [2019-01-01 23:15:45,260 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:15:44" (1/1) ... [2019-01-01 23:15:45,260 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:15:44" (1/1) ... [2019-01-01 23:15:45,380 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:15:44" (1/1) ... [2019-01-01 23:15:45,533 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:15:44" (1/1) ... [2019-01-01 23:15:45,578 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:15:44" (1/1) ... [2019-01-01 23:15:45,646 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:15:45,646 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:15:45,647 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:15:45,647 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:15:45,648 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:15:44" (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-01 23:15:45,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 23:15:45,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-01 23:15:45,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:15:45,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:16:02,228 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:16:02,229 INFO L280 CfgBuilder]: Removed 1433 assue(true) statements. [2019-01-01 23:16:02,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:16:02 BoogieIcfgContainer [2019-01-01 23:16:02,229 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:16:02,230 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:16:02,230 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:16:02,235 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:16:02,236 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:16:02,236 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:15:43" (1/3) ... [2019-01-01 23:16:02,238 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4c52bca8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:16:02, skipping insertion in model container [2019-01-01 23:16:02,238 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:16:02,239 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:15:44" (2/3) ... [2019-01-01 23:16:02,240 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4c52bca8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:16:02, skipping insertion in model container [2019-01-01 23:16:02,241 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:16:02,241 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:16:02" (3/3) ... [2019-01-01 23:16:02,244 INFO L375 chiAutomizerObserver]: Analyzing ICFG elevator_spec1_product22_false-unreach-call_true-termination.cil.c [2019-01-01 23:16:02,318 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:16:02,318 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:16:02,319 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:16:02,319 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:16:02,319 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:16:02,319 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:16:02,319 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:16:02,319 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:16:02,319 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:16:02,435 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6686 states. [2019-01-01 23:16:02,627 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3303 [2019-01-01 23:16:02,628 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:16:02,629 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:16:02,652 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:16:02,652 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:16:02,652 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:16:02,652 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6686 states. [2019-01-01 23:16:02,733 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3303 [2019-01-01 23:16:02,733 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:16:02,733 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:16:02,739 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:16:02,739 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:16:02,747 INFO L794 eck$LassoCheckResult]: Stem: 1786#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(30);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(9);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(21);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(30);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(9);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(21);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(30);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(9);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(25);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(25);~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;~blocked~0 := 0;~cleanupTimeShifts~0 := 12;~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~string109.base, #t~string109.offset := #Ultimate.allocOnStack(10);call #t~string111.base, #t~string111.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string111.base, #t~string111.offset, 1);call write~init~int(95, #t~string111.base, 1 + #t~string111.offset, 1);call write~init~int(93, #t~string111.base, 2 + #t~string111.offset, 1);call write~init~int(0, #t~string111.base, 3 + #t~string111.offset, 1);call #t~string113.base, #t~string113.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string113.base, #t~string113.offset, 1);call write~init~int(93, #t~string113.base, 1 + #t~string113.offset, 1);call write~init~int(32, #t~string113.base, 2 + #t~string113.offset, 1);call write~init~int(0, #t~string113.base, 3 + #t~string113.offset, 1);call #t~string115.base, #t~string115.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string115.base, #t~string115.offset, 1);call write~init~int(97, #t~string115.base, 1 + #t~string115.offset, 1);call write~init~int(116, #t~string115.base, 2 + #t~string115.offset, 1);call write~init~int(32, #t~string115.base, 3 + #t~string115.offset, 1);call write~init~int(0, #t~string115.base, 4 + #t~string115.offset, 1);call #t~string117.base, #t~string117.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string117.base, #t~string117.offset, 1);call write~init~int(105, #t~string117.base, 1 + #t~string117.offset, 1);call write~init~int(0, #t~string117.base, 2 + #t~string117.offset, 1);call #t~string119.base, #t~string119.offset := #Ultimate.allocOnStack(10);call #t~string121.base, #t~string121.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string121.base, #t~string121.offset, 1);call write~init~int(112, #t~string121.base, 1 + #t~string121.offset, 1);call write~init~int(0, #t~string121.base, 2 + #t~string121.offset, 1);call #t~string123.base, #t~string123.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string123.base, #t~string123.offset, 1);call write~init~int(111, #t~string123.base, 1 + #t~string123.offset, 1);call write~init~int(119, #t~string123.base, 2 + #t~string123.offset, 1);call write~init~int(110, #t~string123.base, 3 + #t~string123.offset, 1);call write~init~int(0, #t~string123.base, 4 + #t~string123.offset, 1);call #t~string125.base, #t~string125.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string125.base, #t~string125.offset, 1);call write~init~int(73, #t~string125.base, 1 + #t~string125.offset, 1);call write~init~int(76, #t~string125.base, 2 + #t~string125.offset, 1);call write~init~int(95, #t~string125.base, 3 + #t~string125.offset, 1);call write~init~int(112, #t~string125.base, 4 + #t~string125.offset, 1);call write~init~int(58, #t~string125.base, 5 + #t~string125.offset, 1);call write~init~int(0, #t~string125.base, 6 + #t~string125.offset, 1);call #t~string127.base, #t~string127.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string127.base, #t~string127.offset, 1);call write~init~int(37, #t~string127.base, 1 + #t~string127.offset, 1);call write~init~int(105, #t~string127.base, 2 + #t~string127.offset, 1);call write~init~int(0, #t~string127.base, 3 + #t~string127.offset, 1);call #t~string129.base, #t~string129.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string129.base, #t~string129.offset, 1);call write~init~int(37, #t~string129.base, 1 + #t~string129.offset, 1);call write~init~int(105, #t~string129.base, 2 + #t~string129.offset, 1);call write~init~int(0, #t~string129.base, 3 + #t~string129.offset, 1);call #t~string131.base, #t~string131.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string131.base, #t~string131.offset, 1);call write~init~int(37, #t~string131.base, 1 + #t~string131.offset, 1);call write~init~int(105, #t~string131.base, 2 + #t~string131.offset, 1);call write~init~int(0, #t~string131.base, 3 + #t~string131.offset, 1);call #t~string133.base, #t~string133.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string133.base, #t~string133.offset, 1);call write~init~int(37, #t~string133.base, 1 + #t~string133.offset, 1);call write~init~int(105, #t~string133.base, 2 + #t~string133.offset, 1);call write~init~int(0, #t~string133.base, 3 + #t~string133.offset, 1);call #t~string135.base, #t~string135.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string135.base, #t~string135.offset, 1);call write~init~int(37, #t~string135.base, 1 + #t~string135.offset, 1);call write~init~int(105, #t~string135.base, 2 + #t~string135.offset, 1);call write~init~int(0, #t~string135.base, 3 + #t~string135.offset, 1);call #t~string137.base, #t~string137.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string137.base, #t~string137.offset, 1);call write~init~int(70, #t~string137.base, 1 + #t~string137.offset, 1);call write~init~int(95, #t~string137.base, 2 + #t~string137.offset, 1);call write~init~int(112, #t~string137.base, 3 + #t~string137.offset, 1);call write~init~int(58, #t~string137.base, 4 + #t~string137.offset, 1);call write~init~int(0, #t~string137.base, 5 + #t~string137.offset, 1);call #t~string140.base, #t~string140.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string140.base, #t~string140.offset, 1);call write~init~int(37, #t~string140.base, 1 + #t~string140.offset, 1);call write~init~int(105, #t~string140.base, 2 + #t~string140.offset, 1);call write~init~int(0, #t~string140.base, 3 + #t~string140.offset, 1);call #t~string143.base, #t~string143.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string143.base, #t~string143.offset, 1);call write~init~int(37, #t~string143.base, 1 + #t~string143.offset, 1);call write~init~int(105, #t~string143.base, 2 + #t~string143.offset, 1);call write~init~int(0, #t~string143.base, 3 + #t~string143.offset, 1);call #t~string146.base, #t~string146.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string146.base, #t~string146.offset, 1);call write~init~int(37, #t~string146.base, 1 + #t~string146.offset, 1);call write~init~int(105, #t~string146.base, 2 + #t~string146.offset, 1);call write~init~int(0, #t~string146.base, 3 + #t~string146.offset, 1);call #t~string149.base, #t~string149.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string149.base, #t~string149.offset, 1);call write~init~int(37, #t~string149.base, 1 + #t~string149.offset, 1);call write~init~int(105, #t~string149.base, 2 + #t~string149.offset, 1);call write~init~int(0, #t~string149.base, 3 + #t~string149.offset, 1);call #t~string152.base, #t~string152.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string152.base, #t~string152.offset, 1);call write~init~int(37, #t~string152.base, 1 + #t~string152.offset, 1);call write~init~int(105, #t~string152.base, 2 + #t~string152.offset, 1);call write~init~int(0, #t~string152.base, 3 + #t~string152.offset, 1);call #t~string154.base, #t~string154.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string154.base, #t~string154.offset, 1);call write~init~int(0, #t~string154.base, 1 + #t~string154.offset, 1);call #t~string157.base, #t~string157.offset := #Ultimate.allocOnStack(9);~landingButtons_spc1_0~0 := 0;~landingButtons_spc1_1~0 := 0;~landingButtons_spc1_2~0 := 0;~landingButtons_spc1_3~0 := 0;~landingButtons_spc1_4~0 := 0; 6153#L-1true havoc main_#res;havoc main_#t~ret54, main_~retValue_acc~7, main_~tmp~13;havoc main_~retValue_acc~7;havoc main_~tmp~13; 1566#L1700true havoc valid_product_#res;havoc valid_product_~retValue_acc~12;havoc valid_product_~retValue_acc~12;valid_product_~retValue_acc~12 := 1;valid_product_#res := valid_product_~retValue_acc~12; 1933#L1708true main_#t~ret54 := valid_product_#res;main_~tmp~13 := main_#t~ret54;havoc main_#t~ret54; 1952#L1531true assume 0 != main_~tmp~13; 2148#L1500true ~landingButtons_spc1_0~0 := 0;~landingButtons_spc1_1~0 := 0;~landingButtons_spc1_2~0 := 0;~landingButtons_spc1_3~0 := 0;~landingButtons_spc1_4~0 := 0; 1589#L3285true havoc bigMacCall_#t~ret47, bigMacCall_~tmp~10;havoc bigMacCall_~tmp~10;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~9;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~9; 5572#L1603true assume 0 == getOrigin_~person;getOrigin_~retValue_acc~9 := 4;getOrigin_#res := getOrigin_~retValue_acc~9; 1062#L1628true bigMacCall_#t~ret47 := getOrigin_#res;bigMacCall_~tmp~10 := bigMacCall_#t~ret47;havoc bigMacCall_#t~ret47;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~10;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 305#L770true assume 0 == initPersonOnFloor_~floor; 267#L771true assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 6472#L878-1true callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID, callOnFloor_~__utac__ad__arg1~0;callOnFloor_~floorID := callOnFloor_#in~floorID;havoc callOnFloor_~__utac__ad__arg1~0;callOnFloor_~__utac__ad__arg1~0 := callOnFloor_~floorID;__utac_acc__Specification1_spec__2_#in~floor := callOnFloor_~__utac__ad__arg1~0;havoc __utac_acc__Specification1_spec__2_~floor;__utac_acc__Specification1_spec__2_~floor := __utac_acc__Specification1_spec__2_#in~floor; 2060#L3292true assume 0 == __utac_acc__Specification1_spec__2_~floor;~landingButtons_spc1_0~0 := 1; 4513#L3304-2true assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 964#L574-2true havoc angelinaCall_#t~ret44, angelinaCall_~tmp~7;havoc angelinaCall_~tmp~7;getOrigin_#in~person := 2;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~9;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~9; 5574#L1603-1true assume 0 == getOrigin_~person;getOrigin_~retValue_acc~9 := 4;getOrigin_#res := getOrigin_~retValue_acc~9; 1063#L1628-1true angelinaCall_#t~ret44 := getOrigin_#res;angelinaCall_~tmp~7 := angelinaCall_#t~ret44;havoc angelinaCall_#t~ret44;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 2, angelinaCall_~tmp~7;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 307#L770-1true assume 0 == initPersonOnFloor_~floor; 272#L771-2true assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 6476#L878-3true callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID, callOnFloor_~__utac__ad__arg1~0;callOnFloor_~floorID := callOnFloor_#in~floorID;havoc callOnFloor_~__utac__ad__arg1~0;callOnFloor_~__utac__ad__arg1~0 := callOnFloor_~floorID;__utac_acc__Specification1_spec__2_#in~floor := callOnFloor_~__utac__ad__arg1~0;havoc __utac_acc__Specification1_spec__2_~floor;__utac_acc__Specification1_spec__2_~floor := __utac_acc__Specification1_spec__2_#in~floor; 2059#L3292-2true assume 0 == __utac_acc__Specification1_spec__2_~floor;~landingButtons_spc1_0~0 := 1; 4496#L3304-5true assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 959#L574-5true havoc cleanup_#t~ret48, cleanup_#t~ret49, cleanup_~i~2, cleanup_~tmp~11, cleanup_~tmp___0~2, cleanup_~__cil_tmp4~2;havoc cleanup_~i~2;havoc cleanup_~tmp~11;havoc cleanup_~tmp___0~2;havoc cleanup_~__cil_tmp4~2;havoc timeShift_#t~ret108, timeShift_~tmp~25;havoc timeShift_~tmp~25;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~15;havoc areDoorsOpen_~retValue_acc~15;areDoorsOpen_~retValue_acc~15 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~15; 6629#L1947true timeShift_#t~ret108 := areDoorsOpen_#res;timeShift_~tmp~25 := timeShift_#t~ret108;havoc timeShift_#t~ret108; 579#L2897true assume 0 != timeShift_~tmp~25; 631#L2898true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 1818#L2573-11true havoc __utac_acc__Specification1_spec__3_#t~ret159, __utac_acc__Specification1_spec__3_#t~ret160, __utac_acc__Specification1_spec__3_#t~ret161, __utac_acc__Specification1_spec__3_#t~ret162, __utac_acc__Specification1_spec__3_#t~ret163, __utac_acc__Specification1_spec__3_#t~ret164, __utac_acc__Specification1_spec__3_~floor~0, __utac_acc__Specification1_spec__3_~tmp~28, __utac_acc__Specification1_spec__3_~tmp___0~11, __utac_acc__Specification1_spec__3_~tmp___1~8, __utac_acc__Specification1_spec__3_~tmp___2~6, __utac_acc__Specification1_spec__3_~tmp___3~5, __utac_acc__Specification1_spec__3_~tmp___4~3;havoc __utac_acc__Specification1_spec__3_~floor~0;havoc __utac_acc__Specification1_spec__3_~tmp~28;havoc __utac_acc__Specification1_spec__3_~tmp___0~11;havoc __utac_acc__Specification1_spec__3_~tmp___1~8;havoc __utac_acc__Specification1_spec__3_~tmp___2~6;havoc __utac_acc__Specification1_spec__3_~tmp___3~5;havoc __utac_acc__Specification1_spec__3_~tmp___4~3;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~14;havoc getCurrentFloorID_~retValue_acc~14;getCurrentFloorID_~retValue_acc~14 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~14; 6258#L1938-2true __utac_acc__Specification1_spec__3_#t~ret159 := getCurrentFloorID_#res;__utac_acc__Specification1_spec__3_~tmp~28 := __utac_acc__Specification1_spec__3_#t~ret159;havoc __utac_acc__Specification1_spec__3_#t~ret159;__utac_acc__Specification1_spec__3_~floor~0 := __utac_acc__Specification1_spec__3_~tmp~28; 3027#L3330true assume 0 == __utac_acc__Specification1_spec__3_~floor~0; 2889#L3331true assume 0 != ~landingButtons_spc1_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~15;havoc areDoorsOpen_~retValue_acc~15;areDoorsOpen_~retValue_acc~15 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~15; 6630#L1947-1true __utac_acc__Specification1_spec__3_#t~ret160 := areDoorsOpen_#res;__utac_acc__Specification1_spec__3_~tmp___4~3 := __utac_acc__Specification1_spec__3_#t~ret160;havoc __utac_acc__Specification1_spec__3_#t~ret160; 4040#L3335true assume 0 != __utac_acc__Specification1_spec__3_~tmp___4~3;~landingButtons_spc1_0~0 := 0; 1052#L3390true cleanup_~i~2 := 0; 2606#L1332-2true [2019-01-01 23:16:02,748 INFO L796 eck$LassoCheckResult]: Loop: 2606#L1332-2true assume !false; 2485#L1333true cleanup_~__cil_tmp4~2 := ~cleanupTimeShifts~0 - 1; 2382#L1336true assume cleanup_~i~2 < cleanup_~__cil_tmp4~2;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~13;havoc isBlocked_~retValue_acc~13;isBlocked_~retValue_acc~13 := ~blocked~0;isBlocked_#res := isBlocked_~retValue_acc~13; 5487#L1785true cleanup_#t~ret48 := isBlocked_#res;cleanup_~tmp___0~2 := cleanup_#t~ret48;havoc cleanup_#t~ret48; 1819#L1340true assume 1 != cleanup_~tmp___0~2; 1820#L1340-1true havoc isIdle_#res;havoc isIdle_#t~ret63, isIdle_~retValue_acc~20, isIdle_~tmp~17;havoc isIdle_~retValue_acc~20;havoc isIdle_~tmp~17;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret58, anyStopRequested_#t~ret59, anyStopRequested_#t~ret60, anyStopRequested_#t~ret61, anyStopRequested_#t~ret62, anyStopRequested_~retValue_acc~19, anyStopRequested_~tmp~16, anyStopRequested_~tmp___0~4, anyStopRequested_~tmp___1~3, anyStopRequested_~tmp___2~1, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~19;havoc anyStopRequested_~tmp~16;havoc anyStopRequested_~tmp___0~4;havoc anyStopRequested_~tmp___1~3;havoc anyStopRequested_~tmp___2~1;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~3;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~3; 5178#L494-122true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~3 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~3; 6514#L521-122true anyStopRequested_#t~ret58 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret58;havoc anyStopRequested_#t~ret58; 1757#L2046true assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~19 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~19; 6333#L2110true isIdle_#t~ret63 := anyStopRequested_#res;isIdle_~tmp~17 := isIdle_#t~ret63;havoc isIdle_#t~ret63;isIdle_~retValue_acc~20 := (if 0 == isIdle_~tmp~17 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~20; 6631#L2123true cleanup_#t~ret49 := isIdle_#res;cleanup_~tmp~11 := cleanup_#t~ret49;havoc cleanup_#t~ret49; 2042#L1352true assume !(0 != cleanup_~tmp~11);havoc timeShift_#t~ret108, timeShift_~tmp~25;havoc timeShift_~tmp~25;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~15;havoc areDoorsOpen_~retValue_acc~15;areDoorsOpen_~retValue_acc~15 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~15; 6628#L1947-6true timeShift_#t~ret108 := areDoorsOpen_#res;timeShift_~tmp~25 := timeShift_#t~ret108;havoc timeShift_#t~ret108; 583#L2897-1true assume 0 != timeShift_~tmp~25; 633#L2898-2true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 1814#L2573-23true havoc __utac_acc__Specification1_spec__3_#t~ret159, __utac_acc__Specification1_spec__3_#t~ret160, __utac_acc__Specification1_spec__3_#t~ret161, __utac_acc__Specification1_spec__3_#t~ret162, __utac_acc__Specification1_spec__3_#t~ret163, __utac_acc__Specification1_spec__3_#t~ret164, __utac_acc__Specification1_spec__3_~floor~0, __utac_acc__Specification1_spec__3_~tmp~28, __utac_acc__Specification1_spec__3_~tmp___0~11, __utac_acc__Specification1_spec__3_~tmp___1~8, __utac_acc__Specification1_spec__3_~tmp___2~6, __utac_acc__Specification1_spec__3_~tmp___3~5, __utac_acc__Specification1_spec__3_~tmp___4~3;havoc __utac_acc__Specification1_spec__3_~floor~0;havoc __utac_acc__Specification1_spec__3_~tmp~28;havoc __utac_acc__Specification1_spec__3_~tmp___0~11;havoc __utac_acc__Specification1_spec__3_~tmp___1~8;havoc __utac_acc__Specification1_spec__3_~tmp___2~6;havoc __utac_acc__Specification1_spec__3_~tmp___3~5;havoc __utac_acc__Specification1_spec__3_~tmp___4~3;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~14;havoc getCurrentFloorID_~retValue_acc~14;getCurrentFloorID_~retValue_acc~14 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~14; 6247#L1938-5true __utac_acc__Specification1_spec__3_#t~ret159 := getCurrentFloorID_#res;__utac_acc__Specification1_spec__3_~tmp~28 := __utac_acc__Specification1_spec__3_#t~ret159;havoc __utac_acc__Specification1_spec__3_#t~ret159;__utac_acc__Specification1_spec__3_~floor~0 := __utac_acc__Specification1_spec__3_~tmp~28; 3041#L3330-1true assume 0 == __utac_acc__Specification1_spec__3_~floor~0; 2883#L3331-1true assume 0 != ~landingButtons_spc1_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~15;havoc areDoorsOpen_~retValue_acc~15;areDoorsOpen_~retValue_acc~15 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~15; 6615#L1947-7true __utac_acc__Specification1_spec__3_#t~ret160 := areDoorsOpen_#res;__utac_acc__Specification1_spec__3_~tmp___4~3 := __utac_acc__Specification1_spec__3_#t~ret160;havoc __utac_acc__Specification1_spec__3_#t~ret160; 4045#L3335-2true assume 0 != __utac_acc__Specification1_spec__3_~tmp___4~3;~landingButtons_spc1_0~0 := 0; 1051#L3390-1true cleanup_~i~2 := 1 + cleanup_~i~2; 2606#L1332-2true [2019-01-01 23:16:02,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:16:02,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1434627856, now seen corresponding path program 1 times [2019-01-01 23:16:02,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:16:02,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:16:02,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:16:02,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:16:02,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:16:02,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:16:03,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:16:03,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:16:03,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:16:03,154 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:16:03,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:16:03,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1669856429, now seen corresponding path program 1 times [2019-01-01 23:16:03,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:16:03,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:16:03,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:16:03,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:16:03,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:16:03,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:16:03,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:16:03,950 WARN L181 SmtUtils]: Spent 709.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 84 [2019-01-01 23:16:05,549 WARN L181 SmtUtils]: Spent 1.59 s on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2019-01-01 23:16:05,564 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:16:05,566 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:16:05,566 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:16:05,566 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:16:05,566 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:16:05,566 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:16:05,566 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:16:05,566 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:16:05,568 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec1_product22_false-unreach-call_true-termination.cil.c_Iteration1_Loop [2019-01-01 23:16:05,568 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:16:05,568 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:16:05,596 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-01 23:16:05,628 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-01 23:16:05,643 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-01 23:16:05,645 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-01 23:16:05,648 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-01 23:16:05,713 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-01 23:16:05,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-01 23:16:05,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-01 23:16:05,772 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-01 23:16:05,775 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-01 23:16:05,777 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-01 23:16:05,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-01 23:16:05,780 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-01 23:16:05,782 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-01 23:16:05,872 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-01 23:16:05,875 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-01 23:16:05,876 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-01 23:16:05,878 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-01 23:16:05,879 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-01 23:16:05,890 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-01 23:16:05,896 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-01 23:16:05,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-01 23:16:05,906 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-01 23:16:05,912 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-01 23:16:05,914 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-01 23:16:05,915 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-01 23:16:05,917 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-01 23:16:05,922 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-01 23:16:05,950 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-01 23:16:05,959 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-01 23:16:05,961 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-01 23:16:05,962 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-01 23:16:05,967 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-01 23:16:06,524 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:16:06,526 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-01 23:16:06,534 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:16:06,535 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:16:06,554 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:16:06,554 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification1_spec__3_#t~ret162=0} Honda state: {ULTIMATE.start___utac_acc__Specification1_spec__3_#t~ret162=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-01 23:16:06,576 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:16:06,576 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:16:06,583 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:16:06,583 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification1_spec__3_#t~ret161=0} Honda state: {ULTIMATE.start___utac_acc__Specification1_spec__3_#t~ret161=0} 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-01 23:16:06,614 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:16:06,614 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:16:06,617 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:16:06,617 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification1_spec__3_#t~ret160=0} Honda state: {ULTIMATE.start___utac_acc__Specification1_spec__3_#t~ret160=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-01 23:16:06,644 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:16:06,645 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:16:06,654 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:16:06,654 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_~tmp___1~3=0} Honda state: {ULTIMATE.start_anyStopRequested_~tmp___1~3=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-01 23:16:06,698 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:16:06,699 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 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:16:06,774 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:16:06,775 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:16:18,828 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-01-01 23:16:18,831 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:16:18,831 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:16:18,831 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:16:18,831 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:16:18,831 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:16:18,831 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:16:18,832 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:16:18,832 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:16:18,832 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec1_product22_false-unreach-call_true-termination.cil.c_Iteration1_Loop [2019-01-01 23:16:18,832 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:16:18,832 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:16:18,836 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-01 23:16:18,860 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-01 23:16:18,866 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-01 23:16:18,869 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-01 23:16:18,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-01 23:16:18,893 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-01 23:16:18,895 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-01 23:16:18,897 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-01 23:16:18,898 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-01 23:16:18,899 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-01 23:16:18,929 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-01 23:16:18,930 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-01 23:16:18,932 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-01 23:16:18,935 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-01 23:16:18,938 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-01 23:16:18,946 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-01 23:16:18,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-01 23:16:18,975 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-01 23:16:19,001 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-01 23:16:19,015 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-01 23:16:19,016 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-01 23:16:19,135 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-01 23:16:19,234 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-01 23:16:19,314 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-01 23:16:19,316 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-01 23:16:19,318 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-01 23:16:19,322 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-01 23:16:19,325 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-01 23:16:19,335 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-01 23:16:19,336 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-01 23:16:19,340 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-01 23:16:19,345 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-01 23:16:19,347 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-01 23:16:19,730 WARN L181 SmtUtils]: Spent 291.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-01 23:16:19,989 WARN L181 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-01 23:16:20,253 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-01 23:16:20,617 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-01 23:16:21,071 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:16:21,077 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:16:21,079 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-01 23:16:21,081 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:16:21,081 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:16:21,082 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:16:21,082 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:16:21,082 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:16:21,085 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:16:21,085 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:16:21,088 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:16:21,088 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-01 23:16:21,089 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:16:21,089 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:16:21,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:16:21,089 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:16:21,090 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:16:21,090 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:16:21,090 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:16:21,091 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:16:21,092 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-01 23:16:21,092 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:16:21,093 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:16:21,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:16:21,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:16:21,098 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:16:21,099 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:16:21,099 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:16:21,100 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:16:21,100 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-01 23:16:21,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:16:21,101 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:16:21,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:16:21,102 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:16:21,102 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:16:21,106 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:16:21,107 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:16:21,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:16:21,128 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-01 23:16:21,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:16:21,129 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:16:21,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:16:21,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:16:21,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:16:21,130 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:16:21,130 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:16:21,133 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:16:21,134 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-01 23:16:21,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:16:21,135 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:16:21,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:16:21,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:16:21,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:16:21,136 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:16:21,136 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:16:21,137 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:16:21,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-01 23:16:21,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:16:21,138 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:16:21,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:16:21,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:16:21,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:16:21,139 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:16:21,139 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:16:21,140 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:16:21,143 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-01 23:16:21,144 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:16:21,144 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:16:21,144 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:16:21,144 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:16:21,144 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:16:21,145 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:16:21,145 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:16:21,146 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:16:21,146 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-01 23:16:21,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:16:21,147 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:16:21,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:16:21,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:16:21,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:16:21,151 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:16:21,151 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:16:21,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:16:21,154 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-01 23:16:21,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:16:21,156 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:16:21,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:16:21,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:16:21,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:16:21,157 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:16:21,158 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:16:21,167 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:16:21,168 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:16:21,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:16:21,168 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:16:21,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:16:21,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:16:21,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:16:21,173 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:16:21,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:16:21,175 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:16:21,175 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-01 23:16:21,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:16:21,179 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:16:21,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:16:21,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:16:21,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:16:21,180 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:16:21,180 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:16:21,181 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:16:21,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-01 23:16:21,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:16:21,185 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:16:21,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:16:21,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:16:21,185 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:16:21,185 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:16:21,186 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:16:21,188 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:16:21,188 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-01 23:16:21,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:16:21,189 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:16:21,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:16:21,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:16:21,191 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:16:21,192 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:16:21,192 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:16:21,193 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:16:21,193 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-01 23:16:21,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:16:21,194 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:16:21,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:16:21,194 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:16:21,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:16:21,196 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:16:21,196 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:16:21,207 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:16:21,207 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-01 23:16:21,208 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:16:21,208 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:16:21,208 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:16:21,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:16:21,208 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:16:21,209 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:16:21,209 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:16:21,210 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:16:21,210 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-01 23:16:21,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:16:21,211 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:16:21,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:16:21,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:16:21,212 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:16:21,212 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:16:21,212 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:16:21,213 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:16:21,213 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-01 23:16:21,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:16:21,214 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:16:21,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:16:21,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:16:21,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:16:21,215 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:16:21,215 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:16:21,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:16:21,217 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:16:21,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:16:21,217 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:16:21,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:16:21,218 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:16:21,218 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:16:21,218 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:16:21,219 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:16:21,223 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:16:21,223 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:16:21,224 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:16:21,224 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:16:21,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:16:21,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:16:21,225 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:16:21,225 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:16:21,225 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:16:21,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:16:21,227 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:16:21,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:16:21,228 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:16:21,228 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:16:21,228 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:16:21,228 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:16:21,229 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:16:21,229 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:16:21,238 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:16:21,239 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:16:21,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:16:21,239 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:16:21,240 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:16:21,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:16:21,240 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:16:21,241 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:16:21,241 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:16:21,243 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:16:21,243 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:16:21,244 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:16:21,244 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:16:21,244 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:16:21,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:16:21,244 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:16:21,245 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:16:21,245 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:16:21,250 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:16:21,265 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 23:16:21,265 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 23:16:21,270 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:16:21,270 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:16:21,273 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:16:21,273 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~cleanupTimeShifts~0, ULTIMATE.start_cleanup_~i~2) = 1*~cleanupTimeShifts~0 - 1*ULTIMATE.start_cleanup_~i~2 Supporting invariants [] [2019-01-01 23:16:21,275 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:16:21,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:16:21,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:16:21,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:16:21,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:16:21,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:16:21,826 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-01 23:16:21,846 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-01 23:16:21,848 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6686 states. Second operand 5 states. [2019-01-01 23:16:23,075 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6686 states.. Second operand 5 states. Result 10049 states and 19005 transitions. Complement of second has 9 states. [2019-01-01 23:16:23,076 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-01 23:16:23,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 23:16:23,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12714 transitions. [2019-01-01 23:16:23,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12714 transitions. Stem has 33 letters. Loop has 22 letters. [2019-01-01 23:16:23,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:16:23,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12714 transitions. Stem has 55 letters. Loop has 22 letters. [2019-01-01 23:16:23,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:16:23,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12714 transitions. Stem has 33 letters. Loop has 44 letters. [2019-01-01 23:16:23,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:16:23,100 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10049 states and 19005 transitions. [2019-01-01 23:16:23,227 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:16:23,230 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10049 states to 0 states and 0 transitions. [2019-01-01 23:16:23,232 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 23:16:23,232 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 23:16:23,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 23:16:23,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:16:23,233 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:16:23,233 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:16:23,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:16:23,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:16:23,241 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2019-01-01 23:16:23,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:16:23,245 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-01 23:16:23,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-01 23:16:23,247 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-01 23:16:23,247 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:16:23,247 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 23:16:23,247 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 23:16:23,247 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 23:16:23,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 23:16:23,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:16:23,251 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:16:23,251 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:16:23,252 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:16:23,252 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:16:23,252 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 23:16:23,252 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:16:23,252 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 23:16:23,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:16:23 BoogieIcfgContainer [2019-01-01 23:16:23,263 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:16:23,263 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:16:23,263 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:16:23,264 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:16:23,266 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:16:02" (3/4) ... [2019-01-01 23:16:23,274 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 23:16:23,274 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:16:23,276 INFO L168 Benchmark]: Toolchain (without parser) took 39614.68 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 606.6 MB). Free memory was 947.3 MB in the beginning and 1.3 GB in the end (delta: -371.9 MB). Peak memory consumption was 234.7 MB. Max. memory is 11.5 GB. [2019-01-01 23:16:23,279 INFO L168 Benchmark]: CDTParser took 0.16 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-01 23:16:23,279 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1179.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -168.7 MB). Peak memory consumption was 51.4 MB. Max. memory is 11.5 GB. [2019-01-01 23:16:23,282 INFO L168 Benchmark]: Boogie Procedure Inliner took 354.22 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: 67.2 MB). Peak memory consumption was 67.2 MB. Max. memory is 11.5 GB. [2019-01-01 23:16:23,284 INFO L168 Benchmark]: Boogie Preprocessor took 448.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 987.7 MB in the end (delta: 61.0 MB). Peak memory consumption was 61.0 MB. Max. memory is 11.5 GB. [2019-01-01 23:16:23,285 INFO L168 Benchmark]: RCFGBuilder took 16583.04 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 456.1 MB). Free memory was 987.7 MB in the beginning and 1.4 GB in the end (delta: -388.2 MB). Peak memory consumption was 444.2 MB. Max. memory is 11.5 GB. [2019-01-01 23:16:23,287 INFO L168 Benchmark]: BuchiAutomizer took 21032.76 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 56.8 MB). Peak memory consumption was 56.8 MB. Max. memory is 11.5 GB. [2019-01-01 23:16:23,289 INFO L168 Benchmark]: Witness Printer took 10.89 ms. Allocated memory is still 1.6 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-01-01 23:16:23,297 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1179.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -168.7 MB). Peak memory consumption was 51.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 354.22 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: 67.2 MB). Peak memory consumption was 67.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 448.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 987.7 MB in the end (delta: 61.0 MB). Peak memory consumption was 61.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 16583.04 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 456.1 MB). Free memory was 987.7 MB in the beginning and 1.4 GB in the end (delta: -388.2 MB). Peak memory consumption was 444.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 21032.76 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 56.8 MB). Peak memory consumption was 56.8 MB. Max. memory is 11.5 GB. * Witness Printer took 10.89 ms. Allocated memory is still 1.6 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 24 B). Peak memory consumption was 24 B. 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 20.9s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 18.5s. Construction of modules took 0.1s. Büchi inclusion checks took 1.6s. 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: 12680 SDtfs, 18938 SDslu, 6299 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: 26ms VariablesStem: 0 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 1 LassoNonterminationAnalysisTime: 12.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...