./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/elevator_spec2_product30_false-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/product-lines/elevator_spec2_product30_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 16eb34bf8ac588b2057113d948643073bd800c2b ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:47:24,425 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:47:24,427 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:47:24,446 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:47:24,447 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:47:24,448 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:47:24,449 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:47:24,451 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:47:24,453 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:47:24,454 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:47:24,455 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:47:24,455 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:47:24,457 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:47:24,458 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:47:24,459 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:47:24,460 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:47:24,461 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:47:24,463 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:47:24,465 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:47:24,467 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:47:24,468 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:47:24,469 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:47:24,472 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:47:24,472 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:47:24,472 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:47:24,473 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:47:24,475 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:47:24,476 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:47:24,477 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:47:24,478 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:47:24,478 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:47:24,479 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:47:24,479 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:47:24,480 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:47:24,481 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:47:24,481 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:47:24,482 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-28 23:47:24,504 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:47:24,505 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:47:24,509 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:47:24,510 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:47:24,510 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:47:24,511 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:47:24,511 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:47:24,511 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:47:24,511 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:47:24,511 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:47:24,511 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:47:24,512 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:47:24,512 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 23:47:24,512 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:47:24,512 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:47:24,512 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 23:47:24,512 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:47:24,515 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:47:24,515 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:47:24,515 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:47:24,515 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 23:47:24,515 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:47:24,515 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:47:24,516 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:47:24,517 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:47:24,518 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:47:24,518 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:47:24,518 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:47:24,518 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:47:24,518 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:47:24,520 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:47:24,521 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:47:24,522 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 -> 16eb34bf8ac588b2057113d948643073bd800c2b [2018-11-28 23:47:24,584 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:47:24,600 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:47:24,606 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:47:24,607 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:47:24,608 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:47:24,609 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/elevator_spec2_product30_false-unreach-call_true-termination.cil.c [2018-11-28 23:47:24,675 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/626dfc84d/3f87a5e880f843c491a515a5b58d8cff/FLAGeabd2a6c5 [2018-11-28 23:47:25,382 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:47:25,383 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/elevator_spec2_product30_false-unreach-call_true-termination.cil.c [2018-11-28 23:47:25,414 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/626dfc84d/3f87a5e880f843c491a515a5b58d8cff/FLAGeabd2a6c5 [2018-11-28 23:47:25,522 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/626dfc84d/3f87a5e880f843c491a515a5b58d8cff [2018-11-28 23:47:25,527 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:47:25,530 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:47:25,531 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:47:25,531 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:47:25,537 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:47:25,538 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:47:25" (1/1) ... [2018-11-28 23:47:25,543 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5eb0bef6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:47:25, skipping insertion in model container [2018-11-28 23:47:25,544 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:47:25" (1/1) ... [2018-11-28 23:47:25,553 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:47:25,640 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:47:26,374 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:47:26,394 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:47:26,688 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:47:26,766 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:47:26,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:47:26 WrapperNode [2018-11-28 23:47:26,767 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:47:26,768 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:47:26,768 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:47:26,768 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:47:26,779 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:47:26" (1/1) ... [2018-11-28 23:47:26,831 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:47:26" (1/1) ... [2018-11-28 23:47:27,145 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:47:27,145 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:47:27,146 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:47:27,146 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:47:27,159 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:47:26" (1/1) ... [2018-11-28 23:47:27,159 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:47:26" (1/1) ... [2018-11-28 23:47:27,222 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:47:26" (1/1) ... [2018-11-28 23:47:27,227 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:47:26" (1/1) ... [2018-11-28 23:47:27,373 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:47:26" (1/1) ... [2018-11-28 23:47:27,519 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:47:26" (1/1) ... [2018-11-28 23:47:27,555 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:47:26" (1/1) ... [2018-11-28 23:47:27,620 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:47:27,621 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:47:27,621 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:47:27,621 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:47:27,623 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:47:26" (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 [2018-11-28 23:47:27,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:47:27,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-11-28 23:47:27,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:47:27,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:47:45,045 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:47:45,045 INFO L280 CfgBuilder]: Removed 1565 assue(true) statements. [2018-11-28 23:47:45,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:47:45 BoogieIcfgContainer [2018-11-28 23:47:45,046 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:47:45,047 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:47:45,047 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:47:45,051 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:47:45,052 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:47:45,053 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:47:25" (1/3) ... [2018-11-28 23:47:45,055 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@39f22dc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:47:45, skipping insertion in model container [2018-11-28 23:47:45,055 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:47:45,055 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:47:26" (2/3) ... [2018-11-28 23:47:45,056 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@39f22dc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:47:45, skipping insertion in model container [2018-11-28 23:47:45,056 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:47:45,056 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:47:45" (3/3) ... [2018-11-28 23:47:45,059 INFO L375 chiAutomizerObserver]: Analyzing ICFG elevator_spec2_product30_false-unreach-call_true-termination.cil.c [2018-11-28 23:47:45,121 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:47:45,121 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:47:45,121 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:47:45,122 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:47:45,122 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:47:45,122 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:47:45,122 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:47:45,122 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:47:45,122 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:47:45,236 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6963 states. [2018-11-28 23:47:45,397 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3471 [2018-11-28 23:47:45,398 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:47:45,398 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:47:45,424 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] [2018-11-28 23:47:45,424 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] [2018-11-28 23:47:45,424 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:47:45,425 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6963 states. [2018-11-28 23:47:45,516 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3471 [2018-11-28 23:47:45,517 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:47:45,517 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:47:45,526 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] [2018-11-28 23:47:45,526 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] [2018-11-28 23:47:45,540 INFO L794 eck$LassoCheckResult]: Stem: 2110#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~cleanupTimeShifts~0 := 12;~weight~0 := 0;~maximumWeight~0 := 100;~blocked~0 := 0;~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~floorButtons_spc2_0~0 := 0;~floorButtons_spc2_1~0 := 0;~floorButtons_spc2_2~0 := 0;~floorButtons_spc2_3~0 := 0;~floorButtons_spc2_4~0 := 0;~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~string81.base, #t~string81.offset := #Ultimate.alloc(10);call #t~string83.base, #t~string83.offset := #Ultimate.alloc(4);call write~init~int(91, #t~string83.base, #t~string83.offset, 1);call write~init~int(95, #t~string83.base, 1 + #t~string83.offset, 1);call write~init~int(93, #t~string83.base, 2 + #t~string83.offset, 1);call write~init~int(0, #t~string83.base, 3 + #t~string83.offset, 1);call #t~string85.base, #t~string85.offset := #Ultimate.alloc(4);call write~init~int(91, #t~string85.base, #t~string85.offset, 1);call write~init~int(93, #t~string85.base, 1 + #t~string85.offset, 1);call write~init~int(32, #t~string85.base, 2 + #t~string85.offset, 1);call write~init~int(0, #t~string85.base, 3 + #t~string85.offset, 1);call #t~string87.base, #t~string87.offset := #Ultimate.alloc(5);call write~init~int(32, #t~string87.base, #t~string87.offset, 1);call write~init~int(97, #t~string87.base, 1 + #t~string87.offset, 1);call write~init~int(116, #t~string87.base, 2 + #t~string87.offset, 1);call write~init~int(32, #t~string87.base, 3 + #t~string87.offset, 1);call write~init~int(0, #t~string87.base, 4 + #t~string87.offset, 1);call #t~string89.base, #t~string89.offset := #Ultimate.alloc(3);call write~init~int(37, #t~string89.base, #t~string89.offset, 1);call write~init~int(105, #t~string89.base, 1 + #t~string89.offset, 1);call write~init~int(0, #t~string89.base, 2 + #t~string89.offset, 1);call #t~string91.base, #t~string91.offset := #Ultimate.alloc(10);call #t~string93.base, #t~string93.offset := #Ultimate.alloc(3);call write~init~int(117, #t~string93.base, #t~string93.offset, 1);call write~init~int(112, #t~string93.base, 1 + #t~string93.offset, 1);call write~init~int(0, #t~string93.base, 2 + #t~string93.offset, 1);call #t~string95.base, #t~string95.offset := #Ultimate.alloc(5);call write~init~int(100, #t~string95.base, #t~string95.offset, 1);call write~init~int(111, #t~string95.base, 1 + #t~string95.offset, 1);call write~init~int(119, #t~string95.base, 2 + #t~string95.offset, 1);call write~init~int(110, #t~string95.base, 3 + #t~string95.offset, 1);call write~init~int(0, #t~string95.base, 4 + #t~string95.offset, 1);call #t~string97.base, #t~string97.offset := #Ultimate.alloc(7);call write~init~int(32, #t~string97.base, #t~string97.offset, 1);call write~init~int(73, #t~string97.base, 1 + #t~string97.offset, 1);call write~init~int(76, #t~string97.base, 2 + #t~string97.offset, 1);call write~init~int(95, #t~string97.base, 3 + #t~string97.offset, 1);call write~init~int(112, #t~string97.base, 4 + #t~string97.offset, 1);call write~init~int(58, #t~string97.base, 5 + #t~string97.offset, 1);call write~init~int(0, #t~string97.base, 6 + #t~string97.offset, 1);call #t~string99.base, #t~string99.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string99.base, #t~string99.offset, 1);call write~init~int(37, #t~string99.base, 1 + #t~string99.offset, 1);call write~init~int(105, #t~string99.base, 2 + #t~string99.offset, 1);call write~init~int(0, #t~string99.base, 3 + #t~string99.offset, 1);call #t~string101.base, #t~string101.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string101.base, #t~string101.offset, 1);call write~init~int(37, #t~string101.base, 1 + #t~string101.offset, 1);call write~init~int(105, #t~string101.base, 2 + #t~string101.offset, 1);call write~init~int(0, #t~string101.base, 3 + #t~string101.offset, 1);call #t~string103.base, #t~string103.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string103.base, #t~string103.offset, 1);call write~init~int(37, #t~string103.base, 1 + #t~string103.offset, 1);call write~init~int(105, #t~string103.base, 2 + #t~string103.offset, 1);call write~init~int(0, #t~string103.base, 3 + #t~string103.offset, 1);call #t~string105.base, #t~string105.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string105.base, #t~string105.offset, 1);call write~init~int(37, #t~string105.base, 1 + #t~string105.offset, 1);call write~init~int(105, #t~string105.base, 2 + #t~string105.offset, 1);call write~init~int(0, #t~string105.base, 3 + #t~string105.offset, 1);call #t~string107.base, #t~string107.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string107.base, #t~string107.offset, 1);call write~init~int(37, #t~string107.base, 1 + #t~string107.offset, 1);call write~init~int(105, #t~string107.base, 2 + #t~string107.offset, 1);call write~init~int(0, #t~string107.base, 3 + #t~string107.offset, 1);call #t~string109.base, #t~string109.offset := #Ultimate.alloc(6);call write~init~int(32, #t~string109.base, #t~string109.offset, 1);call write~init~int(70, #t~string109.base, 1 + #t~string109.offset, 1);call write~init~int(95, #t~string109.base, 2 + #t~string109.offset, 1);call write~init~int(112, #t~string109.base, 3 + #t~string109.offset, 1);call write~init~int(58, #t~string109.base, 4 + #t~string109.offset, 1);call write~init~int(0, #t~string109.base, 5 + #t~string109.offset, 1);call #t~string112.base, #t~string112.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string112.base, #t~string112.offset, 1);call write~init~int(37, #t~string112.base, 1 + #t~string112.offset, 1);call write~init~int(105, #t~string112.base, 2 + #t~string112.offset, 1);call write~init~int(0, #t~string112.base, 3 + #t~string112.offset, 1);call #t~string115.base, #t~string115.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string115.base, #t~string115.offset, 1);call write~init~int(37, #t~string115.base, 1 + #t~string115.offset, 1);call write~init~int(105, #t~string115.base, 2 + #t~string115.offset, 1);call write~init~int(0, #t~string115.base, 3 + #t~string115.offset, 1);call #t~string118.base, #t~string118.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string118.base, #t~string118.offset, 1);call write~init~int(37, #t~string118.base, 1 + #t~string118.offset, 1);call write~init~int(105, #t~string118.base, 2 + #t~string118.offset, 1);call write~init~int(0, #t~string118.base, 3 + #t~string118.offset, 1);call #t~string121.base, #t~string121.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string121.base, #t~string121.offset, 1);call write~init~int(37, #t~string121.base, 1 + #t~string121.offset, 1);call write~init~int(105, #t~string121.base, 2 + #t~string121.offset, 1);call write~init~int(0, #t~string121.base, 3 + #t~string121.offset, 1);call #t~string124.base, #t~string124.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string124.base, #t~string124.offset, 1);call write~init~int(37, #t~string124.base, 1 + #t~string124.offset, 1);call write~init~int(105, #t~string124.base, 2 + #t~string124.offset, 1);call write~init~int(0, #t~string124.base, 3 + #t~string124.offset, 1);call #t~string126.base, #t~string126.offset := #Ultimate.alloc(2);call write~init~int(10, #t~string126.base, #t~string126.offset, 1);call write~init~int(0, #t~string126.base, 1 + #t~string126.offset, 1);call #t~string129.base, #t~string129.offset := #Ultimate.alloc(9);~head~0.base, ~head~0.offset := 0, 0;call #t~string149.base, #t~string149.offset := #Ultimate.alloc(30);call #t~string150.base, #t~string150.offset := #Ultimate.alloc(9);call #t~string151.base, #t~string151.offset := #Ultimate.alloc(21);call #t~string152.base, #t~string152.offset := #Ultimate.alloc(30);call #t~string153.base, #t~string153.offset := #Ultimate.alloc(9);call #t~string154.base, #t~string154.offset := #Ultimate.alloc(21);call #t~string158.base, #t~string158.offset := #Ultimate.alloc(30);call #t~string159.base, #t~string159.offset := #Ultimate.alloc(9);call #t~string160.base, #t~string160.offset := #Ultimate.alloc(25);call #t~string161.base, #t~string161.offset := #Ultimate.alloc(30);call #t~string162.base, #t~string162.offset := #Ultimate.alloc(9);call #t~string163.base, #t~string163.offset := #Ultimate.alloc(25); 6391#L-1true havoc main_#res;havoc main_#t~ret13, main_~retValue_acc~4, main_~tmp~8;havoc main_~retValue_acc~4;havoc main_~tmp~8; 552#L1316true havoc valid_product_#res;havoc valid_product_~retValue_acc~9;havoc valid_product_~retValue_acc~9;valid_product_~retValue_acc~9 := 1;valid_product_#res := valid_product_~retValue_acc~9; 2645#L1324true main_#t~ret13 := valid_product_#res;main_~tmp~8 := main_#t~ret13;havoc main_#t~ret13; 3116#L509true assume 0 != main_~tmp~8; 2288#L478true ~floorButtons_spc2_0~0 := 0;~floorButtons_spc2_1~0 := 0;~floorButtons_spc2_2~0 := 0;~floorButtons_spc2_3~0 := 0;~floorButtons_spc2_4~0 := 0; 2379#L1357true havoc bigMacCall_#t~ret6, bigMacCall_~tmp~5;havoc bigMacCall_~tmp~5;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~1;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~1; 2774#L85true assume 0 == getOrigin_~person;getOrigin_~retValue_acc~1 := 4;getOrigin_#res := getOrigin_~retValue_acc~1; 2115#L110true bigMacCall_#t~ret6 := getOrigin_#res;bigMacCall_~tmp~5 := bigMacCall_#t~ret6;havoc bigMacCall_#t~ret6;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~5;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 2161#L986true assume 0 == initPersonOnFloor_~floor; 2158#L987true assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 5651#L1094-1true callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 798#L778true assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 2753#L790-2true havoc cleanup_#t~ret7, cleanup_#t~ret8, cleanup_~i~0, cleanup_~tmp~6, cleanup_~tmp___0~0, cleanup_~__cil_tmp4~0;havoc cleanup_~i~0;havoc cleanup_~tmp~6;havoc cleanup_~tmp___0~0;havoc cleanup_~__cil_tmp4~0;havoc timeShift_#t~ret80, timeShift_~tmp~24;havoc timeShift_~tmp~24;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~12;havoc areDoorsOpen_~retValue_acc~12;areDoorsOpen_~retValue_acc~12 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~12; 5580#L1780true timeShift_#t~ret80 := areDoorsOpen_#res;timeShift_~tmp~24 := timeShift_#t~ret80;havoc timeShift_#t~ret80; 2675#L2729true assume 0 != timeShift_~tmp~24; 2714#L2730true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 2487#L2406-11true havoc __utac_acc__Specification2_spec__3_#t~ret21, __utac_acc__Specification2_spec__3_#t~ret22, __utac_acc__Specification2_spec__3_#t~ret23, __utac_acc__Specification2_spec__3_#t~ret24, __utac_acc__Specification2_spec__3_#t~ret25, __utac_acc__Specification2_spec__3_#t~ret26, __utac_acc__Specification2_spec__3_~floor~0, __utac_acc__Specification2_spec__3_~tmp~11, __utac_acc__Specification2_spec__3_~tmp___0~4, __utac_acc__Specification2_spec__3_~tmp___1~3, __utac_acc__Specification2_spec__3_~tmp___2~1, __utac_acc__Specification2_spec__3_~tmp___3~0, __utac_acc__Specification2_spec__3_~tmp___4~0;havoc __utac_acc__Specification2_spec__3_~floor~0;havoc __utac_acc__Specification2_spec__3_~tmp~11;havoc __utac_acc__Specification2_spec__3_~tmp___0~4;havoc __utac_acc__Specification2_spec__3_~tmp___1~3;havoc __utac_acc__Specification2_spec__3_~tmp___2~1;havoc __utac_acc__Specification2_spec__3_~tmp___3~0;havoc __utac_acc__Specification2_spec__3_~tmp___4~0;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~11;havoc getCurrentFloorID_~retValue_acc~11;getCurrentFloorID_~retValue_acc~11 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~11; 6864#L1771-2true __utac_acc__Specification2_spec__3_#t~ret21 := getCurrentFloorID_#res;__utac_acc__Specification2_spec__3_~tmp~11 := __utac_acc__Specification2_spec__3_#t~ret21;havoc __utac_acc__Specification2_spec__3_#t~ret21;__utac_acc__Specification2_spec__3_~floor~0 := __utac_acc__Specification2_spec__3_~tmp~11; 3411#L1402true assume 0 == __utac_acc__Specification2_spec__3_~floor~0; 3474#L1403true assume 0 != ~floorButtons_spc2_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~12;havoc areDoorsOpen_~retValue_acc~12;areDoorsOpen_~retValue_acc~12 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~12; 5579#L1780-1true __utac_acc__Specification2_spec__3_#t~ret22 := areDoorsOpen_#res;__utac_acc__Specification2_spec__3_~tmp___4~0 := __utac_acc__Specification2_spec__3_#t~ret22;havoc __utac_acc__Specification2_spec__3_#t~ret22; 6449#L1407true assume 0 != __utac_acc__Specification2_spec__3_~tmp___4~0;~floorButtons_spc2_0~0 := 0; 1823#L1462true cleanup_~i~0 := 0; 4042#L308-2true [2018-11-28 23:47:45,541 INFO L796 eck$LassoCheckResult]: Loop: 4042#L308-2true assume !false; 3901#L309true cleanup_~__cil_tmp4~0 := ~cleanupTimeShifts~0 - 1; 3714#L312true assume cleanup_~i~0 < cleanup_~__cil_tmp4~0;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~10;havoc isBlocked_~retValue_acc~10;isBlocked_~retValue_acc~10 := ~blocked~0;isBlocked_#res := isBlocked_~retValue_acc~10; 6951#L1594true cleanup_#t~ret7 := isBlocked_#res;cleanup_~tmp___0~0 := cleanup_#t~ret7;havoc cleanup_#t~ret7; 4628#L316true assume 1 != cleanup_~tmp___0~0; 4633#L316-1true havoc isIdle_#res;havoc isIdle_#t~ret35, isIdle_~retValue_acc~17, isIdle_~tmp~16;havoc isIdle_~retValue_acc~17;havoc isIdle_~tmp~16;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret30, anyStopRequested_#t~ret31, anyStopRequested_#t~ret32, anyStopRequested_#t~ret33, anyStopRequested_#t~ret34, anyStopRequested_~retValue_acc~16, anyStopRequested_~tmp~15, anyStopRequested_~tmp___0~5, anyStopRequested_~tmp___1~4, anyStopRequested_~tmp___2~2, anyStopRequested_~tmp___3~1;havoc anyStopRequested_~retValue_acc~16;havoc anyStopRequested_~tmp~15;havoc anyStopRequested_~tmp___0~5;havoc anyStopRequested_~tmp___1~4;havoc anyStopRequested_~tmp___2~2;havoc anyStopRequested_~tmp___3~1;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~5;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~5; 6558#L715-122true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~5 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~5; 1332#L742-122true anyStopRequested_#t~ret30 := isFloorCalling_#res;anyStopRequested_~tmp___3~1 := anyStopRequested_#t~ret30;havoc anyStopRequested_#t~ret30; 2479#L1879true assume 0 != anyStopRequested_~tmp___3~1;anyStopRequested_~retValue_acc~16 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~16; 6293#L1943true isIdle_#t~ret35 := anyStopRequested_#res;isIdle_~tmp~16 := isIdle_#t~ret35;havoc isIdle_#t~ret35;isIdle_~retValue_acc~17 := (if 0 == isIdle_~tmp~16 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~17; 5369#L1956true cleanup_#t~ret8 := isIdle_#res;cleanup_~tmp~6 := cleanup_#t~ret8;havoc cleanup_#t~ret8; 3173#L328true assume !(0 != cleanup_~tmp~6);havoc timeShift_#t~ret80, timeShift_~tmp~24;havoc timeShift_~tmp~24;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~12;havoc areDoorsOpen_~retValue_acc~12;areDoorsOpen_~retValue_acc~12 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~12; 5560#L1780-6true timeShift_#t~ret80 := areDoorsOpen_#res;timeShift_~tmp~24 := timeShift_#t~ret80;havoc timeShift_#t~ret80; 2676#L2729-1true assume 0 != timeShift_~tmp~24; 2710#L2730-2true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 2486#L2406-23true havoc __utac_acc__Specification2_spec__3_#t~ret21, __utac_acc__Specification2_spec__3_#t~ret22, __utac_acc__Specification2_spec__3_#t~ret23, __utac_acc__Specification2_spec__3_#t~ret24, __utac_acc__Specification2_spec__3_#t~ret25, __utac_acc__Specification2_spec__3_#t~ret26, __utac_acc__Specification2_spec__3_~floor~0, __utac_acc__Specification2_spec__3_~tmp~11, __utac_acc__Specification2_spec__3_~tmp___0~4, __utac_acc__Specification2_spec__3_~tmp___1~3, __utac_acc__Specification2_spec__3_~tmp___2~1, __utac_acc__Specification2_spec__3_~tmp___3~0, __utac_acc__Specification2_spec__3_~tmp___4~0;havoc __utac_acc__Specification2_spec__3_~floor~0;havoc __utac_acc__Specification2_spec__3_~tmp~11;havoc __utac_acc__Specification2_spec__3_~tmp___0~4;havoc __utac_acc__Specification2_spec__3_~tmp___1~3;havoc __utac_acc__Specification2_spec__3_~tmp___2~1;havoc __utac_acc__Specification2_spec__3_~tmp___3~0;havoc __utac_acc__Specification2_spec__3_~tmp___4~0;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~11;havoc getCurrentFloorID_~retValue_acc~11;getCurrentFloorID_~retValue_acc~11 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~11; 6867#L1771-5true __utac_acc__Specification2_spec__3_#t~ret21 := getCurrentFloorID_#res;__utac_acc__Specification2_spec__3_~tmp~11 := __utac_acc__Specification2_spec__3_#t~ret21;havoc __utac_acc__Specification2_spec__3_#t~ret21;__utac_acc__Specification2_spec__3_~floor~0 := __utac_acc__Specification2_spec__3_~tmp~11; 3382#L1402-1true assume 0 == __utac_acc__Specification2_spec__3_~floor~0; 3475#L1403-1true assume 0 != ~floorButtons_spc2_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~12;havoc areDoorsOpen_~retValue_acc~12;areDoorsOpen_~retValue_acc~12 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~12; 5565#L1780-7true __utac_acc__Specification2_spec__3_#t~ret22 := areDoorsOpen_#res;__utac_acc__Specification2_spec__3_~tmp___4~0 := __utac_acc__Specification2_spec__3_#t~ret22;havoc __utac_acc__Specification2_spec__3_#t~ret22; 6408#L1407-2true assume 0 != __utac_acc__Specification2_spec__3_~tmp___4~0;~floorButtons_spc2_0~0 := 0; 1824#L1462-1true cleanup_~i~0 := 1 + cleanup_~i~0; 4042#L308-2true [2018-11-28 23:47:45,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:47:45,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1107775881, now seen corresponding path program 1 times [2018-11-28 23:47:45,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:47:45,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:47:45,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:47:45,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:47:45,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:47:45,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:47:46,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:47:46,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:47:46,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 23:47:46,026 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:47:46,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:47:46,026 INFO L82 PathProgramCache]: Analyzing trace with hash -2114326345, now seen corresponding path program 1 times [2018-11-28 23:47:46,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:47:46,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:47:46,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:47:46,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:47:46,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:47:46,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:47:46,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:47:46,978 WARN L180 SmtUtils]: Spent 881.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 84 [2018-11-28 23:47:47,425 WARN L180 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2018-11-28 23:47:47,436 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:47:47,437 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:47:47,437 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:47:47,437 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:47:47,437 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:47:47,438 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:47:47,438 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:47:47,439 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:47:47,439 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec2_product30_false-unreach-call_true-termination.cil.c_Iteration1_Loop [2018-11-28 23:47:47,439 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:47:47,440 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:47:47,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:47,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:47,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:47,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:47,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:47,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:47,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:47,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:47,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:47,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:47,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:47,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:47,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:47,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:47,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:47,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:47,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:47,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:47,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:47,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:47,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:47,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:47,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:47,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:47,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:47,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:47,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:47,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:47,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:47,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:47,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:47,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:47,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:47:48,313 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:47:48,314 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 [2018-11-28 23:47:48,326 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:47:48,327 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:47:48,343 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:47:48,344 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_~tmp___1~4=0} Honda state: {ULTIMATE.start_anyStopRequested_~tmp___1~4=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 [2018-11-28 23:47:48,370 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:47:48,370 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:47:48,391 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:47:48,391 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isIdle_#t~ret35=0} Honda state: {ULTIMATE.start_isIdle_#t~ret35=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 [2018-11-28 23:47:48,459 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:47:48,463 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:47:48,477 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:47:48,477 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isIdle_#res=0, ULTIMATE.start_cleanup_~tmp~6=0, ULTIMATE.start_isIdle_~retValue_acc~17=0} Honda state: {ULTIMATE.start_isIdle_#res=0, ULTIMATE.start_cleanup_~tmp~6=0, ULTIMATE.start_isIdle_~retValue_acc~17=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) [2018-11-28 23:47:48,573 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:47:48,573 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:47:48,587 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:47:48,587 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_#t~ret80=0} Honda state: {ULTIMATE.start_timeShift_#t~ret80=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) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:47:48,609 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:47:48,609 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:47:48,641 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:47:48,641 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:48:00,684 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2018-11-28 23:48:00,688 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:48:00,688 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:48:00,688 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:48:00,688 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:48:00,688 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:48:00,688 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:48:00,688 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:48:00,689 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:48:00,690 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec2_product30_false-unreach-call_true-termination.cil.c_Iteration1_Loop [2018-11-28 23:48:00,690 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:48:00,691 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:48:00,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:48:00,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:48:00,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:48:00,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:48:00,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:48:00,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:48:00,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:48:00,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:48:00,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:48:00,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:48:00,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:48:00,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:48:00,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:48:00,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:48:00,951 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-28 23:48:00,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:48:00,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:48:01,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:48:01,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:48:01,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:48:01,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:48:01,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:48:01,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:48:01,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:48:01,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:48:01,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:48:01,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:48:01,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:48:01,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:48:01,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:48:01,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:48:01,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:48:01,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:48:01,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:48:01,380 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-28 23:48:01,554 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-28 23:48:01,919 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-28 23:48:02,302 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:48:02,308 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:48:02,310 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:48:02,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:48:02,312 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:48:02,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:48:02,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:48:02,313 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:48:02,315 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:48:02,315 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:48:02,318 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:48:02,318 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:48:02,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:48:02,319 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:48:02,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:48:02,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:48:02,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:48:02,320 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:48:02,320 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:48:02,321 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:48:02,322 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:48:02,322 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:48:02,323 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:48:02,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:48:02,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:48:02,323 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:48:02,324 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:48:02,324 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:48:02,327 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:48:02,327 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:48:02,328 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:48:02,328 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:48:02,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:48:02,328 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:48:02,328 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:48:02,330 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:48:02,330 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:48:02,344 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:48:02,345 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:48:02,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:48:02,346 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:48:02,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:48:02,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:48:02,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:48:02,347 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:48:02,347 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:48:02,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:48:02,349 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:48:02,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:48:02,349 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:48:02,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:48:02,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:48:02,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:48:02,351 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:48:02,351 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:48:02,358 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:48:02,368 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:48:02,368 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:48:02,371 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:48:02,371 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:48:02,371 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:48:02,372 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~cleanupTimeShifts~0, ULTIMATE.start_cleanup_~i~0) = 1*~cleanupTimeShifts~0 - 1*ULTIMATE.start_cleanup_~i~0 Supporting invariants [] [2018-11-28 23:48:02,373 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:48:02,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:48:02,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:48:02,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:48:02,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:48:02,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:48:02,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:48:02,798 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 [2018-11-28 23:48:02,800 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6963 states. Second operand 5 states. [2018-11-28 23:48:03,302 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-28 23:48:04,246 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6963 states.. Second operand 5 states. Result 10494 states and 19826 transitions. Complement of second has 9 states. [2018-11-28 23:48:04,247 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 [2018-11-28 23:48:04,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:48:04,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13223 transitions. [2018-11-28 23:48:04,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13223 transitions. Stem has 24 letters. Loop has 22 letters. [2018-11-28 23:48:04,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:48:04,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13223 transitions. Stem has 46 letters. Loop has 22 letters. [2018-11-28 23:48:04,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:48:04,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13223 transitions. Stem has 24 letters. Loop has 44 letters. [2018-11-28 23:48:04,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:48:04,277 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10494 states and 19826 transitions. [2018-11-28 23:48:04,383 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:48:04,387 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10494 states to 0 states and 0 transitions. [2018-11-28 23:48:04,388 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:48:04,388 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:48:04,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:48:04,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:48:04,390 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:48:04,390 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:48:04,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:48:04,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:48:04,399 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2018-11-28 23:48:04,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:48:04,403 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-28 23:48:04,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 23:48:04,405 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-28 23:48:04,405 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:48:04,405 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 23:48:04,405 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:48:04,405 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:48:04,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:48:04,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:48:04,406 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:48:04,406 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:48:04,406 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:48:04,406 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:48:04,406 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:48:04,406 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:48:04,406 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:48:04,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:48:04 BoogieIcfgContainer [2018-11-28 23:48:04,417 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:48:04,417 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:48:04,417 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:48:04,417 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:48:04,418 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:47:45" (3/4) ... [2018-11-28 23:48:04,423 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:48:04,423 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:48:04,424 INFO L168 Benchmark]: Toolchain (without parser) took 38895.62 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 602.4 MB). Free memory was 943.2 MB in the beginning and 1.3 GB in the end (delta: -348.7 MB). Peak memory consumption was 253.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:48:04,426 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. [2018-11-28 23:48:04,427 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1235.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 943.2 MB in the beginning and 1.1 GB in the end (delta: -143.7 MB). Peak memory consumption was 56.6 MB. Max. memory is 11.5 GB. [2018-11-28 23:48:04,428 INFO L168 Benchmark]: Boogie Procedure Inliner took 377.49 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: 68.6 MB). Peak memory consumption was 68.6 MB. Max. memory is 11.5 GB. [2018-11-28 23:48:04,429 INFO L168 Benchmark]: Boogie Preprocessor took 475.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 942.8 MB in the end (delta: 75.5 MB). Peak memory consumption was 75.5 MB. Max. memory is 11.5 GB. [2018-11-28 23:48:04,430 INFO L168 Benchmark]: RCFGBuilder took 17425.15 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 481.8 MB). Free memory was 942.8 MB in the beginning and 1.3 GB in the end (delta: -389.3 MB). Peak memory consumption was 440.8 MB. Max. memory is 11.5 GB. [2018-11-28 23:48:04,431 INFO L168 Benchmark]: BuchiAutomizer took 19370.32 ms. Allocated memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: -1.6 MB). Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 40.2 MB). Peak memory consumption was 38.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:48:04,433 INFO L168 Benchmark]: Witness Printer took 6.21 ms. Allocated memory is still 1.6 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:48:04,439 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 1235.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 943.2 MB in the beginning and 1.1 GB in the end (delta: -143.7 MB). Peak memory consumption was 56.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 377.49 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: 68.6 MB). Peak memory consumption was 68.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 475.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 942.8 MB in the end (delta: 75.5 MB). Peak memory consumption was 75.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 17425.15 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 481.8 MB). Free memory was 942.8 MB in the beginning and 1.3 GB in the end (delta: -389.3 MB). Peak memory consumption was 440.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 19370.32 ms. Allocated memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: -1.6 MB). Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 40.2 MB). Peak memory consumption was 38.7 MB. Max. memory is 11.5 GB. * Witness Printer took 6.21 ms. Allocated memory is still 1.6 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function cleanupTimeShifts + -1 * i and consists of 6 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 19.3s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 16.8s. Construction of modules took 0.1s. Büchi inclusion checks took 1.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 13189 SDtfs, 19759 SDslu, 6611 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: 17ms VariablesStem: 0 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 1 LassoNonterminationAnalysisTime: 12.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...