./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/product-lines/elevator_spec2_product30.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/product-lines/elevator_spec2_product30.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.25-f470102 [2019-11-28 20:52:58,260 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:52:58,263 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:52:58,281 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:52:58,281 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:52:58,283 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:52:58,286 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:52:58,296 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:52:58,301 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:52:58,305 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:52:58,307 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:52:58,309 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:52:58,310 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:52:58,313 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:52:58,315 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:52:58,317 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:52:58,318 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:52:58,319 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:52:58,322 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:52:58,326 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:52:58,330 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:52:58,331 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:52:58,332 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:52:58,333 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:52:58,335 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:52:58,336 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:52:58,336 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:52:58,337 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:52:58,337 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:52:58,338 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:52:58,339 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:52:58,339 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:52:58,340 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:52:58,341 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:52:58,342 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:52:58,342 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:52:58,343 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:52:58,343 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:52:58,343 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:52:58,344 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:52:58,345 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:52:58,346 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 20:52:58,371 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:52:58,377 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:52:58,378 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:52:58,379 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:52:58,379 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:52:58,379 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 20:52:58,380 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 20:52:58,380 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 20:52:58,380 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 20:52:58,380 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 20:52:58,381 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 20:52:58,381 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:52:58,381 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 20:52:58,382 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:52:58,382 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:52:58,382 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 20:52:58,382 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:52:58,383 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 20:52:58,383 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 20:52:58,383 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 20:52:58,383 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 20:52:58,384 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 20:52:58,384 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 20:52:58,384 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:52:58,385 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 20:52:58,385 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:52:58,385 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:52:58,385 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 20:52:58,386 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:52:58,386 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:52:58,386 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:52:58,387 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 20:52:58,388 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 20:52:58,388 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 16eb34bf8ac588b2057113d948643073bd800c2b [2019-11-28 20:52:58,731 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:52:58,748 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:52:58,752 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:52:58,754 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:52:58,754 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:52:58,755 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec2_product30.cil.c [2019-11-28 20:52:58,829 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/531fd9fa2/f09b00561dbc4554a0b41c688628ec8e/FLAG200cf74f5 [2019-11-28 20:52:59,498 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:52:59,500 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product30.cil.c [2019-11-28 20:52:59,530 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/531fd9fa2/f09b00561dbc4554a0b41c688628ec8e/FLAG200cf74f5 [2019-11-28 20:52:59,693 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/531fd9fa2/f09b00561dbc4554a0b41c688628ec8e [2019-11-28 20:52:59,698 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:52:59,700 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 20:52:59,701 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:52:59,702 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:52:59,706 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:52:59,707 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:52:59" (1/1) ... [2019-11-28 20:52:59,711 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7261e065 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:52:59, skipping insertion in model container [2019-11-28 20:52:59,712 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:52:59" (1/1) ... [2019-11-28 20:52:59,721 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:52:59,820 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:53:00,562 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:53:00,589 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:53:00,706 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:53:00,779 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:53:00,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:53:00 WrapperNode [2019-11-28 20:53:00,780 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:53:00,781 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 20:53:00,781 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 20:53:00,781 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 20:53:00,787 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:53:00" (1/1) ... [2019-11-28 20:53:00,820 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:53:00" (1/1) ... [2019-11-28 20:53:01,190 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 20:53:01,191 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:53:01,191 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:53:01,192 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:53:01,203 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:53:00" (1/1) ... [2019-11-28 20:53:01,204 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:53:00" (1/1) ... [2019-11-28 20:53:01,263 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:53:00" (1/1) ... [2019-11-28 20:53:01,264 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:53:00" (1/1) ... [2019-11-28 20:53:01,474 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:53:00" (1/1) ... [2019-11-28 20:53:01,658 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:53:00" (1/1) ... [2019-11-28 20:53:01,706 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:53:00" (1/1) ... [2019-11-28 20:53:01,775 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:53:01,776 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:53:01,776 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:53:01,776 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:53:01,777 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:53:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:53:01,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 20:53:01,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-28 20:53:01,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:53:01,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:53:15,041 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:53:15,044 INFO L287 CfgBuilder]: Removed 1565 assume(true) statements. [2019-11-28 20:53:15,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:53:15 BoogieIcfgContainer [2019-11-28 20:53:15,049 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:53:15,050 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 20:53:15,050 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 20:53:15,054 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 20:53:15,055 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:53:15,055 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 08:52:59" (1/3) ... [2019-11-28 20:53:15,057 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@74aa0bd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:53:15, skipping insertion in model container [2019-11-28 20:53:15,057 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:53:15,058 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:53:00" (2/3) ... [2019-11-28 20:53:15,058 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@74aa0bd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:53:15, skipping insertion in model container [2019-11-28 20:53:15,058 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:53:15,059 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:53:15" (3/3) ... [2019-11-28 20:53:15,062 INFO L371 chiAutomizerObserver]: Analyzing ICFG elevator_spec2_product30.cil.c [2019-11-28 20:53:15,105 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 20:53:15,105 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 20:53:15,106 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 20:53:15,106 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:53:15,106 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:53:15,106 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 20:53:15,106 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:53:15,106 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 20:53:15,211 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6963 states. [2019-11-28 20:53:15,410 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3471 [2019-11-28 20:53:15,410 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:53:15,410 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:53:15,434 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:53:15,435 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:53:15,435 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 20:53:15,435 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6963 states. [2019-11-28 20:53:15,530 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3471 [2019-11-28 20:53:15,531 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:53:15,531 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:53:15,539 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:53:15,540 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:53:15,555 INFO L794 eck$LassoCheckResult]: Stem: 2110#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string81.base, #t~string81.offset := #Ultimate.allocOnStack(10);call #t~string83.base, #t~string83.offset := #Ultimate.allocOnStack(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.allocOnStack(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.allocOnStack(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.allocOnStack(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.allocOnStack(10);call #t~string93.base, #t~string93.offset := #Ultimate.allocOnStack(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.allocOnStack(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.allocOnStack(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.allocOnStack(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.allocOnStack(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.allocOnStack(4);call write~init~int(32, #t~string103.base, #t~string103.offset, 1);call write~init~int(37, #t~string103.base, 1 + #t~string103.offset, 1);call write~init~int(105, #t~string103.base, 2 + #t~string103.offset, 1);call write~init~int(0, #t~string103.base, 3 + #t~string103.offset, 1);call #t~string105.base, #t~string105.offset := #Ultimate.allocOnStack(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.allocOnStack(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.allocOnStack(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.allocOnStack(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.allocOnStack(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.allocOnStack(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.allocOnStack(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.allocOnStack(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.allocOnStack(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.allocOnStack(9);call #t~string149.base, #t~string149.offset := #Ultimate.allocOnStack(30);call #t~string150.base, #t~string150.offset := #Ultimate.allocOnStack(9);call #t~string151.base, #t~string151.offset := #Ultimate.allocOnStack(21);call #t~string152.base, #t~string152.offset := #Ultimate.allocOnStack(30);call #t~string153.base, #t~string153.offset := #Ultimate.allocOnStack(9);call #t~string154.base, #t~string154.offset := #Ultimate.allocOnStack(21);call #t~string158.base, #t~string158.offset := #Ultimate.allocOnStack(30);call #t~string159.base, #t~string159.offset := #Ultimate.allocOnStack(9);call #t~string160.base, #t~string160.offset := #Ultimate.allocOnStack(25);call #t~string161.base, #t~string161.offset := #Ultimate.allocOnStack(30);call #t~string162.base, #t~string162.offset := #Ultimate.allocOnStack(9);call #t~string163.base, #t~string163.offset := #Ultimate.allocOnStack(25);~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;~head~0.base, ~head~0.offset := 0, 0; 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 [2019-11-28 20:53:15,557 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 [2019-11-28 20:53:15,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:53:15,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1107775881, now seen corresponding path program 1 times [2019-11-28 20:53:15,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:53:15,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557081575] [2019-11-28 20:53:15,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:53:15,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:53:15,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:53:15,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557081575] [2019-11-28 20:53:15,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:53:15,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:53:15,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988060920] [2019-11-28 20:53:16,002 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 20:53:16,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:53:16,004 INFO L82 PathProgramCache]: Analyzing trace with hash -2114326345, now seen corresponding path program 1 times [2019-11-28 20:53:16,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:53:16,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472591746] [2019-11-28 20:53:16,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:53:16,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:53:16,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:53:16,099 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:53:16,362 WARN L192 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 84 [2019-11-28 20:53:16,724 WARN L192 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2019-11-28 20:53:16,744 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:53:16,745 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:53:16,745 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:53:16,745 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:53:16,745 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 20:53:16,745 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:53:16,745 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:53:16,746 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:53:16,746 INFO L133 ssoRankerPreferences]: Filename of dumped script: elevator_spec2_product30.cil.c_Iteration1_Loop [2019-11-28 20:53:16,746 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:53:16,746 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:53:16,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:53:16,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:53:16,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:53:16,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:53:16,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:53:16,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:53:16,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:53:16,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:53:16,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:53:16,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:53:16,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:53:16,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:53:16,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:53:16,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:53:16,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:53:16,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:53:16,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:53:16,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:53:16,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:53:16,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:53:16,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:53:16,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:53:16,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:53:16,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:53:16,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:53:16,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:53:16,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:53:16,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:53:16,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:53:16,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:53:16,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:53:16,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:53:16,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:53:17,430 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:53:17,431 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:53:17,440 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:53:17,440 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:53:17,449 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 20:53:17,450 INFO L440 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 [2019-11-28 20:53:17,469 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:53:17,469 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 20:53:17,475 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 20:53:17,475 INFO L440 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 [2019-11-28 20:53:17,489 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:53:17,489 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 20:53:17,498 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 20:53:17,498 INFO L440 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) [2019-11-28 20:53:17,514 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:53:17,514 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:53:17,519 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 20:53:17,519 INFO L440 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 [2019-11-28 20:53:17,529 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 20:53:17,530 INFO L160 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) [2019-11-28 20:53:17,552 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 20:53:17,552 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:53:29,589 INFO L442 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-11-28 20:53:29,592 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 20:53:29,593 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 20:53:29,593 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 20:53:29,593 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 20:53:29,593 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 20:53:29,594 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:53:29,594 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 20:53:29,594 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 20:53:29,594 INFO L133 ssoRankerPreferences]: Filename of dumped script: elevator_spec2_product30.cil.c_Iteration1_Loop [2019-11-28 20:53:29,594 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 20:53:29,595 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 20:53:29,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:53:29,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:53:29,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:53:29,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:53:29,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:53:29,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:53:29,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:53:29,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:53:29,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:53:29,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:53:29,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:53:29,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:53:29,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:53:29,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:53:29,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:53:29,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:53:29,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:53:29,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:53:29,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:53:29,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:53:29,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:53:29,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:53:29,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:53:29,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:53:29,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:53:29,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:53:29,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:53:29,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:53:29,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:53:29,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:53:29,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:53:29,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:53:29,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 20:53:30,014 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-11-28 20:53:30,399 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 20:53:30,409 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:53:30,423 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:53:30,426 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:53:30,426 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:53:30,427 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:53:30,427 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:53:30,427 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:53:30,430 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:53:30,430 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:53:30,433 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:53:30,448 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:53:30,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:53:30,450 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:53:30,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:53:30,451 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:53:30,451 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:53:30,455 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:53:30,455 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:53:30,461 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:53:30,477 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:53:30,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:53:30,480 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:53:30,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:53:30,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:53:30,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:53:30,484 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:53:30,485 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:53:30,490 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:53:30,507 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:53:30,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:53:30,510 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:53:30,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:53:30,510 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 20:53:30,510 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:53:30,517 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-28 20:53:30,517 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:53:30,531 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 20:53:30,547 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:53:30,549 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:53:30,549 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:53:30,550 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:53:30,554 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:53:30,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:53:30,557 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:53:30,557 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:53:30,563 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:53:30,582 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 20:53:30,584 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 20:53:30,584 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 20:53:30,584 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 20:53:30,584 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 20:53:30,584 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 20:53:30,586 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 20:53:30,586 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 20:53:30,590 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 20:53:30,614 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-28 20:53:30,614 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:53:30,632 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 20:53:30,632 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 20:53:30,632 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 20:53:30,633 INFO L512 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 [] [2019-11-28 20:53:30,641 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 20:53:30,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:53:30,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:53:30,835 INFO L264 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 20:53:30,843 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:53:30,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:53:30,894 INFO L264 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 20:53:30,898 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:53:30,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:53:30,968 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-28 20:53:30,970 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6963 states. Second operand 5 states. [2019-11-28 20:53:31,811 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. [2019-11-28 20:53:31,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-28 20:53:31,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 20:53:31,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13223 transitions. [2019-11-28 20:53:31,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13223 transitions. Stem has 24 letters. Loop has 22 letters. [2019-11-28 20:53:31,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:53:31,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13223 transitions. Stem has 46 letters. Loop has 22 letters. [2019-11-28 20:53:31,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:53:31,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13223 transitions. Stem has 24 letters. Loop has 44 letters. [2019-11-28 20:53:31,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 20:53:31,840 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10494 states and 19826 transitions. [2019-11-28 20:53:31,961 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 20:53:31,964 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10494 states to 0 states and 0 transitions. [2019-11-28 20:53:31,966 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 20:53:31,966 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 20:53:31,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 20:53:31,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:53:31,967 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:53:31,967 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:53:31,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:53:31,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:53:31,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:53:31,974 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2019-11-28 20:53:31,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:53:31,979 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-11-28 20:53:31,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 20:53:31,980 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-11-28 20:53:31,980 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 20:53:31,981 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 20:53:31,981 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 20:53:31,981 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 20:53:31,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 20:53:31,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 20:53:31,981 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:53:31,981 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:53:31,982 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:53:31,982 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 20:53:31,982 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 20:53:31,982 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 20:53:31,982 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 20:53:31,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 08:53:31 BoogieIcfgContainer [2019-11-28 20:53:31,990 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 20:53:31,993 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:53:31,993 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:53:31,994 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:53:31,994 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:53:15" (3/4) ... [2019-11-28 20:53:31,998 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 20:53:31,998 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:53:32,002 INFO L168 Benchmark]: Toolchain (without parser) took 32300.96 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 632.3 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -111.7 MB). Peak memory consumption was 520.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:53:32,003 INFO L168 Benchmark]: CDTParser took 0.69 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:53:32,005 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1079.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -136.4 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2019-11-28 20:53:32,007 INFO L168 Benchmark]: Boogie Procedure Inliner took 410.13 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: 72.6 MB). Peak memory consumption was 72.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:53:32,010 INFO L168 Benchmark]: Boogie Preprocessor took 584.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 943.6 MB in the end (delta: 72.6 MB). Peak memory consumption was 72.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:53:32,016 INFO L168 Benchmark]: RCFGBuilder took 13273.41 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 488.1 MB). Free memory was 943.6 MB in the beginning and 1.2 GB in the end (delta: -264.5 MB). Peak memory consumption was 401.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:53:32,016 INFO L168 Benchmark]: BuchiAutomizer took 16940.45 ms. Allocated memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: -1.0 MB). Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 144.1 MB). Peak memory consumption was 143.1 MB. Max. memory is 11.5 GB. [2019-11-28 20:53:32,017 INFO L168 Benchmark]: Witness Printer took 5.39 ms. Allocated memory is still 1.7 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:53:32,030 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.69 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1079.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -136.4 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 410.13 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: 72.6 MB). Peak memory consumption was 72.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 584.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 943.6 MB in the end (delta: 72.6 MB). Peak memory consumption was 72.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 13273.41 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 488.1 MB). Free memory was 943.6 MB in the beginning and 1.2 GB in the end (delta: -264.5 MB). Peak memory consumption was 401.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 16940.45 ms. Allocated memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: -1.0 MB). Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 144.1 MB). Peak memory consumption was 143.1 MB. Max. memory is 11.5 GB. * Witness Printer took 5.39 ms. Allocated memory is still 1.7 GB. Free memory is still 1.1 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 16.8s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 15.1s. Construction of modules took 0.0s. Büchi inclusion checks took 1.1s. 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.0s 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: 37ms VariablesStem: 0 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 1 LassoNonterminationAnalysisTime: 12.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...