./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/product-lines/elevator_spec14_product32.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/run_dir_2e3530e3-6fa6-4853-b968-ffbb9febc094/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_2e3530e3-6fa6-4853-b968-ffbb9febc094/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2e3530e3-6fa6-4853-b968-ffbb9febc094/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2e3530e3-6fa6-4853-b968-ffbb9febc094/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/product-lines/elevator_spec14_product32.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_2e3530e3-6fa6-4853-b968-ffbb9febc094/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2e3530e3-6fa6-4853-b968-ffbb9febc094/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 7cda6e846c1fc2efd9efcc0cd8cd672f45d07277 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 22:52:11,178 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:52:11,180 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:52:11,200 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:52:11,200 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:52:11,202 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:52:11,204 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:52:11,217 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:52:11,219 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:52:11,220 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:52:11,221 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:52:11,222 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:52:11,223 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:52:11,223 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:52:11,224 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:52:11,225 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:52:11,226 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:52:11,227 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:52:11,229 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:52:11,231 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:52:11,233 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:52:11,235 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:52:11,236 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:52:11,237 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:52:11,239 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:52:11,240 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:52:11,240 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:52:11,241 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:52:11,241 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:52:11,242 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:52:11,243 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:52:11,243 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:52:11,244 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:52:11,245 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:52:11,246 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:52:11,246 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:52:11,247 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:52:11,247 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:52:11,247 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:52:11,248 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:52:11,249 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:52:11,250 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2e3530e3-6fa6-4853-b968-ffbb9febc094/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 22:52:11,269 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:52:11,269 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:52:11,271 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:52:11,271 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:52:11,271 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:52:11,271 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 22:52:11,272 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 22:52:11,272 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 22:52:11,272 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 22:52:11,272 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 22:52:11,273 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 22:52:11,273 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:52:11,273 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:52:11,273 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 22:52:11,274 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:52:11,274 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:52:11,274 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:52:11,275 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 22:52:11,275 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 22:52:11,275 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 22:52:11,275 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:52:11,276 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:52:11,276 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 22:52:11,276 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:52:11,276 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 22:52:11,277 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:52:11,277 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:52:11,277 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 22:52:11,277 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:52:11,278 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:52:11,278 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 22:52:11,279 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 22:52:11,279 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/run_dir_2e3530e3-6fa6-4853-b968-ffbb9febc094/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 -> 7cda6e846c1fc2efd9efcc0cd8cd672f45d07277 [2019-11-15 22:52:11,311 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:52:11,323 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:52:11,327 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:52:11,328 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:52:11,329 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:52:11,330 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2e3530e3-6fa6-4853-b968-ffbb9febc094/bin/uautomizer/../../sv-benchmarks/c/product-lines/elevator_spec14_product32.cil.c [2019-11-15 22:52:11,401 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2e3530e3-6fa6-4853-b968-ffbb9febc094/bin/uautomizer/data/6f8dc9590/ca8038fe3e9745d8b0f7a3e47b4c1be7/FLAG8ed319e86 [2019-11-15 22:52:11,930 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:52:11,931 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2e3530e3-6fa6-4853-b968-ffbb9febc094/sv-benchmarks/c/product-lines/elevator_spec14_product32.cil.c [2019-11-15 22:52:11,954 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2e3530e3-6fa6-4853-b968-ffbb9febc094/bin/uautomizer/data/6f8dc9590/ca8038fe3e9745d8b0f7a3e47b4c1be7/FLAG8ed319e86 [2019-11-15 22:52:12,402 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2e3530e3-6fa6-4853-b968-ffbb9febc094/bin/uautomizer/data/6f8dc9590/ca8038fe3e9745d8b0f7a3e47b4c1be7 [2019-11-15 22:52:12,405 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:52:12,407 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:52:12,408 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:52:12,408 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:52:12,412 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:52:12,413 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:52:12" (1/1) ... [2019-11-15 22:52:12,415 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71d6394e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:52:12, skipping insertion in model container [2019-11-15 22:52:12,416 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:52:12" (1/1) ... [2019-11-15 22:52:12,423 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:52:12,506 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:52:13,197 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:52:13,221 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:52:13,358 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:52:13,448 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:52:13,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:52:13 WrapperNode [2019-11-15 22:52:13,449 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:52:13,451 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:52:13,452 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:52:13,452 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:52:13,462 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:52:13" (1/1) ... [2019-11-15 22:52:13,519 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:52:13" (1/1) ... [2019-11-15 22:52:14,586 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:52:14,587 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:52:14,587 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:52:14,587 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:52:14,599 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:52:13" (1/1) ... [2019-11-15 22:52:14,600 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:52:13" (1/1) ... [2019-11-15 22:52:14,717 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:52:13" (1/1) ... [2019-11-15 22:52:14,718 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:52:13" (1/1) ... [2019-11-15 22:52:15,040 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:52:13" (1/1) ... [2019-11-15 22:52:15,350 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:52:13" (1/1) ... [2019-11-15 22:52:15,437 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:52:13" (1/1) ... [2019-11-15 22:52:15,617 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:52:15,618 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:52:15,619 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:52:15,619 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:52:15,620 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:52:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2e3530e3-6fa6-4853-b968-ffbb9febc094/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-11-15 22:52:15,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:52:15,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-15 22:52:15,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:52:15,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:52:48,485 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:52:48,486 INFO L284 CfgBuilder]: Removed 4063 assume(true) statements. [2019-11-15 22:52:48,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:52:48 BoogieIcfgContainer [2019-11-15 22:52:48,496 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:52:48,497 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 22:52:48,497 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 22:52:48,501 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 22:52:48,503 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:52:48,503 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 10:52:12" (1/3) ... [2019-11-15 22:52:48,504 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3aec4d9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:52:48, skipping insertion in model container [2019-11-15 22:52:48,504 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:52:48,505 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:52:13" (2/3) ... [2019-11-15 22:52:48,505 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3aec4d9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:52:48, skipping insertion in model container [2019-11-15 22:52:48,505 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:52:48,506 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:52:48" (3/3) ... [2019-11-15 22:52:48,507 INFO L371 chiAutomizerObserver]: Analyzing ICFG elevator_spec14_product32.cil.c [2019-11-15 22:52:48,558 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 22:52:48,558 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 22:52:48,558 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 22:52:48,558 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:52:48,559 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:52:48,559 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 22:52:48,559 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:52:48,559 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 22:52:48,834 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17482 states. [2019-11-15 22:52:49,174 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3514 [2019-11-15 22:52:49,174 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:52:49,175 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:52:49,202 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:52:49,202 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] [2019-11-15 22:52:49,202 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 22:52:49,203 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17482 states. [2019-11-15 22:52:49,608 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3514 [2019-11-15 22:52:49,608 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:52:49,608 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:52:49,616 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:52:49,616 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] [2019-11-15 22:52:49,624 INFO L791 eck$LassoCheckResult]: Stem: 2749#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~cleanupTimeShifts~0 := 12;~head~0.base, ~head~0.offset := 0, 0;call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(30);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(9);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(21);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(30);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(9);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(21);call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(30);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(9);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(25);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(30);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(9);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(25);~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~0 := 0;~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~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~string117.base, #t~string117.offset := #Ultimate.allocOnStack(10);call #t~string119.base, #t~string119.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string119.base, #t~string119.offset, 1);call write~init~int(95, #t~string119.base, 1 + #t~string119.offset, 1);call write~init~int(93, #t~string119.base, 2 + #t~string119.offset, 1);call write~init~int(0, #t~string119.base, 3 + #t~string119.offset, 1);call #t~string121.base, #t~string121.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string121.base, #t~string121.offset, 1);call write~init~int(93, #t~string121.base, 1 + #t~string121.offset, 1);call write~init~int(32, #t~string121.base, 2 + #t~string121.offset, 1);call write~init~int(0, #t~string121.base, 3 + #t~string121.offset, 1);call #t~string123.base, #t~string123.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string123.base, #t~string123.offset, 1);call write~init~int(97, #t~string123.base, 1 + #t~string123.offset, 1);call write~init~int(116, #t~string123.base, 2 + #t~string123.offset, 1);call write~init~int(32, #t~string123.base, 3 + #t~string123.offset, 1);call write~init~int(0, #t~string123.base, 4 + #t~string123.offset, 1);call #t~string125.base, #t~string125.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string125.base, #t~string125.offset, 1);call write~init~int(105, #t~string125.base, 1 + #t~string125.offset, 1);call write~init~int(0, #t~string125.base, 2 + #t~string125.offset, 1);call #t~string127.base, #t~string127.offset := #Ultimate.allocOnStack(10);call #t~string129.base, #t~string129.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string129.base, #t~string129.offset, 1);call write~init~int(112, #t~string129.base, 1 + #t~string129.offset, 1);call write~init~int(0, #t~string129.base, 2 + #t~string129.offset, 1);call #t~string131.base, #t~string131.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string131.base, #t~string131.offset, 1);call write~init~int(111, #t~string131.base, 1 + #t~string131.offset, 1);call write~init~int(119, #t~string131.base, 2 + #t~string131.offset, 1);call write~init~int(110, #t~string131.base, 3 + #t~string131.offset, 1);call write~init~int(0, #t~string131.base, 4 + #t~string131.offset, 1);call #t~string133.base, #t~string133.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string133.base, #t~string133.offset, 1);call write~init~int(73, #t~string133.base, 1 + #t~string133.offset, 1);call write~init~int(76, #t~string133.base, 2 + #t~string133.offset, 1);call write~init~int(95, #t~string133.base, 3 + #t~string133.offset, 1);call write~init~int(112, #t~string133.base, 4 + #t~string133.offset, 1);call write~init~int(58, #t~string133.base, 5 + #t~string133.offset, 1);call write~init~int(0, #t~string133.base, 6 + #t~string133.offset, 1);call #t~string135.base, #t~string135.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string135.base, #t~string135.offset, 1);call write~init~int(37, #t~string135.base, 1 + #t~string135.offset, 1);call write~init~int(105, #t~string135.base, 2 + #t~string135.offset, 1);call write~init~int(0, #t~string135.base, 3 + #t~string135.offset, 1);call #t~string137.base, #t~string137.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string137.base, #t~string137.offset, 1);call write~init~int(37, #t~string137.base, 1 + #t~string137.offset, 1);call write~init~int(105, #t~string137.base, 2 + #t~string137.offset, 1);call write~init~int(0, #t~string137.base, 3 + #t~string137.offset, 1);call #t~string139.base, #t~string139.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string139.base, #t~string139.offset, 1);call write~init~int(37, #t~string139.base, 1 + #t~string139.offset, 1);call write~init~int(105, #t~string139.base, 2 + #t~string139.offset, 1);call write~init~int(0, #t~string139.base, 3 + #t~string139.offset, 1);call #t~string141.base, #t~string141.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string141.base, #t~string141.offset, 1);call write~init~int(37, #t~string141.base, 1 + #t~string141.offset, 1);call write~init~int(105, #t~string141.base, 2 + #t~string141.offset, 1);call write~init~int(0, #t~string141.base, 3 + #t~string141.offset, 1);call #t~string143.base, #t~string143.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string143.base, #t~string143.offset, 1);call write~init~int(37, #t~string143.base, 1 + #t~string143.offset, 1);call write~init~int(105, #t~string143.base, 2 + #t~string143.offset, 1);call write~init~int(0, #t~string143.base, 3 + #t~string143.offset, 1);call #t~string145.base, #t~string145.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string145.base, #t~string145.offset, 1);call write~init~int(70, #t~string145.base, 1 + #t~string145.offset, 1);call write~init~int(95, #t~string145.base, 2 + #t~string145.offset, 1);call write~init~int(112, #t~string145.base, 3 + #t~string145.offset, 1);call write~init~int(58, #t~string145.base, 4 + #t~string145.offset, 1);call write~init~int(0, #t~string145.base, 5 + #t~string145.offset, 1);call #t~string148.base, #t~string148.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string148.base, #t~string148.offset, 1);call write~init~int(37, #t~string148.base, 1 + #t~string148.offset, 1);call write~init~int(105, #t~string148.base, 2 + #t~string148.offset, 1);call write~init~int(0, #t~string148.base, 3 + #t~string148.offset, 1);call #t~string151.base, #t~string151.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string151.base, #t~string151.offset, 1);call write~init~int(37, #t~string151.base, 1 + #t~string151.offset, 1);call write~init~int(105, #t~string151.base, 2 + #t~string151.offset, 1);call write~init~int(0, #t~string151.base, 3 + #t~string151.offset, 1);call #t~string154.base, #t~string154.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string154.base, #t~string154.offset, 1);call write~init~int(37, #t~string154.base, 1 + #t~string154.offset, 1);call write~init~int(105, #t~string154.base, 2 + #t~string154.offset, 1);call write~init~int(0, #t~string154.base, 3 + #t~string154.offset, 1);call #t~string157.base, #t~string157.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string157.base, #t~string157.offset, 1);call write~init~int(37, #t~string157.base, 1 + #t~string157.offset, 1);call write~init~int(105, #t~string157.base, 2 + #t~string157.offset, 1);call write~init~int(0, #t~string157.base, 3 + #t~string157.offset, 1);call #t~string160.base, #t~string160.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string160.base, #t~string160.offset, 1);call write~init~int(37, #t~string160.base, 1 + #t~string160.offset, 1);call write~init~int(105, #t~string160.base, 2 + #t~string160.offset, 1);call write~init~int(0, #t~string160.base, 3 + #t~string160.offset, 1);call #t~string162.base, #t~string162.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string162.base, #t~string162.offset, 1);call write~init~int(0, #t~string162.base, 1 + #t~string162.offset, 1);call #t~string165.base, #t~string165.offset := #Ultimate.allocOnStack(9); 17391#L-1true havoc main_#res;havoc main_#t~ret13, main_~retValue_acc~4, main_~tmp~8;havoc main_~retValue_acc~4;havoc main_~tmp~8; 1665#L924true havoc valid_product_#res;havoc valid_product_~retValue_acc~9;havoc valid_product_~retValue_acc~9;valid_product_~retValue_acc~9 := 1;valid_product_#res := valid_product_~retValue_acc~9; 2152#L932true main_#t~ret13 := valid_product_#res;main_~tmp~8 := main_#t~ret13;havoc main_#t~ret13; 4453#L522true assume 0 != main_~tmp~8; 6151#L496true havoc bigMacCall_#t~ret6, bigMacCall_~tmp~5;havoc bigMacCall_~tmp~5;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~1;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~1; 14903#L85true assume 0 == getOrigin_~person;getOrigin_~retValue_acc~1 := 4;getOrigin_#res := getOrigin_~retValue_acc~1; 12780#L110true bigMacCall_#t~ret6 := getOrigin_#res;bigMacCall_~tmp~5 := bigMacCall_#t~ret6;havoc bigMacCall_#t~ret6;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~5;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 16076#L1392true assume 0 == initPersonOnFloor_~floor; 16073#L1393true assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 14103#L1500-1true callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 13158#L1184true assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 6533#L1196-2true havoc timeShift_#t~ret116, timeShift_~tmp~28;havoc timeShift_~tmp~28;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~15;havoc areDoorsOpen_~retValue_acc~15;areDoorsOpen_~retValue_acc~15 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~15; 7101#L1956true timeShift_#t~ret116 := areDoorsOpen_#res;timeShift_~tmp~28 := timeShift_#t~ret116;havoc timeShift_#t~ret116; 6034#L2967true assume 0 != timeShift_~tmp~28; 4316#L2968true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 6168#L2612-11true havoc __utac_acc__Specification14_spec__1_#t~ret168, __utac_acc__Specification14_spec__1_#t~ret169, __utac_acc__Specification14_spec__1_#t~ret170, __utac_acc__Specification14_spec__1_#t~ret171, __utac_acc__Specification14_spec__1_~tmp~31, __utac_acc__Specification14_spec__1_~tmp___0~13, __utac_acc__Specification14_spec__1_~tmp___1~8, __utac_acc__Specification14_spec__1_~tmp___2~6;havoc __utac_acc__Specification14_spec__1_~tmp~31;havoc __utac_acc__Specification14_spec__1_~tmp___0~13;havoc __utac_acc__Specification14_spec__1_~tmp___1~8;havoc __utac_acc__Specification14_spec__1_~tmp___2~6;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret167, isExecutiveFloorCalling_~retValue_acc~30;havoc isExecutiveFloorCalling_~retValue_acc~30;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~10;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~10; 9144#L1121-130true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~10 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~10; 15710#L1148-130true isExecutiveFloorCalling_#t~ret167 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~30 := isExecutiveFloorCalling_#t~ret167;havoc isExecutiveFloorCalling_#t~ret167;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~30; 8086#L3347-6true __utac_acc__Specification14_spec__1_#t~ret168 := isExecutiveFloorCalling_#res;__utac_acc__Specification14_spec__1_~tmp___2~6 := __utac_acc__Specification14_spec__1_#t~ret168;havoc __utac_acc__Specification14_spec__1_#t~ret168; 7566#L3380true assume !(0 != __utac_acc__Specification14_spec__1_~tmp___2~6); 7568#L3380-1true havoc timeShift_#t~ret116, timeShift_~tmp~28;havoc timeShift_~tmp~28;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~15;havoc areDoorsOpen_~retValue_acc~15;areDoorsOpen_~retValue_acc~15 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~15; 7102#L1956-2true timeShift_#t~ret116 := areDoorsOpen_#res;timeShift_~tmp~28 := timeShift_#t~ret116;havoc timeShift_#t~ret116; 6036#L2967-1true assume 0 != timeShift_~tmp~28; 4319#L2968-2true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 6010#L2612-23true havoc __utac_acc__Specification14_spec__1_#t~ret168, __utac_acc__Specification14_spec__1_#t~ret169, __utac_acc__Specification14_spec__1_#t~ret170, __utac_acc__Specification14_spec__1_#t~ret171, __utac_acc__Specification14_spec__1_~tmp~31, __utac_acc__Specification14_spec__1_~tmp___0~13, __utac_acc__Specification14_spec__1_~tmp___1~8, __utac_acc__Specification14_spec__1_~tmp___2~6;havoc __utac_acc__Specification14_spec__1_~tmp~31;havoc __utac_acc__Specification14_spec__1_~tmp___0~13;havoc __utac_acc__Specification14_spec__1_~tmp___1~8;havoc __utac_acc__Specification14_spec__1_~tmp___2~6;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret167, isExecutiveFloorCalling_~retValue_acc~30;havoc isExecutiveFloorCalling_~retValue_acc~30;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~10;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~10; 11244#L1121-261true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~10 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~10; 15560#L1148-261true isExecutiveFloorCalling_#t~ret167 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~30 := isExecutiveFloorCalling_#t~ret167;havoc isExecutiveFloorCalling_#t~ret167;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~30; 8085#L3347-13true __utac_acc__Specification14_spec__1_#t~ret168 := isExecutiveFloorCalling_#res;__utac_acc__Specification14_spec__1_~tmp___2~6 := __utac_acc__Specification14_spec__1_#t~ret168;havoc __utac_acc__Specification14_spec__1_#t~ret168; 7565#L3380-2true assume !(0 != __utac_acc__Specification14_spec__1_~tmp___2~6); 7574#L3380-3true havoc timeShift_#t~ret116, timeShift_~tmp~28;havoc timeShift_~tmp~28;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~15;havoc areDoorsOpen_~retValue_acc~15;areDoorsOpen_~retValue_acc~15 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~15; 7111#L1956-4true timeShift_#t~ret116 := areDoorsOpen_#res;timeShift_~tmp~28 := timeShift_#t~ret116;havoc timeShift_#t~ret116; 6038#L2967-2true assume 0 != timeShift_~tmp~28; 4295#L2968-4true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 5994#L2612-35true havoc __utac_acc__Specification14_spec__1_#t~ret168, __utac_acc__Specification14_spec__1_#t~ret169, __utac_acc__Specification14_spec__1_#t~ret170, __utac_acc__Specification14_spec__1_#t~ret171, __utac_acc__Specification14_spec__1_~tmp~31, __utac_acc__Specification14_spec__1_~tmp___0~13, __utac_acc__Specification14_spec__1_~tmp___1~8, __utac_acc__Specification14_spec__1_~tmp___2~6;havoc __utac_acc__Specification14_spec__1_~tmp~31;havoc __utac_acc__Specification14_spec__1_~tmp___0~13;havoc __utac_acc__Specification14_spec__1_~tmp___1~8;havoc __utac_acc__Specification14_spec__1_~tmp___2~6;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret167, isExecutiveFloorCalling_~retValue_acc~30;havoc isExecutiveFloorCalling_~retValue_acc~30;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~10;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~10; 10964#L1121-392true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~10 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~10; 15216#L1148-392true isExecutiveFloorCalling_#t~ret167 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~30 := isExecutiveFloorCalling_#t~ret167;havoc isExecutiveFloorCalling_#t~ret167;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~30; 8069#L3347-20true __utac_acc__Specification14_spec__1_#t~ret168 := isExecutiveFloorCalling_#res;__utac_acc__Specification14_spec__1_~tmp___2~6 := __utac_acc__Specification14_spec__1_#t~ret168;havoc __utac_acc__Specification14_spec__1_#t~ret168; 7570#L3380-4true assume !(0 != __utac_acc__Specification14_spec__1_~tmp___2~6); 7572#L3380-5true havoc bobCall_#t~ret1, bobCall_~tmp~0;havoc bobCall_~tmp~0;getOrigin_#in~person := 0;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~1;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~1; 14838#L85-1true assume 0 == getOrigin_~person;getOrigin_~retValue_acc~1 := 4;getOrigin_#res := getOrigin_~retValue_acc~1; 12779#L110-1true bobCall_#t~ret1 := getOrigin_#res;bobCall_~tmp~0 := bobCall_#t~ret1;havoc bobCall_#t~ret1;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 0, bobCall_~tmp~0;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 16077#L1392-1true assume 0 == initPersonOnFloor_~floor; 16074#L1393-2true assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 14074#L1500-3true callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 5860#L1184-2true assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 6507#L1196-5true havoc cleanup_#t~ret7, cleanup_#t~ret8, cleanup_~i~0, cleanup_~tmp~6, cleanup_~tmp___0~0, cleanup_~__cil_tmp4~0;havoc cleanup_~i~0;havoc cleanup_~tmp~6;havoc cleanup_~tmp___0~0;havoc cleanup_~__cil_tmp4~0;havoc timeShift_#t~ret116, timeShift_~tmp~28;havoc timeShift_~tmp~28;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~15;havoc areDoorsOpen_~retValue_acc~15;areDoorsOpen_~retValue_acc~15 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~15; 7213#L1956-6true timeShift_#t~ret116 := areDoorsOpen_#res;timeShift_~tmp~28 := timeShift_#t~ret116;havoc timeShift_#t~ret116; 6029#L2967-3true assume 0 != timeShift_~tmp~28; 4299#L2968-6true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 5976#L2612-47true havoc __utac_acc__Specification14_spec__1_#t~ret168, __utac_acc__Specification14_spec__1_#t~ret169, __utac_acc__Specification14_spec__1_#t~ret170, __utac_acc__Specification14_spec__1_#t~ret171, __utac_acc__Specification14_spec__1_~tmp~31, __utac_acc__Specification14_spec__1_~tmp___0~13, __utac_acc__Specification14_spec__1_~tmp___1~8, __utac_acc__Specification14_spec__1_~tmp___2~6;havoc __utac_acc__Specification14_spec__1_~tmp~31;havoc __utac_acc__Specification14_spec__1_~tmp___0~13;havoc __utac_acc__Specification14_spec__1_~tmp___1~8;havoc __utac_acc__Specification14_spec__1_~tmp___2~6;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret167, isExecutiveFloorCalling_~retValue_acc~30;havoc isExecutiveFloorCalling_~retValue_acc~30;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~10;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~10; 9793#L1121-523true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~10 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~10; 12728#L1148-523true isExecutiveFloorCalling_#t~ret167 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~30 := isExecutiveFloorCalling_#t~ret167;havoc isExecutiveFloorCalling_#t~ret167;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~30; 7919#L3347-27true __utac_acc__Specification14_spec__1_#t~ret168 := isExecutiveFloorCalling_#res;__utac_acc__Specification14_spec__1_~tmp___2~6 := __utac_acc__Specification14_spec__1_#t~ret168;havoc __utac_acc__Specification14_spec__1_#t~ret168; 7557#L3380-6true assume !(0 != __utac_acc__Specification14_spec__1_~tmp___2~6); 7554#L3380-7true cleanup_~i~0 := 0; 16215#L326-2true [2019-11-15 22:52:49,626 INFO L793 eck$LassoCheckResult]: Loop: 16215#L326-2true assume !false; 16275#L327true cleanup_~__cil_tmp4~0 := ~cleanupTimeShifts~0 - 1; 16197#L330true assume cleanup_~i~0 < cleanup_~__cil_tmp4~0;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~13;havoc isBlocked_~retValue_acc~13;isBlocked_~retValue_acc~13 := ~blocked~0;isBlocked_#res := isBlocked_~retValue_acc~13; 17418#L1774true cleanup_#t~ret7 := isBlocked_#res;cleanup_~tmp___0~0 := cleanup_#t~ret7;havoc cleanup_#t~ret7; 16051#L334true assume 1 != cleanup_~tmp___0~0; 16052#L334-1true havoc isIdle_#res;havoc isIdle_#t~ret64, isIdle_~retValue_acc~20, isIdle_~tmp~18;havoc isIdle_~retValue_acc~20;havoc isIdle_~tmp~18;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret59, anyStopRequested_#t~ret60, anyStopRequested_#t~ret61, anyStopRequested_#t~ret62, anyStopRequested_#t~ret63, anyStopRequested_~retValue_acc~19, anyStopRequested_~tmp~17, anyStopRequested_~tmp___0~4, anyStopRequested_~tmp___1~3, anyStopRequested_~tmp___2~1, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~19;havoc anyStopRequested_~tmp~17;havoc anyStopRequested_~tmp___0~4;havoc anyStopRequested_~tmp___1~3;havoc anyStopRequested_~tmp___2~1;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~10;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~10; 9800#L1121-524true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~10 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~10; 12730#L1148-524true anyStopRequested_#t~ret59 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret59;havoc anyStopRequested_#t~ret59; 3059#L2055true assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~19 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~19; 17390#L2119true isIdle_#t~ret64 := anyStopRequested_#res;isIdle_~tmp~18 := isIdle_#t~ret64;havoc isIdle_#t~ret64;isIdle_~retValue_acc~20 := (if 0 == isIdle_~tmp~18 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~20; 17041#L2132true cleanup_#t~ret8 := isIdle_#res;cleanup_~tmp~6 := cleanup_#t~ret8;havoc cleanup_#t~ret8; 16394#L346true assume !(0 != cleanup_~tmp~6);havoc timeShift_#t~ret116, timeShift_~tmp~28;havoc timeShift_~tmp~28;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~15;havoc areDoorsOpen_~retValue_acc~15;areDoorsOpen_~retValue_acc~15 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~15; 7222#L1956-8true timeShift_#t~ret116 := areDoorsOpen_#res;timeShift_~tmp~28 := timeShift_#t~ret116;havoc timeShift_#t~ret116; 6028#L2967-4true assume 0 != timeShift_~tmp~28; 4309#L2968-8true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 5935#L2612-59true havoc __utac_acc__Specification14_spec__1_#t~ret168, __utac_acc__Specification14_spec__1_#t~ret169, __utac_acc__Specification14_spec__1_#t~ret170, __utac_acc__Specification14_spec__1_#t~ret171, __utac_acc__Specification14_spec__1_~tmp~31, __utac_acc__Specification14_spec__1_~tmp___0~13, __utac_acc__Specification14_spec__1_~tmp___1~8, __utac_acc__Specification14_spec__1_~tmp___2~6;havoc __utac_acc__Specification14_spec__1_~tmp~31;havoc __utac_acc__Specification14_spec__1_~tmp___0~13;havoc __utac_acc__Specification14_spec__1_~tmp___1~8;havoc __utac_acc__Specification14_spec__1_~tmp___2~6;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret167, isExecutiveFloorCalling_~retValue_acc~30;havoc isExecutiveFloorCalling_~retValue_acc~30;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~10;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~10; 14823#L1121-659true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~10 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~10; 12597#L1148-659true isExecutiveFloorCalling_#t~ret167 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~30 := isExecutiveFloorCalling_#t~ret167;havoc isExecutiveFloorCalling_#t~ret167;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~30; 7917#L3347-34true __utac_acc__Specification14_spec__1_#t~ret168 := isExecutiveFloorCalling_#res;__utac_acc__Specification14_spec__1_~tmp___2~6 := __utac_acc__Specification14_spec__1_#t~ret168;havoc __utac_acc__Specification14_spec__1_#t~ret168; 7561#L3380-8true assume !(0 != __utac_acc__Specification14_spec__1_~tmp___2~6); 7564#L3380-9true cleanup_~i~0 := 1 + cleanup_~i~0; 16215#L326-2true [2019-11-15 22:52:49,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:52:49,636 INFO L82 PathProgramCache]: Analyzing trace with hash 359400175, now seen corresponding path program 1 times [2019-11-15 22:52:49,644 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:52:49,645 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720996259] [2019-11-15 22:52:49,645 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:52:49,645 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:52:49,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:52:49,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:52:50,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:52:50,009 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720996259] [2019-11-15 22:52:50,010 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:52:50,010 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:52:50,010 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186060668] [2019-11-15 22:52:50,016 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:52:50,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:52:50,016 INFO L82 PathProgramCache]: Analyzing trace with hash 710955789, now seen corresponding path program 1 times [2019-11-15 22:52:50,017 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:52:50,017 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333390563] [2019-11-15 22:52:50,017 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:52:50,017 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:52:50,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:52:50,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:52:50,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:52:50,139 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333390563] [2019-11-15 22:52:50,139 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:52:50,139 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 22:52:50,140 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397930263] [2019-11-15 22:52:50,141 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 22:52:50,142 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:52:50,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:52:50,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:52:50,167 INFO L87 Difference]: Start difference. First operand 17482 states. Second operand 8 states. [2019-11-15 22:53:26,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:53:26,101 INFO L93 Difference]: Finished difference Result 234390 states and 440916 transitions. [2019-11-15 22:53:26,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-15 22:53:26,103 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 234390 states and 440916 transitions. [2019-11-15 22:53:27,497 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80930 [2019-11-15 22:53:37,283 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 234390 states to 234290 states and 440789 transitions. [2019-11-15 22:53:37,285 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 234290 [2019-11-15 22:53:37,508 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 234290 [2019-11-15 22:53:37,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 234290 states and 440789 transitions. [2019-11-15 22:53:37,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:53:37,744 INFO L688 BuchiCegarLoop]: Abstraction has 234290 states and 440789 transitions. [2019-11-15 22:53:37,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234290 states and 440789 transitions. [2019-11-15 22:53:39,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234290 to 34911. [2019-11-15 22:53:39,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34911 states. [2019-11-15 22:53:39,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34911 states to 34911 states and 65830 transitions. [2019-11-15 22:53:39,610 INFO L711 BuchiCegarLoop]: Abstraction has 34911 states and 65830 transitions. [2019-11-15 22:53:39,610 INFO L591 BuchiCegarLoop]: Abstraction has 34911 states and 65830 transitions. [2019-11-15 22:53:39,610 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 22:53:39,610 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34911 states and 65830 transitions. [2019-11-15 22:53:39,736 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7033 [2019-11-15 22:53:39,737 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:53:39,737 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:53:39,742 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:53:39,742 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:53:39,742 INFO L791 eck$LassoCheckResult]: Stem: 255704#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~cleanupTimeShifts~0 := 12;~head~0.base, ~head~0.offset := 0, 0;call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(30);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(9);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(21);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(30);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(9);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(21);call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(30);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(9);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(25);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(30);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(9);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(25);~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~0 := 0;~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~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~string117.base, #t~string117.offset := #Ultimate.allocOnStack(10);call #t~string119.base, #t~string119.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string119.base, #t~string119.offset, 1);call write~init~int(95, #t~string119.base, 1 + #t~string119.offset, 1);call write~init~int(93, #t~string119.base, 2 + #t~string119.offset, 1);call write~init~int(0, #t~string119.base, 3 + #t~string119.offset, 1);call #t~string121.base, #t~string121.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string121.base, #t~string121.offset, 1);call write~init~int(93, #t~string121.base, 1 + #t~string121.offset, 1);call write~init~int(32, #t~string121.base, 2 + #t~string121.offset, 1);call write~init~int(0, #t~string121.base, 3 + #t~string121.offset, 1);call #t~string123.base, #t~string123.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string123.base, #t~string123.offset, 1);call write~init~int(97, #t~string123.base, 1 + #t~string123.offset, 1);call write~init~int(116, #t~string123.base, 2 + #t~string123.offset, 1);call write~init~int(32, #t~string123.base, 3 + #t~string123.offset, 1);call write~init~int(0, #t~string123.base, 4 + #t~string123.offset, 1);call #t~string125.base, #t~string125.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string125.base, #t~string125.offset, 1);call write~init~int(105, #t~string125.base, 1 + #t~string125.offset, 1);call write~init~int(0, #t~string125.base, 2 + #t~string125.offset, 1);call #t~string127.base, #t~string127.offset := #Ultimate.allocOnStack(10);call #t~string129.base, #t~string129.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string129.base, #t~string129.offset, 1);call write~init~int(112, #t~string129.base, 1 + #t~string129.offset, 1);call write~init~int(0, #t~string129.base, 2 + #t~string129.offset, 1);call #t~string131.base, #t~string131.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string131.base, #t~string131.offset, 1);call write~init~int(111, #t~string131.base, 1 + #t~string131.offset, 1);call write~init~int(119, #t~string131.base, 2 + #t~string131.offset, 1);call write~init~int(110, #t~string131.base, 3 + #t~string131.offset, 1);call write~init~int(0, #t~string131.base, 4 + #t~string131.offset, 1);call #t~string133.base, #t~string133.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string133.base, #t~string133.offset, 1);call write~init~int(73, #t~string133.base, 1 + #t~string133.offset, 1);call write~init~int(76, #t~string133.base, 2 + #t~string133.offset, 1);call write~init~int(95, #t~string133.base, 3 + #t~string133.offset, 1);call write~init~int(112, #t~string133.base, 4 + #t~string133.offset, 1);call write~init~int(58, #t~string133.base, 5 + #t~string133.offset, 1);call write~init~int(0, #t~string133.base, 6 + #t~string133.offset, 1);call #t~string135.base, #t~string135.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string135.base, #t~string135.offset, 1);call write~init~int(37, #t~string135.base, 1 + #t~string135.offset, 1);call write~init~int(105, #t~string135.base, 2 + #t~string135.offset, 1);call write~init~int(0, #t~string135.base, 3 + #t~string135.offset, 1);call #t~string137.base, #t~string137.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string137.base, #t~string137.offset, 1);call write~init~int(37, #t~string137.base, 1 + #t~string137.offset, 1);call write~init~int(105, #t~string137.base, 2 + #t~string137.offset, 1);call write~init~int(0, #t~string137.base, 3 + #t~string137.offset, 1);call #t~string139.base, #t~string139.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string139.base, #t~string139.offset, 1);call write~init~int(37, #t~string139.base, 1 + #t~string139.offset, 1);call write~init~int(105, #t~string139.base, 2 + #t~string139.offset, 1);call write~init~int(0, #t~string139.base, 3 + #t~string139.offset, 1);call #t~string141.base, #t~string141.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string141.base, #t~string141.offset, 1);call write~init~int(37, #t~string141.base, 1 + #t~string141.offset, 1);call write~init~int(105, #t~string141.base, 2 + #t~string141.offset, 1);call write~init~int(0, #t~string141.base, 3 + #t~string141.offset, 1);call #t~string143.base, #t~string143.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string143.base, #t~string143.offset, 1);call write~init~int(37, #t~string143.base, 1 + #t~string143.offset, 1);call write~init~int(105, #t~string143.base, 2 + #t~string143.offset, 1);call write~init~int(0, #t~string143.base, 3 + #t~string143.offset, 1);call #t~string145.base, #t~string145.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string145.base, #t~string145.offset, 1);call write~init~int(70, #t~string145.base, 1 + #t~string145.offset, 1);call write~init~int(95, #t~string145.base, 2 + #t~string145.offset, 1);call write~init~int(112, #t~string145.base, 3 + #t~string145.offset, 1);call write~init~int(58, #t~string145.base, 4 + #t~string145.offset, 1);call write~init~int(0, #t~string145.base, 5 + #t~string145.offset, 1);call #t~string148.base, #t~string148.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string148.base, #t~string148.offset, 1);call write~init~int(37, #t~string148.base, 1 + #t~string148.offset, 1);call write~init~int(105, #t~string148.base, 2 + #t~string148.offset, 1);call write~init~int(0, #t~string148.base, 3 + #t~string148.offset, 1);call #t~string151.base, #t~string151.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string151.base, #t~string151.offset, 1);call write~init~int(37, #t~string151.base, 1 + #t~string151.offset, 1);call write~init~int(105, #t~string151.base, 2 + #t~string151.offset, 1);call write~init~int(0, #t~string151.base, 3 + #t~string151.offset, 1);call #t~string154.base, #t~string154.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string154.base, #t~string154.offset, 1);call write~init~int(37, #t~string154.base, 1 + #t~string154.offset, 1);call write~init~int(105, #t~string154.base, 2 + #t~string154.offset, 1);call write~init~int(0, #t~string154.base, 3 + #t~string154.offset, 1);call #t~string157.base, #t~string157.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string157.base, #t~string157.offset, 1);call write~init~int(37, #t~string157.base, 1 + #t~string157.offset, 1);call write~init~int(105, #t~string157.base, 2 + #t~string157.offset, 1);call write~init~int(0, #t~string157.base, 3 + #t~string157.offset, 1);call #t~string160.base, #t~string160.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string160.base, #t~string160.offset, 1);call write~init~int(37, #t~string160.base, 1 + #t~string160.offset, 1);call write~init~int(105, #t~string160.base, 2 + #t~string160.offset, 1);call write~init~int(0, #t~string160.base, 3 + #t~string160.offset, 1);call #t~string162.base, #t~string162.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string162.base, #t~string162.offset, 1);call write~init~int(0, #t~string162.base, 1 + #t~string162.offset, 1);call #t~string165.base, #t~string165.offset := #Ultimate.allocOnStack(9); 255705#L-1 havoc main_#res;havoc main_#t~ret13, main_~retValue_acc~4, main_~tmp~8;havoc main_~retValue_acc~4;havoc main_~tmp~8; 254577#L924 havoc valid_product_#res;havoc valid_product_~retValue_acc~9;havoc valid_product_~retValue_acc~9;valid_product_~retValue_acc~9 := 1;valid_product_#res := valid_product_~retValue_acc~9; 254578#L932 main_#t~ret13 := valid_product_#res;main_~tmp~8 := main_#t~ret13;havoc main_#t~ret13; 255134#L522 assume 0 != main_~tmp~8; 257658#L496 havoc bigMacCall_#t~ret6, bigMacCall_~tmp~5;havoc bigMacCall_~tmp~5;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~1;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~1; 259863#L85 assume 0 == getOrigin_~person;getOrigin_~retValue_acc~1 := 4;getOrigin_#res := getOrigin_~retValue_acc~1; 267381#L110 bigMacCall_#t~ret6 := getOrigin_#res;bigMacCall_~tmp~5 := bigMacCall_#t~ret6;havoc bigMacCall_#t~ret6;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~5;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 267382#L1392 assume 0 == initPersonOnFloor_~floor; 269367#L1393 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 262532#L1500-1 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 267689#L1184 assume !(0 == callOnFloor_~floorID); 259459#L1187 assume 1 == callOnFloor_~floorID;~calls_1~0 := 1; 258614#L1196-2 havoc timeShift_#t~ret116, timeShift_~tmp~28;havoc timeShift_~tmp~28;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~15;havoc areDoorsOpen_~retValue_acc~15;areDoorsOpen_~retValue_acc~15 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~15; 260123#L1956 timeShift_#t~ret116 := areDoorsOpen_#res;timeShift_~tmp~28 := timeShift_#t~ret116;havoc timeShift_#t~ret116; 259742#L2967 assume 0 != timeShift_~tmp~28; 259743#L2968 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 270389#L2612-11 havoc __utac_acc__Specification14_spec__1_#t~ret168, __utac_acc__Specification14_spec__1_#t~ret169, __utac_acc__Specification14_spec__1_#t~ret170, __utac_acc__Specification14_spec__1_#t~ret171, __utac_acc__Specification14_spec__1_~tmp~31, __utac_acc__Specification14_spec__1_~tmp___0~13, __utac_acc__Specification14_spec__1_~tmp___1~8, __utac_acc__Specification14_spec__1_~tmp___2~6;havoc __utac_acc__Specification14_spec__1_~tmp~31;havoc __utac_acc__Specification14_spec__1_~tmp___0~13;havoc __utac_acc__Specification14_spec__1_~tmp___1~8;havoc __utac_acc__Specification14_spec__1_~tmp___2~6;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret167, isExecutiveFloorCalling_~retValue_acc~30;havoc isExecutiveFloorCalling_~retValue_acc~30;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~10;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~10; 263027#L1121-130 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~10 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~10; 263029#L1148-130 isExecutiveFloorCalling_#t~ret167 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~30 := isExecutiveFloorCalling_#t~ret167;havoc isExecutiveFloorCalling_#t~ret167;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~30; 261515#L3347-6 __utac_acc__Specification14_spec__1_#t~ret168 := isExecutiveFloorCalling_#res;__utac_acc__Specification14_spec__1_~tmp___2~6 := __utac_acc__Specification14_spec__1_#t~ret168;havoc __utac_acc__Specification14_spec__1_#t~ret168; 261516#L3380 assume !(0 != __utac_acc__Specification14_spec__1_~tmp___2~6); 254557#L3380-1 havoc timeShift_#t~ret116, timeShift_~tmp~28;havoc timeShift_~tmp~28;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~15;havoc areDoorsOpen_~retValue_acc~15;areDoorsOpen_~retValue_acc~15 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~15; 260637#L1956-2 timeShift_#t~ret116 := areDoorsOpen_#res;timeShift_~tmp~28 := timeShift_#t~ret116;havoc timeShift_#t~ret116; 259746#L2967-1 assume 0 != timeShift_~tmp~28; 257472#L2968-2 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 256899#L2612-23 havoc __utac_acc__Specification14_spec__1_#t~ret168, __utac_acc__Specification14_spec__1_#t~ret169, __utac_acc__Specification14_spec__1_#t~ret170, __utac_acc__Specification14_spec__1_#t~ret171, __utac_acc__Specification14_spec__1_~tmp~31, __utac_acc__Specification14_spec__1_~tmp___0~13, __utac_acc__Specification14_spec__1_~tmp___1~8, __utac_acc__Specification14_spec__1_~tmp___2~6;havoc __utac_acc__Specification14_spec__1_~tmp~31;havoc __utac_acc__Specification14_spec__1_~tmp___0~13;havoc __utac_acc__Specification14_spec__1_~tmp___1~8;havoc __utac_acc__Specification14_spec__1_~tmp___2~6;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret167, isExecutiveFloorCalling_~retValue_acc~30;havoc isExecutiveFloorCalling_~retValue_acc~30;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~10;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~10; 265836#L1121-261 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~10 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~10; 264005#L1148-261 isExecutiveFloorCalling_#t~ret167 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~30 := isExecutiveFloorCalling_#t~ret167;havoc isExecutiveFloorCalling_#t~ret167;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~30; 261513#L3347-13 __utac_acc__Specification14_spec__1_#t~ret168 := isExecutiveFloorCalling_#res;__utac_acc__Specification14_spec__1_~tmp___2~6 := __utac_acc__Specification14_spec__1_#t~ret168;havoc __utac_acc__Specification14_spec__1_#t~ret168; 261514#L3380-2 assume !(0 != __utac_acc__Specification14_spec__1_~tmp___2~6); 254549#L3380-3 havoc timeShift_#t~ret116, timeShift_~tmp~28;havoc timeShift_~tmp~28;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~15;havoc areDoorsOpen_~retValue_acc~15;areDoorsOpen_~retValue_acc~15 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~15; 260648#L1956-4 timeShift_#t~ret116 := areDoorsOpen_#res;timeShift_~tmp~28 := timeShift_#t~ret116;havoc timeShift_#t~ret116; 259749#L2967-2 assume 0 != timeShift_~tmp~28; 257428#L2968-4 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 256892#L2612-35 havoc __utac_acc__Specification14_spec__1_#t~ret168, __utac_acc__Specification14_spec__1_#t~ret169, __utac_acc__Specification14_spec__1_#t~ret170, __utac_acc__Specification14_spec__1_#t~ret171, __utac_acc__Specification14_spec__1_~tmp~31, __utac_acc__Specification14_spec__1_~tmp___0~13, __utac_acc__Specification14_spec__1_~tmp___1~8, __utac_acc__Specification14_spec__1_~tmp___2~6;havoc __utac_acc__Specification14_spec__1_~tmp~31;havoc __utac_acc__Specification14_spec__1_~tmp___0~13;havoc __utac_acc__Specification14_spec__1_~tmp___1~8;havoc __utac_acc__Specification14_spec__1_~tmp___2~6;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret167, isExecutiveFloorCalling_~retValue_acc~30;havoc isExecutiveFloorCalling_~retValue_acc~30;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~10;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~10; 265665#L1121-392 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~10 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~10; 263955#L1148-392 isExecutiveFloorCalling_#t~ret167 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~30 := isExecutiveFloorCalling_#t~ret167;havoc isExecutiveFloorCalling_#t~ret167;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~30; 261493#L3347-20 __utac_acc__Specification14_spec__1_#t~ret168 := isExecutiveFloorCalling_#res;__utac_acc__Specification14_spec__1_~tmp___2~6 := __utac_acc__Specification14_spec__1_#t~ret168;havoc __utac_acc__Specification14_spec__1_#t~ret168; 261494#L3380-4 assume !(0 != __utac_acc__Specification14_spec__1_~tmp___2~6); 254554#L3380-5 havoc bobCall_#t~ret1, bobCall_~tmp~0;havoc bobCall_~tmp~0;getOrigin_#in~person := 0;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~1;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~1; 261157#L85-1 assume 0 == getOrigin_~person;getOrigin_~retValue_acc~1 := 4;getOrigin_#res := getOrigin_~retValue_acc~1; 267379#L110-1 bobCall_#t~ret1 := getOrigin_#res;bobCall_~tmp~0 := bobCall_#t~ret1;havoc bobCall_#t~ret1;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 0, bobCall_~tmp~0;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 267380#L1392-1 assume 0 == initPersonOnFloor_~floor; 269369#L1393-2 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 262555#L1500-3 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 259581#L1184-2 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 258635#L1196-5 havoc cleanup_#t~ret7, cleanup_#t~ret8, cleanup_~i~0, cleanup_~tmp~6, cleanup_~tmp___0~0, cleanup_~__cil_tmp4~0;havoc cleanup_~i~0;havoc cleanup_~tmp~6;havoc cleanup_~tmp___0~0;havoc cleanup_~__cil_tmp4~0;havoc timeShift_#t~ret116, timeShift_~tmp~28;havoc timeShift_~tmp~28;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~15;havoc areDoorsOpen_~retValue_acc~15;areDoorsOpen_~retValue_acc~15 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~15; 260115#L1956-6 timeShift_#t~ret116 := areDoorsOpen_#res;timeShift_~tmp~28 := timeShift_#t~ret116;havoc timeShift_#t~ret116; 259735#L2967-3 assume 0 != timeShift_~tmp~28; 259736#L2968-6 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 259681#L2612-47 havoc __utac_acc__Specification14_spec__1_#t~ret168, __utac_acc__Specification14_spec__1_#t~ret169, __utac_acc__Specification14_spec__1_#t~ret170, __utac_acc__Specification14_spec__1_#t~ret171, __utac_acc__Specification14_spec__1_~tmp~31, __utac_acc__Specification14_spec__1_~tmp___0~13, __utac_acc__Specification14_spec__1_~tmp___1~8, __utac_acc__Specification14_spec__1_~tmp___2~6;havoc __utac_acc__Specification14_spec__1_~tmp~31;havoc __utac_acc__Specification14_spec__1_~tmp___0~13;havoc __utac_acc__Specification14_spec__1_~tmp___1~8;havoc __utac_acc__Specification14_spec__1_~tmp___2~6;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret167, isExecutiveFloorCalling_~retValue_acc~30;havoc isExecutiveFloorCalling_~retValue_acc~30;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~10;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~10; 259682#L1121-523 assume !(0 == isFloorCalling_~floorID); 270385#L1125-523 assume 1 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~10 := ~calls_1~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~10; 283396#L1148-523 isExecutiveFloorCalling_#t~ret167 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~30 := isExecutiveFloorCalling_#t~ret167;havoc isExecutiveFloorCalling_#t~ret167;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~30; 283395#L3347-27 __utac_acc__Specification14_spec__1_#t~ret168 := isExecutiveFloorCalling_#res;__utac_acc__Specification14_spec__1_~tmp___2~6 := __utac_acc__Specification14_spec__1_#t~ret168;havoc __utac_acc__Specification14_spec__1_#t~ret168; 283394#L3380-6 assume !(0 != __utac_acc__Specification14_spec__1_~tmp___2~6); 261135#L3380-7 cleanup_~i~0 := 0; 261136#L326-2 [2019-11-15 22:53:39,743 INFO L793 eck$LassoCheckResult]: Loop: 261136#L326-2 assume !false; 269525#L327 cleanup_~__cil_tmp4~0 := ~cleanupTimeShifts~0 - 1; 269500#L330 assume cleanup_~i~0 < cleanup_~__cil_tmp4~0;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~13;havoc isBlocked_~retValue_acc~13;isBlocked_~retValue_acc~13 := ~blocked~0;isBlocked_#res := isBlocked_~retValue_acc~13; 269501#L1774 cleanup_#t~ret7 := isBlocked_#res;cleanup_~tmp___0~0 := cleanup_#t~ret7;havoc cleanup_#t~ret7; 269345#L334 assume 1 != cleanup_~tmp___0~0; 269346#L334-1 havoc isIdle_#res;havoc isIdle_#t~ret64, isIdle_~retValue_acc~20, isIdle_~tmp~18;havoc isIdle_~retValue_acc~20;havoc isIdle_~tmp~18;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret59, anyStopRequested_#t~ret60, anyStopRequested_#t~ret61, anyStopRequested_#t~ret62, anyStopRequested_#t~ret63, anyStopRequested_~retValue_acc~19, anyStopRequested_~tmp~17, anyStopRequested_~tmp___0~4, anyStopRequested_~tmp___1~3, anyStopRequested_~tmp___2~1, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~19;havoc anyStopRequested_~tmp~17;havoc anyStopRequested_~tmp___0~4;havoc anyStopRequested_~tmp___1~3;havoc anyStopRequested_~tmp___2~1;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~10;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~10; 263935#L1121-524 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~10 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~10; 263936#L1148-524 anyStopRequested_#t~ret59 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret59;havoc anyStopRequested_#t~ret59; 256160#L2055 assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~19 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~19; 256130#L2119 isIdle_#t~ret64 := anyStopRequested_#res;isIdle_~tmp~18 := isIdle_#t~ret64;havoc isIdle_#t~ret64;isIdle_~retValue_acc~20 := (if 0 == isIdle_~tmp~18 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~20; 270117#L2132 cleanup_#t~ret8 := isIdle_#res;cleanup_~tmp~6 := cleanup_#t~ret8;havoc cleanup_#t~ret8; 269697#L346 assume !(0 != cleanup_~tmp~6);havoc timeShift_#t~ret116, timeShift_~tmp~28;havoc timeShift_~tmp~28;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~15;havoc areDoorsOpen_~retValue_acc~15;areDoorsOpen_~retValue_acc~15 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~15; 260755#L1956-8 timeShift_#t~ret116 := areDoorsOpen_#res;timeShift_~tmp~28 := timeShift_#t~ret116;havoc timeShift_#t~ret116; 259733#L2967-4 assume 0 != timeShift_~tmp~28; 257455#L2968-8 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 256887#L2612-59 havoc __utac_acc__Specification14_spec__1_#t~ret168, __utac_acc__Specification14_spec__1_#t~ret169, __utac_acc__Specification14_spec__1_#t~ret170, __utac_acc__Specification14_spec__1_#t~ret171, __utac_acc__Specification14_spec__1_~tmp~31, __utac_acc__Specification14_spec__1_~tmp___0~13, __utac_acc__Specification14_spec__1_~tmp___1~8, __utac_acc__Specification14_spec__1_~tmp___2~6;havoc __utac_acc__Specification14_spec__1_~tmp~31;havoc __utac_acc__Specification14_spec__1_~tmp___0~13;havoc __utac_acc__Specification14_spec__1_~tmp___1~8;havoc __utac_acc__Specification14_spec__1_~tmp___2~6;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret167, isExecutiveFloorCalling_~retValue_acc~30;havoc isExecutiveFloorCalling_~retValue_acc~30;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~10;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~10; 259640#L1121-659 assume !(0 == isFloorCalling_~floorID); 283403#L1125-659 assume 1 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~10 := ~calls_1~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~10; 283405#L1148-659 isExecutiveFloorCalling_#t~ret167 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~30 := isExecutiveFloorCalling_#t~ret167;havoc isExecutiveFloorCalling_#t~ret167;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~30; 283401#L3347-34 __utac_acc__Specification14_spec__1_#t~ret168 := isExecutiveFloorCalling_#res;__utac_acc__Specification14_spec__1_~tmp___2~6 := __utac_acc__Specification14_spec__1_#t~ret168;havoc __utac_acc__Specification14_spec__1_#t~ret168; 283402#L3380-8 assume !(0 != __utac_acc__Specification14_spec__1_~tmp___2~6); 254543#L3380-9 cleanup_~i~0 := 1 + cleanup_~i~0; 261136#L326-2 [2019-11-15 22:53:39,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:39,743 INFO L82 PathProgramCache]: Analyzing trace with hash -765194178, now seen corresponding path program 1 times [2019-11-15 22:53:39,743 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:39,744 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584088957] [2019-11-15 22:53:39,744 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:39,744 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:39,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:39,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:39,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:53:39,889 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584088957] [2019-11-15 22:53:39,889 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:53:39,889 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:53:39,889 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92997386] [2019-11-15 22:53:39,890 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:53:39,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:39,891 INFO L82 PathProgramCache]: Analyzing trace with hash 604504277, now seen corresponding path program 1 times [2019-11-15 22:53:39,891 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:53:39,891 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860451639] [2019-11-15 22:53:39,891 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:39,892 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:53:39,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:53:39,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:39,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:53:39,943 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:53:40,193 WARN L191 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2019-11-15 22:53:40,457 WARN L191 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2019-11-15 22:53:40,469 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:53:40,469 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:53:40,469 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:53:40,470 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:53:40,470 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 22:53:40,470 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:53:40,470 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:53:40,470 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:53:40,470 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec14_product32.cil.c_Iteration2_Loop [2019-11-15 22:53:40,471 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:53:40,471 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:53:40,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:40,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:40,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:40,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:40,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:40,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:40,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:40,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:40,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:40,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:40,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:40,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:40,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:40,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:40,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:40,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:40,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:40,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:40,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:40,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:40,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:40,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:40,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:40,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:40,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:40,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:40,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:40,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:40,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:40,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:41,104 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:53:41,105 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2e3530e3-6fa6-4853-b968-ffbb9febc094/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-11-15 22:53:41,117 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:53:41,117 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 22:53:41,124 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 22:53:41,124 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_~tmp___1~3=0} Honda state: {ULTIMATE.start_anyStopRequested_~tmp___1~3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2e3530e3-6fa6-4853-b968-ffbb9febc094/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-11-15 22:53:41,129 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:53:41,129 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 22:53:41,132 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 22:53:41,132 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification14_spec__1_~tmp___0~13=0} Honda state: {ULTIMATE.start___utac_acc__Specification14_spec__1_~tmp___0~13=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2e3530e3-6fa6-4853-b968-ffbb9febc094/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) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:53:41,137 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:53:41,137 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 22:53:41,141 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 22:53:41,141 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification14_spec__1_#t~ret169=0} Honda state: {ULTIMATE.start___utac_acc__Specification14_spec__1_#t~ret169=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2e3530e3-6fa6-4853-b968-ffbb9febc094/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) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:53:41,165 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:53:41,165 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 22:53:41,189 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 22:53:41,189 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification14_spec__1_#t~ret171=0} Honda state: {ULTIMATE.start___utac_acc__Specification14_spec__1_#t~ret171=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2e3530e3-6fa6-4853-b968-ffbb9febc094/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-11-15 22:53:41,245 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:53:41,245 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-11-15 22:53:41,253 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 22:53:41,253 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/run_dir_2e3530e3-6fa6-4853-b968-ffbb9febc094/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) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:53:41,269 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:53:41,269 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 22:53:41,276 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 22:53:41,277 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~executiveFloor~0=1, ULTIMATE.start_isFloorCalling_#in~floorID=1, ULTIMATE.start_isFloorCalling_~floorID=1} Honda state: {~executiveFloor~0=1, ULTIMATE.start_isFloorCalling_#in~floorID=1, ULTIMATE.start_isFloorCalling_~floorID=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2e3530e3-6fa6-4853-b968-ffbb9febc094/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) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:53:41,324 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:53:41,325 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2e3530e3-6fa6-4853-b968-ffbb9febc094/bin/uautomizer/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:53:41,343 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 22:53:41,344 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 22:53:42,047 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 22:53:42,049 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:53:42,049 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:53:42,050 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:53:42,050 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:53:42,050 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:53:42,050 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:53:42,050 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:53:42,050 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:53:42,050 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec14_product32.cil.c_Iteration2_Loop [2019-11-15 22:53:42,050 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:53:42,051 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:53:42,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:42,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:42,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:42,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:42,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:42,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:42,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:42,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:42,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:42,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:42,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:42,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:42,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:42,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:42,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:42,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:42,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:42,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:42,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:42,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:42,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:42,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-11-15 22:53:42,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:42,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:42,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:42,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:42,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-11-15 22:53:42,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-11-15 22:53:42,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:42,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:53:42,711 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:53:42,722 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:53:42,725 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:42,726 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:42,727 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:42,728 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:42,728 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:42,728 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:42,731 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:42,731 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:42,748 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:42,750 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:42,751 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:42,751 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:42,751 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:42,751 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:42,752 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:42,753 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:42,753 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:42,758 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:42,758 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:42,759 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:42,766 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:42,767 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:42,767 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:42,767 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:42,768 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:42,768 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:42,768 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:42,769 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:42,770 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:42,770 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:42,771 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:42,771 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:42,771 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:42,772 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:42,772 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:42,772 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:42,773 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:42,774 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:42,774 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:42,774 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:42,775 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:42,775 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:42,775 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:42,776 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:42,777 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:42,778 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:42,779 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:42,779 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:42,779 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:42,780 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:42,780 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:42,780 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:42,781 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:42,782 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:53:42,784 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:53:42,785 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:53:42,786 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:53:42,786 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:53:42,786 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:53:42,786 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:53:42,787 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:53:42,789 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:53:42,793 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:53:42,804 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 22:53:42,804 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 22:53:42,806 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:53:42,806 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 22:53:42,807 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:53:42,807 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~cleanupTimeShifts~0, ULTIMATE.start_cleanup_~i~0) = 1*~cleanupTimeShifts~0 - 1*ULTIMATE.start_cleanup_~i~0 Supporting invariants [] [2019-11-15 22:53:42,809 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 22:53:42,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:53:43,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:43,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:53:43,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:53:43,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:53:43,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 22:53:43,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:53:43,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:53:43,117 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 22:53:43,118 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34911 states and 65830 transitions. cyclomatic complexity: 30920 Second operand 5 states. [2019-11-15 22:53:44,303 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34911 states and 65830 transitions. cyclomatic complexity: 30920. Second operand 5 states. Result 41944 states and 79078 transitions. Complement of second has 8 states. [2019-11-15 22:53:44,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 22:53:44,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 22:53:44,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32955 transitions. [2019-11-15 22:53:44,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32955 transitions. Stem has 58 letters. Loop has 22 letters. [2019-11-15 22:53:44,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:53:44,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32955 transitions. Stem has 80 letters. Loop has 22 letters. [2019-11-15 22:53:44,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:53:44,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32955 transitions. Stem has 58 letters. Loop has 44 letters. [2019-11-15 22:53:44,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:53:44,349 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41944 states and 79078 transitions. [2019-11-15 22:53:44,588 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 22:53:44,589 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41944 states to 0 states and 0 transitions. [2019-11-15 22:53:44,589 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 22:53:44,589 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 22:53:44,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 22:53:44,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:53:44,590 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:53:44,590 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:53:44,590 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:53:44,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:53:44,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:53:44,591 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2019-11-15 22:53:44,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:53:44,591 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-11-15 22:53:44,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 22:53:44,591 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-11-15 22:53:44,591 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 22:53:44,592 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 22:53:44,592 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 22:53:44,592 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 22:53:44,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 22:53:44,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:53:44,592 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:53:44,592 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:53:44,592 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:53:44,593 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 22:53:44,593 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 22:53:44,593 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 22:53:44,593 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 22:53:44,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 10:53:44 BoogieIcfgContainer [2019-11-15 22:53:44,600 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 22:53:44,600 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:53:44,600 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:53:44,600 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:53:44,601 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:52:48" (3/4) ... [2019-11-15 22:53:44,604 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 22:53:44,604 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:53:44,606 INFO L168 Benchmark]: Toolchain (without parser) took 92199.02 ms. Allocated memory was 1.0 GB in the beginning and 5.2 GB in the end (delta: 4.2 GB). Free memory was 935.7 MB in the beginning and 1.7 GB in the end (delta: -794.2 MB). Peak memory consumption was 3.4 GB. Max. memory is 11.5 GB. [2019-11-15 22:53:44,606 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:53:44,607 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1043.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 935.7 MB in the beginning and 1.1 GB in the end (delta: -145.2 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. [2019-11-15 22:53:44,608 INFO L168 Benchmark]: Boogie Procedure Inliner took 1135.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.8 MB). Peak memory consumption was 284.8 MB. Max. memory is 11.5 GB. [2019-11-15 22:53:44,608 INFO L168 Benchmark]: Boogie Preprocessor took 1031.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 882.0 MB in the end (delta: 172.1 MB). Peak memory consumption was 172.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:53:44,609 INFO L168 Benchmark]: RCFGBuilder took 32878.50 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.0 GB). Free memory was 882.0 MB in the beginning and 827.1 MB in the end (delta: 55.0 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-11-15 22:53:44,610 INFO L168 Benchmark]: BuchiAutomizer took 56102.49 ms. Allocated memory was 2.2 GB in the beginning and 5.2 GB in the end (delta: 3.0 GB). Free memory was 827.1 MB in the beginning and 1.7 GB in the end (delta: -902.9 MB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2019-11-15 22:53:44,610 INFO L168 Benchmark]: Witness Printer took 4.22 ms. Allocated memory is still 5.2 GB. Free memory is still 1.7 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:53:44,614 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.28 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1043.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 935.7 MB in the beginning and 1.1 GB in the end (delta: -145.2 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 1135.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.8 MB). Peak memory consumption was 284.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 1031.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 882.0 MB in the end (delta: 172.1 MB). Peak memory consumption was 172.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 32878.50 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.0 GB). Free memory was 882.0 MB in the beginning and 827.1 MB in the end (delta: 55.0 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * BuchiAutomizer took 56102.49 ms. Allocated memory was 2.2 GB in the beginning and 5.2 GB in the end (delta: 3.0 GB). Free memory was 827.1 MB in the beginning and 1.7 GB in the end (delta: -902.9 MB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. * Witness Printer took 4.22 ms. Allocated memory is still 5.2 GB. Free memory is still 1.7 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 3 terminating modules (2 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function cleanupTimeShifts + -1 * i and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 56.0s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 3.5s. Construction of modules took 24.0s. Büchi inclusion checks took 13.4s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 1.8s AutomataMinimizationTime, 1 MinimizatonAttempts, 199379 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 11.4s Buchi closure took 0.2s. Biggest automaton had 34911 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 102858 SDtfs, 487792 SDslu, 611446 SDs, 0 SdLazy, 33471 SolverSat, 3431 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 24.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI1 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital99 mio100 ax100 hnf100 lsp20 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq220 hnf86 smp100 dnf157 smp100 tf103 neg96 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 23ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.9s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...