./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/elevator_spec2_product26_false-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/product-lines/elevator_spec2_product26_false-unreach-call_true-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 773d2c4d0eda21b7c46dba917d93fd8caf4fa295 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 23:20:17,010 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:20:17,011 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:20:17,023 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:20:17,024 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:20:17,027 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:20:17,029 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:20:17,032 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:20:17,033 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:20:17,034 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:20:17,035 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:20:17,035 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:20:17,036 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:20:17,037 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:20:17,038 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:20:17,043 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:20:17,044 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:20:17,049 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:20:17,053 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:20:17,057 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:20:17,058 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:20:17,060 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:20:17,063 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:20:17,065 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:20:17,066 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:20:17,067 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:20:17,067 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:20:17,069 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:20:17,070 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:20:17,072 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:20:17,074 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:20:17,074 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:20:17,074 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:20:17,075 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:20:17,075 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:20:17,078 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:20:17,078 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-01 23:20:17,097 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:20:17,098 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:20:17,099 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:20:17,099 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:20:17,099 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:20:17,100 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:20:17,100 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:20:17,100 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:20:17,100 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:20:17,100 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:20:17,100 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:20:17,101 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:20:17,101 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:20:17,101 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:20:17,101 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:20:17,101 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:20:17,101 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:20:17,103 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:20:17,103 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:20:17,103 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:20:17,103 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:20:17,104 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:20:17,104 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:20:17,104 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:20:17,104 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:20:17,104 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:20:17,104 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:20:17,106 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:20:17,106 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:20:17,106 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:20:17,106 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:20:17,108 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:20:17,108 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 773d2c4d0eda21b7c46dba917d93fd8caf4fa295 [2019-01-01 23:20:17,142 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:20:17,156 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:20:17,160 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:20:17,161 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:20:17,161 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:20:17,162 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/elevator_spec2_product26_false-unreach-call_true-termination.cil.c [2019-01-01 23:20:17,217 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9ae96003/d0d8617f744d4dda9ce4ea51911b9f95/FLAG61303cb82 [2019-01-01 23:20:17,909 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:20:17,909 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/elevator_spec2_product26_false-unreach-call_true-termination.cil.c [2019-01-01 23:20:17,932 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9ae96003/d0d8617f744d4dda9ce4ea51911b9f95/FLAG61303cb82 [2019-01-01 23:20:18,028 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9ae96003/d0d8617f744d4dda9ce4ea51911b9f95 [2019-01-01 23:20:18,032 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:20:18,033 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:20:18,034 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:20:18,034 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:20:18,038 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:20:18,039 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:20:18" (1/1) ... [2019-01-01 23:20:18,043 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@135d5d44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:20:18, skipping insertion in model container [2019-01-01 23:20:18,045 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:20:18" (1/1) ... [2019-01-01 23:20:18,054 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:20:18,152 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:20:18,870 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:20:18,973 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:20:19,126 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:20:19,207 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:20:19,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:20:19 WrapperNode [2019-01-01 23:20:19,208 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:20:19,209 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:20:19,209 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:20:19,209 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:20:19,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:20:19" (1/1) ... [2019-01-01 23:20:19,265 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:20:19" (1/1) ... [2019-01-01 23:20:19,495 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:20:19,495 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:20:19,496 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:20:19,496 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:20:19,508 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:20:19" (1/1) ... [2019-01-01 23:20:19,508 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:20:19" (1/1) ... [2019-01-01 23:20:19,546 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:20:19" (1/1) ... [2019-01-01 23:20:19,547 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:20:19" (1/1) ... [2019-01-01 23:20:19,676 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:20:19" (1/1) ... [2019-01-01 23:20:19,819 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:20:19" (1/1) ... [2019-01-01 23:20:19,854 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:20:19" (1/1) ... [2019-01-01 23:20:19,898 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:20:19,899 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:20:19,899 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:20:19,899 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:20:19,900 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:20:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:20:19,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 23:20:19,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-01 23:20:19,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:20:19,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:20:35,707 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:20:35,708 INFO L280 CfgBuilder]: Removed 1125 assue(true) statements. [2019-01-01 23:20:35,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:20:35 BoogieIcfgContainer [2019-01-01 23:20:35,708 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:20:35,709 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:20:35,709 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:20:35,713 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:20:35,714 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:20:35,714 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:20:18" (1/3) ... [2019-01-01 23:20:35,715 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2a51d2a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:20:35, skipping insertion in model container [2019-01-01 23:20:35,715 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:20:35,716 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:20:19" (2/3) ... [2019-01-01 23:20:35,716 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2a51d2a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:20:35, skipping insertion in model container [2019-01-01 23:20:35,717 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:20:35,717 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:20:35" (3/3) ... [2019-01-01 23:20:35,719 INFO L375 chiAutomizerObserver]: Analyzing ICFG elevator_spec2_product26_false-unreach-call_true-termination.cil.c [2019-01-01 23:20:35,785 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:20:35,786 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:20:35,786 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:20:35,786 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:20:35,786 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:20:35,787 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:20:35,787 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:20:35,787 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:20:35,788 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:20:35,880 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4855 states. [2019-01-01 23:20:36,042 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2417 [2019-01-01 23:20:36,042 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:20:36,043 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:20:36,064 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:20:36,064 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:20:36,065 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:20:36,065 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4855 states. [2019-01-01 23:20:36,146 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2417 [2019-01-01 23:20:36,146 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:20:36,146 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:20:36,150 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:20:36,151 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:20:36,165 INFO L794 eck$LassoCheckResult]: Stem: 2374#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~cleanupTimeShifts~0 := 12;~weight~0 := 0;~maximumWeight~0 := 100;~blocked~0 := 0;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0;call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(10);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string63.base, #t~string63.offset, 1);call write~init~int(95, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(93, #t~string63.base, 2 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 3 + #t~string63.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string65.base, #t~string65.offset, 1);call write~init~int(93, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(32, #t~string65.base, 2 + #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 3 + #t~string65.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string67.base, #t~string67.offset, 1);call write~init~int(97, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(116, #t~string67.base, 2 + #t~string67.offset, 1);call write~init~int(32, #t~string67.base, 3 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 4 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string69.base, #t~string69.offset, 1);call write~init~int(105, #t~string69.base, 1 + #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 2 + #t~string69.offset, 1);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(10);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string73.base, #t~string73.offset, 1);call write~init~int(112, #t~string73.base, 1 + #t~string73.offset, 1);call write~init~int(0, #t~string73.base, 2 + #t~string73.offset, 1);call #t~string75.base, #t~string75.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string75.base, #t~string75.offset, 1);call write~init~int(111, #t~string75.base, 1 + #t~string75.offset, 1);call write~init~int(119, #t~string75.base, 2 + #t~string75.offset, 1);call write~init~int(110, #t~string75.base, 3 + #t~string75.offset, 1);call write~init~int(0, #t~string75.base, 4 + #t~string75.offset, 1);call #t~string77.base, #t~string77.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string77.base, #t~string77.offset, 1);call write~init~int(73, #t~string77.base, 1 + #t~string77.offset, 1);call write~init~int(76, #t~string77.base, 2 + #t~string77.offset, 1);call write~init~int(95, #t~string77.base, 3 + #t~string77.offset, 1);call write~init~int(112, #t~string77.base, 4 + #t~string77.offset, 1);call write~init~int(58, #t~string77.base, 5 + #t~string77.offset, 1);call write~init~int(0, #t~string77.base, 6 + #t~string77.offset, 1);call #t~string79.base, #t~string79.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string79.base, #t~string79.offset, 1);call write~init~int(37, #t~string79.base, 1 + #t~string79.offset, 1);call write~init~int(105, #t~string79.base, 2 + #t~string79.offset, 1);call write~init~int(0, #t~string79.base, 3 + #t~string79.offset, 1);call #t~string81.base, #t~string81.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string81.base, #t~string81.offset, 1);call write~init~int(37, #t~string81.base, 1 + #t~string81.offset, 1);call write~init~int(105, #t~string81.base, 2 + #t~string81.offset, 1);call write~init~int(0, #t~string81.base, 3 + #t~string81.offset, 1);call #t~string83.base, #t~string83.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string83.base, #t~string83.offset, 1);call write~init~int(37, #t~string83.base, 1 + #t~string83.offset, 1);call write~init~int(105, #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(32, #t~string85.base, #t~string85.offset, 1);call write~init~int(37, #t~string85.base, 1 + #t~string85.offset, 1);call write~init~int(105, #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(4);call write~init~int(32, #t~string87.base, #t~string87.offset, 1);call write~init~int(37, #t~string87.base, 1 + #t~string87.offset, 1);call write~init~int(105, #t~string87.base, 2 + #t~string87.offset, 1);call write~init~int(0, #t~string87.base, 3 + #t~string87.offset, 1);call #t~string89.base, #t~string89.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string89.base, #t~string89.offset, 1);call write~init~int(70, #t~string89.base, 1 + #t~string89.offset, 1);call write~init~int(95, #t~string89.base, 2 + #t~string89.offset, 1);call write~init~int(112, #t~string89.base, 3 + #t~string89.offset, 1);call write~init~int(58, #t~string89.base, 4 + #t~string89.offset, 1);call write~init~int(0, #t~string89.base, 5 + #t~string89.offset, 1);call #t~string92.base, #t~string92.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string92.base, #t~string92.offset, 1);call write~init~int(37, #t~string92.base, 1 + #t~string92.offset, 1);call write~init~int(105, #t~string92.base, 2 + #t~string92.offset, 1);call write~init~int(0, #t~string92.base, 3 + #t~string92.offset, 1);call #t~string95.base, #t~string95.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string95.base, #t~string95.offset, 1);call write~init~int(37, #t~string95.base, 1 + #t~string95.offset, 1);call write~init~int(105, #t~string95.base, 2 + #t~string95.offset, 1);call write~init~int(0, #t~string95.base, 3 + #t~string95.offset, 1);call #t~string98.base, #t~string98.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string98.base, #t~string98.offset, 1);call write~init~int(37, #t~string98.base, 1 + #t~string98.offset, 1);call write~init~int(105, #t~string98.base, 2 + #t~string98.offset, 1);call write~init~int(0, #t~string98.base, 3 + #t~string98.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~string104.base, #t~string104.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string104.base, #t~string104.offset, 1);call write~init~int(37, #t~string104.base, 1 + #t~string104.offset, 1);call write~init~int(105, #t~string104.base, 2 + #t~string104.offset, 1);call write~init~int(0, #t~string104.base, 3 + #t~string104.offset, 1);call #t~string106.base, #t~string106.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string106.base, #t~string106.offset, 1);call write~init~int(0, #t~string106.base, 1 + #t~string106.offset, 1);call #t~string109.base, #t~string109.offset := #Ultimate.allocOnStack(9);~head~0.base, ~head~0.offset := 0, 0;call #t~string129.base, #t~string129.offset := #Ultimate.allocOnStack(30);call #t~string130.base, #t~string130.offset := #Ultimate.allocOnStack(9);call #t~string131.base, #t~string131.offset := #Ultimate.allocOnStack(21);call #t~string132.base, #t~string132.offset := #Ultimate.allocOnStack(30);call #t~string133.base, #t~string133.offset := #Ultimate.allocOnStack(9);call #t~string134.base, #t~string134.offset := #Ultimate.allocOnStack(21);call #t~string138.base, #t~string138.offset := #Ultimate.allocOnStack(30);call #t~string139.base, #t~string139.offset := #Ultimate.allocOnStack(9);call #t~string140.base, #t~string140.offset := #Ultimate.allocOnStack(25);call #t~string141.base, #t~string141.offset := #Ultimate.allocOnStack(30);call #t~string142.base, #t~string142.offset := #Ultimate.allocOnStack(9);call #t~string143.base, #t~string143.offset := #Ultimate.allocOnStack(25);~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~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; 3679#L-1true havoc main_#res;havoc main_#t~ret13, main_~retValue_acc~1, main_~tmp~8;havoc main_~retValue_acc~1;havoc main_~tmp~8; 153#L2449true havoc valid_product_#res;havoc valid_product_~retValue_acc~22;havoc valid_product_~retValue_acc~22;valid_product_~retValue_acc~22 := 1;valid_product_#res := valid_product_~retValue_acc~22; 681#L2457true main_#t~ret13 := valid_product_#res;main_~tmp~8 := main_#t~ret13;havoc main_#t~ret13; 2637#L389true assume 0 != main_~tmp~8; 3323#L358true ~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; 1833#L3138true havoc bigMacCall_#t~ret6, bigMacCall_~tmp~5;havoc bigMacCall_~tmp~5;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~16;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~16; 2801#L1974true assume 0 == getOrigin_~person;getOrigin_~retValue_acc~16 := 4;getOrigin_#res := getOrigin_~retValue_acc~16; 442#L1999true 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; 3982#L2815true assume 0 == initPersonOnFloor_~floor; 4126#L2816true assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 4282#L2923-1true callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 1891#L2607true assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 283#L2619-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~ret60, timeShift_~tmp~19;havoc timeShift_~tmp~19;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~4;havoc areDoorsOpen_~retValue_acc~4;areDoorsOpen_~retValue_acc~4 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~4; 1736#L674true timeShift_#t~ret60 := areDoorsOpen_#res;timeShift_~tmp~19 := timeShift_#t~ret60;havoc timeShift_#t~ret60; 1498#L1557true assume 0 != timeShift_~tmp~19; 1588#L1558true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 3071#L1261-11true havoc __utac_acc__Specification2_spec__3_#t~ret147, __utac_acc__Specification2_spec__3_#t~ret148, __utac_acc__Specification2_spec__3_#t~ret149, __utac_acc__Specification2_spec__3_#t~ret150, __utac_acc__Specification2_spec__3_#t~ret151, __utac_acc__Specification2_spec__3_#t~ret152, __utac_acc__Specification2_spec__3_~floor~0, __utac_acc__Specification2_spec__3_~tmp~25, __utac_acc__Specification2_spec__3_~tmp___0~8, __utac_acc__Specification2_spec__3_~tmp___1~6, __utac_acc__Specification2_spec__3_~tmp___2~6, __utac_acc__Specification2_spec__3_~tmp___3~5, __utac_acc__Specification2_spec__3_~tmp___4~3;havoc __utac_acc__Specification2_spec__3_~floor~0;havoc __utac_acc__Specification2_spec__3_~tmp~25;havoc __utac_acc__Specification2_spec__3_~tmp___0~8;havoc __utac_acc__Specification2_spec__3_~tmp___1~6;havoc __utac_acc__Specification2_spec__3_~tmp___2~6;havoc __utac_acc__Specification2_spec__3_~tmp___3~5;havoc __utac_acc__Specification2_spec__3_~tmp___4~3;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~3;havoc getCurrentFloorID_~retValue_acc~3;getCurrentFloorID_~retValue_acc~3 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~3; 1166#L665true __utac_acc__Specification2_spec__3_#t~ret147 := getCurrentFloorID_#res;__utac_acc__Specification2_spec__3_~tmp~25 := __utac_acc__Specification2_spec__3_#t~ret147;havoc __utac_acc__Specification2_spec__3_#t~ret147;__utac_acc__Specification2_spec__3_~floor~0 := __utac_acc__Specification2_spec__3_~tmp~25; 4376#L3183true assume 0 == __utac_acc__Specification2_spec__3_~floor~0; 4508#L3184true assume 0 != ~floorButtons_spc2_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~4;havoc areDoorsOpen_~retValue_acc~4;areDoorsOpen_~retValue_acc~4 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~4; 1737#L674-1true __utac_acc__Specification2_spec__3_#t~ret148 := areDoorsOpen_#res;__utac_acc__Specification2_spec__3_~tmp___4~3 := __utac_acc__Specification2_spec__3_#t~ret148;havoc __utac_acc__Specification2_spec__3_#t~ret148; 2485#L3188true assume 0 != __utac_acc__Specification2_spec__3_~tmp___4~3;~floorButtons_spc2_0~0 := 0; 88#L3243true cleanup_~i~0 := 0; 4356#L188-2true [2019-01-01 23:20:36,171 INFO L796 eck$LassoCheckResult]: Loop: 4356#L188-2true assume !false; 4498#L189true cleanup_~__cil_tmp4~0 := ~cleanupTimeShifts~0 - 1; 4297#L192true assume cleanup_~i~0 < cleanup_~__cil_tmp4~0;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~2;havoc isBlocked_~retValue_acc~2;isBlocked_~retValue_acc~2 := ~blocked~0;isBlocked_#res := isBlocked_~retValue_acc~2; 1269#L487true cleanup_#t~ret7 := isBlocked_#res;cleanup_~tmp___0~0 := cleanup_#t~ret7;havoc cleanup_#t~ret7; 2350#L196true assume 1 != cleanup_~tmp___0~0; 2347#L196-1true havoc isIdle_#res;havoc isIdle_#t~ret22, isIdle_~retValue_acc~9, isIdle_~tmp~13;havoc isIdle_~retValue_acc~9;havoc isIdle_~tmp~13;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret17, anyStopRequested_#t~ret18, anyStopRequested_#t~ret19, anyStopRequested_#t~ret20, anyStopRequested_#t~ret21, anyStopRequested_~retValue_acc~8, anyStopRequested_~tmp~12, anyStopRequested_~tmp___0~2, anyStopRequested_~tmp___1~1, anyStopRequested_~tmp___2~1, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~8;havoc anyStopRequested_~tmp~12;havoc anyStopRequested_~tmp___0~2;havoc anyStopRequested_~tmp___1~1;havoc anyStopRequested_~tmp___2~1;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~23;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~23; 878#L2544-42true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~23 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~23; 2416#L2571-42true anyStopRequested_#t~ret17 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret17;havoc anyStopRequested_#t~ret17; 252#L773true assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~8 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~8; 1382#L837true isIdle_#t~ret22 := anyStopRequested_#res;isIdle_~tmp~13 := isIdle_#t~ret22;havoc isIdle_#t~ret22;isIdle_~retValue_acc~9 := (if 0 == isIdle_~tmp~13 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~9; 1749#L850true cleanup_#t~ret8 := isIdle_#res;cleanup_~tmp~6 := cleanup_#t~ret8;havoc cleanup_#t~ret8; 2859#L208true assume !(0 != cleanup_~tmp~6);havoc timeShift_#t~ret60, timeShift_~tmp~19;havoc timeShift_~tmp~19;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~4;havoc areDoorsOpen_~retValue_acc~4;areDoorsOpen_~retValue_acc~4 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~4; 1723#L674-6true timeShift_#t~ret60 := areDoorsOpen_#res;timeShift_~tmp~19 := timeShift_#t~ret60;havoc timeShift_#t~ret60; 1646#L1557-1true assume 0 != timeShift_~tmp~19; 1570#L1558-2true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 3053#L1261-23true havoc __utac_acc__Specification2_spec__3_#t~ret147, __utac_acc__Specification2_spec__3_#t~ret148, __utac_acc__Specification2_spec__3_#t~ret149, __utac_acc__Specification2_spec__3_#t~ret150, __utac_acc__Specification2_spec__3_#t~ret151, __utac_acc__Specification2_spec__3_#t~ret152, __utac_acc__Specification2_spec__3_~floor~0, __utac_acc__Specification2_spec__3_~tmp~25, __utac_acc__Specification2_spec__3_~tmp___0~8, __utac_acc__Specification2_spec__3_~tmp___1~6, __utac_acc__Specification2_spec__3_~tmp___2~6, __utac_acc__Specification2_spec__3_~tmp___3~5, __utac_acc__Specification2_spec__3_~tmp___4~3;havoc __utac_acc__Specification2_spec__3_~floor~0;havoc __utac_acc__Specification2_spec__3_~tmp~25;havoc __utac_acc__Specification2_spec__3_~tmp___0~8;havoc __utac_acc__Specification2_spec__3_~tmp___1~6;havoc __utac_acc__Specification2_spec__3_~tmp___2~6;havoc __utac_acc__Specification2_spec__3_~tmp___3~5;havoc __utac_acc__Specification2_spec__3_~tmp___4~3;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~3;havoc getCurrentFloorID_~retValue_acc~3;getCurrentFloorID_~retValue_acc~3 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~3; 1167#L665-1true __utac_acc__Specification2_spec__3_#t~ret147 := getCurrentFloorID_#res;__utac_acc__Specification2_spec__3_~tmp~25 := __utac_acc__Specification2_spec__3_#t~ret147;havoc __utac_acc__Specification2_spec__3_#t~ret147;__utac_acc__Specification2_spec__3_~floor~0 := __utac_acc__Specification2_spec__3_~tmp~25; 4361#L3183-1true assume 0 == __utac_acc__Specification2_spec__3_~floor~0; 4512#L3184-1true assume 0 != ~floorButtons_spc2_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~4;havoc areDoorsOpen_~retValue_acc~4;areDoorsOpen_~retValue_acc~4 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~4; 1725#L674-7true __utac_acc__Specification2_spec__3_#t~ret148 := areDoorsOpen_#res;__utac_acc__Specification2_spec__3_~tmp___4~3 := __utac_acc__Specification2_spec__3_#t~ret148;havoc __utac_acc__Specification2_spec__3_#t~ret148; 2482#L3188-2true assume 0 != __utac_acc__Specification2_spec__3_~tmp___4~3;~floorButtons_spc2_0~0 := 0; 81#L3243-1true cleanup_~i~0 := 1 + cleanup_~i~0; 4356#L188-2true [2019-01-01 23:20:36,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:20:36,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1323712467, now seen corresponding path program 1 times [2019-01-01 23:20:36,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:20:36,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:20:36,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:20:36,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:20:36,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:20:36,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:20:36,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:20:36,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:20:36,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:20:36,590 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:20:36,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:20:36,590 INFO L82 PathProgramCache]: Analyzing trace with hash 2119774427, now seen corresponding path program 1 times [2019-01-01 23:20:36,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:20:36,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:20:36,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:20:36,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:20:36,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:20:36,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:20:36,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:20:37,404 WARN L181 SmtUtils]: Spent 726.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 84 [2019-01-01 23:20:38,330 WARN L181 SmtUtils]: Spent 914.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2019-01-01 23:20:38,342 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:20:38,344 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:20:38,344 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:20:38,344 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:20:38,344 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:20:38,344 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:20:38,345 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:20:38,345 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:20:38,345 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec2_product26_false-unreach-call_true-termination.cil.c_Iteration1_Loop [2019-01-01 23:20:38,345 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:20:38,345 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:20:38,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:20:38,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:20:38,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:20:38,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:20:38,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:20:38,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:20:38,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:20:38,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:20:38,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:20:38,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:20:38,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:20:38,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:20:38,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:20:38,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:20:38,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:20:38,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:20:38,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:20:38,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:20:38,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:20:38,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:20:38,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:20:38,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:20:38,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:20:38,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-01-01 23:20:38,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:20:38,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:20:38,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:20:38,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:20:38,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:20:38,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:20:38,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:20:38,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:20:38,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:20:39,384 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:20:39,385 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:20:39,397 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:20:39,398 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:20:39,410 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:20:39,410 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification2_spec__3_#t~ret147=0} Honda state: {ULTIMATE.start___utac_acc__Specification2_spec__3_#t~ret147=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:20:39,434 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:20:39,434 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:20:39,442 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:20:39,443 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification2_spec__3_~tmp___1~6=0} Honda state: {ULTIMATE.start___utac_acc__Specification2_spec__3_~tmp___1~6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:20:39,469 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:20:39,470 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:20:39,486 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:20:39,486 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification2_spec__3_#t~ret151=0} Honda state: {ULTIMATE.start___utac_acc__Specification2_spec__3_#t~ret151=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:20:39,589 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:20:39,589 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:20:39,615 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:20:39,615 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_areDoorsOpen_#res=-8, ULTIMATE.start_areDoorsOpen_~retValue_acc~4=-8, ULTIMATE.start_timeShift_~tmp~19=-8, ~doorState~0=-8, ULTIMATE.start___utac_acc__Specification2_spec__3_~tmp___4~3=-8} Honda state: {ULTIMATE.start_areDoorsOpen_#res=-8, ULTIMATE.start_areDoorsOpen_~retValue_acc~4=-8, ULTIMATE.start_timeShift_~tmp~19=-8, ~doorState~0=-8, ULTIMATE.start___utac_acc__Specification2_spec__3_~tmp___4~3=-8} 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-01-01 23:20:39,659 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:20:39,659 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:20:39,663 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:20:39,663 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_~tmp___1~1=0} Honda state: {ULTIMATE.start_anyStopRequested_~tmp___1~1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:20:39,684 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:20:39,685 INFO L163 nArgumentSynthesizer]: Using integer mode. 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-01-01 23:20:39,727 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:20:39,727 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:20:40,379 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:20:40,381 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:20:40,382 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:20:40,382 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:20:40,382 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:20:40,382 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:20:40,382 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:20:40,382 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:20:40,382 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:20:40,383 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec2_product26_false-unreach-call_true-termination.cil.c_Iteration1_Loop [2019-01-01 23:20:40,383 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:20:40,383 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:20:40,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:20:40,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:20:40,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:20:40,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:20:40,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:20:40,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:20:40,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:20:40,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:20:40,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:20:40,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:20:40,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:20:40,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:20:40,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:20:40,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:20:40,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:20:40,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:20:40,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:20:40,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:20:40,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:20:40,664 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-01 23:20:40,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:20:40,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-01-01 23:20:40,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:20:40,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:20:40,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:20:40,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:20:40,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:20:40,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-01-01 23:20:40,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:20:40,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:20:40,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:20:40,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:20:40,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:20:40,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:20:41,187 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-01 23:20:41,513 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-01 23:20:42,021 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:20:42,027 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:20:42,029 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:20:42,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:20:42,031 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:20:42,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:20:42,032 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:20:42,032 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:20:42,039 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:20:42,039 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:20:42,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:20:42,055 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:20:42,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:20:42,056 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:20:42,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:20:42,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:20:42,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:20:42,059 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:20:42,059 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:20:42,060 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:20:42,061 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:20:42,061 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:20:42,061 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:20:42,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:20:42,064 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:20:42,064 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:20:42,064 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:20:42,064 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:20:42,066 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:20:42,067 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:20:42,067 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:20:42,067 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:20:42,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:20:42,069 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:20:42,069 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:20:42,070 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:20:42,070 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:20:42,072 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:20:42,073 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:20:42,073 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:20:42,073 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:20:42,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:20:42,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:20:42,076 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:20:42,076 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:20:42,076 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:20:42,078 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:20:42,079 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:20:42,079 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:20:42,079 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:20:42,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:20:42,080 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:20:42,080 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:20:42,081 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:20:42,081 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:20:42,089 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:20:42,098 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 23:20:42,098 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 23:20:42,100 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:20:42,101 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:20:42,101 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:20:42,102 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~cleanupTimeShifts~0, ULTIMATE.start_cleanup_~i~0) = 1*~cleanupTimeShifts~0 - 1*ULTIMATE.start_cleanup_~i~0 Supporting invariants [] [2019-01-01 23:20:42,104 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:20:42,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:20:42,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:20:42,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:20:42,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:20:42,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:20:42,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:20:42,799 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 23:20:42,802 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4855 states. Second operand 5 states. [2019-01-01 23:20:43,577 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4855 states.. Second operand 5 states. Result 7332 states and 13832 transitions. Complement of second has 9 states. [2019-01-01 23:20:43,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 23:20:43,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 23:20:43,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9227 transitions. [2019-01-01 23:20:43,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 9227 transitions. Stem has 24 letters. Loop has 22 letters. [2019-01-01 23:20:43,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:20:43,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 9227 transitions. Stem has 46 letters. Loop has 22 letters. [2019-01-01 23:20:43,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:20:43,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 9227 transitions. Stem has 24 letters. Loop has 44 letters. [2019-01-01 23:20:43,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:20:43,601 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7332 states and 13832 transitions. [2019-01-01 23:20:43,684 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:20:43,688 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7332 states to 0 states and 0 transitions. [2019-01-01 23:20:43,690 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 23:20:43,690 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 23:20:43,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 23:20:43,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:20:43,692 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:20:43,692 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:20:43,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:20:43,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:20:43,700 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2019-01-01 23:20:43,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:20:43,705 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-01 23:20:43,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-01 23:20:43,706 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-01 23:20:43,706 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:20:43,706 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 23:20:43,706 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 23:20:43,706 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 23:20:43,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 23:20:43,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:20:43,709 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:20:43,710 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:20:43,710 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:20:43,710 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:20:43,710 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 23:20:43,710 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:20:43,710 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 23:20:43,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:20:43 BoogieIcfgContainer [2019-01-01 23:20:43,721 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:20:43,721 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:20:43,721 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:20:43,722 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:20:43,722 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:20:35" (3/4) ... [2019-01-01 23:20:43,728 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 23:20:43,728 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:20:43,729 INFO L168 Benchmark]: Toolchain (without parser) took 25696.46 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 529.0 MB). Free memory was 945.9 MB in the beginning and 1.2 GB in the end (delta: -224.2 MB). Peak memory consumption was 304.8 MB. Max. memory is 11.5 GB. [2019-01-01 23:20:43,730 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:20:43,732 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1174.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -158.3 MB). Peak memory consumption was 57.5 MB. Max. memory is 11.5 GB. [2019-01-01 23:20:43,733 INFO L168 Benchmark]: Boogie Procedure Inliner took 286.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 11.5 GB. [2019-01-01 23:20:43,734 INFO L168 Benchmark]: Boogie Preprocessor took 403.15 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: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 11.5 GB. [2019-01-01 23:20:43,735 INFO L168 Benchmark]: RCFGBuilder took 15809.52 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 200.8 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -125.8 MB). Peak memory consumption was 447.0 MB. Max. memory is 11.5 GB. [2019-01-01 23:20:43,737 INFO L168 Benchmark]: BuchiAutomizer took 8011.93 ms. Allocated memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: 189.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -34.2 MB). Peak memory consumption was 155.6 MB. Max. memory is 11.5 GB. [2019-01-01 23:20:43,738 INFO L168 Benchmark]: Witness Printer took 6.73 ms. Allocated memory is still 1.6 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:20:43,744 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1174.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -158.3 MB). Peak memory consumption was 57.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 286.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 403.15 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: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 15809.52 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 200.8 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -125.8 MB). Peak memory consumption was 447.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8011.93 ms. Allocated memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: 189.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -34.2 MB). Peak memory consumption was 155.6 MB. Max. memory is 11.5 GB. * Witness Printer took 6.73 ms. Allocated memory is still 1.6 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function cleanupTimeShifts + -1 * i and consists of 6 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.9s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 5.9s. Construction of modules took 0.1s. Büchi inclusion checks took 1.3s. 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.0s 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: 9193 SDtfs, 18352 SDslu, 4613 SDs, 0 SdLazy, 9 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital109 mio100 ax100 hnf100 lsp16 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq211 hnf89 smp100 dnf176 smp100 tf103 neg96 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 25ms VariablesStem: 0 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.8s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...