./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/product-lines/elevator_spec2_product18.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_caa0d39c-4041-46de-8c92-4c0755aae4fe/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_caa0d39c-4041-46de-8c92-4c0755aae4fe/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_caa0d39c-4041-46de-8c92-4c0755aae4fe/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_caa0d39c-4041-46de-8c92-4c0755aae4fe/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/product-lines/elevator_spec2_product18.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_caa0d39c-4041-46de-8c92-4c0755aae4fe/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_caa0d39c-4041-46de-8c92-4c0755aae4fe/bin/uautomizer --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 fc7d4fa32c225e9bde4f412637f12e9da3676853 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 09:00:43,105 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:00:43,108 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:00:43,118 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:00:43,120 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:00:43,121 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:00:43,122 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:00:43,123 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:00:43,125 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:00:43,125 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:00:43,126 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:00:43,127 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:00:43,127 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:00:43,129 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:00:43,130 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:00:43,131 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:00:43,137 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:00:43,139 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:00:43,140 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:00:43,141 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:00:43,142 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:00:43,143 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:00:43,147 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:00:43,148 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:00:43,150 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:00:43,150 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:00:43,150 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:00:43,151 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:00:43,151 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:00:43,153 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:00:43,154 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:00:43,154 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:00:43,155 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:00:43,155 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:00:43,156 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:00:43,158 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:00:43,158 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:00:43,159 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:00:43,159 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:00:43,159 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:00:43,160 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:00:43,160 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_caa0d39c-4041-46de-8c92-4c0755aae4fe/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 09:00:43,172 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:00:43,172 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:00:43,173 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:00:43,173 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:00:43,174 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:00:43,174 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 09:00:43,174 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 09:00:43,174 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 09:00:43,174 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 09:00:43,174 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 09:00:43,174 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 09:00:43,175 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:00:43,175 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 09:00:43,175 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 09:00:43,175 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:00:43,175 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 09:00:43,175 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:00:43,176 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 09:00:43,176 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 09:00:43,176 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 09:00:43,176 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 09:00:43,176 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:00:43,177 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 09:00:43,177 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:00:43,177 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 09:00:43,177 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:00:43,177 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:00:43,177 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 09:00:43,178 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:00:43,178 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:00:43,178 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 09:00:43,179 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 09:00:43,179 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_caa0d39c-4041-46de-8c92-4c0755aae4fe/bin/uautomizer 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 -> fc7d4fa32c225e9bde4f412637f12e9da3676853 [2019-10-22 09:00:43,208 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:00:43,219 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:00:43,221 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:00:43,222 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:00:43,222 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:00:43,223 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_caa0d39c-4041-46de-8c92-4c0755aae4fe/bin/uautomizer/../../sv-benchmarks/c/product-lines/elevator_spec2_product18.cil.c [2019-10-22 09:00:43,267 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_caa0d39c-4041-46de-8c92-4c0755aae4fe/bin/uautomizer/data/f4fda5ab7/5bdfe6de10cb4382b6ceb5155c8d956c/FLAGe4307ac0f [2019-10-22 09:00:43,794 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:00:43,796 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_caa0d39c-4041-46de-8c92-4c0755aae4fe/sv-benchmarks/c/product-lines/elevator_spec2_product18.cil.c [2019-10-22 09:00:43,814 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_caa0d39c-4041-46de-8c92-4c0755aae4fe/bin/uautomizer/data/f4fda5ab7/5bdfe6de10cb4382b6ceb5155c8d956c/FLAGe4307ac0f [2019-10-22 09:00:44,244 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_caa0d39c-4041-46de-8c92-4c0755aae4fe/bin/uautomizer/data/f4fda5ab7/5bdfe6de10cb4382b6ceb5155c8d956c [2019-10-22 09:00:44,248 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:00:44,249 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:00:44,250 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:00:44,250 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:00:44,254 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:00:44,255 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:00:44" (1/1) ... [2019-10-22 09:00:44,257 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27fb289e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:44, skipping insertion in model container [2019-10-22 09:00:44,257 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:00:44" (1/1) ... [2019-10-22 09:00:44,264 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:00:44,330 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:00:44,870 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:00:44,883 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:00:44,987 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:00:45,037 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:00:45,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:45 WrapperNode [2019-10-22 09:00:45,038 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:00:45,038 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:00:45,039 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:00:45,039 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:00:45,045 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:45" (1/1) ... [2019-10-22 09:00:45,069 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:45" (1/1) ... [2019-10-22 09:00:45,334 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:00:45,335 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:00:45,335 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:00:45,335 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:00:45,344 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:45" (1/1) ... [2019-10-22 09:00:45,344 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:45" (1/1) ... [2019-10-22 09:00:45,375 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:45" (1/1) ... [2019-10-22 09:00:45,376 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:45" (1/1) ... [2019-10-22 09:00:45,472 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:45" (1/1) ... [2019-10-22 09:00:45,567 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:45" (1/1) ... [2019-10-22 09:00:45,589 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:45" (1/1) ... [2019-10-22 09:00:45,620 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:00:45,620 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:00:45,620 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:00:45,621 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:00:45,621 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_caa0d39c-4041-46de-8c92-4c0755aae4fe/bin/uautomizer/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-10-22 09:00:45,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 09:00:45,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-22 09:00:45,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:00:45,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:00:52,979 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:00:52,980 INFO L284 CfgBuilder]: Removed 1029 assume(true) statements. [2019-10-22 09:00:52,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:52 BoogieIcfgContainer [2019-10-22 09:00:52,982 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:00:52,983 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 09:00:52,983 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 09:00:52,986 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 09:00:52,986 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:00:52,987 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 09:00:44" (1/3) ... [2019-10-22 09:00:52,988 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@719ed5c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:00:52, skipping insertion in model container [2019-10-22 09:00:52,988 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:00:52,989 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:45" (2/3) ... [2019-10-22 09:00:52,989 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@719ed5c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:00:52, skipping insertion in model container [2019-10-22 09:00:52,989 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:00:52,989 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:52" (3/3) ... [2019-10-22 09:00:52,991 INFO L371 chiAutomizerObserver]: Analyzing ICFG elevator_spec2_product18.cil.c [2019-10-22 09:00:53,037 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 09:00:53,037 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 09:00:53,037 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 09:00:53,038 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:00:53,038 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:00:53,038 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 09:00:53,038 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:00:53,038 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 09:00:53,103 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4639 states. [2019-10-22 09:00:53,198 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2309 [2019-10-22 09:00:53,198 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:53,198 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:53,210 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:53,211 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:53,211 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 09:00:53,211 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4639 states. [2019-10-22 09:00:53,248 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2309 [2019-10-22 09:00:53,249 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:53,249 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:53,252 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:53,252 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:53,258 INFO L791 eck$LassoCheckResult]: Stem: 2498#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~weight~0 := 0;~maximumWeight~0 := 100;~blocked~0 := 0;~cleanupTimeShifts~0 := 12;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0;call #t~string53.base, #t~string53.offset := #Ultimate.allocOnStack(10);call #t~string55.base, #t~string55.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string55.base, #t~string55.offset, 1);call write~init~int(95, #t~string55.base, 1 + #t~string55.offset, 1);call write~init~int(93, #t~string55.base, 2 + #t~string55.offset, 1);call write~init~int(0, #t~string55.base, 3 + #t~string55.offset, 1);call #t~string57.base, #t~string57.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string57.base, #t~string57.offset, 1);call write~init~int(93, #t~string57.base, 1 + #t~string57.offset, 1);call write~init~int(32, #t~string57.base, 2 + #t~string57.offset, 1);call write~init~int(0, #t~string57.base, 3 + #t~string57.offset, 1);call #t~string59.base, #t~string59.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string59.base, #t~string59.offset, 1);call write~init~int(97, #t~string59.base, 1 + #t~string59.offset, 1);call write~init~int(116, #t~string59.base, 2 + #t~string59.offset, 1);call write~init~int(32, #t~string59.base, 3 + #t~string59.offset, 1);call write~init~int(0, #t~string59.base, 4 + #t~string59.offset, 1);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string61.base, #t~string61.offset, 1);call write~init~int(105, #t~string61.base, 1 + #t~string61.offset, 1);call write~init~int(0, #t~string61.base, 2 + #t~string61.offset, 1);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(10);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string65.base, #t~string65.offset, 1);call write~init~int(112, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 2 + #t~string65.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string67.base, #t~string67.offset, 1);call write~init~int(111, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(119, #t~string67.base, 2 + #t~string67.offset, 1);call write~init~int(110, #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(7);call write~init~int(32, #t~string69.base, #t~string69.offset, 1);call write~init~int(73, #t~string69.base, 1 + #t~string69.offset, 1);call write~init~int(76, #t~string69.base, 2 + #t~string69.offset, 1);call write~init~int(95, #t~string69.base, 3 + #t~string69.offset, 1);call write~init~int(112, #t~string69.base, 4 + #t~string69.offset, 1);call write~init~int(58, #t~string69.base, 5 + #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 6 + #t~string69.offset, 1);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string71.base, #t~string71.offset, 1);call write~init~int(37, #t~string71.base, 1 + #t~string71.offset, 1);call write~init~int(105, #t~string71.base, 2 + #t~string71.offset, 1);call write~init~int(0, #t~string71.base, 3 + #t~string71.offset, 1);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string73.base, #t~string73.offset, 1);call write~init~int(37, #t~string73.base, 1 + #t~string73.offset, 1);call write~init~int(105, #t~string73.base, 2 + #t~string73.offset, 1);call write~init~int(0, #t~string73.base, 3 + #t~string73.offset, 1);call #t~string75.base, #t~string75.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string75.base, #t~string75.offset, 1);call write~init~int(37, #t~string75.base, 1 + #t~string75.offset, 1);call write~init~int(105, #t~string75.base, 2 + #t~string75.offset, 1);call write~init~int(0, #t~string75.base, 3 + #t~string75.offset, 1);call #t~string77.base, #t~string77.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string77.base, #t~string77.offset, 1);call write~init~int(37, #t~string77.base, 1 + #t~string77.offset, 1);call write~init~int(105, #t~string77.base, 2 + #t~string77.offset, 1);call write~init~int(0, #t~string77.base, 3 + #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(6);call write~init~int(32, #t~string81.base, #t~string81.offset, 1);call write~init~int(70, #t~string81.base, 1 + #t~string81.offset, 1);call write~init~int(95, #t~string81.base, 2 + #t~string81.offset, 1);call write~init~int(112, #t~string81.base, 3 + #t~string81.offset, 1);call write~init~int(58, #t~string81.base, 4 + #t~string81.offset, 1);call write~init~int(0, #t~string81.base, 5 + #t~string81.offset, 1);call #t~string84.base, #t~string84.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string84.base, #t~string84.offset, 1);call write~init~int(37, #t~string84.base, 1 + #t~string84.offset, 1);call write~init~int(105, #t~string84.base, 2 + #t~string84.offset, 1);call write~init~int(0, #t~string84.base, 3 + #t~string84.offset, 1);call #t~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~string90.base, #t~string90.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string90.base, #t~string90.offset, 1);call write~init~int(37, #t~string90.base, 1 + #t~string90.offset, 1);call write~init~int(105, #t~string90.base, 2 + #t~string90.offset, 1);call write~init~int(0, #t~string90.base, 3 + #t~string90.offset, 1);call #t~string93.base, #t~string93.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string93.base, #t~string93.offset, 1);call write~init~int(37, #t~string93.base, 1 + #t~string93.offset, 1);call write~init~int(105, #t~string93.base, 2 + #t~string93.offset, 1);call write~init~int(0, #t~string93.base, 3 + #t~string93.offset, 1);call #t~string96.base, #t~string96.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string96.base, #t~string96.offset, 1);call write~init~int(37, #t~string96.base, 1 + #t~string96.offset, 1);call write~init~int(105, #t~string96.base, 2 + #t~string96.offset, 1);call write~init~int(0, #t~string96.base, 3 + #t~string96.offset, 1);call #t~string98.base, #t~string98.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string98.base, #t~string98.offset, 1);call write~init~int(0, #t~string98.base, 1 + #t~string98.offset, 1);call #t~string101.base, #t~string101.offset := #Ultimate.allocOnStack(9);~head~0.base, ~head~0.offset := 0, 0;call #t~string121.base, #t~string121.offset := #Ultimate.allocOnStack(30);call #t~string122.base, #t~string122.offset := #Ultimate.allocOnStack(9);call #t~string123.base, #t~string123.offset := #Ultimate.allocOnStack(21);call #t~string124.base, #t~string124.offset := #Ultimate.allocOnStack(30);call #t~string125.base, #t~string125.offset := #Ultimate.allocOnStack(9);call #t~string126.base, #t~string126.offset := #Ultimate.allocOnStack(21);call #t~string130.base, #t~string130.offset := #Ultimate.allocOnStack(30);call #t~string131.base, #t~string131.offset := #Ultimate.allocOnStack(9);call #t~string132.base, #t~string132.offset := #Ultimate.allocOnStack(25);call #t~string133.base, #t~string133.offset := #Ultimate.allocOnStack(30);call #t~string134.base, #t~string134.offset := #Ultimate.allocOnStack(9);call #t~string135.base, #t~string135.offset := #Ultimate.allocOnStack(25);~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;~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; 3604#L-1true havoc main_#res;havoc main_#t~ret151, main_~retValue_acc~22, main_~tmp~25;havoc main_~retValue_acc~22;havoc main_~tmp~25; 2826#L300true havoc valid_product_#res;havoc valid_product_~retValue_acc~4;havoc valid_product_~retValue_acc~4;valid_product_~retValue_acc~4 := 1;valid_product_#res := valid_product_~retValue_acc~4; 1608#L308true main_#t~ret151 := valid_product_#res;main_~tmp~25 := main_#t~ret151;havoc main_#t~ret151; 569#L2529true assume 0 != main_~tmp~25; 2830#L2502true ~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; 3530#L2557true havoc bigMacCall_#t~ret144, bigMacCall_~tmp~22;havoc bigMacCall_~tmp~22;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~1;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~1; 2418#L200true assume 0 == getOrigin_~person;getOrigin_~retValue_acc~1 := 4;getOrigin_#res := getOrigin_~retValue_acc~1; 1518#L225true bigMacCall_#t~ret144 := getOrigin_#res;bigMacCall_~tmp~22 := bigMacCall_#t~ret144;havoc bigMacCall_#t~ret144;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~22;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 729#L3077true assume 0 == initPersonOnFloor_~floor; 3944#L3078true assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 4273#L3185-1true callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 2132#L2869true assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 402#L2881-2true havoc cleanup_#t~ret145, cleanup_#t~ret146, cleanup_~i~3, cleanup_~tmp~23, cleanup_~tmp___0~8, cleanup_~__cil_tmp4~2;havoc cleanup_~i~3;havoc cleanup_~tmp~23;havoc cleanup_~tmp___0~8;havoc cleanup_~__cil_tmp4~2;havoc timeShift_#t~ret52, timeShift_~tmp~11;havoc timeShift_~tmp~11;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~7;havoc areDoorsOpen_~retValue_acc~7;areDoorsOpen_~retValue_acc~7 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~7; 3077#L559true timeShift_#t~ret52 := areDoorsOpen_#res;timeShift_~tmp~11 := timeShift_#t~ret52;havoc timeShift_#t~ret52; 2976#L1442true assume 0 != timeShift_~tmp~11; 2774#L1443true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 3427#L1146-11true havoc __utac_acc__Specification2_spec__3_#t~ret152, __utac_acc__Specification2_spec__3_#t~ret153, __utac_acc__Specification2_spec__3_#t~ret154, __utac_acc__Specification2_spec__3_#t~ret155, __utac_acc__Specification2_spec__3_#t~ret156, __utac_acc__Specification2_spec__3_#t~ret157, __utac_acc__Specification2_spec__3_~floor~0, __utac_acc__Specification2_spec__3_~tmp~26, __utac_acc__Specification2_spec__3_~tmp___0~10, __utac_acc__Specification2_spec__3_~tmp___1~8, __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~26;havoc __utac_acc__Specification2_spec__3_~tmp___0~10;havoc __utac_acc__Specification2_spec__3_~tmp___1~8;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~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 2506#L550true __utac_acc__Specification2_spec__3_#t~ret152 := getCurrentFloorID_#res;__utac_acc__Specification2_spec__3_~tmp~26 := __utac_acc__Specification2_spec__3_#t~ret152;havoc __utac_acc__Specification2_spec__3_#t~ret152;__utac_acc__Specification2_spec__3_~floor~0 := __utac_acc__Specification2_spec__3_~tmp~26; 1478#L2602true assume 0 == __utac_acc__Specification2_spec__3_~floor~0; 1422#L2603true assume 0 != ~floorButtons_spc2_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~7;havoc areDoorsOpen_~retValue_acc~7;areDoorsOpen_~retValue_acc~7 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~7; 3061#L559-1true __utac_acc__Specification2_spec__3_#t~ret153 := areDoorsOpen_#res;__utac_acc__Specification2_spec__3_~tmp___4~3 := __utac_acc__Specification2_spec__3_#t~ret153;havoc __utac_acc__Specification2_spec__3_#t~ret153; 2140#L2607true assume 0 != __utac_acc__Specification2_spec__3_~tmp___4~3;~floorButtons_spc2_0~0 := 0; 2568#L2662true cleanup_~i~3 := 0; 1612#L2334-2true [2019-10-22 09:00:53,259 INFO L793 eck$LassoCheckResult]: Loop: 1612#L2334-2true assume !false; 1547#L2335true cleanup_~__cil_tmp4~2 := ~cleanupTimeShifts~0 - 1; 1453#L2338true assume cleanup_~i~3 < cleanup_~__cil_tmp4~2;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~5;havoc isBlocked_~retValue_acc~5;isBlocked_~retValue_acc~5 := ~blocked~0;isBlocked_#res := isBlocked_~retValue_acc~5; 1657#L392true cleanup_#t~ret145 := isBlocked_#res;cleanup_~tmp___0~8 := cleanup_#t~ret145;havoc cleanup_#t~ret145; 2172#L2342true assume 1 != cleanup_~tmp___0~8; 2178#L2342-1true havoc isIdle_#res;havoc isIdle_#t~ret14, isIdle_~retValue_acc~12, isIdle_~tmp~5;havoc isIdle_~retValue_acc~12;havoc isIdle_~tmp~5;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret9, anyStopRequested_#t~ret10, anyStopRequested_#t~ret11, anyStopRequested_#t~ret12, anyStopRequested_#t~ret13, anyStopRequested_~retValue_acc~11, anyStopRequested_~tmp~4, anyStopRequested_~tmp___0~2, anyStopRequested_~tmp___1~2, anyStopRequested_~tmp___2~0, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~11;havoc anyStopRequested_~tmp~4;havoc anyStopRequested_~tmp___0~2;havoc anyStopRequested_~tmp___1~2;havoc anyStopRequested_~tmp___2~0;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; 1213#L2806-42true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~23 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~23; 4220#L2833-42true anyStopRequested_#t~ret9 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret9;havoc anyStopRequested_#t~ret9; 1687#L658true assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~11 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~11; 2531#L722true isIdle_#t~ret14 := anyStopRequested_#res;isIdle_~tmp~5 := isIdle_#t~ret14;havoc isIdle_#t~ret14;isIdle_~retValue_acc~12 := (if 0 == isIdle_~tmp~5 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~12; 3082#L735true cleanup_#t~ret146 := isIdle_#res;cleanup_~tmp~23 := cleanup_#t~ret146;havoc cleanup_#t~ret146; 292#L2354true assume !(0 != cleanup_~tmp~23);havoc timeShift_#t~ret52, timeShift_~tmp~11;havoc timeShift_~tmp~11;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~7;havoc areDoorsOpen_~retValue_acc~7;areDoorsOpen_~retValue_acc~7 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~7; 2918#L559-6true timeShift_#t~ret52 := areDoorsOpen_#res;timeShift_~tmp~11 := timeShift_#t~ret52;havoc timeShift_#t~ret52; 2978#L1442-1true assume 0 != timeShift_~tmp~11; 2777#L1443-2true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 3355#L1146-23true havoc __utac_acc__Specification2_spec__3_#t~ret152, __utac_acc__Specification2_spec__3_#t~ret153, __utac_acc__Specification2_spec__3_#t~ret154, __utac_acc__Specification2_spec__3_#t~ret155, __utac_acc__Specification2_spec__3_#t~ret156, __utac_acc__Specification2_spec__3_#t~ret157, __utac_acc__Specification2_spec__3_~floor~0, __utac_acc__Specification2_spec__3_~tmp~26, __utac_acc__Specification2_spec__3_~tmp___0~10, __utac_acc__Specification2_spec__3_~tmp___1~8, __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~26;havoc __utac_acc__Specification2_spec__3_~tmp___0~10;havoc __utac_acc__Specification2_spec__3_~tmp___1~8;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~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 2507#L550-1true __utac_acc__Specification2_spec__3_#t~ret152 := getCurrentFloorID_#res;__utac_acc__Specification2_spec__3_~tmp~26 := __utac_acc__Specification2_spec__3_#t~ret152;havoc __utac_acc__Specification2_spec__3_#t~ret152;__utac_acc__Specification2_spec__3_~floor~0 := __utac_acc__Specification2_spec__3_~tmp~26; 1463#L2602-1true assume 0 == __utac_acc__Specification2_spec__3_~floor~0; 1424#L2603-1true assume 0 != ~floorButtons_spc2_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~7;havoc areDoorsOpen_~retValue_acc~7;areDoorsOpen_~retValue_acc~7 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~7; 2920#L559-7true __utac_acc__Specification2_spec__3_#t~ret153 := areDoorsOpen_#res;__utac_acc__Specification2_spec__3_~tmp___4~3 := __utac_acc__Specification2_spec__3_#t~ret153;havoc __utac_acc__Specification2_spec__3_#t~ret153; 2138#L2607-2true assume 0 != __utac_acc__Specification2_spec__3_~tmp___4~3;~floorButtons_spc2_0~0 := 0; 2573#L2662-1true cleanup_~i~3 := 1 + cleanup_~i~3; 1612#L2334-2true [2019-10-22 09:00:53,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:53,268 INFO L82 PathProgramCache]: Analyzing trace with hash 856093261, now seen corresponding path program 1 times [2019-10-22 09:00:53,277 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:53,277 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195382132] [2019-10-22 09:00:53,277 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:53,278 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:53,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:53,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:53,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:53,562 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195382132] [2019-10-22 09:00:53,562 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:53,563 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:53,563 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44886480] [2019-10-22 09:00:53,567 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:00:53,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:53,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1563217659, now seen corresponding path program 1 times [2019-10-22 09:00:53,568 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:53,568 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577106814] [2019-10-22 09:00:53,568 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:53,569 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:53,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:53,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:53,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:53,646 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:53,871 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 84 [2019-10-22 09:00:54,114 WARN L191 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2019-10-22 09:00:54,123 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:54,124 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:54,124 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:54,124 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:54,124 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 09:00:54,125 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:54,125 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:54,125 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:54,125 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec2_product18.cil.c_Iteration1_Loop [2019-10-22 09:00:54,125 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:54,125 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:54,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:54,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:54,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:54,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:54,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:54,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:54,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:54,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:54,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:54,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:54,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:54,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:54,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:54,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:54,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:54,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:54,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:54,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:54,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:54,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:54,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:54,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:54,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:54,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:54,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:54,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:54,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:54,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:54,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:54,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:54,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:54,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:54,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:54,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:54,607 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:54,611 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_caa0d39c-4041-46de-8c92-4c0755aae4fe/bin/uautomizer/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-10-22 09:00:54,620 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:54,620 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:54,630 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:54,630 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification2_spec__3_~tmp___1~8=0} Honda state: {ULTIMATE.start___utac_acc__Specification2_spec__3_~tmp___1~8=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_caa0d39c-4041-46de-8c92-4c0755aae4fe/bin/uautomizer/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-10-22 09:00:54,664 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:54,664 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 09:00:54,667 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:54,668 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_~tmp___1~2=0} Honda state: {ULTIMATE.start_anyStopRequested_~tmp___1~2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_caa0d39c-4041-46de-8c92-4c0755aae4fe/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:00:54,684 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:54,684 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:54,697 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:54,697 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isFloorCalling_#in~floorID=0, ULTIMATE.start_isFloorCalling_~floorID=0} Honda state: {ULTIMATE.start_isFloorCalling_#in~floorID=0, ULTIMATE.start_isFloorCalling_~floorID=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_caa0d39c-4041-46de-8c92-4c0755aae4fe/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:00:54,716 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:54,716 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:54,720 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:54,720 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isIdle_~retValue_acc~12=0, ULTIMATE.start_isIdle_#res=0} Honda state: {ULTIMATE.start_isIdle_~retValue_acc~12=0, ULTIMATE.start_isIdle_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_caa0d39c-4041-46de-8c92-4c0755aae4fe/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:00:54,727 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:54,727 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:54,731 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 09:00:54,731 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~weight~0=1, ~maximumWeight~0=0} Honda state: {~weight~0=1, ~maximumWeight~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_caa0d39c-4041-46de-8c92-4c0755aae4fe/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:00:54,738 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 09:00:54,738 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_caa0d39c-4041-46de-8c92-4c0755aae4fe/bin/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 09:00:54,785 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 09:00:54,785 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:54,800 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 09:00:54,803 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:54,803 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:54,804 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:54,804 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:54,804 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:00:54,804 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:54,804 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:54,804 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:54,804 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec2_product18.cil.c_Iteration1_Loop [2019-10-22 09:00:54,804 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:54,804 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:54,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:54,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:54,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:54,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:54,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:54,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:54,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:54,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:54,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:54,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:54,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:54,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:54,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:54,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:54,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:54,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:54,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:54,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:54,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:54,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:54,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:54,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:54,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:54,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:54,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:54,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:54,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:54,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:54,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:54,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:54,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:54,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-10-22 09:00:54,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:54,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:55,128 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-10-22 09:00:55,341 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:55,352 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:00:55,354 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:55,355 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:55,355 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:55,356 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:55,357 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:55,357 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:55,359 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:55,359 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:55,361 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:55,363 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:55,364 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:55,365 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:55,366 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:55,366 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:55,366 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:55,366 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:55,368 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:55,369 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:55,370 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:55,370 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:55,370 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:55,370 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:55,370 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:55,371 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:55,371 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:55,371 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:55,379 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:55,379 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:55,380 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:55,380 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:55,380 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:55,380 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:55,380 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:55,381 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:55,381 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:55,382 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:55,383 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:55,383 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:55,383 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:55,386 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:55,386 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:55,387 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:55,387 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:55,387 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:55,389 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:55,389 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:55,390 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:55,390 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:55,390 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:55,390 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:55,390 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:55,391 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:55,391 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:55,402 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:55,402 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:55,403 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:55,403 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:55,403 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:55,403 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 09:00:55,403 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:55,404 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 09:00:55,404 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:55,420 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:55,420 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:55,421 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:55,421 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:55,421 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:55,421 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:55,421 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:55,422 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:55,422 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:55,423 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:55,423 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:55,423 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:55,424 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:55,424 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:55,424 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:55,424 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:55,425 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:55,425 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:55,425 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:55,426 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:55,426 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:55,426 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:55,426 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:55,427 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:55,427 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:55,427 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:55,427 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:55,428 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:55,428 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:00:55,428 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:55,429 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:55,429 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:55,429 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:55,429 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:55,429 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:55,429 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:55,435 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:00:55,441 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 09:00:55,442 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:00:55,443 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:00:55,444 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 09:00:55,444 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:00:55,444 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~cleanupTimeShifts~0, ULTIMATE.start_cleanup_~i~3) = 1*~cleanupTimeShifts~0 - 1*ULTIMATE.start_cleanup_~i~3 Supporting invariants [] [2019-10-22 09:00:55,447 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 09:00:55,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:55,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:55,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:00:55,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:55,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:55,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 09:00:55,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:55,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:55,661 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-10-22 09:00:55,662 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4639 states. Second operand 5 states. [2019-10-22 09:00:56,047 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4639 states.. Second operand 5 states. Result 7008 states and 13256 transitions. Complement of second has 9 states. [2019-10-22 09:00:56,048 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-10-22 09:00:56,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 09:00:56,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8843 transitions. [2019-10-22 09:00:56,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 8843 transitions. Stem has 24 letters. Loop has 22 letters. [2019-10-22 09:00:56,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:56,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 8843 transitions. Stem has 46 letters. Loop has 22 letters. [2019-10-22 09:00:56,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:56,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 8843 transitions. Stem has 24 letters. Loop has 44 letters. [2019-10-22 09:00:56,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:56,064 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7008 states and 13256 transitions. [2019-10-22 09:00:56,125 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:00:56,128 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7008 states to 0 states and 0 transitions. [2019-10-22 09:00:56,129 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 09:00:56,129 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 09:00:56,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 09:00:56,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:56,130 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:00:56,130 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:00:56,130 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:56,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:56,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:56,134 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2019-10-22 09:00:56,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:56,137 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-10-22 09:00:56,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 09:00:56,138 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-10-22 09:00:56,138 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:00:56,138 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 09:00:56,138 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 09:00:56,139 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 09:00:56,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 09:00:56,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:56,139 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:00:56,139 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:00:56,139 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:00:56,139 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 09:00:56,139 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 09:00:56,139 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:00:56,141 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 09:00:56,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 09:00:56 BoogieIcfgContainer [2019-10-22 09:00:56,146 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 09:00:56,147 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:00:56,147 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:00:56,147 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:00:56,148 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:52" (3/4) ... [2019-10-22 09:00:56,151 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 09:00:56,151 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:00:56,152 INFO L168 Benchmark]: Toolchain (without parser) took 11903.47 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 557.3 MB). Free memory was 944.5 MB in the beginning and 1.2 GB in the end (delta: -282.8 MB). Peak memory consumption was 274.5 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:56,153 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:00:56,153 INFO L168 Benchmark]: CACSL2BoogieTranslator took 788.25 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -117.1 MB). Peak memory consumption was 29.2 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:56,154 INFO L168 Benchmark]: Boogie Procedure Inliner took 296.52 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.0 MB). Peak memory consumption was 48.0 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:56,155 INFO L168 Benchmark]: Boogie Preprocessor took 284.88 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 972.4 MB in the end (delta: 41.1 MB). Peak memory consumption was 41.1 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:56,156 INFO L168 Benchmark]: RCFGBuilder took 7362.24 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 194.5 MB). Free memory was 972.4 MB in the beginning and 1.1 GB in the end (delta: -147.6 MB). Peak memory consumption was 432.4 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:56,156 INFO L168 Benchmark]: BuchiAutomizer took 3163.61 ms. Allocated memory was 1.3 GB in the beginning and 1.6 GB in the end (delta: 249.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -107.3 MB). Peak memory consumption was 141.7 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:56,156 INFO L168 Benchmark]: Witness Printer took 4.31 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-10-22 09:00:56,159 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 788.25 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -117.1 MB). Peak memory consumption was 29.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 296.52 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.0 MB). Peak memory consumption was 48.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 284.88 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 972.4 MB in the end (delta: 41.1 MB). Peak memory consumption was 41.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 7362.24 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 194.5 MB). Free memory was 972.4 MB in the beginning and 1.1 GB in the end (delta: -147.6 MB). Peak memory consumption was 432.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3163.61 ms. Allocated memory was 1.3 GB in the beginning and 1.6 GB in the end (delta: 249.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -107.3 MB). Peak memory consumption was 141.7 MB. Max. memory is 11.5 GB. * Witness Printer took 4.31 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 3.1s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 2.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.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: 8809 SDtfs, 13204 SDslu, 4421 SDs, 0 SdLazy, 9 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital109 mio100 ax100 hnf100 lsp16 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq211 hnf89 smp100 dnf176 smp100 tf103 neg96 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 17ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...