./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/product-lines/elevator_spec14_product32_false-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_037b0559-7f90-4eca-a014-cbf58035f9d5/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_037b0559-7f90-4eca-a014-cbf58035f9d5/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_037b0559-7f90-4eca-a014-cbf58035f9d5/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_037b0559-7f90-4eca-a014-cbf58035f9d5/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/product-lines/elevator_spec14_product32_false-unreach-call_true-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_037b0559-7f90-4eca-a014-cbf58035f9d5/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_037b0559-7f90-4eca-a014-cbf58035f9d5/bin-2019/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.23-635dfa2 [2018-12-02 06:52:26,582 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 06:52:26,583 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 06:52:26,591 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 06:52:26,591 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 06:52:26,592 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 06:52:26,592 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 06:52:26,593 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 06:52:26,594 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 06:52:26,595 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 06:52:26,596 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 06:52:26,596 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 06:52:26,596 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 06:52:26,597 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 06:52:26,598 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 06:52:26,598 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 06:52:26,599 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 06:52:26,600 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 06:52:26,601 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 06:52:26,602 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 06:52:26,603 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 06:52:26,604 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 06:52:26,605 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 06:52:26,605 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 06:52:26,606 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 06:52:26,606 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 06:52:26,607 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 06:52:26,607 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 06:52:26,608 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 06:52:26,609 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 06:52:26,609 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 06:52:26,609 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 06:52:26,609 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 06:52:26,610 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 06:52:26,610 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 06:52:26,610 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 06:52:26,611 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_037b0559-7f90-4eca-a014-cbf58035f9d5/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-02 06:52:26,622 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 06:52:26,622 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 06:52:26,623 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 06:52:26,623 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 06:52:26,623 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 06:52:26,623 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 06:52:26,623 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 06:52:26,623 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 06:52:26,624 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 06:52:26,624 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 06:52:26,624 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 06:52:26,624 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 06:52:26,624 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 06:52:26,624 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 06:52:26,624 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 06:52:26,624 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 06:52:26,624 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 06:52:26,624 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 06:52:26,625 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 06:52:26,625 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 06:52:26,625 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 06:52:26,625 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 06:52:26,625 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 06:52:26,625 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 06:52:26,625 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 06:52:26,625 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 06:52:26,625 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 06:52:26,626 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 06:52:26,626 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 06:52:26,626 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 06:52:26,626 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 06:52:26,626 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 06:52:26,626 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_037b0559-7f90-4eca-a014-cbf58035f9d5/bin-2019/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 [2018-12-02 06:52:26,648 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 06:52:26,657 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 06:52:26,660 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 06:52:26,661 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 06:52:26,661 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 06:52:26,662 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_037b0559-7f90-4eca-a014-cbf58035f9d5/bin-2019/uautomizer/../../sv-benchmarks/c/product-lines/elevator_spec14_product32_false-unreach-call_true-termination.cil.c [2018-12-02 06:52:26,704 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_037b0559-7f90-4eca-a014-cbf58035f9d5/bin-2019/uautomizer/data/17dfa3085/c2a009c0472a425285c64dd0c678ec52/FLAGca5a7bdbb [2018-12-02 06:52:27,165 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 06:52:27,165 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_037b0559-7f90-4eca-a014-cbf58035f9d5/sv-benchmarks/c/product-lines/elevator_spec14_product32_false-unreach-call_true-termination.cil.c [2018-12-02 06:52:27,176 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_037b0559-7f90-4eca-a014-cbf58035f9d5/bin-2019/uautomizer/data/17dfa3085/c2a009c0472a425285c64dd0c678ec52/FLAGca5a7bdbb [2018-12-02 06:52:27,186 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_037b0559-7f90-4eca-a014-cbf58035f9d5/bin-2019/uautomizer/data/17dfa3085/c2a009c0472a425285c64dd0c678ec52 [2018-12-02 06:52:27,188 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 06:52:27,190 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 06:52:27,190 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 06:52:27,190 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 06:52:27,193 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 06:52:27,194 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:52:27" (1/1) ... [2018-12-02 06:52:27,196 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3db95926 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:52:27, skipping insertion in model container [2018-12-02 06:52:27,196 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:52:27" (1/1) ... [2018-12-02 06:52:27,201 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 06:52:27,245 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 06:52:27,548 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 06:52:27,556 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 06:52:27,636 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 06:52:27,679 INFO L195 MainTranslator]: Completed translation [2018-12-02 06:52:27,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:52:27 WrapperNode [2018-12-02 06:52:27,679 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 06:52:27,680 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 06:52:27,680 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 06:52:27,680 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 06:52:27,688 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:52:27" (1/1) ... [2018-12-02 06:52:27,706 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:52:27" (1/1) ... [2018-12-02 06:52:28,076 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 06:52:28,077 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 06:52:28,077 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 06:52:28,077 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 06:52:28,083 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:52:27" (1/1) ... [2018-12-02 06:52:28,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:52:27" (1/1) ... [2018-12-02 06:52:28,140 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:52:27" (1/1) ... [2018-12-02 06:52:28,140 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:52:27" (1/1) ... [2018-12-02 06:52:28,318 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:52:27" (1/1) ... [2018-12-02 06:52:28,411 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:52:27" (1/1) ... [2018-12-02 06:52:28,457 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:52:27" (1/1) ... [2018-12-02 06:52:28,528 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 06:52:28,528 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 06:52:28,528 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 06:52:28,528 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 06:52:28,529 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:52:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_037b0559-7f90-4eca-a014-cbf58035f9d5/bin-2019/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 [2018-12-02 06:52:28,561 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 06:52:28,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-02 06:52:28,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 06:52:28,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 06:52:43,417 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 06:52:43,418 INFO L280 CfgBuilder]: Removed 4063 assue(true) statements. [2018-12-02 06:52:43,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:52:43 BoogieIcfgContainer [2018-12-02 06:52:43,418 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 06:52:43,419 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 06:52:43,419 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 06:52:43,421 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 06:52:43,422 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 06:52:43,422 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 06:52:27" (1/3) ... [2018-12-02 06:52:43,422 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1f27dc11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 06:52:43, skipping insertion in model container [2018-12-02 06:52:43,422 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 06:52:43,423 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:52:27" (2/3) ... [2018-12-02 06:52:43,423 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1f27dc11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 06:52:43, skipping insertion in model container [2018-12-02 06:52:43,423 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 06:52:43,423 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:52:43" (3/3) ... [2018-12-02 06:52:43,424 INFO L375 chiAutomizerObserver]: Analyzing ICFG elevator_spec14_product32_false-unreach-call_true-termination.cil.c [2018-12-02 06:52:43,456 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 06:52:43,456 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 06:52:43,456 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 06:52:43,456 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 06:52:43,456 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 06:52:43,456 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 06:52:43,457 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 06:52:43,457 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 06:52:43,457 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 06:52:43,562 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17482 states. [2018-12-02 06:52:43,703 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3514 [2018-12-02 06:52:43,703 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 06:52:43,703 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 06:52:43,716 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2018-12-02 06:52:43,716 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:52:43,716 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 06:52:43,716 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17482 states. [2018-12-02 06:52:43,791 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3514 [2018-12-02 06:52:43,791 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 06:52:43,791 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 06:52:43,795 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2018-12-02 06:52:43,795 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:52:43,800 INFO L794 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.alloc(30);call #t~string33.base, #t~string33.offset := #Ultimate.alloc(9);call #t~string34.base, #t~string34.offset := #Ultimate.alloc(21);call #t~string35.base, #t~string35.offset := #Ultimate.alloc(30);call #t~string36.base, #t~string36.offset := #Ultimate.alloc(9);call #t~string37.base, #t~string37.offset := #Ultimate.alloc(21);call #t~string41.base, #t~string41.offset := #Ultimate.alloc(30);call #t~string42.base, #t~string42.offset := #Ultimate.alloc(9);call #t~string43.base, #t~string43.offset := #Ultimate.alloc(25);call #t~string44.base, #t~string44.offset := #Ultimate.alloc(30);call #t~string45.base, #t~string45.offset := #Ultimate.alloc(9);call #t~string46.base, #t~string46.offset := #Ultimate.alloc(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.alloc(10);call #t~string119.base, #t~string119.offset := #Ultimate.alloc(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.alloc(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.alloc(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.alloc(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.alloc(10);call #t~string129.base, #t~string129.offset := #Ultimate.alloc(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.alloc(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.alloc(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.alloc(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.alloc(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.alloc(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.alloc(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.alloc(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.alloc(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.alloc(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.alloc(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.alloc(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.alloc(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.alloc(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.alloc(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.alloc(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 [2018-12-02 06:52:43,801 INFO L796 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 [2018-12-02 06:52:43,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:52:43,806 INFO L82 PathProgramCache]: Analyzing trace with hash 359400175, now seen corresponding path program 1 times [2018-12-02 06:52:43,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:52:43,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:52:43,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:52:43,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:52:43,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:52:43,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:52:43,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:52:43,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:52:43,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:52:43,990 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 06:52:43,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:52:43,991 INFO L82 PathProgramCache]: Analyzing trace with hash 710955789, now seen corresponding path program 1 times [2018-12-02 06:52:43,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:52:43,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:52:43,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:52:43,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:52:43,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:52:43,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:52:44,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:52:44,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:52:44,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 06:52:44,047 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 06:52:44,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 06:52:44,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-02 06:52:44,062 INFO L87 Difference]: Start difference. First operand 17482 states. Second operand 8 states. [2018-12-02 06:53:10,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:53:10,156 INFO L93 Difference]: Finished difference Result 234390 states and 440916 transitions. [2018-12-02 06:53:10,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-02 06:53:10,158 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 234390 states and 440916 transitions. [2018-12-02 06:53:10,845 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80930 [2018-12-02 06:53:11,489 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 234390 states to 234290 states and 440789 transitions. [2018-12-02 06:53:11,490 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 234290 [2018-12-02 06:53:11,623 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 234290 [2018-12-02 06:53:11,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 234290 states and 440789 transitions. [2018-12-02 06:53:11,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 06:53:11,753 INFO L705 BuchiCegarLoop]: Abstraction has 234290 states and 440789 transitions. [2018-12-02 06:53:11,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234290 states and 440789 transitions. [2018-12-02 06:53:12,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234290 to 34911. [2018-12-02 06:53:12,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34911 states. [2018-12-02 06:53:12,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34911 states to 34911 states and 65830 transitions. [2018-12-02 06:53:12,676 INFO L728 BuchiCegarLoop]: Abstraction has 34911 states and 65830 transitions. [2018-12-02 06:53:12,677 INFO L608 BuchiCegarLoop]: Abstraction has 34911 states and 65830 transitions. [2018-12-02 06:53:12,677 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 06:53:12,677 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34911 states and 65830 transitions. [2018-12-02 06:53:12,735 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7033 [2018-12-02 06:53:12,736 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 06:53:12,736 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 06:53:13,562 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2018-12-02 06:53:13,562 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:53:13,562 INFO L794 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.alloc(30);call #t~string33.base, #t~string33.offset := #Ultimate.alloc(9);call #t~string34.base, #t~string34.offset := #Ultimate.alloc(21);call #t~string35.base, #t~string35.offset := #Ultimate.alloc(30);call #t~string36.base, #t~string36.offset := #Ultimate.alloc(9);call #t~string37.base, #t~string37.offset := #Ultimate.alloc(21);call #t~string41.base, #t~string41.offset := #Ultimate.alloc(30);call #t~string42.base, #t~string42.offset := #Ultimate.alloc(9);call #t~string43.base, #t~string43.offset := #Ultimate.alloc(25);call #t~string44.base, #t~string44.offset := #Ultimate.alloc(30);call #t~string45.base, #t~string45.offset := #Ultimate.alloc(9);call #t~string46.base, #t~string46.offset := #Ultimate.alloc(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.alloc(10);call #t~string119.base, #t~string119.offset := #Ultimate.alloc(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.alloc(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.alloc(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.alloc(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.alloc(10);call #t~string129.base, #t~string129.offset := #Ultimate.alloc(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.alloc(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.alloc(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.alloc(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.alloc(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.alloc(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.alloc(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.alloc(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.alloc(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.alloc(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.alloc(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.alloc(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.alloc(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.alloc(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.alloc(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.alloc(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 [2018-12-02 06:53:13,563 INFO L796 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 [2018-12-02 06:53:13,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:53:13,566 INFO L82 PathProgramCache]: Analyzing trace with hash -765194178, now seen corresponding path program 1 times [2018-12-02 06:53:13,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:53:13,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:53:13,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:53:13,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:53:13,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:53:13,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:53:13,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:53:13,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:53:13,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 06:53:13,620 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 06:53:13,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:53:13,620 INFO L82 PathProgramCache]: Analyzing trace with hash 604504277, now seen corresponding path program 1 times [2018-12-02 06:53:13,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:53:13,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:53:13,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:53:13,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:53:13,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:53:13,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:53:13,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:53:13,780 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2018-12-02 06:53:13,931 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2018-12-02 06:53:13,937 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 06:53:13,938 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 06:53:13,938 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 06:53:13,938 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 06:53:13,938 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 06:53:13,938 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 06:53:13,938 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 06:53:13,938 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 06:53:13,938 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec14_product32_false-unreach-call_true-termination.cil.c_Iteration2_Loop [2018-12-02 06:53:13,938 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 06:53:13,938 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 06:53:13,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:53:13,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:53:13,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:53:13,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:53:13,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:53:13,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:53:13,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:53:13,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:53:13,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:53:13,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:53:13,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:53:13,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:53:13,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:53:13,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:53:13,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:53:13,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:53:13,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:53:13,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:53:13,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:53:13,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:53:13,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:53:13,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:53:14,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:53:14,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:53:14,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:53:14,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:53:14,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:53:14,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:53:14,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:53:14,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:53:14,186 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 06:53:14,187 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_037b0559-7f90-4eca-a014-cbf58035f9d5/bin-2019/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 [2018-12-02 06:53:14,190 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 06:53:14,190 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 06:53:14,195 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 06:53:14,195 INFO L448 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/working_dir_037b0559-7f90-4eca-a014-cbf58035f9d5/bin-2019/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 [2018-12-02 06:53:14,211 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 06:53:14,211 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 06:53:14,214 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 06:53:14,214 INFO L448 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/working_dir_037b0559-7f90-4eca-a014-cbf58035f9d5/bin-2019/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 [2018-12-02 06:53:14,230 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 06:53:14,230 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 06:53:14,232 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 06:53:14,232 INFO L448 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/working_dir_037b0559-7f90-4eca-a014-cbf58035f9d5/bin-2019/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 [2018-12-02 06:53:14,248 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 06:53:14,248 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 06:53:14,250 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 06:53:14,250 INFO L448 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/working_dir_037b0559-7f90-4eca-a014-cbf58035f9d5/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 06:53:14,265 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 06:53:14,265 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 06:53:14,280 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 06:53:14,280 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~weight~0=1, ~maximumWeight~0=0} Honda state: {~weight~0=1, ~maximumWeight~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_037b0559-7f90-4eca-a014-cbf58035f9d5/bin-2019/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 [2018-12-02 06:53:14,283 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 06:53:14,283 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 06:53:14,286 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 06:53:14,286 INFO L448 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/working_dir_037b0559-7f90-4eca-a014-cbf58035f9d5/bin-2019/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 [2018-12-02 06:53:14,301 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 06:53:14,302 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_037b0559-7f90-4eca-a014-cbf58035f9d5/bin-2019/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 [2018-12-02 06:53:14,319 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 06:53:14,319 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 06:53:14,787 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-02 06:53:14,789 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 06:53:14,790 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 06:53:14,790 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 06:53:14,790 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 06:53:14,790 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 06:53:14,790 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 06:53:14,790 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 06:53:14,790 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 06:53:14,790 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec14_product32_false-unreach-call_true-termination.cil.c_Iteration2_Loop [2018-12-02 06:53:14,790 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 06:53:14,790 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 06:53:14,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:53:14,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:53:14,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:53:14,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:53:14,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:53:14,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:53:14,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:53:14,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:53:14,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:53:14,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:53:14,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:53:14,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:53:14,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:53:14,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:53:14,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:53:14,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:53:14,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:53:14,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:53:14,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:53:14,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:53:14,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:53:14,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:53:14,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:53:14,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:53:14,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:53:14,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:53:14,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:53:14,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:53:14,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:53:14,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:53:15,036 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 06:53:15,039 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 06:53:15,040 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:53:15,041 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:53:15,042 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 06:53:15,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:53:15,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:53:15,042 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:53:15,044 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 06:53:15,044 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 06:53:15,047 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:53:15,047 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:53:15,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:53:15,048 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 06:53:15,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:53:15,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:53:15,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:53:15,048 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 06:53:15,048 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 06:53:15,049 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:53:15,049 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:53:15,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:53:15,050 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 06:53:15,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:53:15,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:53:15,050 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:53:15,050 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 06:53:15,051 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 06:53:15,051 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:53:15,051 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:53:15,052 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:53:15,052 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 06:53:15,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:53:15,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:53:15,052 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:53:15,052 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 06:53:15,053 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 06:53:15,053 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:53:15,053 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:53:15,054 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:53:15,054 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 06:53:15,054 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:53:15,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:53:15,054 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:53:15,054 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 06:53:15,054 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 06:53:15,055 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:53:15,055 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:53:15,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:53:15,056 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 06:53:15,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:53:15,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:53:15,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:53:15,056 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 06:53:15,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 06:53:15,057 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:53:15,058 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:53:15,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:53:15,058 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 06:53:15,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:53:15,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:53:15,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:53:15,059 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 06:53:15,059 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 06:53:15,063 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 06:53:15,067 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-02 06:53:15,067 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 06:53:15,069 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 06:53:15,069 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 06:53:15,069 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 06:53:15,069 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~cleanupTimeShifts~0, ULTIMATE.start_cleanup_~i~0) = 1*~cleanupTimeShifts~0 - 1*ULTIMATE.start_cleanup_~i~0 Supporting invariants [] [2018-12-02 06:53:15,070 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-02 06:53:15,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:53:15,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:53:15,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:53:15,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:53:15,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:53:15,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:53:15,220 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-02 06:53:15,220 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34911 states and 65830 transitions. cyclomatic complexity: 30920 Second operand 5 states. [2018-12-02 06:53:15,828 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. [2018-12-02 06:53:15,828 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 [2018-12-02 06:53:15,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-02 06:53:15,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32955 transitions. [2018-12-02 06:53:15,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32955 transitions. Stem has 58 letters. Loop has 22 letters. [2018-12-02 06:53:15,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 06:53:15,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32955 transitions. Stem has 80 letters. Loop has 22 letters. [2018-12-02 06:53:15,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 06:53:15,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32955 transitions. Stem has 58 letters. Loop has 44 letters. [2018-12-02 06:53:15,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 06:53:15,852 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41944 states and 79078 transitions. [2018-12-02 06:53:15,958 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 06:53:15,958 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41944 states to 0 states and 0 transitions. [2018-12-02 06:53:15,958 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-02 06:53:15,958 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-02 06:53:15,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-02 06:53:15,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 06:53:15,959 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 06:53:15,959 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 06:53:15,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 06:53:15,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 06:53:15,959 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2018-12-02 06:53:15,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:53:15,959 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-12-02 06:53:15,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 06:53:15,959 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-12-02 06:53:15,959 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 06:53:15,959 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 06:53:15,959 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-02 06:53:15,959 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-02 06:53:15,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-02 06:53:15,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 06:53:15,960 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 06:53:15,960 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 06:53:15,960 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 06:53:15,960 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 06:53:15,960 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-02 06:53:15,960 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 06:53:15,960 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-02 06:53:15,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.12 06:53:15 BoogieIcfgContainer [2018-12-02 06:53:15,964 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-02 06:53:15,965 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 06:53:15,965 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 06:53:15,965 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 06:53:15,965 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:52:43" (3/4) ... [2018-12-02 06:53:15,967 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 06:53:15,967 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 06:53:15,968 INFO L168 Benchmark]: Toolchain (without parser) took 48778.78 ms. Allocated memory was 1.0 GB in the beginning and 4.4 GB in the end (delta: 3.4 GB). Free memory was 951.7 MB in the beginning and 2.6 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2018-12-02 06:53:15,968 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 06:53:15,969 INFO L168 Benchmark]: CACSL2BoogieTranslator took 489.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -127.5 MB). Peak memory consumption was 42.0 MB. Max. memory is 11.5 GB. [2018-12-02 06:53:15,969 INFO L168 Benchmark]: Boogie Procedure Inliner took 396.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 857.8 MB in the end (delta: 221.4 MB). Peak memory consumption was 221.4 MB. Max. memory is 11.5 GB. [2018-12-02 06:53:15,970 INFO L168 Benchmark]: Boogie Preprocessor took 451.25 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 196.1 MB). Free memory was 857.8 MB in the beginning and 1.1 GB in the end (delta: -275.5 MB). Peak memory consumption was 151.2 MB. Max. memory is 11.5 GB. [2018-12-02 06:53:15,970 INFO L168 Benchmark]: RCFGBuilder took 14890.29 ms. Allocated memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: 858.8 MB). Free memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: -621.9 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2018-12-02 06:53:15,970 INFO L168 Benchmark]: BuchiAutomizer took 32545.66 ms. Allocated memory was 2.2 GB in the beginning and 4.4 GB in the end (delta: 2.2 GB). Free memory was 1.8 GB in the beginning and 2.6 GB in the end (delta: -809.0 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2018-12-02 06:53:15,971 INFO L168 Benchmark]: Witness Printer took 2.59 ms. Allocated memory is still 4.4 GB. Free memory is still 2.6 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 06:53:15,974 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 489.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -127.5 MB). Peak memory consumption was 42.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 396.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 857.8 MB in the end (delta: 221.4 MB). Peak memory consumption was 221.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 451.25 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 196.1 MB). Free memory was 857.8 MB in the beginning and 1.1 GB in the end (delta: -275.5 MB). Peak memory consumption was 151.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 14890.29 ms. Allocated memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: 858.8 MB). Free memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: -621.9 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * BuchiAutomizer took 32545.66 ms. Allocated memory was 2.2 GB in the beginning and 4.4 GB in the end (delta: 2.2 GB). Free memory was 1.8 GB in the beginning and 2.6 GB in the end (delta: -809.0 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Witness Printer took 2.59 ms. Allocated memory is still 4.4 GB. Free memory is still 2.6 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 32.5s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.7s. Construction of modules took 17.0s. Büchi inclusion checks took 9.8s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.9s AutomataMinimizationTime, 1 MinimizatonAttempts, 199379 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 1.4s Buchi closure took 0.1s. 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, 17.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: 6ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...