./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/elevator_spec9_product27_true-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/product-lines/elevator_spec9_product27_true-unreach-call_true-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fb9c828c93a89ad7d5e84962eb47c2963862e6b6 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 04:06:04,802 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:06:04,804 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:06:04,816 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:06:04,816 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:06:04,817 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:06:04,819 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:06:04,821 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:06:04,823 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:06:04,825 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:06:04,826 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:06:04,826 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:06:04,828 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:06:04,831 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:06:04,835 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:06:04,838 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:06:04,839 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:06:04,843 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:06:04,850 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:06:04,851 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:06:04,853 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:06:04,854 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:06:04,857 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:06:04,857 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:06:04,857 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:06:04,858 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:06:04,860 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:06:04,860 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:06:04,861 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:06:04,863 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:06:04,863 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:06:04,864 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:06:04,864 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:06:04,864 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:06:04,865 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:06:04,866 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:06:04,866 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 04:06:04,884 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:06:04,884 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:06:04,885 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:06:04,885 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:06:04,886 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:06:04,886 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:06:04,887 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:06:04,887 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:06:04,887 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:06:04,887 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:06:04,887 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:06:04,887 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:06:04,888 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:06:04,888 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:06:04,888 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:06:04,888 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:06:04,888 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:06:04,888 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:06:04,889 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:06:04,890 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:06:04,890 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:06:04,890 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:06:04,891 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:06:04,891 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:06:04,891 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:06:04,891 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:06:04,891 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:06:04,892 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:06:04,894 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:06:04,894 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:06:04,894 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:06:04,895 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:06:04,895 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fb9c828c93a89ad7d5e84962eb47c2963862e6b6 [2019-01-14 04:06:04,937 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:06:04,953 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:06:04,961 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:06:04,962 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:06:04,963 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:06:04,964 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/elevator_spec9_product27_true-unreach-call_true-termination.cil.c [2019-01-14 04:06:05,027 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac98962de/4d7f48f7003f428db44f52e4916b89bb/FLAG356fc8ac8 [2019-01-14 04:06:05,640 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:06:05,642 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/elevator_spec9_product27_true-unreach-call_true-termination.cil.c [2019-01-14 04:06:05,668 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac98962de/4d7f48f7003f428db44f52e4916b89bb/FLAG356fc8ac8 [2019-01-14 04:06:05,825 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac98962de/4d7f48f7003f428db44f52e4916b89bb [2019-01-14 04:06:05,832 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:06:05,833 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:06:05,835 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:06:05,835 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:06:05,842 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:06:05,843 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:06:05" (1/1) ... [2019-01-14 04:06:05,847 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21e13714 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:06:05, skipping insertion in model container [2019-01-14 04:06:05,847 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:06:05" (1/1) ... [2019-01-14 04:06:05,857 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:06:05,963 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:06:06,685 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:06:06,719 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:06:07,004 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:06:07,075 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:06:07,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:06:07 WrapperNode [2019-01-14 04:06:07,076 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:06:07,077 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:06:07,077 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:06:07,077 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:06:07,086 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:06:07" (1/1) ... [2019-01-14 04:06:07,120 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:06:07" (1/1) ... [2019-01-14 04:06:07,312 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:06:07,312 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:06:07,312 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:06:07,312 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:06:07,323 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:06:07" (1/1) ... [2019-01-14 04:06:07,323 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:06:07" (1/1) ... [2019-01-14 04:06:07,341 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:06:07" (1/1) ... [2019-01-14 04:06:07,341 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:06:07" (1/1) ... [2019-01-14 04:06:07,418 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:06:07" (1/1) ... [2019-01-14 04:06:07,478 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:06:07" (1/1) ... [2019-01-14 04:06:07,495 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:06:07" (1/1) ... [2019-01-14 04:06:07,521 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:06:07,521 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:06:07,522 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:06:07,522 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:06:07,523 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:06:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:06:07,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 04:06:07,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-14 04:06:07,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:06:07,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:06:18,554 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:06:18,555 INFO L286 CfgBuilder]: Removed 649 assue(true) statements. [2019-01-14 04:06:18,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:06:18 BoogieIcfgContainer [2019-01-14 04:06:18,557 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:06:18,558 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:06:18,558 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:06:18,562 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:06:18,563 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:06:18,563 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:06:05" (1/3) ... [2019-01-14 04:06:18,564 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2748e0ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:06:18, skipping insertion in model container [2019-01-14 04:06:18,565 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:06:18,565 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:06:07" (2/3) ... [2019-01-14 04:06:18,566 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2748e0ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:06:18, skipping insertion in model container [2019-01-14 04:06:18,566 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:06:18,566 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:06:18" (3/3) ... [2019-01-14 04:06:18,568 INFO L375 chiAutomizerObserver]: Analyzing ICFG elevator_spec9_product27_true-unreach-call_true-termination.cil.c [2019-01-14 04:06:18,623 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:06:18,624 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:06:18,624 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:06:18,624 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:06:18,624 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:06:18,625 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:06:18,625 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:06:18,625 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:06:18,626 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:06:18,688 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2599 states. [2019-01-14 04:06:18,819 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1289 [2019-01-14 04:06:18,820 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:06:18,820 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:06:18,845 INFO L867 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] [2019-01-14 04:06:18,845 INFO L868 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:06:18,845 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:06:18,845 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2599 states. [2019-01-14 04:06:18,881 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1289 [2019-01-14 04:06:18,881 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:06:18,881 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:06:18,885 INFO L867 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] [2019-01-14 04:06:18,886 INFO L868 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:06:18,894 INFO L794 eck$LassoCheckResult]: Stem: 357#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(30);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(9);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(21);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(30);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(9);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(21);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(30);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(9);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(25);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(25);~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~cleanupTimeShifts~0 := 12;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0;call #t~string108.base, #t~string108.offset := #Ultimate.allocOnStack(10);call #t~string110.base, #t~string110.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string110.base, #t~string110.offset, 1);call write~init~int(95, #t~string110.base, 1 + #t~string110.offset, 1);call write~init~int(93, #t~string110.base, 2 + #t~string110.offset, 1);call write~init~int(0, #t~string110.base, 3 + #t~string110.offset, 1);call #t~string112.base, #t~string112.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string112.base, #t~string112.offset, 1);call write~init~int(93, #t~string112.base, 1 + #t~string112.offset, 1);call write~init~int(32, #t~string112.base, 2 + #t~string112.offset, 1);call write~init~int(0, #t~string112.base, 3 + #t~string112.offset, 1);call #t~string114.base, #t~string114.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string114.base, #t~string114.offset, 1);call write~init~int(97, #t~string114.base, 1 + #t~string114.offset, 1);call write~init~int(116, #t~string114.base, 2 + #t~string114.offset, 1);call write~init~int(32, #t~string114.base, 3 + #t~string114.offset, 1);call write~init~int(0, #t~string114.base, 4 + #t~string114.offset, 1);call #t~string116.base, #t~string116.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string116.base, #t~string116.offset, 1);call write~init~int(105, #t~string116.base, 1 + #t~string116.offset, 1);call write~init~int(0, #t~string116.base, 2 + #t~string116.offset, 1);call #t~string118.base, #t~string118.offset := #Ultimate.allocOnStack(10);call #t~string120.base, #t~string120.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string120.base, #t~string120.offset, 1);call write~init~int(112, #t~string120.base, 1 + #t~string120.offset, 1);call write~init~int(0, #t~string120.base, 2 + #t~string120.offset, 1);call #t~string122.base, #t~string122.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string122.base, #t~string122.offset, 1);call write~init~int(111, #t~string122.base, 1 + #t~string122.offset, 1);call write~init~int(119, #t~string122.base, 2 + #t~string122.offset, 1);call write~init~int(110, #t~string122.base, 3 + #t~string122.offset, 1);call write~init~int(0, #t~string122.base, 4 + #t~string122.offset, 1);call #t~string124.base, #t~string124.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string124.base, #t~string124.offset, 1);call write~init~int(73, #t~string124.base, 1 + #t~string124.offset, 1);call write~init~int(76, #t~string124.base, 2 + #t~string124.offset, 1);call write~init~int(95, #t~string124.base, 3 + #t~string124.offset, 1);call write~init~int(112, #t~string124.base, 4 + #t~string124.offset, 1);call write~init~int(58, #t~string124.base, 5 + #t~string124.offset, 1);call write~init~int(0, #t~string124.base, 6 + #t~string124.offset, 1);call #t~string126.base, #t~string126.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string126.base, #t~string126.offset, 1);call write~init~int(37, #t~string126.base, 1 + #t~string126.offset, 1);call write~init~int(105, #t~string126.base, 2 + #t~string126.offset, 1);call write~init~int(0, #t~string126.base, 3 + #t~string126.offset, 1);call #t~string128.base, #t~string128.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string128.base, #t~string128.offset, 1);call write~init~int(37, #t~string128.base, 1 + #t~string128.offset, 1);call write~init~int(105, #t~string128.base, 2 + #t~string128.offset, 1);call write~init~int(0, #t~string128.base, 3 + #t~string128.offset, 1);call #t~string130.base, #t~string130.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string130.base, #t~string130.offset, 1);call write~init~int(37, #t~string130.base, 1 + #t~string130.offset, 1);call write~init~int(105, #t~string130.base, 2 + #t~string130.offset, 1);call write~init~int(0, #t~string130.base, 3 + #t~string130.offset, 1);call #t~string132.base, #t~string132.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string132.base, #t~string132.offset, 1);call write~init~int(37, #t~string132.base, 1 + #t~string132.offset, 1);call write~init~int(105, #t~string132.base, 2 + #t~string132.offset, 1);call write~init~int(0, #t~string132.base, 3 + #t~string132.offset, 1);call #t~string134.base, #t~string134.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string134.base, #t~string134.offset, 1);call write~init~int(37, #t~string134.base, 1 + #t~string134.offset, 1);call write~init~int(105, #t~string134.base, 2 + #t~string134.offset, 1);call write~init~int(0, #t~string134.base, 3 + #t~string134.offset, 1);call #t~string136.base, #t~string136.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string136.base, #t~string136.offset, 1);call write~init~int(70, #t~string136.base, 1 + #t~string136.offset, 1);call write~init~int(95, #t~string136.base, 2 + #t~string136.offset, 1);call write~init~int(112, #t~string136.base, 3 + #t~string136.offset, 1);call write~init~int(58, #t~string136.base, 4 + #t~string136.offset, 1);call write~init~int(0, #t~string136.base, 5 + #t~string136.offset, 1);call #t~string139.base, #t~string139.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string139.base, #t~string139.offset, 1);call write~init~int(37, #t~string139.base, 1 + #t~string139.offset, 1);call write~init~int(105, #t~string139.base, 2 + #t~string139.offset, 1);call write~init~int(0, #t~string139.base, 3 + #t~string139.offset, 1);call #t~string142.base, #t~string142.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string142.base, #t~string142.offset, 1);call write~init~int(37, #t~string142.base, 1 + #t~string142.offset, 1);call write~init~int(105, #t~string142.base, 2 + #t~string142.offset, 1);call write~init~int(0, #t~string142.base, 3 + #t~string142.offset, 1);call #t~string145.base, #t~string145.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string145.base, #t~string145.offset, 1);call write~init~int(37, #t~string145.base, 1 + #t~string145.offset, 1);call write~init~int(105, #t~string145.base, 2 + #t~string145.offset, 1);call write~init~int(0, #t~string145.base, 3 + #t~string145.offset, 1);call #t~string148.base, #t~string148.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string148.base, #t~string148.offset, 1);call write~init~int(37, #t~string148.base, 1 + #t~string148.offset, 1);call write~init~int(105, #t~string148.base, 2 + #t~string148.offset, 1);call write~init~int(0, #t~string148.base, 3 + #t~string148.offset, 1);call #t~string151.base, #t~string151.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string151.base, #t~string151.offset, 1);call write~init~int(37, #t~string151.base, 1 + #t~string151.offset, 1);call write~init~int(105, #t~string151.base, 2 + #t~string151.offset, 1);call write~init~int(0, #t~string151.base, 3 + #t~string151.offset, 1);call #t~string153.base, #t~string153.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string153.base, #t~string153.offset, 1);call write~init~int(0, #t~string153.base, 1 + #t~string153.offset, 1);~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 1434#L-1true havoc main_#res;havoc main_#t~ret54, main_~retValue_acc~4, main_~tmp~13;havoc main_~retValue_acc~4;havoc main_~tmp~13; 83#L3286true havoc valid_product_#res;havoc valid_product_~retValue_acc~26;havoc valid_product_~retValue_acc~26;valid_product_~retValue_acc~26 := 1;valid_product_#res := valid_product_~retValue_acc~26; 814#L3294true main_#t~ret54 := valid_product_#res;main_~tmp~13 := main_#t~ret54;havoc main_#t~ret54; 2176#L850true assume 0 != main_~tmp~13; 7#L819true ~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 755#L3119true havoc bigMacCall_#t~ret47, bigMacCall_~tmp~10;havoc bigMacCall_~tmp~10;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~28;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~28; 585#L3342true assume 0 == getOrigin_~person;getOrigin_~retValue_acc~28 := 4;getOrigin_#res := getOrigin_~retValue_acc~28; 300#L3367true bigMacCall_#t~ret47 := getOrigin_#res;bigMacCall_~tmp~10 := bigMacCall_#t~ret47;havoc bigMacCall_#t~ret47;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~10;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 1249#L2776true assume 0 == initPersonOnFloor_~floor; 1380#L2777true assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 394#L2884-1true callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 2148#L2568true assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 25#L2580-2true havoc cleanup_#t~ret48, cleanup_#t~ret49, cleanup_~i~2, cleanup_~tmp~11, cleanup_~tmp___0~2, cleanup_~__cil_tmp4~2;havoc cleanup_~i~2;havoc cleanup_~tmp~11;havoc cleanup_~tmp___0~2;havoc cleanup_~__cil_tmp4~2;havoc timeShift_#t~ret97, timeShift_#t~ret98, timeShift_#t~ret99, timeShift_#t~ret100, timeShift_#t~ret101, timeShift_#t~ret102, timeShift_#t~ret103, timeShift_#t~ret104, timeShift_#t~ret105, timeShift_#t~ret106, timeShift_#t~ret107, timeShift_~tmp~25, timeShift_~tmp___0~10, timeShift_~tmp___1~6, timeShift_~tmp___2~4, timeShift_~tmp___3~3, timeShift_~tmp___4~2, timeShift_~tmp___5~2, timeShift_~tmp___6~2, timeShift_~tmp___7~2, timeShift_~tmp___8~2, timeShift_~tmp___9~2;havoc timeShift_~tmp~25;havoc timeShift_~tmp___0~10;havoc timeShift_~tmp___1~6;havoc timeShift_~tmp___2~4;havoc timeShift_~tmp___3~3;havoc timeShift_~tmp___4~2;havoc timeShift_~tmp___5~2;havoc timeShift_~tmp___6~2;havoc timeShift_~tmp___7~2;havoc timeShift_~tmp___8~2;havoc timeShift_~tmp___9~2;havoc stopRequestedAtCurrentFloor_#res;havoc stopRequestedAtCurrentFloor_#t~ret81, stopRequestedAtCurrentFloor_#t~ret82, stopRequestedAtCurrentFloor_#t~ret83, stopRequestedAtCurrentFloor_#t~ret84, stopRequestedAtCurrentFloor_~retValue_acc~17, stopRequestedAtCurrentFloor_~tmp~23, stopRequestedAtCurrentFloor_~tmp___0~8;havoc stopRequestedAtCurrentFloor_~retValue_acc~17;havoc stopRequestedAtCurrentFloor_~tmp~23;havoc stopRequestedAtCurrentFloor_~tmp___0~8;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 594#L2505true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 370#L2532true isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 867#L2409true stopRequestedAtCurrentFloor_#t~ret81 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~23 := stopRequestedAtCurrentFloor_#t~ret81;havoc stopRequestedAtCurrentFloor_#t~ret81; 854#L1793true assume 0 != stopRequestedAtCurrentFloor_~tmp~23;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 116#L1124true stopRequestedAtCurrentFloor_#t~ret82 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~8 := stopRequestedAtCurrentFloor_#t~ret82;havoc stopRequestedAtCurrentFloor_#t~ret82; 806#L1797true assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~8);stopRequestedAtCurrentFloor_~retValue_acc~17 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~17; 1079#L1810true timeShift_#t~ret97 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret97;havoc timeShift_#t~ret97; 2537#L1946true assume !(0 != timeShift_~tmp___9~2); 2292#L2037true assume !(1 == ~doorState~0); 2263#L2037-2true stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret75, stopRequestedInDirection_#t~ret76, stopRequestedInDirection_#t~ret77, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~14, stopRequestedInDirection_~tmp~20, stopRequestedInDirection_~tmp___0~6, stopRequestedInDirection_~__cil_tmp7~5, stopRequestedInDirection_~__cil_tmp8~5;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~14;havoc stopRequestedInDirection_~tmp~20;havoc stopRequestedInDirection_~tmp___0~6;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 599#L2505-3true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 376#L2532-3true isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 872#L2409-1true stopRequestedInDirection_#t~ret75 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~6 := stopRequestedInDirection_#t~ret75;havoc stopRequestedInDirection_#t~ret75; 1384#L1676true assume 0 != stopRequestedInDirection_~tmp___0~6;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 117#L1124-1true stopRequestedInDirection_#t~ret76 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~20 := stopRequestedInDirection_#t~ret76;havoc stopRequestedInDirection_#t~ret76;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~20 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~14 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~14; 1890#L1689true timeShift_#t~ret104 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret104;havoc timeShift_#t~ret104; 482#L2045true assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret78, continueInDirection_~dir, continueInDirection_~tmp~21;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~21;~currentHeading~0 := continueInDirection_~dir; 1910#L1733true assume !(1 == ~currentHeading~0); 51#L1743true assume !(0 == ~currentFloorID~0); 36#L1743-2true assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 849#L1749-5true havoc __utac_acc__Specification9_spec__3_#t~ret156, __utac_acc__Specification9_spec__3_#t~ret157, __utac_acc__Specification9_spec__3_#t~ret158, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~27, __utac_acc__Specification9_spec__3_~tmp___0~12, __utac_acc__Specification9_spec__3_~tmp___1~8;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~27;havoc __utac_acc__Specification9_spec__3_~tmp___0~12;havoc __utac_acc__Specification9_spec__3_~tmp___1~8;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 123#L1124-3true __utac_acc__Specification9_spec__3_#t~ret156 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~27 := __utac_acc__Specification9_spec__3_#t~ret156;havoc __utac_acc__Specification9_spec__3_#t~ret156;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~27;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~10;havoc isEmpty_~retValue_acc~10; 1799#L1184-6true assume 1 == ~persons_0~0;isEmpty_~retValue_acc~10 := 0;isEmpty_#res := isEmpty_~retValue_acc~10; 79#L1216-6true __utac_acc__Specification9_spec__3_#t~ret157 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~8 := __utac_acc__Specification9_spec__3_#t~ret157;havoc __utac_acc__Specification9_spec__3_#t~ret157; 815#L3162true assume 0 != __utac_acc__Specification9_spec__3_~tmp___1~8;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 1261#L3172-1true cleanup_~i~2 := 0; 678#L651-2true [2019-01-14 04:06:18,902 INFO L796 eck$LassoCheckResult]: Loop: 678#L651-2true assume !false; 796#L652true cleanup_~__cil_tmp4~2 := ~cleanupTimeShifts~0 - 1; 632#L655true assume cleanup_~i~2 < cleanup_~__cil_tmp4~2;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~5;havoc isBlocked_~retValue_acc~5;isBlocked_~retValue_acc~5 := 0;isBlocked_#res := isBlocked_~retValue_acc~5; 400#L946true cleanup_#t~ret48 := isBlocked_#res;cleanup_~tmp___0~2 := cleanup_#t~ret48;havoc cleanup_#t~ret48; 1475#L659true assume 1 != cleanup_~tmp___0~2; 1480#L659-1true havoc isIdle_#res;havoc isIdle_#t~ret63, isIdle_~retValue_acc~12, isIdle_~tmp~18;havoc isIdle_~retValue_acc~12;havoc isIdle_~tmp~18;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret58, anyStopRequested_#t~ret59, anyStopRequested_#t~ret60, anyStopRequested_#t~ret61, anyStopRequested_#t~ret62, anyStopRequested_~retValue_acc~11, anyStopRequested_~tmp~17, anyStopRequested_~tmp___0~4, anyStopRequested_~tmp___1~3, anyStopRequested_~tmp___2~1, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~11;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~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 1772#L2505-25true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 319#L2532-25true anyStopRequested_#t~ret58 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret58;havoc anyStopRequested_#t~ret58; 1450#L1232true assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~11 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~11; 504#L1296true isIdle_#t~ret63 := anyStopRequested_#res;isIdle_~tmp~18 := isIdle_#t~ret63;havoc isIdle_#t~ret63;isIdle_~retValue_acc~12 := (if 0 == isIdle_~tmp~18 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~12; 824#L1309true cleanup_#t~ret49 := isIdle_#res;cleanup_~tmp~11 := cleanup_#t~ret49;havoc cleanup_#t~ret49; 2364#L671true assume !(0 != cleanup_~tmp~11);havoc timeShift_#t~ret97, timeShift_#t~ret98, timeShift_#t~ret99, timeShift_#t~ret100, timeShift_#t~ret101, timeShift_#t~ret102, timeShift_#t~ret103, timeShift_#t~ret104, timeShift_#t~ret105, timeShift_#t~ret106, timeShift_#t~ret107, timeShift_~tmp~25, timeShift_~tmp___0~10, timeShift_~tmp___1~6, timeShift_~tmp___2~4, timeShift_~tmp___3~3, timeShift_~tmp___4~2, timeShift_~tmp___5~2, timeShift_~tmp___6~2, timeShift_~tmp___7~2, timeShift_~tmp___8~2, timeShift_~tmp___9~2;havoc timeShift_~tmp~25;havoc timeShift_~tmp___0~10;havoc timeShift_~tmp___1~6;havoc timeShift_~tmp___2~4;havoc timeShift_~tmp___3~3;havoc timeShift_~tmp___4~2;havoc timeShift_~tmp___5~2;havoc timeShift_~tmp___6~2;havoc timeShift_~tmp___7~2;havoc timeShift_~tmp___8~2;havoc timeShift_~tmp___9~2;havoc stopRequestedAtCurrentFloor_#res;havoc stopRequestedAtCurrentFloor_#t~ret81, stopRequestedAtCurrentFloor_#t~ret82, stopRequestedAtCurrentFloor_#t~ret83, stopRequestedAtCurrentFloor_#t~ret84, stopRequestedAtCurrentFloor_~retValue_acc~17, stopRequestedAtCurrentFloor_~tmp~23, stopRequestedAtCurrentFloor_~tmp___0~8;havoc stopRequestedAtCurrentFloor_~retValue_acc~17;havoc stopRequestedAtCurrentFloor_~tmp~23;havoc stopRequestedAtCurrentFloor_~tmp___0~8;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 1756#L2505-30true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 157#L2532-30true isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 874#L2409-3true stopRequestedAtCurrentFloor_#t~ret81 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~23 := stopRequestedAtCurrentFloor_#t~ret81;havoc stopRequestedAtCurrentFloor_#t~ret81; 855#L1793-1true assume 0 != stopRequestedAtCurrentFloor_~tmp~23;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 127#L1124-4true stopRequestedAtCurrentFloor_#t~ret82 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~8 := stopRequestedAtCurrentFloor_#t~ret82;havoc stopRequestedAtCurrentFloor_#t~ret82; 793#L1797-1true assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~8);stopRequestedAtCurrentFloor_~retValue_acc~17 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~17; 1086#L1810-1true timeShift_#t~ret97 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret97;havoc timeShift_#t~ret97; 2511#L1946-1true assume !(0 != timeShift_~tmp___9~2); 2267#L2037-3true assume 1 == ~doorState~0;~doorState~0 := 0; 2277#L2037-5true stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret75, stopRequestedInDirection_#t~ret76, stopRequestedInDirection_#t~ret77, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~14, stopRequestedInDirection_~tmp~20, stopRequestedInDirection_~tmp___0~6, stopRequestedInDirection_~__cil_tmp7~5, stopRequestedInDirection_~__cil_tmp8~5;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~14;havoc stopRequestedInDirection_~tmp~20;havoc stopRequestedInDirection_~tmp___0~6;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 1744#L2505-33true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 138#L2532-33true isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 877#L2409-4true stopRequestedInDirection_#t~ret75 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~6 := stopRequestedInDirection_#t~ret75;havoc stopRequestedInDirection_#t~ret75; 1391#L1676-2true assume 0 != stopRequestedInDirection_~tmp___0~6;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 128#L1124-5true stopRequestedInDirection_#t~ret76 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~20 := stopRequestedInDirection_#t~ret76;havoc stopRequestedInDirection_#t~ret76;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~20 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~14 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~14; 1898#L1689-2true timeShift_#t~ret104 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret104;havoc timeShift_#t~ret104; 484#L2045-1true assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret78, continueInDirection_~dir, continueInDirection_~tmp~21;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~21;~currentHeading~0 := continueInDirection_~dir; 1895#L1733-3true assume !(1 == ~currentHeading~0); 29#L1743-9true assume !(0 == ~currentFloorID~0); 17#L1743-11true assume 1 == ~currentHeading~0;~currentFloorID~0 := 1 + ~currentFloorID~0; 842#L1749-11true havoc __utac_acc__Specification9_spec__3_#t~ret156, __utac_acc__Specification9_spec__3_#t~ret157, __utac_acc__Specification9_spec__3_#t~ret158, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~27, __utac_acc__Specification9_spec__3_~tmp___0~12, __utac_acc__Specification9_spec__3_~tmp___1~8;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~27;havoc __utac_acc__Specification9_spec__3_~tmp___0~12;havoc __utac_acc__Specification9_spec__3_~tmp___1~8;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 105#L1124-7true __utac_acc__Specification9_spec__3_#t~ret156 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~27 := __utac_acc__Specification9_spec__3_#t~ret156;havoc __utac_acc__Specification9_spec__3_#t~ret156;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~27;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~10;havoc isEmpty_~retValue_acc~10; 1765#L1184-13true assume 1 == ~persons_0~0;isEmpty_~retValue_acc~10 := 0;isEmpty_#res := isEmpty_~retValue_acc~10; 63#L1216-13true __utac_acc__Specification9_spec__3_#t~ret157 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~8 := __utac_acc__Specification9_spec__3_#t~ret157;havoc __utac_acc__Specification9_spec__3_#t~ret157; 807#L3162-2true assume 0 != __utac_acc__Specification9_spec__3_~tmp___1~8;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 1265#L3172-3true cleanup_~i~2 := 1 + cleanup_~i~2; 678#L651-2true [2019-01-14 04:06:18,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:06:18,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1322374021, now seen corresponding path program 1 times [2019-01-14 04:06:18,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:06:18,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:06:18,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:06:18,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:06:18,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:06:19,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:06:19,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:06:19,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:06:19,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:06:19,349 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:06:19,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:06:19,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1147060777, now seen corresponding path program 1 times [2019-01-14 04:06:19,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:06:19,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:06:19,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:06:19,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:06:19,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:06:19,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:06:19,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:06:19,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:06:19,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:06:19,437 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:06:19,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:06:19,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:06:19,456 INFO L87 Difference]: Start difference. First operand 2599 states. Second operand 3 states. [2019-01-14 04:06:20,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:06:20,295 INFO L93 Difference]: Finished difference Result 3918 states and 7348 transitions. [2019-01-14 04:06:20,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:06:20,298 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3918 states and 7348 transitions. [2019-01-14 04:06:20,338 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2568 [2019-01-14 04:06:20,387 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3918 states to 3890 states and 7315 transitions. [2019-01-14 04:06:20,388 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3890 [2019-01-14 04:06:20,399 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3890 [2019-01-14 04:06:20,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3890 states and 7315 transitions. [2019-01-14 04:06:20,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:06:20,423 INFO L706 BuchiCegarLoop]: Abstraction has 3890 states and 7315 transitions. [2019-01-14 04:06:20,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3890 states and 7315 transitions. [2019-01-14 04:06:20,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3890 to 3888. [2019-01-14 04:06:20,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3888 states. [2019-01-14 04:06:20,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3888 states to 3888 states and 7312 transitions. [2019-01-14 04:06:20,586 INFO L729 BuchiCegarLoop]: Abstraction has 3888 states and 7312 transitions. [2019-01-14 04:06:20,587 INFO L609 BuchiCegarLoop]: Abstraction has 3888 states and 7312 transitions. [2019-01-14 04:06:20,587 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:06:20,587 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3888 states and 7312 transitions. [2019-01-14 04:06:20,612 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2566 [2019-01-14 04:06:20,612 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:06:20,613 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:06:20,617 INFO L867 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] [2019-01-14 04:06:20,620 INFO L868 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:06:20,621 INFO L794 eck$LassoCheckResult]: Stem: 7134#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(30);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(9);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(21);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(30);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(9);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(21);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(30);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(9);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(25);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(25);~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~cleanupTimeShifts~0 := 12;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0;call #t~string108.base, #t~string108.offset := #Ultimate.allocOnStack(10);call #t~string110.base, #t~string110.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string110.base, #t~string110.offset, 1);call write~init~int(95, #t~string110.base, 1 + #t~string110.offset, 1);call write~init~int(93, #t~string110.base, 2 + #t~string110.offset, 1);call write~init~int(0, #t~string110.base, 3 + #t~string110.offset, 1);call #t~string112.base, #t~string112.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string112.base, #t~string112.offset, 1);call write~init~int(93, #t~string112.base, 1 + #t~string112.offset, 1);call write~init~int(32, #t~string112.base, 2 + #t~string112.offset, 1);call write~init~int(0, #t~string112.base, 3 + #t~string112.offset, 1);call #t~string114.base, #t~string114.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string114.base, #t~string114.offset, 1);call write~init~int(97, #t~string114.base, 1 + #t~string114.offset, 1);call write~init~int(116, #t~string114.base, 2 + #t~string114.offset, 1);call write~init~int(32, #t~string114.base, 3 + #t~string114.offset, 1);call write~init~int(0, #t~string114.base, 4 + #t~string114.offset, 1);call #t~string116.base, #t~string116.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string116.base, #t~string116.offset, 1);call write~init~int(105, #t~string116.base, 1 + #t~string116.offset, 1);call write~init~int(0, #t~string116.base, 2 + #t~string116.offset, 1);call #t~string118.base, #t~string118.offset := #Ultimate.allocOnStack(10);call #t~string120.base, #t~string120.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string120.base, #t~string120.offset, 1);call write~init~int(112, #t~string120.base, 1 + #t~string120.offset, 1);call write~init~int(0, #t~string120.base, 2 + #t~string120.offset, 1);call #t~string122.base, #t~string122.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string122.base, #t~string122.offset, 1);call write~init~int(111, #t~string122.base, 1 + #t~string122.offset, 1);call write~init~int(119, #t~string122.base, 2 + #t~string122.offset, 1);call write~init~int(110, #t~string122.base, 3 + #t~string122.offset, 1);call write~init~int(0, #t~string122.base, 4 + #t~string122.offset, 1);call #t~string124.base, #t~string124.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string124.base, #t~string124.offset, 1);call write~init~int(73, #t~string124.base, 1 + #t~string124.offset, 1);call write~init~int(76, #t~string124.base, 2 + #t~string124.offset, 1);call write~init~int(95, #t~string124.base, 3 + #t~string124.offset, 1);call write~init~int(112, #t~string124.base, 4 + #t~string124.offset, 1);call write~init~int(58, #t~string124.base, 5 + #t~string124.offset, 1);call write~init~int(0, #t~string124.base, 6 + #t~string124.offset, 1);call #t~string126.base, #t~string126.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string126.base, #t~string126.offset, 1);call write~init~int(37, #t~string126.base, 1 + #t~string126.offset, 1);call write~init~int(105, #t~string126.base, 2 + #t~string126.offset, 1);call write~init~int(0, #t~string126.base, 3 + #t~string126.offset, 1);call #t~string128.base, #t~string128.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string128.base, #t~string128.offset, 1);call write~init~int(37, #t~string128.base, 1 + #t~string128.offset, 1);call write~init~int(105, #t~string128.base, 2 + #t~string128.offset, 1);call write~init~int(0, #t~string128.base, 3 + #t~string128.offset, 1);call #t~string130.base, #t~string130.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string130.base, #t~string130.offset, 1);call write~init~int(37, #t~string130.base, 1 + #t~string130.offset, 1);call write~init~int(105, #t~string130.base, 2 + #t~string130.offset, 1);call write~init~int(0, #t~string130.base, 3 + #t~string130.offset, 1);call #t~string132.base, #t~string132.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string132.base, #t~string132.offset, 1);call write~init~int(37, #t~string132.base, 1 + #t~string132.offset, 1);call write~init~int(105, #t~string132.base, 2 + #t~string132.offset, 1);call write~init~int(0, #t~string132.base, 3 + #t~string132.offset, 1);call #t~string134.base, #t~string134.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string134.base, #t~string134.offset, 1);call write~init~int(37, #t~string134.base, 1 + #t~string134.offset, 1);call write~init~int(105, #t~string134.base, 2 + #t~string134.offset, 1);call write~init~int(0, #t~string134.base, 3 + #t~string134.offset, 1);call #t~string136.base, #t~string136.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string136.base, #t~string136.offset, 1);call write~init~int(70, #t~string136.base, 1 + #t~string136.offset, 1);call write~init~int(95, #t~string136.base, 2 + #t~string136.offset, 1);call write~init~int(112, #t~string136.base, 3 + #t~string136.offset, 1);call write~init~int(58, #t~string136.base, 4 + #t~string136.offset, 1);call write~init~int(0, #t~string136.base, 5 + #t~string136.offset, 1);call #t~string139.base, #t~string139.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string139.base, #t~string139.offset, 1);call write~init~int(37, #t~string139.base, 1 + #t~string139.offset, 1);call write~init~int(105, #t~string139.base, 2 + #t~string139.offset, 1);call write~init~int(0, #t~string139.base, 3 + #t~string139.offset, 1);call #t~string142.base, #t~string142.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string142.base, #t~string142.offset, 1);call write~init~int(37, #t~string142.base, 1 + #t~string142.offset, 1);call write~init~int(105, #t~string142.base, 2 + #t~string142.offset, 1);call write~init~int(0, #t~string142.base, 3 + #t~string142.offset, 1);call #t~string145.base, #t~string145.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string145.base, #t~string145.offset, 1);call write~init~int(37, #t~string145.base, 1 + #t~string145.offset, 1);call write~init~int(105, #t~string145.base, 2 + #t~string145.offset, 1);call write~init~int(0, #t~string145.base, 3 + #t~string145.offset, 1);call #t~string148.base, #t~string148.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string148.base, #t~string148.offset, 1);call write~init~int(37, #t~string148.base, 1 + #t~string148.offset, 1);call write~init~int(105, #t~string148.base, 2 + #t~string148.offset, 1);call write~init~int(0, #t~string148.base, 3 + #t~string148.offset, 1);call #t~string151.base, #t~string151.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string151.base, #t~string151.offset, 1);call write~init~int(37, #t~string151.base, 1 + #t~string151.offset, 1);call write~init~int(105, #t~string151.base, 2 + #t~string151.offset, 1);call write~init~int(0, #t~string151.base, 3 + #t~string151.offset, 1);call #t~string153.base, #t~string153.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string153.base, #t~string153.offset, 1);call write~init~int(0, #t~string153.base, 1 + #t~string153.offset, 1);~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 7135#L-1 havoc main_#res;havoc main_#t~ret54, main_~retValue_acc~4, main_~tmp~13;havoc main_~retValue_acc~4;havoc main_~tmp~13; 6710#L3286 havoc valid_product_#res;havoc valid_product_~retValue_acc~26;havoc valid_product_~retValue_acc~26;valid_product_~retValue_acc~26 := 1;valid_product_#res := valid_product_~retValue_acc~26; 6711#L3294 main_#t~ret54 := valid_product_#res;main_~tmp~13 := main_#t~ret54;havoc main_#t~ret54; 7790#L850 assume 0 != main_~tmp~13; 6539#L819 ~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 6540#L3119 havoc bigMacCall_#t~ret47, bigMacCall_~tmp~10;havoc bigMacCall_~tmp~10;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~28;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~28; 7424#L3342 assume 0 == getOrigin_~person;getOrigin_~retValue_acc~28 := 4;getOrigin_#res := getOrigin_~retValue_acc~28; 7053#L3367 bigMacCall_#t~ret47 := getOrigin_#res;bigMacCall_~tmp~10 := bigMacCall_#t~ret47;havoc bigMacCall_#t~ret47;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~10;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 7054#L2776 assume 0 == initPersonOnFloor_~floor; 8286#L2777 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 6633#L2884-1 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 7174#L2568 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 6577#L2580-2 havoc cleanup_#t~ret48, cleanup_#t~ret49, cleanup_~i~2, cleanup_~tmp~11, cleanup_~tmp___0~2, cleanup_~__cil_tmp4~2;havoc cleanup_~i~2;havoc cleanup_~tmp~11;havoc cleanup_~tmp___0~2;havoc cleanup_~__cil_tmp4~2;havoc timeShift_#t~ret97, timeShift_#t~ret98, timeShift_#t~ret99, timeShift_#t~ret100, timeShift_#t~ret101, timeShift_#t~ret102, timeShift_#t~ret103, timeShift_#t~ret104, timeShift_#t~ret105, timeShift_#t~ret106, timeShift_#t~ret107, timeShift_~tmp~25, timeShift_~tmp___0~10, timeShift_~tmp___1~6, timeShift_~tmp___2~4, timeShift_~tmp___3~3, timeShift_~tmp___4~2, timeShift_~tmp___5~2, timeShift_~tmp___6~2, timeShift_~tmp___7~2, timeShift_~tmp___8~2, timeShift_~tmp___9~2;havoc timeShift_~tmp~25;havoc timeShift_~tmp___0~10;havoc timeShift_~tmp___1~6;havoc timeShift_~tmp___2~4;havoc timeShift_~tmp___3~3;havoc timeShift_~tmp___4~2;havoc timeShift_~tmp___5~2;havoc timeShift_~tmp___6~2;havoc timeShift_~tmp___7~2;havoc timeShift_~tmp___8~2;havoc timeShift_~tmp___9~2;havoc stopRequestedAtCurrentFloor_#res;havoc stopRequestedAtCurrentFloor_#t~ret81, stopRequestedAtCurrentFloor_#t~ret82, stopRequestedAtCurrentFloor_#t~ret83, stopRequestedAtCurrentFloor_#t~ret84, stopRequestedAtCurrentFloor_~retValue_acc~17, stopRequestedAtCurrentFloor_~tmp~23, stopRequestedAtCurrentFloor_~tmp___0~8;havoc stopRequestedAtCurrentFloor_~retValue_acc~17;havoc stopRequestedAtCurrentFloor_~tmp~23;havoc stopRequestedAtCurrentFloor_~tmp___0~8;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 6584#L2505 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 7150#L2532 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 7151#L2409 stopRequestedAtCurrentFloor_#t~ret81 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~23 := stopRequestedAtCurrentFloor_#t~ret81;havoc stopRequestedAtCurrentFloor_#t~ret81; 7826#L1793 assume 0 != stopRequestedAtCurrentFloor_~tmp~23;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 6769#L1124 stopRequestedAtCurrentFloor_#t~ret82 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~8 := stopRequestedAtCurrentFloor_#t~ret82;havoc stopRequestedAtCurrentFloor_#t~ret82; 6770#L1797 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~8);stopRequestedAtCurrentFloor_~retValue_acc~17 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~17; 7783#L1810 timeShift_#t~ret97 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret97;havoc timeShift_#t~ret97; 7996#L1946 assume !(0 != timeShift_~tmp___9~2); 9052#L2037 assume !(1 == ~doorState~0); 9028#L2037-2 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret75, stopRequestedInDirection_#t~ret76, stopRequestedInDirection_#t~ret77, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~14, stopRequestedInDirection_~tmp~20, stopRequestedInDirection_~tmp___0~6, stopRequestedInDirection_~__cil_tmp7~5, stopRequestedInDirection_~__cil_tmp8~5;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~14;havoc stopRequestedInDirection_~tmp~20;havoc stopRequestedInDirection_~tmp___0~6;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 7454#L2505-3 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 7156#L2532-3 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 7157#L2409-1 stopRequestedInDirection_#t~ret75 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~6 := stopRequestedInDirection_#t~ret75;havoc stopRequestedInDirection_#t~ret75; 7841#L1676 assume 0 != stopRequestedInDirection_~tmp___0~6;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 6771#L1124-1 stopRequestedInDirection_#t~ret76 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~20 := stopRequestedInDirection_#t~ret76;havoc stopRequestedInDirection_#t~ret76;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~20 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~14 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~14; 6772#L1689 timeShift_#t~ret104 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret104;havoc timeShift_#t~ret104; 7271#L2045 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret78, continueInDirection_~dir, continueInDirection_~tmp~21;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~21;~currentHeading~0 := continueInDirection_~dir; 7273#L1733 assume !(1 == ~currentHeading~0); 6641#L1743 assume 0 == ~currentFloorID~0;~currentHeading~0 := 1; 6642#L1743-2 assume 1 == ~currentHeading~0;~currentFloorID~0 := 1 + ~currentFloorID~0; 7582#L1749-5 havoc __utac_acc__Specification9_spec__3_#t~ret156, __utac_acc__Specification9_spec__3_#t~ret157, __utac_acc__Specification9_spec__3_#t~ret158, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~27, __utac_acc__Specification9_spec__3_~tmp___0~12, __utac_acc__Specification9_spec__3_~tmp___1~8;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~27;havoc __utac_acc__Specification9_spec__3_~tmp___0~12;havoc __utac_acc__Specification9_spec__3_~tmp___1~8;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 10301#L1124-3 __utac_acc__Specification9_spec__3_#t~ret156 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~27 := __utac_acc__Specification9_spec__3_#t~ret156;havoc __utac_acc__Specification9_spec__3_#t~ret156;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~27;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~10;havoc isEmpty_~retValue_acc~10; 10298#L1184-6 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~10 := 0;isEmpty_#res := isEmpty_~retValue_acc~10; 10294#L1216-6 __utac_acc__Specification9_spec__3_#t~ret157 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~8 := __utac_acc__Specification9_spec__3_#t~ret157;havoc __utac_acc__Specification9_spec__3_#t~ret157; 9404#L3162 assume 0 != __utac_acc__Specification9_spec__3_~tmp___1~8;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 9400#L3172-1 cleanup_~i~2 := 0; 9398#L651-2 [2019-01-14 04:06:20,627 INFO L796 eck$LassoCheckResult]: Loop: 9398#L651-2 assume !false; 9397#L652 cleanup_~__cil_tmp4~2 := ~cleanupTimeShifts~0 - 1; 9396#L655 assume cleanup_~i~2 < cleanup_~__cil_tmp4~2;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~5;havoc isBlocked_~retValue_acc~5;isBlocked_~retValue_acc~5 := 0;isBlocked_#res := isBlocked_~retValue_acc~5; 9395#L946 cleanup_#t~ret48 := isBlocked_#res;cleanup_~tmp___0~2 := cleanup_#t~ret48;havoc cleanup_#t~ret48; 9394#L659 assume 1 != cleanup_~tmp___0~2; 9393#L659-1 havoc isIdle_#res;havoc isIdle_#t~ret63, isIdle_~retValue_acc~12, isIdle_~tmp~18;havoc isIdle_~retValue_acc~12;havoc isIdle_~tmp~18;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret58, anyStopRequested_#t~ret59, anyStopRequested_#t~ret60, anyStopRequested_#t~ret61, anyStopRequested_#t~ret62, anyStopRequested_~retValue_acc~11, anyStopRequested_~tmp~17, anyStopRequested_~tmp___0~4, anyStopRequested_~tmp___1~3, anyStopRequested_~tmp___2~1, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~11;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~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 9388#L2505-25 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 9382#L2532-25 anyStopRequested_#t~ret58 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret58;havoc anyStopRequested_#t~ret58; 9366#L1232 assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~11 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~11; 9357#L1296 isIdle_#t~ret63 := anyStopRequested_#res;isIdle_~tmp~18 := isIdle_#t~ret63;havoc isIdle_#t~ret63;isIdle_~retValue_acc~12 := (if 0 == isIdle_~tmp~18 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~12; 9356#L1309 cleanup_#t~ret49 := isIdle_#res;cleanup_~tmp~11 := cleanup_#t~ret49;havoc cleanup_#t~ret49; 9355#L671 assume !(0 != cleanup_~tmp~11);havoc timeShift_#t~ret97, timeShift_#t~ret98, timeShift_#t~ret99, timeShift_#t~ret100, timeShift_#t~ret101, timeShift_#t~ret102, timeShift_#t~ret103, timeShift_#t~ret104, timeShift_#t~ret105, timeShift_#t~ret106, timeShift_#t~ret107, timeShift_~tmp~25, timeShift_~tmp___0~10, timeShift_~tmp___1~6, timeShift_~tmp___2~4, timeShift_~tmp___3~3, timeShift_~tmp___4~2, timeShift_~tmp___5~2, timeShift_~tmp___6~2, timeShift_~tmp___7~2, timeShift_~tmp___8~2, timeShift_~tmp___9~2;havoc timeShift_~tmp~25;havoc timeShift_~tmp___0~10;havoc timeShift_~tmp___1~6;havoc timeShift_~tmp___2~4;havoc timeShift_~tmp___3~3;havoc timeShift_~tmp___4~2;havoc timeShift_~tmp___5~2;havoc timeShift_~tmp___6~2;havoc timeShift_~tmp___7~2;havoc timeShift_~tmp___8~2;havoc timeShift_~tmp___9~2;havoc stopRequestedAtCurrentFloor_#res;havoc stopRequestedAtCurrentFloor_#t~ret81, stopRequestedAtCurrentFloor_#t~ret82, stopRequestedAtCurrentFloor_#t~ret83, stopRequestedAtCurrentFloor_#t~ret84, stopRequestedAtCurrentFloor_~retValue_acc~17, stopRequestedAtCurrentFloor_~tmp~23, stopRequestedAtCurrentFloor_~tmp___0~8;havoc stopRequestedAtCurrentFloor_~retValue_acc~17;havoc stopRequestedAtCurrentFloor_~tmp~23;havoc stopRequestedAtCurrentFloor_~tmp___0~8;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 9354#L2505-30 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 9349#L2532-30 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 9348#L2409-3 stopRequestedAtCurrentFloor_#t~ret81 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~23 := stopRequestedAtCurrentFloor_#t~ret81;havoc stopRequestedAtCurrentFloor_#t~ret81; 9347#L1793-1 assume 0 != stopRequestedAtCurrentFloor_~tmp~23;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 9346#L1124-4 stopRequestedAtCurrentFloor_#t~ret82 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~8 := stopRequestedAtCurrentFloor_#t~ret82;havoc stopRequestedAtCurrentFloor_#t~ret82; 9326#L1797-1 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~8);stopRequestedAtCurrentFloor_~retValue_acc~17 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~17; 9322#L1810-1 timeShift_#t~ret97 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret97;havoc timeShift_#t~ret97; 9320#L1946-1 assume !(0 != timeShift_~tmp___9~2); 9319#L2037-3 assume 1 == ~doorState~0;~doorState~0 := 0; 9318#L2037-5 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret75, stopRequestedInDirection_#t~ret76, stopRequestedInDirection_#t~ret77, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~14, stopRequestedInDirection_~tmp~20, stopRequestedInDirection_~tmp___0~6, stopRequestedInDirection_~__cil_tmp7~5, stopRequestedInDirection_~__cil_tmp8~5;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~14;havoc stopRequestedInDirection_~tmp~20;havoc stopRequestedInDirection_~tmp___0~6;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 9316#L2505-33 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 9312#L2532-33 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 9311#L2409-4 stopRequestedInDirection_#t~ret75 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~6 := stopRequestedInDirection_#t~ret75;havoc stopRequestedInDirection_#t~ret75; 9310#L1676-2 assume 0 != stopRequestedInDirection_~tmp___0~6;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 9199#L1124-5 stopRequestedInDirection_#t~ret76 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~20 := stopRequestedInDirection_#t~ret76;havoc stopRequestedInDirection_#t~ret76;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~20 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~14 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~14; 9198#L1689-2 timeShift_#t~ret104 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret104;havoc timeShift_#t~ret104; 9195#L2045-1 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret78, continueInDirection_~dir, continueInDirection_~tmp~21;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~21;~currentHeading~0 := continueInDirection_~dir; 9196#L1733-3 assume !(1 == ~currentHeading~0); 6591#L1743-9 assume 0 == ~currentFloorID~0;~currentHeading~0 := 1; 6592#L1743-11 assume 1 == ~currentHeading~0;~currentFloorID~0 := 1 + ~currentFloorID~0; 9432#L1749-11 havoc __utac_acc__Specification9_spec__3_#t~ret156, __utac_acc__Specification9_spec__3_#t~ret157, __utac_acc__Specification9_spec__3_#t~ret158, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~27, __utac_acc__Specification9_spec__3_~tmp___0~12, __utac_acc__Specification9_spec__3_~tmp___1~8;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~27;havoc __utac_acc__Specification9_spec__3_~tmp___0~12;havoc __utac_acc__Specification9_spec__3_~tmp___1~8;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 9431#L1124-7 __utac_acc__Specification9_spec__3_#t~ret156 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~27 := __utac_acc__Specification9_spec__3_#t~ret156;havoc __utac_acc__Specification9_spec__3_#t~ret156;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~27;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~10;havoc isEmpty_~retValue_acc~10; 9430#L1184-13 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~10 := 0;isEmpty_#res := isEmpty_~retValue_acc~10; 9424#L1216-13 __utac_acc__Specification9_spec__3_#t~ret157 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~8 := __utac_acc__Specification9_spec__3_#t~ret157;havoc __utac_acc__Specification9_spec__3_#t~ret157; 9420#L3162-2 assume 0 != __utac_acc__Specification9_spec__3_~tmp___1~8;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 9399#L3172-3 cleanup_~i~2 := 1 + cleanup_~i~2; 9398#L651-2 [2019-01-14 04:06:20,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:06:20,627 INFO L82 PathProgramCache]: Analyzing trace with hash 2006932539, now seen corresponding path program 1 times [2019-01-14 04:06:20,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:06:20,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:06:20,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:06:20,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:06:20,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:06:20,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:06:20,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:06:20,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:06:20,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:06:20,816 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:06:20,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:06:20,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1956407403, now seen corresponding path program 1 times [2019-01-14 04:06:20,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:06:20,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:06:20,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:06:20,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:06:20,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:06:20,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:06:21,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:06:21,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:06:21,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 04:06:21,199 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:06:21,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 04:06:21,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-14 04:06:21,200 INFO L87 Difference]: Start difference. First operand 3888 states and 7312 transitions. cyclomatic complexity: 3425 Second operand 7 states. [2019-01-14 04:06:22,365 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-14 04:06:22,706 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-14 04:06:29,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:06:29,240 INFO L93 Difference]: Finished difference Result 31551 states and 59042 transitions. [2019-01-14 04:06:29,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-14 04:06:29,241 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31551 states and 59042 transitions. [2019-01-14 04:06:29,415 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18920 [2019-01-14 04:06:29,833 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31551 states to 31551 states and 59042 transitions. [2019-01-14 04:06:29,834 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31551 [2019-01-14 04:06:29,876 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31551 [2019-01-14 04:06:29,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31551 states and 59042 transitions. [2019-01-14 04:06:29,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:06:29,929 INFO L706 BuchiCegarLoop]: Abstraction has 31551 states and 59042 transitions. [2019-01-14 04:06:29,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31551 states and 59042 transitions. [2019-01-14 04:06:30,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31551 to 11248. [2019-01-14 04:06:30,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11248 states. [2019-01-14 04:06:30,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11248 states to 11248 states and 21079 transitions. [2019-01-14 04:06:30,319 INFO L729 BuchiCegarLoop]: Abstraction has 11248 states and 21079 transitions. [2019-01-14 04:06:30,319 INFO L609 BuchiCegarLoop]: Abstraction has 11248 states and 21079 transitions. [2019-01-14 04:06:30,319 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:06:30,319 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11248 states and 21079 transitions. [2019-01-14 04:06:30,373 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7522 [2019-01-14 04:06:30,374 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:06:30,374 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:06:30,378 INFO L867 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] [2019-01-14 04:06:30,382 INFO L868 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:06:30,382 INFO L794 eck$LassoCheckResult]: Stem: 42628#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(30);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(9);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(21);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(30);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(9);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(21);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(30);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(9);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(25);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(25);~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~cleanupTimeShifts~0 := 12;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0;call #t~string108.base, #t~string108.offset := #Ultimate.allocOnStack(10);call #t~string110.base, #t~string110.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string110.base, #t~string110.offset, 1);call write~init~int(95, #t~string110.base, 1 + #t~string110.offset, 1);call write~init~int(93, #t~string110.base, 2 + #t~string110.offset, 1);call write~init~int(0, #t~string110.base, 3 + #t~string110.offset, 1);call #t~string112.base, #t~string112.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string112.base, #t~string112.offset, 1);call write~init~int(93, #t~string112.base, 1 + #t~string112.offset, 1);call write~init~int(32, #t~string112.base, 2 + #t~string112.offset, 1);call write~init~int(0, #t~string112.base, 3 + #t~string112.offset, 1);call #t~string114.base, #t~string114.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string114.base, #t~string114.offset, 1);call write~init~int(97, #t~string114.base, 1 + #t~string114.offset, 1);call write~init~int(116, #t~string114.base, 2 + #t~string114.offset, 1);call write~init~int(32, #t~string114.base, 3 + #t~string114.offset, 1);call write~init~int(0, #t~string114.base, 4 + #t~string114.offset, 1);call #t~string116.base, #t~string116.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string116.base, #t~string116.offset, 1);call write~init~int(105, #t~string116.base, 1 + #t~string116.offset, 1);call write~init~int(0, #t~string116.base, 2 + #t~string116.offset, 1);call #t~string118.base, #t~string118.offset := #Ultimate.allocOnStack(10);call #t~string120.base, #t~string120.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string120.base, #t~string120.offset, 1);call write~init~int(112, #t~string120.base, 1 + #t~string120.offset, 1);call write~init~int(0, #t~string120.base, 2 + #t~string120.offset, 1);call #t~string122.base, #t~string122.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string122.base, #t~string122.offset, 1);call write~init~int(111, #t~string122.base, 1 + #t~string122.offset, 1);call write~init~int(119, #t~string122.base, 2 + #t~string122.offset, 1);call write~init~int(110, #t~string122.base, 3 + #t~string122.offset, 1);call write~init~int(0, #t~string122.base, 4 + #t~string122.offset, 1);call #t~string124.base, #t~string124.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string124.base, #t~string124.offset, 1);call write~init~int(73, #t~string124.base, 1 + #t~string124.offset, 1);call write~init~int(76, #t~string124.base, 2 + #t~string124.offset, 1);call write~init~int(95, #t~string124.base, 3 + #t~string124.offset, 1);call write~init~int(112, #t~string124.base, 4 + #t~string124.offset, 1);call write~init~int(58, #t~string124.base, 5 + #t~string124.offset, 1);call write~init~int(0, #t~string124.base, 6 + #t~string124.offset, 1);call #t~string126.base, #t~string126.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string126.base, #t~string126.offset, 1);call write~init~int(37, #t~string126.base, 1 + #t~string126.offset, 1);call write~init~int(105, #t~string126.base, 2 + #t~string126.offset, 1);call write~init~int(0, #t~string126.base, 3 + #t~string126.offset, 1);call #t~string128.base, #t~string128.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string128.base, #t~string128.offset, 1);call write~init~int(37, #t~string128.base, 1 + #t~string128.offset, 1);call write~init~int(105, #t~string128.base, 2 + #t~string128.offset, 1);call write~init~int(0, #t~string128.base, 3 + #t~string128.offset, 1);call #t~string130.base, #t~string130.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string130.base, #t~string130.offset, 1);call write~init~int(37, #t~string130.base, 1 + #t~string130.offset, 1);call write~init~int(105, #t~string130.base, 2 + #t~string130.offset, 1);call write~init~int(0, #t~string130.base, 3 + #t~string130.offset, 1);call #t~string132.base, #t~string132.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string132.base, #t~string132.offset, 1);call write~init~int(37, #t~string132.base, 1 + #t~string132.offset, 1);call write~init~int(105, #t~string132.base, 2 + #t~string132.offset, 1);call write~init~int(0, #t~string132.base, 3 + #t~string132.offset, 1);call #t~string134.base, #t~string134.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string134.base, #t~string134.offset, 1);call write~init~int(37, #t~string134.base, 1 + #t~string134.offset, 1);call write~init~int(105, #t~string134.base, 2 + #t~string134.offset, 1);call write~init~int(0, #t~string134.base, 3 + #t~string134.offset, 1);call #t~string136.base, #t~string136.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string136.base, #t~string136.offset, 1);call write~init~int(70, #t~string136.base, 1 + #t~string136.offset, 1);call write~init~int(95, #t~string136.base, 2 + #t~string136.offset, 1);call write~init~int(112, #t~string136.base, 3 + #t~string136.offset, 1);call write~init~int(58, #t~string136.base, 4 + #t~string136.offset, 1);call write~init~int(0, #t~string136.base, 5 + #t~string136.offset, 1);call #t~string139.base, #t~string139.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string139.base, #t~string139.offset, 1);call write~init~int(37, #t~string139.base, 1 + #t~string139.offset, 1);call write~init~int(105, #t~string139.base, 2 + #t~string139.offset, 1);call write~init~int(0, #t~string139.base, 3 + #t~string139.offset, 1);call #t~string142.base, #t~string142.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string142.base, #t~string142.offset, 1);call write~init~int(37, #t~string142.base, 1 + #t~string142.offset, 1);call write~init~int(105, #t~string142.base, 2 + #t~string142.offset, 1);call write~init~int(0, #t~string142.base, 3 + #t~string142.offset, 1);call #t~string145.base, #t~string145.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string145.base, #t~string145.offset, 1);call write~init~int(37, #t~string145.base, 1 + #t~string145.offset, 1);call write~init~int(105, #t~string145.base, 2 + #t~string145.offset, 1);call write~init~int(0, #t~string145.base, 3 + #t~string145.offset, 1);call #t~string148.base, #t~string148.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string148.base, #t~string148.offset, 1);call write~init~int(37, #t~string148.base, 1 + #t~string148.offset, 1);call write~init~int(105, #t~string148.base, 2 + #t~string148.offset, 1);call write~init~int(0, #t~string148.base, 3 + #t~string148.offset, 1);call #t~string151.base, #t~string151.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string151.base, #t~string151.offset, 1);call write~init~int(37, #t~string151.base, 1 + #t~string151.offset, 1);call write~init~int(105, #t~string151.base, 2 + #t~string151.offset, 1);call write~init~int(0, #t~string151.base, 3 + #t~string151.offset, 1);call #t~string153.base, #t~string153.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string153.base, #t~string153.offset, 1);call write~init~int(0, #t~string153.base, 1 + #t~string153.offset, 1);~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 42629#L-1 havoc main_#res;havoc main_#t~ret54, main_~retValue_acc~4, main_~tmp~13;havoc main_~retValue_acc~4;havoc main_~tmp~13; 42183#L3286 havoc valid_product_#res;havoc valid_product_~retValue_acc~26;havoc valid_product_~retValue_acc~26;valid_product_~retValue_acc~26 := 1;valid_product_#res := valid_product_~retValue_acc~26; 42184#L3294 main_#t~ret54 := valid_product_#res;main_~tmp~13 := main_#t~ret54;havoc main_#t~ret54; 43315#L850 assume 0 != main_~tmp~13; 42018#L819 ~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 42019#L3119 havoc bigMacCall_#t~ret47, bigMacCall_~tmp~10;havoc bigMacCall_~tmp~10;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~28;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~28; 42932#L3342 assume 0 == getOrigin_~person;getOrigin_~retValue_acc~28 := 4;getOrigin_#res := getOrigin_~retValue_acc~28; 42543#L3367 bigMacCall_#t~ret47 := getOrigin_#res;bigMacCall_~tmp~10 := bigMacCall_#t~ret47;havoc bigMacCall_#t~ret47;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~10;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 42544#L2776 assume 0 == initPersonOnFloor_~floor; 43889#L2777 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 42107#L2884-1 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 42674#L2568 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 42054#L2580-2 havoc cleanup_#t~ret48, cleanup_#t~ret49, cleanup_~i~2, cleanup_~tmp~11, cleanup_~tmp___0~2, cleanup_~__cil_tmp4~2;havoc cleanup_~i~2;havoc cleanup_~tmp~11;havoc cleanup_~tmp___0~2;havoc cleanup_~__cil_tmp4~2;havoc timeShift_#t~ret97, timeShift_#t~ret98, timeShift_#t~ret99, timeShift_#t~ret100, timeShift_#t~ret101, timeShift_#t~ret102, timeShift_#t~ret103, timeShift_#t~ret104, timeShift_#t~ret105, timeShift_#t~ret106, timeShift_#t~ret107, timeShift_~tmp~25, timeShift_~tmp___0~10, timeShift_~tmp___1~6, timeShift_~tmp___2~4, timeShift_~tmp___3~3, timeShift_~tmp___4~2, timeShift_~tmp___5~2, timeShift_~tmp___6~2, timeShift_~tmp___7~2, timeShift_~tmp___8~2, timeShift_~tmp___9~2;havoc timeShift_~tmp~25;havoc timeShift_~tmp___0~10;havoc timeShift_~tmp___1~6;havoc timeShift_~tmp___2~4;havoc timeShift_~tmp___3~3;havoc timeShift_~tmp___4~2;havoc timeShift_~tmp___5~2;havoc timeShift_~tmp___6~2;havoc timeShift_~tmp___7~2;havoc timeShift_~tmp___8~2;havoc timeShift_~tmp___9~2;havoc stopRequestedAtCurrentFloor_#res;havoc stopRequestedAtCurrentFloor_#t~ret81, stopRequestedAtCurrentFloor_#t~ret82, stopRequestedAtCurrentFloor_#t~ret83, stopRequestedAtCurrentFloor_#t~ret84, stopRequestedAtCurrentFloor_~retValue_acc~17, stopRequestedAtCurrentFloor_~tmp~23, stopRequestedAtCurrentFloor_~tmp___0~8;havoc stopRequestedAtCurrentFloor_~retValue_acc~17;havoc stopRequestedAtCurrentFloor_~tmp~23;havoc stopRequestedAtCurrentFloor_~tmp___0~8;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 42060#L2505 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 42650#L2532 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 42651#L2409 stopRequestedAtCurrentFloor_#t~ret81 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~23 := stopRequestedAtCurrentFloor_#t~ret81;havoc stopRequestedAtCurrentFloor_#t~ret81; 43364#L1793 assume 0 != stopRequestedAtCurrentFloor_~tmp~23;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 42242#L1124 stopRequestedAtCurrentFloor_#t~ret82 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~8 := stopRequestedAtCurrentFloor_#t~ret82;havoc stopRequestedAtCurrentFloor_#t~ret82; 42243#L1797 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~8);stopRequestedAtCurrentFloor_~retValue_acc~17 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~17; 43306#L1810 timeShift_#t~ret97 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret97;havoc timeShift_#t~ret97; 49878#L1946 assume !(0 != timeShift_~tmp___9~2); 49879#L2037 assume !(1 == ~doorState~0); 51051#L2037-2 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret75, stopRequestedInDirection_#t~ret76, stopRequestedInDirection_#t~ret77, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~14, stopRequestedInDirection_~tmp~20, stopRequestedInDirection_~tmp___0~6, stopRequestedInDirection_~__cil_tmp7~5, stopRequestedInDirection_~__cil_tmp8~5;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~14;havoc stopRequestedInDirection_~tmp~20;havoc stopRequestedInDirection_~tmp___0~6;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 51050#L2505-3 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 51049#L2532-3 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 51048#L2409-1 stopRequestedInDirection_#t~ret75 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~6 := stopRequestedInDirection_#t~ret75;havoc stopRequestedInDirection_#t~ret75; 51046#L1676 assume 0 != stopRequestedInDirection_~tmp___0~6;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 51047#L1124-1 stopRequestedInDirection_#t~ret76 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~20 := stopRequestedInDirection_#t~ret76;havoc stopRequestedInDirection_#t~ret76;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~20 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~14 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~14; 44454#L1689 timeShift_#t~ret104 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret104;havoc timeShift_#t~ret104; 42776#L2045 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret78, continueInDirection_~dir, continueInDirection_~tmp~21;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~21;~currentHeading~0 := continueInDirection_~dir; 42778#L1733 assume !(1 == ~currentHeading~0); 42115#L1743 assume !(0 == ~currentFloorID~0); 42084#L1743-2 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 42061#L1749-5 havoc __utac_acc__Specification9_spec__3_#t~ret156, __utac_acc__Specification9_spec__3_#t~ret157, __utac_acc__Specification9_spec__3_#t~ret158, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~27, __utac_acc__Specification9_spec__3_~tmp___0~12, __utac_acc__Specification9_spec__3_~tmp___1~8;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~27;havoc __utac_acc__Specification9_spec__3_~tmp___0~12;havoc __utac_acc__Specification9_spec__3_~tmp___1~8;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 51192#L1124-3 __utac_acc__Specification9_spec__3_#t~ret156 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~27 := __utac_acc__Specification9_spec__3_#t~ret156;havoc __utac_acc__Specification9_spec__3_#t~ret156;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~27;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~10;havoc isEmpty_~retValue_acc~10; 51189#L1184-6 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~10 := 0;isEmpty_#res := isEmpty_~retValue_acc~10; 51185#L1216-6 __utac_acc__Specification9_spec__3_#t~ret157 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~8 := __utac_acc__Specification9_spec__3_#t~ret157;havoc __utac_acc__Specification9_spec__3_#t~ret157; 51175#L3162 assume 0 != __utac_acc__Specification9_spec__3_~tmp___1~8;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 49082#L3172-1 cleanup_~i~2 := 0; 49081#L651-2 [2019-01-14 04:06:30,382 INFO L796 eck$LassoCheckResult]: Loop: 49081#L651-2 assume !false; 49071#L652 cleanup_~__cil_tmp4~2 := ~cleanupTimeShifts~0 - 1; 49072#L655 assume cleanup_~i~2 < cleanup_~__cil_tmp4~2;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~5;havoc isBlocked_~retValue_acc~5;isBlocked_~retValue_acc~5 := 0;isBlocked_#res := isBlocked_~retValue_acc~5; 49067#L946 cleanup_#t~ret48 := isBlocked_#res;cleanup_~tmp___0~2 := cleanup_#t~ret48;havoc cleanup_#t~ret48; 49068#L659 assume 1 != cleanup_~tmp___0~2; 49063#L659-1 havoc isIdle_#res;havoc isIdle_#t~ret63, isIdle_~retValue_acc~12, isIdle_~tmp~18;havoc isIdle_~retValue_acc~12;havoc isIdle_~tmp~18;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret58, anyStopRequested_#t~ret59, anyStopRequested_#t~ret60, anyStopRequested_#t~ret61, anyStopRequested_#t~ret62, anyStopRequested_~retValue_acc~11, anyStopRequested_~tmp~17, anyStopRequested_~tmp___0~4, anyStopRequested_~tmp___1~3, anyStopRequested_~tmp___2~1, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~11;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~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 49064#L2505-25 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 42574#L2532-25 anyStopRequested_#t~ret58 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret58;havoc anyStopRequested_#t~ret58; 42575#L1232 assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~11 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~11; 42807#L1296 isIdle_#t~ret63 := anyStopRequested_#res;isIdle_~tmp~18 := isIdle_#t~ret63;havoc isIdle_#t~ret63;isIdle_~retValue_acc~12 := (if 0 == isIdle_~tmp~18 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~12; 42808#L1309 cleanup_#t~ret49 := isIdle_#res;cleanup_~tmp~11 := cleanup_#t~ret49;havoc cleanup_#t~ret49; 45106#L671 assume !(0 != cleanup_~tmp~11);havoc timeShift_#t~ret97, timeShift_#t~ret98, timeShift_#t~ret99, timeShift_#t~ret100, timeShift_#t~ret101, timeShift_#t~ret102, timeShift_#t~ret103, timeShift_#t~ret104, timeShift_#t~ret105, timeShift_#t~ret106, timeShift_#t~ret107, timeShift_~tmp~25, timeShift_~tmp___0~10, timeShift_~tmp___1~6, timeShift_~tmp___2~4, timeShift_~tmp___3~3, timeShift_~tmp___4~2, timeShift_~tmp___5~2, timeShift_~tmp___6~2, timeShift_~tmp___7~2, timeShift_~tmp___8~2, timeShift_~tmp___9~2;havoc timeShift_~tmp~25;havoc timeShift_~tmp___0~10;havoc timeShift_~tmp___1~6;havoc timeShift_~tmp___2~4;havoc timeShift_~tmp___3~3;havoc timeShift_~tmp___4~2;havoc timeShift_~tmp___5~2;havoc timeShift_~tmp___6~2;havoc timeShift_~tmp___7~2;havoc timeShift_~tmp___8~2;havoc timeShift_~tmp___9~2;havoc stopRequestedAtCurrentFloor_#res;havoc stopRequestedAtCurrentFloor_#t~ret81, stopRequestedAtCurrentFloor_#t~ret82, stopRequestedAtCurrentFloor_#t~ret83, stopRequestedAtCurrentFloor_#t~ret84, stopRequestedAtCurrentFloor_~retValue_acc~17, stopRequestedAtCurrentFloor_~tmp~23, stopRequestedAtCurrentFloor_~tmp___0~8;havoc stopRequestedAtCurrentFloor_~retValue_acc~17;havoc stopRequestedAtCurrentFloor_~tmp~23;havoc stopRequestedAtCurrentFloor_~tmp___0~8;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 45107#L2505-30 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 46980#L2532-30 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 45090#L2409-3 stopRequestedAtCurrentFloor_#t~ret81 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~23 := stopRequestedAtCurrentFloor_#t~ret81;havoc stopRequestedAtCurrentFloor_#t~ret81; 45091#L1793-1 assume 0 != stopRequestedAtCurrentFloor_~tmp~23;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 45006#L1124-4 stopRequestedAtCurrentFloor_#t~ret82 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~8 := stopRequestedAtCurrentFloor_#t~ret82;havoc stopRequestedAtCurrentFloor_#t~ret82; 45007#L1797-1 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~8);stopRequestedAtCurrentFloor_~retValue_acc~17 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~17; 50630#L1810-1 timeShift_#t~ret97 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret97;havoc timeShift_#t~ret97; 50631#L1946-1 assume !(0 != timeShift_~tmp___9~2); 51152#L2037-3 assume 1 == ~doorState~0;~doorState~0 := 0; 51151#L2037-5 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret75, stopRequestedInDirection_#t~ret76, stopRequestedInDirection_#t~ret77, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~14, stopRequestedInDirection_~tmp~20, stopRequestedInDirection_~tmp___0~6, stopRequestedInDirection_~__cil_tmp7~5, stopRequestedInDirection_~__cil_tmp8~5;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~14;havoc stopRequestedInDirection_~tmp~20;havoc stopRequestedInDirection_~tmp___0~6;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 51150#L2505-33 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 51149#L2532-33 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 51148#L2409-4 stopRequestedInDirection_#t~ret75 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~6 := stopRequestedInDirection_#t~ret75;havoc stopRequestedInDirection_#t~ret75; 51146#L1676-2 assume 0 != stopRequestedInDirection_~tmp___0~6;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 51144#L1124-5 stopRequestedInDirection_#t~ret76 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~20 := stopRequestedInDirection_#t~ret76;havoc stopRequestedInDirection_#t~ret76;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~20 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~14 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~14; 51143#L1689-2 timeShift_#t~ret104 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret104;havoc timeShift_#t~ret104; 42780#L2045-1 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret78, continueInDirection_~dir, continueInDirection_~tmp~21;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~21;~currentHeading~0 := continueInDirection_~dir; 42782#L1733-3 assume !(1 == ~currentHeading~0); 42067#L1743-9 assume !(0 == ~currentFloorID~0); 42045#L1743-11 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 42039#L1749-11 havoc __utac_acc__Specification9_spec__3_#t~ret156, __utac_acc__Specification9_spec__3_#t~ret157, __utac_acc__Specification9_spec__3_#t~ret158, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~27, __utac_acc__Specification9_spec__3_~tmp___0~12, __utac_acc__Specification9_spec__3_~tmp___1~8;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~27;havoc __utac_acc__Specification9_spec__3_~tmp___0~12;havoc __utac_acc__Specification9_spec__3_~tmp___1~8;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 51211#L1124-7 __utac_acc__Specification9_spec__3_#t~ret156 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~27 := __utac_acc__Specification9_spec__3_#t~ret156;havoc __utac_acc__Specification9_spec__3_#t~ret156;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~27;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~10;havoc isEmpty_~retValue_acc~10; 51210#L1184-13 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~10 := 0;isEmpty_#res := isEmpty_~retValue_acc~10; 51204#L1216-13 __utac_acc__Specification9_spec__3_#t~ret157 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~8 := __utac_acc__Specification9_spec__3_#t~ret157;havoc __utac_acc__Specification9_spec__3_#t~ret157; 51201#L3162-2 assume 0 != __utac_acc__Specification9_spec__3_~tmp___1~8;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 49080#L3172-3 cleanup_~i~2 := 1 + cleanup_~i~2; 49081#L651-2 [2019-01-14 04:06:30,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:06:30,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1322374021, now seen corresponding path program 2 times [2019-01-14 04:06:30,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:06:30,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:06:30,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:06:30,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:06:30,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:06:30,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:06:30,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:06:30,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:06:30,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:06:30,545 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:06:30,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:06:30,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1372899157, now seen corresponding path program 1 times [2019-01-14 04:06:30,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:06:30,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:06:30,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:06:30,547 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:06:30,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:06:30,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:06:30,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:06:30,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:06:30,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 04:06:30,690 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:06:30,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 04:06:30,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 04:06:30,691 INFO L87 Difference]: Start difference. First operand 11248 states and 21079 transitions. cyclomatic complexity: 9833 Second operand 4 states. [2019-01-14 04:06:31,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:06:31,096 INFO L93 Difference]: Finished difference Result 33404 states and 62704 transitions. [2019-01-14 04:06:31,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 04:06:31,097 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33404 states and 62704 transitions. [2019-01-14 04:06:31,231 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 27126 [2019-01-14 04:06:31,367 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33404 states to 33404 states and 62704 transitions. [2019-01-14 04:06:31,367 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33404 [2019-01-14 04:06:31,402 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33404 [2019-01-14 04:06:31,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33404 states and 62704 transitions. [2019-01-14 04:06:31,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:06:31,448 INFO L706 BuchiCegarLoop]: Abstraction has 33404 states and 62704 transitions. [2019-01-14 04:06:31,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33404 states and 62704 transitions. [2019-01-14 04:06:31,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33404 to 11270. [2019-01-14 04:06:31,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11270 states. [2019-01-14 04:06:31,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11270 states to 11270 states and 21101 transitions. [2019-01-14 04:06:31,741 INFO L729 BuchiCegarLoop]: Abstraction has 11270 states and 21101 transitions. [2019-01-14 04:06:31,742 INFO L609 BuchiCegarLoop]: Abstraction has 11270 states and 21101 transitions. [2019-01-14 04:06:31,742 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 04:06:31,742 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11270 states and 21101 transitions. [2019-01-14 04:06:31,781 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7534 [2019-01-14 04:06:31,782 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:06:31,782 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:06:31,786 INFO L867 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] [2019-01-14 04:06:31,787 INFO L868 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:06:31,787 INFO L794 eck$LassoCheckResult]: Stem: 87307#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(30);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(9);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(21);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(30);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(9);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(21);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(30);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(9);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(25);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(25);~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~cleanupTimeShifts~0 := 12;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0;call #t~string108.base, #t~string108.offset := #Ultimate.allocOnStack(10);call #t~string110.base, #t~string110.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string110.base, #t~string110.offset, 1);call write~init~int(95, #t~string110.base, 1 + #t~string110.offset, 1);call write~init~int(93, #t~string110.base, 2 + #t~string110.offset, 1);call write~init~int(0, #t~string110.base, 3 + #t~string110.offset, 1);call #t~string112.base, #t~string112.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string112.base, #t~string112.offset, 1);call write~init~int(93, #t~string112.base, 1 + #t~string112.offset, 1);call write~init~int(32, #t~string112.base, 2 + #t~string112.offset, 1);call write~init~int(0, #t~string112.base, 3 + #t~string112.offset, 1);call #t~string114.base, #t~string114.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string114.base, #t~string114.offset, 1);call write~init~int(97, #t~string114.base, 1 + #t~string114.offset, 1);call write~init~int(116, #t~string114.base, 2 + #t~string114.offset, 1);call write~init~int(32, #t~string114.base, 3 + #t~string114.offset, 1);call write~init~int(0, #t~string114.base, 4 + #t~string114.offset, 1);call #t~string116.base, #t~string116.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string116.base, #t~string116.offset, 1);call write~init~int(105, #t~string116.base, 1 + #t~string116.offset, 1);call write~init~int(0, #t~string116.base, 2 + #t~string116.offset, 1);call #t~string118.base, #t~string118.offset := #Ultimate.allocOnStack(10);call #t~string120.base, #t~string120.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string120.base, #t~string120.offset, 1);call write~init~int(112, #t~string120.base, 1 + #t~string120.offset, 1);call write~init~int(0, #t~string120.base, 2 + #t~string120.offset, 1);call #t~string122.base, #t~string122.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string122.base, #t~string122.offset, 1);call write~init~int(111, #t~string122.base, 1 + #t~string122.offset, 1);call write~init~int(119, #t~string122.base, 2 + #t~string122.offset, 1);call write~init~int(110, #t~string122.base, 3 + #t~string122.offset, 1);call write~init~int(0, #t~string122.base, 4 + #t~string122.offset, 1);call #t~string124.base, #t~string124.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string124.base, #t~string124.offset, 1);call write~init~int(73, #t~string124.base, 1 + #t~string124.offset, 1);call write~init~int(76, #t~string124.base, 2 + #t~string124.offset, 1);call write~init~int(95, #t~string124.base, 3 + #t~string124.offset, 1);call write~init~int(112, #t~string124.base, 4 + #t~string124.offset, 1);call write~init~int(58, #t~string124.base, 5 + #t~string124.offset, 1);call write~init~int(0, #t~string124.base, 6 + #t~string124.offset, 1);call #t~string126.base, #t~string126.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string126.base, #t~string126.offset, 1);call write~init~int(37, #t~string126.base, 1 + #t~string126.offset, 1);call write~init~int(105, #t~string126.base, 2 + #t~string126.offset, 1);call write~init~int(0, #t~string126.base, 3 + #t~string126.offset, 1);call #t~string128.base, #t~string128.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string128.base, #t~string128.offset, 1);call write~init~int(37, #t~string128.base, 1 + #t~string128.offset, 1);call write~init~int(105, #t~string128.base, 2 + #t~string128.offset, 1);call write~init~int(0, #t~string128.base, 3 + #t~string128.offset, 1);call #t~string130.base, #t~string130.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string130.base, #t~string130.offset, 1);call write~init~int(37, #t~string130.base, 1 + #t~string130.offset, 1);call write~init~int(105, #t~string130.base, 2 + #t~string130.offset, 1);call write~init~int(0, #t~string130.base, 3 + #t~string130.offset, 1);call #t~string132.base, #t~string132.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string132.base, #t~string132.offset, 1);call write~init~int(37, #t~string132.base, 1 + #t~string132.offset, 1);call write~init~int(105, #t~string132.base, 2 + #t~string132.offset, 1);call write~init~int(0, #t~string132.base, 3 + #t~string132.offset, 1);call #t~string134.base, #t~string134.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string134.base, #t~string134.offset, 1);call write~init~int(37, #t~string134.base, 1 + #t~string134.offset, 1);call write~init~int(105, #t~string134.base, 2 + #t~string134.offset, 1);call write~init~int(0, #t~string134.base, 3 + #t~string134.offset, 1);call #t~string136.base, #t~string136.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string136.base, #t~string136.offset, 1);call write~init~int(70, #t~string136.base, 1 + #t~string136.offset, 1);call write~init~int(95, #t~string136.base, 2 + #t~string136.offset, 1);call write~init~int(112, #t~string136.base, 3 + #t~string136.offset, 1);call write~init~int(58, #t~string136.base, 4 + #t~string136.offset, 1);call write~init~int(0, #t~string136.base, 5 + #t~string136.offset, 1);call #t~string139.base, #t~string139.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string139.base, #t~string139.offset, 1);call write~init~int(37, #t~string139.base, 1 + #t~string139.offset, 1);call write~init~int(105, #t~string139.base, 2 + #t~string139.offset, 1);call write~init~int(0, #t~string139.base, 3 + #t~string139.offset, 1);call #t~string142.base, #t~string142.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string142.base, #t~string142.offset, 1);call write~init~int(37, #t~string142.base, 1 + #t~string142.offset, 1);call write~init~int(105, #t~string142.base, 2 + #t~string142.offset, 1);call write~init~int(0, #t~string142.base, 3 + #t~string142.offset, 1);call #t~string145.base, #t~string145.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string145.base, #t~string145.offset, 1);call write~init~int(37, #t~string145.base, 1 + #t~string145.offset, 1);call write~init~int(105, #t~string145.base, 2 + #t~string145.offset, 1);call write~init~int(0, #t~string145.base, 3 + #t~string145.offset, 1);call #t~string148.base, #t~string148.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string148.base, #t~string148.offset, 1);call write~init~int(37, #t~string148.base, 1 + #t~string148.offset, 1);call write~init~int(105, #t~string148.base, 2 + #t~string148.offset, 1);call write~init~int(0, #t~string148.base, 3 + #t~string148.offset, 1);call #t~string151.base, #t~string151.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string151.base, #t~string151.offset, 1);call write~init~int(37, #t~string151.base, 1 + #t~string151.offset, 1);call write~init~int(105, #t~string151.base, 2 + #t~string151.offset, 1);call write~init~int(0, #t~string151.base, 3 + #t~string151.offset, 1);call #t~string153.base, #t~string153.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string153.base, #t~string153.offset, 1);call write~init~int(0, #t~string153.base, 1 + #t~string153.offset, 1);~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 87308#L-1 havoc main_#res;havoc main_#t~ret54, main_~retValue_acc~4, main_~tmp~13;havoc main_~retValue_acc~4;havoc main_~tmp~13; 86847#L3286 havoc valid_product_#res;havoc valid_product_~retValue_acc~26;havoc valid_product_~retValue_acc~26;valid_product_~retValue_acc~26 := 1;valid_product_#res := valid_product_~retValue_acc~26; 86848#L3294 main_#t~ret54 := valid_product_#res;main_~tmp~13 := main_#t~ret54;havoc main_#t~ret54; 88013#L850 assume 0 != main_~tmp~13; 86681#L819 ~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 86682#L3119 havoc bigMacCall_#t~ret47, bigMacCall_~tmp~10;havoc bigMacCall_~tmp~10;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~28;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~28; 87628#L3342 assume 0 == getOrigin_~person;getOrigin_~retValue_acc~28 := 4;getOrigin_#res := getOrigin_~retValue_acc~28; 87210#L3367 bigMacCall_#t~ret47 := getOrigin_#res;bigMacCall_~tmp~10 := bigMacCall_#t~ret47;havoc bigMacCall_#t~ret47;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~10;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 87211#L2776 assume 0 == initPersonOnFloor_~floor; 88577#L2777 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 86773#L2884-1 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 87356#L2568 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 86717#L2580-2 havoc cleanup_#t~ret48, cleanup_#t~ret49, cleanup_~i~2, cleanup_~tmp~11, cleanup_~tmp___0~2, cleanup_~__cil_tmp4~2;havoc cleanup_~i~2;havoc cleanup_~tmp~11;havoc cleanup_~tmp___0~2;havoc cleanup_~__cil_tmp4~2;havoc timeShift_#t~ret97, timeShift_#t~ret98, timeShift_#t~ret99, timeShift_#t~ret100, timeShift_#t~ret101, timeShift_#t~ret102, timeShift_#t~ret103, timeShift_#t~ret104, timeShift_#t~ret105, timeShift_#t~ret106, timeShift_#t~ret107, timeShift_~tmp~25, timeShift_~tmp___0~10, timeShift_~tmp___1~6, timeShift_~tmp___2~4, timeShift_~tmp___3~3, timeShift_~tmp___4~2, timeShift_~tmp___5~2, timeShift_~tmp___6~2, timeShift_~tmp___7~2, timeShift_~tmp___8~2, timeShift_~tmp___9~2;havoc timeShift_~tmp~25;havoc timeShift_~tmp___0~10;havoc timeShift_~tmp___1~6;havoc timeShift_~tmp___2~4;havoc timeShift_~tmp___3~3;havoc timeShift_~tmp___4~2;havoc timeShift_~tmp___5~2;havoc timeShift_~tmp___6~2;havoc timeShift_~tmp___7~2;havoc timeShift_~tmp___8~2;havoc timeShift_~tmp___9~2;havoc stopRequestedAtCurrentFloor_#res;havoc stopRequestedAtCurrentFloor_#t~ret81, stopRequestedAtCurrentFloor_#t~ret82, stopRequestedAtCurrentFloor_#t~ret83, stopRequestedAtCurrentFloor_#t~ret84, stopRequestedAtCurrentFloor_~retValue_acc~17, stopRequestedAtCurrentFloor_~tmp~23, stopRequestedAtCurrentFloor_~tmp___0~8;havoc stopRequestedAtCurrentFloor_~retValue_acc~17;havoc stopRequestedAtCurrentFloor_~tmp~23;havoc stopRequestedAtCurrentFloor_~tmp___0~8;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 86728#L2505 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 87325#L2532 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 87326#L2409 stopRequestedAtCurrentFloor_#t~ret81 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~23 := stopRequestedAtCurrentFloor_#t~ret81;havoc stopRequestedAtCurrentFloor_#t~ret81; 88059#L1793 assume 0 != stopRequestedAtCurrentFloor_~tmp~23;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 86906#L1124 stopRequestedAtCurrentFloor_#t~ret82 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~8 := stopRequestedAtCurrentFloor_#t~ret82;havoc stopRequestedAtCurrentFloor_#t~ret82; 86907#L1797 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~8);stopRequestedAtCurrentFloor_~retValue_acc~17 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~17; 88005#L1810 timeShift_#t~ret97 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret97;havoc timeShift_#t~ret97; 89619#L1946 assume !(0 != timeShift_~tmp___9~2); 89621#L2037 assume !(1 == ~doorState~0); 89481#L2037-2 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret75, stopRequestedInDirection_#t~ret76, stopRequestedInDirection_#t~ret77, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~14, stopRequestedInDirection_~tmp~20, stopRequestedInDirection_~tmp___0~6, stopRequestedInDirection_~__cil_tmp7~5, stopRequestedInDirection_~__cil_tmp8~5;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~14;havoc stopRequestedInDirection_~tmp~20;havoc stopRequestedInDirection_~tmp___0~6;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 89482#L2505-3 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 87332#L2532-3 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 87333#L2409-1 stopRequestedInDirection_#t~ret75 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~6 := stopRequestedInDirection_#t~ret75;havoc stopRequestedInDirection_#t~ret75; 88781#L1676 assume 0 != stopRequestedInDirection_~tmp___0~6;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 86910#L1124-1 stopRequestedInDirection_#t~ret76 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~20 := stopRequestedInDirection_#t~ret76;havoc stopRequestedInDirection_#t~ret76;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~20 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~14 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~14; 86911#L1689 timeShift_#t~ret104 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret104;havoc timeShift_#t~ret104; 87462#L2045 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret78, continueInDirection_~dir, continueInDirection_~tmp~21;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~21;~currentHeading~0 := continueInDirection_~dir; 87464#L1733 assume !(1 == ~currentHeading~0); 90070#L1743 assume !(0 == ~currentFloorID~0); 90067#L1743-2 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 90058#L1749-5 havoc __utac_acc__Specification9_spec__3_#t~ret156, __utac_acc__Specification9_spec__3_#t~ret157, __utac_acc__Specification9_spec__3_#t~ret158, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~27, __utac_acc__Specification9_spec__3_~tmp___0~12, __utac_acc__Specification9_spec__3_~tmp___1~8;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~27;havoc __utac_acc__Specification9_spec__3_~tmp___0~12;havoc __utac_acc__Specification9_spec__3_~tmp___1~8;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 90054#L1124-3 __utac_acc__Specification9_spec__3_#t~ret156 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~27 := __utac_acc__Specification9_spec__3_#t~ret156;havoc __utac_acc__Specification9_spec__3_#t~ret156;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~27;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~10;havoc isEmpty_~retValue_acc~10; 90055#L1184-6 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~10 := 0;isEmpty_#res := isEmpty_~retValue_acc~10; 90042#L1216-6 __utac_acc__Specification9_spec__3_#t~ret157 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~8 := __utac_acc__Specification9_spec__3_#t~ret157;havoc __utac_acc__Specification9_spec__3_#t~ret157; 91055#L3162 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~8);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~7;havoc areDoorsOpen_~retValue_acc~7;areDoorsOpen_~retValue_acc~7 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~7; 90029#L1133 __utac_acc__Specification9_spec__3_#t~ret158 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~12 := __utac_acc__Specification9_spec__3_#t~ret158;havoc __utac_acc__Specification9_spec__3_#t~ret158; 90032#L3172 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___0~12); 90024#L3172-1 cleanup_~i~2 := 0; 90022#L651-2 [2019-01-14 04:06:31,787 INFO L796 eck$LassoCheckResult]: Loop: 90022#L651-2 assume !false; 90021#L652 cleanup_~__cil_tmp4~2 := ~cleanupTimeShifts~0 - 1; 90020#L655 assume cleanup_~i~2 < cleanup_~__cil_tmp4~2;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~5;havoc isBlocked_~retValue_acc~5;isBlocked_~retValue_acc~5 := 0;isBlocked_#res := isBlocked_~retValue_acc~5; 90019#L946 cleanup_#t~ret48 := isBlocked_#res;cleanup_~tmp___0~2 := cleanup_#t~ret48;havoc cleanup_#t~ret48; 90018#L659 assume 1 != cleanup_~tmp___0~2; 90013#L659-1 havoc isIdle_#res;havoc isIdle_#t~ret63, isIdle_~retValue_acc~12, isIdle_~tmp~18;havoc isIdle_~retValue_acc~12;havoc isIdle_~tmp~18;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret58, anyStopRequested_#t~ret59, anyStopRequested_#t~ret60, anyStopRequested_#t~ret61, anyStopRequested_#t~ret62, anyStopRequested_~retValue_acc~11, anyStopRequested_~tmp~17, anyStopRequested_~tmp___0~4, anyStopRequested_~tmp___1~3, anyStopRequested_~tmp___2~1, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~11;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~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 90008#L2505-25 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 89995#L2532-25 anyStopRequested_#t~ret58 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret58;havoc anyStopRequested_#t~ret58; 89985#L1232 assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~11 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~11; 89976#L1296 isIdle_#t~ret63 := anyStopRequested_#res;isIdle_~tmp~18 := isIdle_#t~ret63;havoc isIdle_#t~ret63;isIdle_~retValue_acc~12 := (if 0 == isIdle_~tmp~18 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~12; 89975#L1309 cleanup_#t~ret49 := isIdle_#res;cleanup_~tmp~11 := cleanup_#t~ret49;havoc cleanup_#t~ret49; 89974#L671 assume !(0 != cleanup_~tmp~11);havoc timeShift_#t~ret97, timeShift_#t~ret98, timeShift_#t~ret99, timeShift_#t~ret100, timeShift_#t~ret101, timeShift_#t~ret102, timeShift_#t~ret103, timeShift_#t~ret104, timeShift_#t~ret105, timeShift_#t~ret106, timeShift_#t~ret107, timeShift_~tmp~25, timeShift_~tmp___0~10, timeShift_~tmp___1~6, timeShift_~tmp___2~4, timeShift_~tmp___3~3, timeShift_~tmp___4~2, timeShift_~tmp___5~2, timeShift_~tmp___6~2, timeShift_~tmp___7~2, timeShift_~tmp___8~2, timeShift_~tmp___9~2;havoc timeShift_~tmp~25;havoc timeShift_~tmp___0~10;havoc timeShift_~tmp___1~6;havoc timeShift_~tmp___2~4;havoc timeShift_~tmp___3~3;havoc timeShift_~tmp___4~2;havoc timeShift_~tmp___5~2;havoc timeShift_~tmp___6~2;havoc timeShift_~tmp___7~2;havoc timeShift_~tmp___8~2;havoc timeShift_~tmp___9~2;havoc stopRequestedAtCurrentFloor_#res;havoc stopRequestedAtCurrentFloor_#t~ret81, stopRequestedAtCurrentFloor_#t~ret82, stopRequestedAtCurrentFloor_#t~ret83, stopRequestedAtCurrentFloor_#t~ret84, stopRequestedAtCurrentFloor_~retValue_acc~17, stopRequestedAtCurrentFloor_~tmp~23, stopRequestedAtCurrentFloor_~tmp___0~8;havoc stopRequestedAtCurrentFloor_~retValue_acc~17;havoc stopRequestedAtCurrentFloor_~tmp~23;havoc stopRequestedAtCurrentFloor_~tmp___0~8;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 89973#L2505-30 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 89966#L2532-30 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 89972#L2409-3 stopRequestedAtCurrentFloor_#t~ret81 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~23 := stopRequestedAtCurrentFloor_#t~ret81;havoc stopRequestedAtCurrentFloor_#t~ret81; 89970#L1793-1 assume 0 != stopRequestedAtCurrentFloor_~tmp~23;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 89968#L1124-4 stopRequestedAtCurrentFloor_#t~ret82 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~8 := stopRequestedAtCurrentFloor_#t~ret82;havoc stopRequestedAtCurrentFloor_#t~ret82; 89969#L1797-1 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~8);stopRequestedAtCurrentFloor_~retValue_acc~17 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~17; 92205#L1810-1 timeShift_#t~ret97 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret97;havoc timeShift_#t~ret97; 92201#L1946-1 assume !(0 != timeShift_~tmp___9~2); 92161#L2037-3 assume 1 == ~doorState~0;~doorState~0 := 0; 92155#L2037-5 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret75, stopRequestedInDirection_#t~ret76, stopRequestedInDirection_#t~ret77, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~14, stopRequestedInDirection_~tmp~20, stopRequestedInDirection_~tmp___0~6, stopRequestedInDirection_~__cil_tmp7~5, stopRequestedInDirection_~__cil_tmp8~5;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~14;havoc stopRequestedInDirection_~tmp~20;havoc stopRequestedInDirection_~tmp___0~6;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 92153#L2505-33 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 92110#L2532-33 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 92107#L2409-4 stopRequestedInDirection_#t~ret75 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~6 := stopRequestedInDirection_#t~ret75;havoc stopRequestedInDirection_#t~ret75; 92104#L1676-2 assume 0 != stopRequestedInDirection_~tmp___0~6;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 92011#L1124-5 stopRequestedInDirection_#t~ret76 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~20 := stopRequestedInDirection_#t~ret76;havoc stopRequestedInDirection_#t~ret76;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~20 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~14 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~14; 92009#L1689-2 timeShift_#t~ret104 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret104;havoc timeShift_#t~ret104; 92006#L2045-1 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret78, continueInDirection_~dir, continueInDirection_~tmp~21;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~21;~currentHeading~0 := continueInDirection_~dir; 92004#L1733-3 assume !(1 == ~currentHeading~0); 92001#L1743-9 assume !(0 == ~currentFloorID~0); 91995#L1743-11 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 91988#L1749-11 havoc __utac_acc__Specification9_spec__3_#t~ret156, __utac_acc__Specification9_spec__3_#t~ret157, __utac_acc__Specification9_spec__3_#t~ret158, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~27, __utac_acc__Specification9_spec__3_~tmp___0~12, __utac_acc__Specification9_spec__3_~tmp___1~8;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~27;havoc __utac_acc__Specification9_spec__3_~tmp___0~12;havoc __utac_acc__Specification9_spec__3_~tmp___1~8;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 92564#L1124-7 __utac_acc__Specification9_spec__3_#t~ret156 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~27 := __utac_acc__Specification9_spec__3_#t~ret156;havoc __utac_acc__Specification9_spec__3_#t~ret156;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~27;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~10;havoc isEmpty_~retValue_acc~10; 91093#L1184-13 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~10 := 0;isEmpty_#res := isEmpty_~retValue_acc~10; 91085#L1216-13 __utac_acc__Specification9_spec__3_#t~ret157 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~8 := __utac_acc__Specification9_spec__3_#t~ret157;havoc __utac_acc__Specification9_spec__3_#t~ret157; 91103#L3162-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~8);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~7;havoc areDoorsOpen_~retValue_acc~7;areDoorsOpen_~retValue_acc~7 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~7; 91097#L1133-1 __utac_acc__Specification9_spec__3_#t~ret158 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~12 := __utac_acc__Specification9_spec__3_#t~ret158;havoc __utac_acc__Specification9_spec__3_#t~ret158; 91098#L3172-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___0~12); 90023#L3172-3 cleanup_~i~2 := 1 + cleanup_~i~2; 90022#L651-2 [2019-01-14 04:06:31,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:06:31,788 INFO L82 PathProgramCache]: Analyzing trace with hash 509077176, now seen corresponding path program 1 times [2019-01-14 04:06:31,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:06:31,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:06:31,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:06:31,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:06:31,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:06:31,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:06:31,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:06:31,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:06:31,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:06:31,924 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:06:31,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:06:31,924 INFO L82 PathProgramCache]: Analyzing trace with hash -800740888, now seen corresponding path program 1 times [2019-01-14 04:06:31,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:06:31,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:06:31,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:06:31,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:06:31,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:06:31,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:06:31,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:06:33,004 WARN L181 SmtUtils]: Spent 984.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 165 [2019-01-14 04:06:34,066 WARN L181 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 157 DAG size of output: 129 [2019-01-14 04:06:34,084 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:06:34,085 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:06:34,085 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:06:34,085 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:06:34,085 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:06:34,086 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:06:34,086 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:06:34,086 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:06:34,086 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec9_product27_true-unreach-call_true-termination.cil.c_Iteration4_Loop [2019-01-14 04:06:34,086 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:06:34,086 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:06:34,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:34,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:34,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:34,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:34,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:34,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:34,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:34,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:34,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:34,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:34,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:34,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:34,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:34,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:34,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:34,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:34,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:34,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:34,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:34,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:34,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:34,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:34,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:34,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:34,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:34,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:34,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:34,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:34,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:34,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:34,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:34,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:34,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:34,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:34,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:34,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:34,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:34,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:34,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:34,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:34,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:34,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:34,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:34,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:34,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:34,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:34,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:34,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:34,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:34,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:34,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:34,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:34,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:34,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:34,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:34,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:34,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:34,810 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-14 04:06:34,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:34,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:34,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:34,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:34,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:34,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:35,778 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:06:35,779 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:06:35,794 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:06:35,794 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:06:35,806 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:06:35,806 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_~tmp___7~2=0} Honda state: {ULTIMATE.start_timeShift_~tmp___7~2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:06:35,851 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:06:35,852 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:06:35,867 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:06:35,867 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_#t~ret101=0} Honda state: {ULTIMATE.start_timeShift_#t~ret101=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 04:06:35,911 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:06:35,912 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:06:35,919 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:06:35,919 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_#t~ret103=0} Honda state: {ULTIMATE.start_timeShift_#t~ret103=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:06:35,946 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:06:35,946 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:06:35,950 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:06:35,950 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_#t~ret104=0} Honda state: {ULTIMATE.start_timeShift_#t~ret104=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:06:35,983 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:06:35,983 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:06:36,017 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:06:36,017 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:06:36,074 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:06:36,077 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:06:36,077 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:06:36,077 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:06:36,077 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:06:36,077 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:06:36,078 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:06:36,078 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:06:36,078 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:06:36,078 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec9_product27_true-unreach-call_true-termination.cil.c_Iteration4_Loop [2019-01-14 04:06:36,078 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:06:36,078 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:06:36,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:36,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:36,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:36,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:36,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:36,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:36,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:36,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:36,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:36,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:36,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:36,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:36,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:36,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:36,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:36,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:36,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:36,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:36,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:36,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:36,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:36,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:36,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:36,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:36,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:36,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:36,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:36,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:36,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:36,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:36,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:36,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:36,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:36,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:36,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:36,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:36,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:36,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:36,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:36,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:36,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:36,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:36,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:36,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:36,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:36,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:36,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:36,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:36,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:36,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:36,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:36,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:36,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:37,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:37,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:37,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:37,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:37,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:37,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:37,277 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-14 04:06:37,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:37,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:37,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:37,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:06:37,932 WARN L181 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2019-01-14 04:06:38,507 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:06:38,513 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:06:38,516 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:06:38,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:06:38,518 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:06:38,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:06:38,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:06:38,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:06:38,526 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:06:38,526 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:06:38,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:06:38,530 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:06:38,534 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:06:38,535 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:06:38,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:06:38,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:06:38,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:06:38,536 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:06:38,539 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:06:38,539 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:06:38,540 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:06:38,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:06:38,540 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:06:38,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:06:38,546 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:06:38,546 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:06:38,546 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:06:38,546 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:06:38,547 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:06:38,548 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:06:38,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:06:38,548 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:06:38,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:06:38,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:06:38,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:06:38,553 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:06:38,553 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:06:38,558 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:06:38,559 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:06:38,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:06:38,559 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:06:38,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:06:38,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:06:38,560 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:06:38,560 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:06:38,560 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:06:38,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:06:38,567 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:06:38,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:06:38,568 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:06:38,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:06:38,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:06:38,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:06:38,568 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:06:38,568 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:06:38,569 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:06:38,570 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:06:38,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:06:38,570 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:06:38,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:06:38,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:06:38,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:06:38,571 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:06:38,571 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:06:38,571 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:06:38,574 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:06:38,575 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:06:38,575 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:06:38,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:06:38,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:06:38,575 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:06:38,576 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:06:38,576 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:06:38,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:06:38,582 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:06:38,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:06:38,583 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:06:38,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:06:38,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:06:38,583 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:06:38,585 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:06:38,585 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:06:38,596 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:06:38,604 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:06:38,604 INFO L444 ModelExtractionUtils]: 9 out of 12 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:06:38,609 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:06:38,609 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:06:38,613 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:06:38,613 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~currentFloorID~0) = 1*~currentFloorID~0 Supporting invariants [] [2019-01-14 04:06:38,614 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:06:38,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:06:38,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:06:38,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:06:38,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:06:38,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:06:40,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:06:40,632 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 13 loop predicates [2019-01-14 04:06:40,633 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11270 states and 21101 transitions. cyclomatic complexity: 9833 Second operand 15 states. [2019-01-14 04:06:41,483 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-14 04:06:42,336 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-14 04:06:47,275 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 22 [2019-01-14 04:06:50,467 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 32 [2019-01-14 04:06:53,304 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 20 [2019-01-14 04:06:58,679 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11270 states and 21101 transitions. cyclomatic complexity: 9833. Second operand 15 states. Result 141139 states and 262413 transitions. Complement of second has 168 states. [2019-01-14 04:06:58,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 85 states 1 stem states 82 non-accepting loop states 1 accepting loop states [2019-01-14 04:06:58,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-14 04:06:58,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 35465 transitions. [2019-01-14 04:06:58,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 35465 transitions. Stem has 42 letters. Loop has 40 letters. [2019-01-14 04:06:58,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:06:58,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 35465 transitions. Stem has 82 letters. Loop has 40 letters. [2019-01-14 04:06:58,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:06:58,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 85 states and 35465 transitions. Stem has 42 letters. Loop has 80 letters. [2019-01-14 04:06:58,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:06:58,724 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 141139 states and 262413 transitions. [2019-01-14 04:06:59,264 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 52250 [2019-01-14 04:07:00,573 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 141139 states to 133363 states and 247753 transitions. [2019-01-14 04:07:00,573 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72191 [2019-01-14 04:07:00,627 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72198 [2019-01-14 04:07:00,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 133363 states and 247753 transitions. [2019-01-14 04:07:00,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:07:00,635 INFO L706 BuchiCegarLoop]: Abstraction has 133363 states and 247753 transitions. [2019-01-14 04:07:00,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133363 states and 247753 transitions. [2019-01-14 04:07:01,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133363 to 32595. [2019-01-14 04:07:01,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32595 states. [2019-01-14 04:07:01,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32595 states to 32595 states and 60791 transitions. [2019-01-14 04:07:01,971 INFO L729 BuchiCegarLoop]: Abstraction has 32595 states and 60791 transitions. [2019-01-14 04:07:01,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:07:01,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:07:01,972 INFO L87 Difference]: Start difference. First operand 32595 states and 60791 transitions. Second operand 3 states. [2019-01-14 04:07:02,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:07:02,252 INFO L93 Difference]: Finished difference Result 32595 states and 60785 transitions. [2019-01-14 04:07:02,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:07:02,254 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32595 states and 60785 transitions. [2019-01-14 04:07:02,387 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 16103 [2019-01-14 04:07:02,502 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32595 states to 32595 states and 60785 transitions. [2019-01-14 04:07:02,503 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21929 [2019-01-14 04:07:02,523 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21929 [2019-01-14 04:07:02,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32595 states and 60785 transitions. [2019-01-14 04:07:02,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:07:02,531 INFO L706 BuchiCegarLoop]: Abstraction has 32595 states and 60785 transitions. [2019-01-14 04:07:02,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32595 states and 60785 transitions. [2019-01-14 04:07:02,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32595 to 32595. [2019-01-14 04:07:02,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32595 states. [2019-01-14 04:07:02,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32595 states to 32595 states and 60785 transitions. [2019-01-14 04:07:02,954 INFO L729 BuchiCegarLoop]: Abstraction has 32595 states and 60785 transitions. [2019-01-14 04:07:02,954 INFO L609 BuchiCegarLoop]: Abstraction has 32595 states and 60785 transitions. [2019-01-14 04:07:02,954 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 04:07:02,954 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32595 states and 60785 transitions. [2019-01-14 04:07:03,044 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 16103 [2019-01-14 04:07:03,044 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:07:03,044 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:07:03,049 INFO L867 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] [2019-01-14 04:07:03,049 INFO L868 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:07:03,050 INFO L794 eck$LassoCheckResult]: Stem: 305835#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(30);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(9);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(21);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(30);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(9);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(21);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(30);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(9);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(25);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(25);~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~cleanupTimeShifts~0 := 12;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0;call #t~string108.base, #t~string108.offset := #Ultimate.allocOnStack(10);call #t~string110.base, #t~string110.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string110.base, #t~string110.offset, 1);call write~init~int(95, #t~string110.base, 1 + #t~string110.offset, 1);call write~init~int(93, #t~string110.base, 2 + #t~string110.offset, 1);call write~init~int(0, #t~string110.base, 3 + #t~string110.offset, 1);call #t~string112.base, #t~string112.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string112.base, #t~string112.offset, 1);call write~init~int(93, #t~string112.base, 1 + #t~string112.offset, 1);call write~init~int(32, #t~string112.base, 2 + #t~string112.offset, 1);call write~init~int(0, #t~string112.base, 3 + #t~string112.offset, 1);call #t~string114.base, #t~string114.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string114.base, #t~string114.offset, 1);call write~init~int(97, #t~string114.base, 1 + #t~string114.offset, 1);call write~init~int(116, #t~string114.base, 2 + #t~string114.offset, 1);call write~init~int(32, #t~string114.base, 3 + #t~string114.offset, 1);call write~init~int(0, #t~string114.base, 4 + #t~string114.offset, 1);call #t~string116.base, #t~string116.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string116.base, #t~string116.offset, 1);call write~init~int(105, #t~string116.base, 1 + #t~string116.offset, 1);call write~init~int(0, #t~string116.base, 2 + #t~string116.offset, 1);call #t~string118.base, #t~string118.offset := #Ultimate.allocOnStack(10);call #t~string120.base, #t~string120.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string120.base, #t~string120.offset, 1);call write~init~int(112, #t~string120.base, 1 + #t~string120.offset, 1);call write~init~int(0, #t~string120.base, 2 + #t~string120.offset, 1);call #t~string122.base, #t~string122.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string122.base, #t~string122.offset, 1);call write~init~int(111, #t~string122.base, 1 + #t~string122.offset, 1);call write~init~int(119, #t~string122.base, 2 + #t~string122.offset, 1);call write~init~int(110, #t~string122.base, 3 + #t~string122.offset, 1);call write~init~int(0, #t~string122.base, 4 + #t~string122.offset, 1);call #t~string124.base, #t~string124.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string124.base, #t~string124.offset, 1);call write~init~int(73, #t~string124.base, 1 + #t~string124.offset, 1);call write~init~int(76, #t~string124.base, 2 + #t~string124.offset, 1);call write~init~int(95, #t~string124.base, 3 + #t~string124.offset, 1);call write~init~int(112, #t~string124.base, 4 + #t~string124.offset, 1);call write~init~int(58, #t~string124.base, 5 + #t~string124.offset, 1);call write~init~int(0, #t~string124.base, 6 + #t~string124.offset, 1);call #t~string126.base, #t~string126.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string126.base, #t~string126.offset, 1);call write~init~int(37, #t~string126.base, 1 + #t~string126.offset, 1);call write~init~int(105, #t~string126.base, 2 + #t~string126.offset, 1);call write~init~int(0, #t~string126.base, 3 + #t~string126.offset, 1);call #t~string128.base, #t~string128.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string128.base, #t~string128.offset, 1);call write~init~int(37, #t~string128.base, 1 + #t~string128.offset, 1);call write~init~int(105, #t~string128.base, 2 + #t~string128.offset, 1);call write~init~int(0, #t~string128.base, 3 + #t~string128.offset, 1);call #t~string130.base, #t~string130.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string130.base, #t~string130.offset, 1);call write~init~int(37, #t~string130.base, 1 + #t~string130.offset, 1);call write~init~int(105, #t~string130.base, 2 + #t~string130.offset, 1);call write~init~int(0, #t~string130.base, 3 + #t~string130.offset, 1);call #t~string132.base, #t~string132.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string132.base, #t~string132.offset, 1);call write~init~int(37, #t~string132.base, 1 + #t~string132.offset, 1);call write~init~int(105, #t~string132.base, 2 + #t~string132.offset, 1);call write~init~int(0, #t~string132.base, 3 + #t~string132.offset, 1);call #t~string134.base, #t~string134.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string134.base, #t~string134.offset, 1);call write~init~int(37, #t~string134.base, 1 + #t~string134.offset, 1);call write~init~int(105, #t~string134.base, 2 + #t~string134.offset, 1);call write~init~int(0, #t~string134.base, 3 + #t~string134.offset, 1);call #t~string136.base, #t~string136.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string136.base, #t~string136.offset, 1);call write~init~int(70, #t~string136.base, 1 + #t~string136.offset, 1);call write~init~int(95, #t~string136.base, 2 + #t~string136.offset, 1);call write~init~int(112, #t~string136.base, 3 + #t~string136.offset, 1);call write~init~int(58, #t~string136.base, 4 + #t~string136.offset, 1);call write~init~int(0, #t~string136.base, 5 + #t~string136.offset, 1);call #t~string139.base, #t~string139.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string139.base, #t~string139.offset, 1);call write~init~int(37, #t~string139.base, 1 + #t~string139.offset, 1);call write~init~int(105, #t~string139.base, 2 + #t~string139.offset, 1);call write~init~int(0, #t~string139.base, 3 + #t~string139.offset, 1);call #t~string142.base, #t~string142.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string142.base, #t~string142.offset, 1);call write~init~int(37, #t~string142.base, 1 + #t~string142.offset, 1);call write~init~int(105, #t~string142.base, 2 + #t~string142.offset, 1);call write~init~int(0, #t~string142.base, 3 + #t~string142.offset, 1);call #t~string145.base, #t~string145.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string145.base, #t~string145.offset, 1);call write~init~int(37, #t~string145.base, 1 + #t~string145.offset, 1);call write~init~int(105, #t~string145.base, 2 + #t~string145.offset, 1);call write~init~int(0, #t~string145.base, 3 + #t~string145.offset, 1);call #t~string148.base, #t~string148.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string148.base, #t~string148.offset, 1);call write~init~int(37, #t~string148.base, 1 + #t~string148.offset, 1);call write~init~int(105, #t~string148.base, 2 + #t~string148.offset, 1);call write~init~int(0, #t~string148.base, 3 + #t~string148.offset, 1);call #t~string151.base, #t~string151.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string151.base, #t~string151.offset, 1);call write~init~int(37, #t~string151.base, 1 + #t~string151.offset, 1);call write~init~int(105, #t~string151.base, 2 + #t~string151.offset, 1);call write~init~int(0, #t~string151.base, 3 + #t~string151.offset, 1);call #t~string153.base, #t~string153.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string153.base, #t~string153.offset, 1);call write~init~int(0, #t~string153.base, 1 + #t~string153.offset, 1);~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 305836#L-1 havoc main_#res;havoc main_#t~ret54, main_~retValue_acc~4, main_~tmp~13;havoc main_~retValue_acc~4;havoc main_~tmp~13; 305148#L3286 havoc valid_product_#res;havoc valid_product_~retValue_acc~26;havoc valid_product_~retValue_acc~26;valid_product_~retValue_acc~26 := 1;valid_product_#res := valid_product_~retValue_acc~26; 305149#L3294 main_#t~ret54 := valid_product_#res;main_~tmp~13 := main_#t~ret54;havoc main_#t~ret54; 306866#L850 assume 0 != main_~tmp~13; 304886#L819 ~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 304887#L3119 havoc bigMacCall_#t~ret47, bigMacCall_~tmp~10;havoc bigMacCall_~tmp~10;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~28;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~28; 306296#L3342 assume !(0 == getOrigin_~person); 306297#L3346 assume !(1 == getOrigin_~person); 307992#L3350 assume !(2 == getOrigin_~person); 307993#L3354 assume !(3 == getOrigin_~person); 309141#L3358 assume !(4 == getOrigin_~person); 308644#L3362 assume 5 == getOrigin_~person;getOrigin_~retValue_acc~28 := 1;getOrigin_#res := getOrigin_~retValue_acc~28; 305722#L3367 bigMacCall_#t~ret47 := getOrigin_#res;bigMacCall_~tmp~10 := bigMacCall_#t~ret47;havoc bigMacCall_#t~ret47;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~10;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 305723#L2776 assume 0 == initPersonOnFloor_~floor; 307758#L2777 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 305026#L2884-1 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 305899#L2568 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 304941#L2580-2 havoc cleanup_#t~ret48, cleanup_#t~ret49, cleanup_~i~2, cleanup_~tmp~11, cleanup_~tmp___0~2, cleanup_~__cil_tmp4~2;havoc cleanup_~i~2;havoc cleanup_~tmp~11;havoc cleanup_~tmp___0~2;havoc cleanup_~__cil_tmp4~2;havoc timeShift_#t~ret97, timeShift_#t~ret98, timeShift_#t~ret99, timeShift_#t~ret100, timeShift_#t~ret101, timeShift_#t~ret102, timeShift_#t~ret103, timeShift_#t~ret104, timeShift_#t~ret105, timeShift_#t~ret106, timeShift_#t~ret107, timeShift_~tmp~25, timeShift_~tmp___0~10, timeShift_~tmp___1~6, timeShift_~tmp___2~4, timeShift_~tmp___3~3, timeShift_~tmp___4~2, timeShift_~tmp___5~2, timeShift_~tmp___6~2, timeShift_~tmp___7~2, timeShift_~tmp___8~2, timeShift_~tmp___9~2;havoc timeShift_~tmp~25;havoc timeShift_~tmp___0~10;havoc timeShift_~tmp___1~6;havoc timeShift_~tmp___2~4;havoc timeShift_~tmp___3~3;havoc timeShift_~tmp___4~2;havoc timeShift_~tmp___5~2;havoc timeShift_~tmp___6~2;havoc timeShift_~tmp___7~2;havoc timeShift_~tmp___8~2;havoc timeShift_~tmp___9~2;havoc stopRequestedAtCurrentFloor_#res;havoc stopRequestedAtCurrentFloor_#t~ret81, stopRequestedAtCurrentFloor_#t~ret82, stopRequestedAtCurrentFloor_#t~ret83, stopRequestedAtCurrentFloor_#t~ret84, stopRequestedAtCurrentFloor_~retValue_acc~17, stopRequestedAtCurrentFloor_~tmp~23, stopRequestedAtCurrentFloor_~tmp___0~8;havoc stopRequestedAtCurrentFloor_~retValue_acc~17;havoc stopRequestedAtCurrentFloor_~tmp~23;havoc stopRequestedAtCurrentFloor_~tmp___0~8;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 304947#L2505 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 306316#L2532 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 309307#L2409 stopRequestedAtCurrentFloor_#t~ret81 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~23 := stopRequestedAtCurrentFloor_#t~ret81;havoc stopRequestedAtCurrentFloor_#t~ret81; 309305#L1793 assume 0 != stopRequestedAtCurrentFloor_~tmp~23;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 309303#L1124 stopRequestedAtCurrentFloor_#t~ret82 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~8 := stopRequestedAtCurrentFloor_#t~ret82;havoc stopRequestedAtCurrentFloor_#t~ret82; 309300#L1797 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~8);stopRequestedAtCurrentFloor_~retValue_acc~17 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~17; 307241#L1810 timeShift_#t~ret97 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret97;havoc timeShift_#t~ret97; 307242#L1946 assume !(0 != timeShift_~tmp___9~2); 309128#L2037 assume !(1 == ~doorState~0); 309094#L2037-2 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret75, stopRequestedInDirection_#t~ret76, stopRequestedInDirection_#t~ret77, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~14, stopRequestedInDirection_~tmp~20, stopRequestedInDirection_~tmp___0~6, stopRequestedInDirection_~__cil_tmp7~5, stopRequestedInDirection_~__cil_tmp8~5;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~14;havoc stopRequestedInDirection_~tmp~20;havoc stopRequestedInDirection_~tmp___0~6;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 309095#L2505-3 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 305871#L2532-3 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 305872#L2409-1 stopRequestedInDirection_#t~ret75 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~6 := stopRequestedInDirection_#t~ret75;havoc stopRequestedInDirection_#t~ret75; 308058#L1676 assume 0 != stopRequestedInDirection_~tmp___0~6;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 308060#L1124-1 stopRequestedInDirection_#t~ret76 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~20 := stopRequestedInDirection_#t~ret76;havoc stopRequestedInDirection_#t~ret76;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~20 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~14 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~14; 309529#L1689 timeShift_#t~ret104 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret104;havoc timeShift_#t~ret104; 309527#L2045 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret78, continueInDirection_~dir, continueInDirection_~tmp~21;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~21;~currentHeading~0 := continueInDirection_~dir; 309528#L1733 assume !(1 == ~currentHeading~0); 309629#L1743 assume !(0 == ~currentFloorID~0); 304992#L1743-2 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 304949#L1749-5 havoc __utac_acc__Specification9_spec__3_#t~ret156, __utac_acc__Specification9_spec__3_#t~ret157, __utac_acc__Specification9_spec__3_#t~ret158, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~27, __utac_acc__Specification9_spec__3_~tmp___0~12, __utac_acc__Specification9_spec__3_~tmp___1~8;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~27;havoc __utac_acc__Specification9_spec__3_~tmp___0~12;havoc __utac_acc__Specification9_spec__3_~tmp___1~8;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 315366#L1124-3 __utac_acc__Specification9_spec__3_#t~ret156 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~27 := __utac_acc__Specification9_spec__3_#t~ret156;havoc __utac_acc__Specification9_spec__3_#t~ret156;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~27;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~10;havoc isEmpty_~retValue_acc~10; 315363#L1184-6 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~10 := 0;isEmpty_#res := isEmpty_~retValue_acc~10; 315359#L1216-6 __utac_acc__Specification9_spec__3_#t~ret157 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~8 := __utac_acc__Specification9_spec__3_#t~ret157;havoc __utac_acc__Specification9_spec__3_#t~ret157; 315358#L3162 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~8);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~7;havoc areDoorsOpen_~retValue_acc~7;areDoorsOpen_~retValue_acc~7 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~7; 315351#L1133 __utac_acc__Specification9_spec__3_#t~ret158 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~12 := __utac_acc__Specification9_spec__3_#t~ret158;havoc __utac_acc__Specification9_spec__3_#t~ret158; 315354#L3172 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___0~12); 307779#L3172-1 cleanup_~i~2 := 0; 307780#L651-2 assume !false; 327863#L652 [2019-01-14 04:07:03,056 INFO L796 eck$LassoCheckResult]: Loop: 327863#L652 cleanup_~__cil_tmp4~2 := ~cleanupTimeShifts~0 - 1; 332276#L655 assume cleanup_~i~2 < cleanup_~__cil_tmp4~2;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~5;havoc isBlocked_~retValue_acc~5;isBlocked_~retValue_acc~5 := 0;isBlocked_#res := isBlocked_~retValue_acc~5; 332275#L946 cleanup_#t~ret48 := isBlocked_#res;cleanup_~tmp___0~2 := cleanup_#t~ret48;havoc cleanup_#t~ret48; 332274#L659 assume 1 != cleanup_~tmp___0~2; 332273#L659-1 havoc isIdle_#res;havoc isIdle_#t~ret63, isIdle_~retValue_acc~12, isIdle_~tmp~18;havoc isIdle_~retValue_acc~12;havoc isIdle_~tmp~18;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret58, anyStopRequested_#t~ret59, anyStopRequested_#t~ret60, anyStopRequested_#t~ret61, anyStopRequested_#t~ret62, anyStopRequested_~retValue_acc~11, anyStopRequested_~tmp~17, anyStopRequested_~tmp___0~4, anyStopRequested_~tmp___1~3, anyStopRequested_~tmp___2~1, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~11;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~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 332272#L2505-25 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 332271#L2532-25 anyStopRequested_#t~ret58 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret58;havoc anyStopRequested_#t~ret58; 332237#L1232 assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~11 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~11; 332228#L1296 isIdle_#t~ret63 := anyStopRequested_#res;isIdle_~tmp~18 := isIdle_#t~ret63;havoc isIdle_#t~ret63;isIdle_~retValue_acc~12 := (if 0 == isIdle_~tmp~18 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~12; 332227#L1309 cleanup_#t~ret49 := isIdle_#res;cleanup_~tmp~11 := cleanup_#t~ret49;havoc cleanup_#t~ret49; 332226#L671 assume !(0 != cleanup_~tmp~11);havoc timeShift_#t~ret97, timeShift_#t~ret98, timeShift_#t~ret99, timeShift_#t~ret100, timeShift_#t~ret101, timeShift_#t~ret102, timeShift_#t~ret103, timeShift_#t~ret104, timeShift_#t~ret105, timeShift_#t~ret106, timeShift_#t~ret107, timeShift_~tmp~25, timeShift_~tmp___0~10, timeShift_~tmp___1~6, timeShift_~tmp___2~4, timeShift_~tmp___3~3, timeShift_~tmp___4~2, timeShift_~tmp___5~2, timeShift_~tmp___6~2, timeShift_~tmp___7~2, timeShift_~tmp___8~2, timeShift_~tmp___9~2;havoc timeShift_~tmp~25;havoc timeShift_~tmp___0~10;havoc timeShift_~tmp___1~6;havoc timeShift_~tmp___2~4;havoc timeShift_~tmp___3~3;havoc timeShift_~tmp___4~2;havoc timeShift_~tmp___5~2;havoc timeShift_~tmp___6~2;havoc timeShift_~tmp___7~2;havoc timeShift_~tmp___8~2;havoc timeShift_~tmp___9~2;havoc stopRequestedAtCurrentFloor_#res;havoc stopRequestedAtCurrentFloor_#t~ret81, stopRequestedAtCurrentFloor_#t~ret82, stopRequestedAtCurrentFloor_#t~ret83, stopRequestedAtCurrentFloor_#t~ret84, stopRequestedAtCurrentFloor_~retValue_acc~17, stopRequestedAtCurrentFloor_~tmp~23, stopRequestedAtCurrentFloor_~tmp___0~8;havoc stopRequestedAtCurrentFloor_~retValue_acc~17;havoc stopRequestedAtCurrentFloor_~tmp~23;havoc stopRequestedAtCurrentFloor_~tmp___0~8;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 332225#L2505-30 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 318207#L2532-30 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 332219#L2409-3 stopRequestedAtCurrentFloor_#t~ret81 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~23 := stopRequestedAtCurrentFloor_#t~ret81;havoc stopRequestedAtCurrentFloor_#t~ret81; 332204#L1793-1 assume 0 != stopRequestedAtCurrentFloor_~tmp~23;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 332202#L1124-4 stopRequestedAtCurrentFloor_#t~ret82 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~8 := stopRequestedAtCurrentFloor_#t~ret82;havoc stopRequestedAtCurrentFloor_#t~ret82; 332173#L1797-1 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~8);stopRequestedAtCurrentFloor_~retValue_acc~17 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~17; 332171#L1810-1 timeShift_#t~ret97 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret97;havoc timeShift_#t~ret97; 332169#L1946-1 assume !(0 != timeShift_~tmp___9~2); 332167#L2037-3 assume 1 == ~doorState~0;~doorState~0 := 0; 332166#L2037-5 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret75, stopRequestedInDirection_#t~ret76, stopRequestedInDirection_#t~ret77, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~14, stopRequestedInDirection_~tmp~20, stopRequestedInDirection_~tmp___0~6, stopRequestedInDirection_~__cil_tmp7~5, stopRequestedInDirection_~__cil_tmp8~5;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~14;havoc stopRequestedInDirection_~tmp~20;havoc stopRequestedInDirection_~tmp___0~6;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 332164#L2505-33 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 332163#L2532-33 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 332160#L2409-4 stopRequestedInDirection_#t~ret75 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~6 := stopRequestedInDirection_#t~ret75;havoc stopRequestedInDirection_#t~ret75; 332158#L1676-2 assume !(0 != stopRequestedInDirection_~tmp___0~6);stopRequestedInDirection__wrappee__empty_#in~dir, stopRequestedInDirection__wrappee__empty_#in~respectFloorCalls, stopRequestedInDirection__wrappee__empty_#in~respectInLiftCalls := stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls;havoc stopRequestedInDirection__wrappee__empty_#res;havoc stopRequestedInDirection__wrappee__empty_#t~ret64, stopRequestedInDirection__wrappee__empty_#t~ret65, stopRequestedInDirection__wrappee__empty_#t~ret66, stopRequestedInDirection__wrappee__empty_#t~ret67, stopRequestedInDirection__wrappee__empty_#t~ret68, stopRequestedInDirection__wrappee__empty_#t~ret69, stopRequestedInDirection__wrappee__empty_#t~ret70, stopRequestedInDirection__wrappee__empty_#t~ret71, stopRequestedInDirection__wrappee__empty_#t~ret72, stopRequestedInDirection__wrappee__empty_#t~ret73, stopRequestedInDirection__wrappee__empty_#t~ret74, stopRequestedInDirection__wrappee__empty_~dir, stopRequestedInDirection__wrappee__empty_~respectFloorCalls, stopRequestedInDirection__wrappee__empty_~respectInLiftCalls, stopRequestedInDirection__wrappee__empty_~retValue_acc~13, stopRequestedInDirection__wrappee__empty_~tmp~19, stopRequestedInDirection__wrappee__empty_~tmp___0~5, stopRequestedInDirection__wrappee__empty_~tmp___1~4, stopRequestedInDirection__wrappee__empty_~tmp___2~2, stopRequestedInDirection__wrappee__empty_~tmp___3~1, stopRequestedInDirection__wrappee__empty_~tmp___4~0, stopRequestedInDirection__wrappee__empty_~tmp___5~0, stopRequestedInDirection__wrappee__empty_~tmp___6~0, stopRequestedInDirection__wrappee__empty_~tmp___7~0, stopRequestedInDirection__wrappee__empty_~tmp___8~0, stopRequestedInDirection__wrappee__empty_~tmp___9~0;stopRequestedInDirection__wrappee__empty_~dir := stopRequestedInDirection__wrappee__empty_#in~dir;stopRequestedInDirection__wrappee__empty_~respectFloorCalls := stopRequestedInDirection__wrappee__empty_#in~respectFloorCalls;stopRequestedInDirection__wrappee__empty_~respectInLiftCalls := stopRequestedInDirection__wrappee__empty_#in~respectInLiftCalls;havoc stopRequestedInDirection__wrappee__empty_~retValue_acc~13;havoc stopRequestedInDirection__wrappee__empty_~tmp~19;havoc stopRequestedInDirection__wrappee__empty_~tmp___0~5;havoc stopRequestedInDirection__wrappee__empty_~tmp___1~4;havoc stopRequestedInDirection__wrappee__empty_~tmp___2~2;havoc stopRequestedInDirection__wrappee__empty_~tmp___3~1;havoc stopRequestedInDirection__wrappee__empty_~tmp___4~0;havoc stopRequestedInDirection__wrappee__empty_~tmp___5~0;havoc stopRequestedInDirection__wrappee__empty_~tmp___6~0;havoc stopRequestedInDirection__wrappee__empty_~tmp___7~0;havoc stopRequestedInDirection__wrappee__empty_~tmp___8~0;havoc stopRequestedInDirection__wrappee__empty_~tmp___9~0; 332155#L1328-2 assume 1 == stopRequestedInDirection__wrappee__empty_~dir;isTopFloor_#in~floorID := ~currentFloorID~0;havoc isTopFloor_#res;havoc isTopFloor_~floorID, isTopFloor_~retValue_acc~24;isTopFloor_~floorID := isTopFloor_#in~floorID;havoc isTopFloor_~retValue_acc~24;isTopFloor_~retValue_acc~24 := (if 4 == isTopFloor_~floorID then 1 else 0);isTopFloor_#res := isTopFloor_~retValue_acc~24; 332156#L3079-5 stopRequestedInDirection__wrappee__empty_#t~ret64 := isTopFloor_#res;stopRequestedInDirection__wrappee__empty_~tmp~19 := stopRequestedInDirection__wrappee__empty_#t~ret64;havoc stopRequestedInDirection__wrappee__empty_#t~ret64; 332077#L1332-2 assume 0 != stopRequestedInDirection__wrappee__empty_~tmp~19;stopRequestedInDirection__wrappee__empty_~retValue_acc~13 := 0;stopRequestedInDirection__wrappee__empty_#res := stopRequestedInDirection__wrappee__empty_~retValue_acc~13; 305839#L1650-2 stopRequestedInDirection_#t~ret77 := stopRequestedInDirection__wrappee__empty_#res;stopRequestedInDirection_~retValue_acc~14 := stopRequestedInDirection_#t~ret77;havoc stopRequestedInDirection_#t~ret77;stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~14; 332054#L1689-2 timeShift_#t~ret104 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret104;havoc timeShift_#t~ret104; 332052#L2045-1 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret78, continueInDirection_~dir, continueInDirection_~tmp~21;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~21;~currentHeading~0 := continueInDirection_~dir; 332048#L1733-3 assume !(1 == ~currentHeading~0); 304960#L1743-9 assume !(0 == ~currentFloorID~0); 304923#L1743-11 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 304910#L1749-11 havoc __utac_acc__Specification9_spec__3_#t~ret156, __utac_acc__Specification9_spec__3_#t~ret157, __utac_acc__Specification9_spec__3_#t~ret158, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~27, __utac_acc__Specification9_spec__3_~tmp___0~12, __utac_acc__Specification9_spec__3_~tmp___1~8;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~27;havoc __utac_acc__Specification9_spec__3_~tmp___0~12;havoc __utac_acc__Specification9_spec__3_~tmp___1~8;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 332305#L1124-7 __utac_acc__Specification9_spec__3_#t~ret156 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~27 := __utac_acc__Specification9_spec__3_#t~ret156;havoc __utac_acc__Specification9_spec__3_#t~ret156;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~27;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~10;havoc isEmpty_~retValue_acc~10; 332304#L1184-13 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~10 := 0;isEmpty_#res := isEmpty_~retValue_acc~10; 332299#L1216-13 __utac_acc__Specification9_spec__3_#t~ret157 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~8 := __utac_acc__Specification9_spec__3_#t~ret157;havoc __utac_acc__Specification9_spec__3_#t~ret157; 332307#L3162-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~8);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~7;havoc areDoorsOpen_~retValue_acc~7;areDoorsOpen_~retValue_acc~7 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~7; 332294#L1133-1 __utac_acc__Specification9_spec__3_#t~ret158 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~12 := __utac_acc__Specification9_spec__3_#t~ret158;havoc __utac_acc__Specification9_spec__3_#t~ret158; 332284#L3172-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___0~12); 332283#L3172-3 cleanup_~i~2 := 1 + cleanup_~i~2; 332282#L651-2 assume !false; 327863#L652 [2019-01-14 04:07:03,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:07:03,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1786296517, now seen corresponding path program 1 times [2019-01-14 04:07:03,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:07:03,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:07:03,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:07:03,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:07:03,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:07:03,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:07:03,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:07:03,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:07:03,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 04:07:03,185 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:07:03,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:07:03,185 INFO L82 PathProgramCache]: Analyzing trace with hash -586911933, now seen corresponding path program 1 times [2019-01-14 04:07:03,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:07:03,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:07:03,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:07:03,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:07:03,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:07:03,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:07:03,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:07:03,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:07:03,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-14 04:07:03,402 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:07:03,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 04:07:03,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-14 04:07:03,403 INFO L87 Difference]: Start difference. First operand 32595 states and 60785 transitions. cyclomatic complexity: 28205 Second operand 8 states. [2019-01-14 04:07:09,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:07:09,664 INFO L93 Difference]: Finished difference Result 415791 states and 779502 transitions. [2019-01-14 04:07:09,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-14 04:07:09,666 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 415791 states and 779502 transitions. [2019-01-14 04:07:11,245 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 202584 [2019-01-14 04:07:20,304 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 415791 states to 415791 states and 779502 transitions. [2019-01-14 04:07:20,304 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 269035 [2019-01-14 04:07:20,540 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 269035 [2019-01-14 04:07:20,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 415791 states and 779502 transitions. [2019-01-14 04:07:20,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:07:20,549 INFO L706 BuchiCegarLoop]: Abstraction has 415791 states and 779502 transitions. [2019-01-14 04:07:20,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415791 states and 779502 transitions. [2019-01-14 04:07:22,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415791 to 61785. [2019-01-14 04:07:22,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61785 states. [2019-01-14 04:07:22,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61785 states to 61785 states and 115156 transitions. [2019-01-14 04:07:22,718 INFO L729 BuchiCegarLoop]: Abstraction has 61785 states and 115156 transitions. [2019-01-14 04:07:22,718 INFO L609 BuchiCegarLoop]: Abstraction has 61785 states and 115156 transitions. [2019-01-14 04:07:22,718 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 04:07:22,719 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61785 states and 115156 transitions. [2019-01-14 04:07:22,857 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 31115 [2019-01-14 04:07:22,858 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:07:22,858 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:07:22,860 INFO L867 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] [2019-01-14 04:07:22,860 INFO L868 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:07:22,861 INFO L794 eck$LassoCheckResult]: Stem: 754306#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(30);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(9);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(21);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(30);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(9);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(21);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(30);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(9);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(25);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(25);~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~cleanupTimeShifts~0 := 12;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0;call #t~string108.base, #t~string108.offset := #Ultimate.allocOnStack(10);call #t~string110.base, #t~string110.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string110.base, #t~string110.offset, 1);call write~init~int(95, #t~string110.base, 1 + #t~string110.offset, 1);call write~init~int(93, #t~string110.base, 2 + #t~string110.offset, 1);call write~init~int(0, #t~string110.base, 3 + #t~string110.offset, 1);call #t~string112.base, #t~string112.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string112.base, #t~string112.offset, 1);call write~init~int(93, #t~string112.base, 1 + #t~string112.offset, 1);call write~init~int(32, #t~string112.base, 2 + #t~string112.offset, 1);call write~init~int(0, #t~string112.base, 3 + #t~string112.offset, 1);call #t~string114.base, #t~string114.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string114.base, #t~string114.offset, 1);call write~init~int(97, #t~string114.base, 1 + #t~string114.offset, 1);call write~init~int(116, #t~string114.base, 2 + #t~string114.offset, 1);call write~init~int(32, #t~string114.base, 3 + #t~string114.offset, 1);call write~init~int(0, #t~string114.base, 4 + #t~string114.offset, 1);call #t~string116.base, #t~string116.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string116.base, #t~string116.offset, 1);call write~init~int(105, #t~string116.base, 1 + #t~string116.offset, 1);call write~init~int(0, #t~string116.base, 2 + #t~string116.offset, 1);call #t~string118.base, #t~string118.offset := #Ultimate.allocOnStack(10);call #t~string120.base, #t~string120.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string120.base, #t~string120.offset, 1);call write~init~int(112, #t~string120.base, 1 + #t~string120.offset, 1);call write~init~int(0, #t~string120.base, 2 + #t~string120.offset, 1);call #t~string122.base, #t~string122.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string122.base, #t~string122.offset, 1);call write~init~int(111, #t~string122.base, 1 + #t~string122.offset, 1);call write~init~int(119, #t~string122.base, 2 + #t~string122.offset, 1);call write~init~int(110, #t~string122.base, 3 + #t~string122.offset, 1);call write~init~int(0, #t~string122.base, 4 + #t~string122.offset, 1);call #t~string124.base, #t~string124.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string124.base, #t~string124.offset, 1);call write~init~int(73, #t~string124.base, 1 + #t~string124.offset, 1);call write~init~int(76, #t~string124.base, 2 + #t~string124.offset, 1);call write~init~int(95, #t~string124.base, 3 + #t~string124.offset, 1);call write~init~int(112, #t~string124.base, 4 + #t~string124.offset, 1);call write~init~int(58, #t~string124.base, 5 + #t~string124.offset, 1);call write~init~int(0, #t~string124.base, 6 + #t~string124.offset, 1);call #t~string126.base, #t~string126.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string126.base, #t~string126.offset, 1);call write~init~int(37, #t~string126.base, 1 + #t~string126.offset, 1);call write~init~int(105, #t~string126.base, 2 + #t~string126.offset, 1);call write~init~int(0, #t~string126.base, 3 + #t~string126.offset, 1);call #t~string128.base, #t~string128.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string128.base, #t~string128.offset, 1);call write~init~int(37, #t~string128.base, 1 + #t~string128.offset, 1);call write~init~int(105, #t~string128.base, 2 + #t~string128.offset, 1);call write~init~int(0, #t~string128.base, 3 + #t~string128.offset, 1);call #t~string130.base, #t~string130.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string130.base, #t~string130.offset, 1);call write~init~int(37, #t~string130.base, 1 + #t~string130.offset, 1);call write~init~int(105, #t~string130.base, 2 + #t~string130.offset, 1);call write~init~int(0, #t~string130.base, 3 + #t~string130.offset, 1);call #t~string132.base, #t~string132.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string132.base, #t~string132.offset, 1);call write~init~int(37, #t~string132.base, 1 + #t~string132.offset, 1);call write~init~int(105, #t~string132.base, 2 + #t~string132.offset, 1);call write~init~int(0, #t~string132.base, 3 + #t~string132.offset, 1);call #t~string134.base, #t~string134.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string134.base, #t~string134.offset, 1);call write~init~int(37, #t~string134.base, 1 + #t~string134.offset, 1);call write~init~int(105, #t~string134.base, 2 + #t~string134.offset, 1);call write~init~int(0, #t~string134.base, 3 + #t~string134.offset, 1);call #t~string136.base, #t~string136.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string136.base, #t~string136.offset, 1);call write~init~int(70, #t~string136.base, 1 + #t~string136.offset, 1);call write~init~int(95, #t~string136.base, 2 + #t~string136.offset, 1);call write~init~int(112, #t~string136.base, 3 + #t~string136.offset, 1);call write~init~int(58, #t~string136.base, 4 + #t~string136.offset, 1);call write~init~int(0, #t~string136.base, 5 + #t~string136.offset, 1);call #t~string139.base, #t~string139.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string139.base, #t~string139.offset, 1);call write~init~int(37, #t~string139.base, 1 + #t~string139.offset, 1);call write~init~int(105, #t~string139.base, 2 + #t~string139.offset, 1);call write~init~int(0, #t~string139.base, 3 + #t~string139.offset, 1);call #t~string142.base, #t~string142.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string142.base, #t~string142.offset, 1);call write~init~int(37, #t~string142.base, 1 + #t~string142.offset, 1);call write~init~int(105, #t~string142.base, 2 + #t~string142.offset, 1);call write~init~int(0, #t~string142.base, 3 + #t~string142.offset, 1);call #t~string145.base, #t~string145.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string145.base, #t~string145.offset, 1);call write~init~int(37, #t~string145.base, 1 + #t~string145.offset, 1);call write~init~int(105, #t~string145.base, 2 + #t~string145.offset, 1);call write~init~int(0, #t~string145.base, 3 + #t~string145.offset, 1);call #t~string148.base, #t~string148.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string148.base, #t~string148.offset, 1);call write~init~int(37, #t~string148.base, 1 + #t~string148.offset, 1);call write~init~int(105, #t~string148.base, 2 + #t~string148.offset, 1);call write~init~int(0, #t~string148.base, 3 + #t~string148.offset, 1);call #t~string151.base, #t~string151.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string151.base, #t~string151.offset, 1);call write~init~int(37, #t~string151.base, 1 + #t~string151.offset, 1);call write~init~int(105, #t~string151.base, 2 + #t~string151.offset, 1);call write~init~int(0, #t~string151.base, 3 + #t~string151.offset, 1);call #t~string153.base, #t~string153.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string153.base, #t~string153.offset, 1);call write~init~int(0, #t~string153.base, 1 + #t~string153.offset, 1);~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 754307#L-1 havoc main_#res;havoc main_#t~ret54, main_~retValue_acc~4, main_~tmp~13;havoc main_~retValue_acc~4;havoc main_~tmp~13; 753627#L3286 havoc valid_product_#res;havoc valid_product_~retValue_acc~26;havoc valid_product_~retValue_acc~26;valid_product_~retValue_acc~26 := 1;valid_product_#res := valid_product_~retValue_acc~26; 753628#L3294 main_#t~ret54 := valid_product_#res;main_~tmp~13 := main_#t~ret54;havoc main_#t~ret54; 755348#L850 assume 0 != main_~tmp~13; 753368#L819 ~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 753369#L3119 havoc bigMacCall_#t~ret47, bigMacCall_~tmp~10;havoc bigMacCall_~tmp~10;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~28;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~28; 754767#L3342 assume !(0 == getOrigin_~person); 754768#L3346 assume !(1 == getOrigin_~person); 756468#L3350 assume !(2 == getOrigin_~person); 756469#L3354 assume !(3 == getOrigin_~person); 757605#L3358 assume !(4 == getOrigin_~person); 757113#L3362 assume 5 == getOrigin_~person;getOrigin_~retValue_acc~28 := 1;getOrigin_#res := getOrigin_~retValue_acc~28; 754194#L3367 bigMacCall_#t~ret47 := getOrigin_#res;bigMacCall_~tmp~10 := bigMacCall_#t~ret47;havoc bigMacCall_#t~ret47;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~10;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 754195#L2776 assume 0 == initPersonOnFloor_~floor; 756227#L2777 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 753505#L2884-1 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 754369#L2568 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 757450#L2580-2 havoc cleanup_#t~ret48, cleanup_#t~ret49, cleanup_~i~2, cleanup_~tmp~11, cleanup_~tmp___0~2, cleanup_~__cil_tmp4~2;havoc cleanup_~i~2;havoc cleanup_~tmp~11;havoc cleanup_~tmp___0~2;havoc cleanup_~__cil_tmp4~2;havoc timeShift_#t~ret97, timeShift_#t~ret98, timeShift_#t~ret99, timeShift_#t~ret100, timeShift_#t~ret101, timeShift_#t~ret102, timeShift_#t~ret103, timeShift_#t~ret104, timeShift_#t~ret105, timeShift_#t~ret106, timeShift_#t~ret107, timeShift_~tmp~25, timeShift_~tmp___0~10, timeShift_~tmp___1~6, timeShift_~tmp___2~4, timeShift_~tmp___3~3, timeShift_~tmp___4~2, timeShift_~tmp___5~2, timeShift_~tmp___6~2, timeShift_~tmp___7~2, timeShift_~tmp___8~2, timeShift_~tmp___9~2;havoc timeShift_~tmp~25;havoc timeShift_~tmp___0~10;havoc timeShift_~tmp___1~6;havoc timeShift_~tmp___2~4;havoc timeShift_~tmp___3~3;havoc timeShift_~tmp___4~2;havoc timeShift_~tmp___5~2;havoc timeShift_~tmp___6~2;havoc timeShift_~tmp___7~2;havoc timeShift_~tmp___8~2;havoc timeShift_~tmp___9~2;havoc stopRequestedAtCurrentFloor_#res;havoc stopRequestedAtCurrentFloor_#t~ret81, stopRequestedAtCurrentFloor_#t~ret82, stopRequestedAtCurrentFloor_#t~ret83, stopRequestedAtCurrentFloor_#t~ret84, stopRequestedAtCurrentFloor_~retValue_acc~17, stopRequestedAtCurrentFloor_~tmp~23, stopRequestedAtCurrentFloor_~tmp___0~8;havoc stopRequestedAtCurrentFloor_~retValue_acc~17;havoc stopRequestedAtCurrentFloor_~tmp~23;havoc stopRequestedAtCurrentFloor_~tmp___0~8;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 754787#L2505 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 754788#L2532 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 757831#L2409 stopRequestedAtCurrentFloor_#t~ret81 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~23 := stopRequestedAtCurrentFloor_#t~ret81;havoc stopRequestedAtCurrentFloor_#t~ret81; 757816#L1793 assume 0 != stopRequestedAtCurrentFloor_~tmp~23;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 757817#L1124 stopRequestedAtCurrentFloor_#t~ret82 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~8 := stopRequestedAtCurrentFloor_#t~ret82;havoc stopRequestedAtCurrentFloor_#t~ret82; 757803#L1797 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~8);stopRequestedAtCurrentFloor_~retValue_acc~17 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~17; 757804#L1810 timeShift_#t~ret97 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret97;havoc timeShift_#t~ret97; 758434#L1946 assume !(0 != timeShift_~tmp___9~2); 758433#L2037 assume !(1 == ~doorState~0); 757559#L2037-2 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret75, stopRequestedInDirection_#t~ret76, stopRequestedInDirection_#t~ret77, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~14, stopRequestedInDirection_~tmp~20, stopRequestedInDirection_~tmp___0~6, stopRequestedInDirection_~__cil_tmp7~5, stopRequestedInDirection_~__cil_tmp8~5;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~14;havoc stopRequestedInDirection_~tmp~20;havoc stopRequestedInDirection_~tmp___0~6;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 757560#L2505-3 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 754342#L2532-3 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 754343#L2409-1 stopRequestedInDirection_#t~ret75 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~6 := stopRequestedInDirection_#t~ret75;havoc stopRequestedInDirection_#t~ret75; 756534#L1676 assume 0 != stopRequestedInDirection_~tmp___0~6;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 756535#L1124-1 stopRequestedInDirection_#t~ret76 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~20 := stopRequestedInDirection_#t~ret76;havoc stopRequestedInDirection_#t~ret76;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~20 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~14 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~14; 757956#L1689 timeShift_#t~ret104 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret104;havoc timeShift_#t~ret104; 757957#L2045 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret78, continueInDirection_~dir, continueInDirection_~tmp~21;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~21;~currentHeading~0 := continueInDirection_~dir; 758432#L1733 assume !(1 == ~currentHeading~0); 763335#L1743 assume !(0 == ~currentFloorID~0); 763326#L1743-2 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 763316#L1749-5 havoc __utac_acc__Specification9_spec__3_#t~ret156, __utac_acc__Specification9_spec__3_#t~ret157, __utac_acc__Specification9_spec__3_#t~ret158, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~27, __utac_acc__Specification9_spec__3_~tmp___0~12, __utac_acc__Specification9_spec__3_~tmp___1~8;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~27;havoc __utac_acc__Specification9_spec__3_~tmp___0~12;havoc __utac_acc__Specification9_spec__3_~tmp___1~8;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 764854#L1124-3 __utac_acc__Specification9_spec__3_#t~ret156 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~27 := __utac_acc__Specification9_spec__3_#t~ret156;havoc __utac_acc__Specification9_spec__3_#t~ret156;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~27;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~10;havoc isEmpty_~retValue_acc~10; 764851#L1184-6 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~10 := 0;isEmpty_#res := isEmpty_~retValue_acc~10; 764847#L1216-6 __utac_acc__Specification9_spec__3_#t~ret157 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~8 := __utac_acc__Specification9_spec__3_#t~ret157;havoc __utac_acc__Specification9_spec__3_#t~ret157; 764848#L3162 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~8);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~7;havoc areDoorsOpen_~retValue_acc~7;areDoorsOpen_~retValue_acc~7 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~7; 764836#L1133 __utac_acc__Specification9_spec__3_#t~ret158 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~12 := __utac_acc__Specification9_spec__3_#t~ret158;havoc __utac_acc__Specification9_spec__3_#t~ret158; 764839#L3172 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___0~12); 764831#L3172-1 cleanup_~i~2 := 0; 763287#L651-2 assume !false; 763288#L652 [2019-01-14 04:07:22,861 INFO L796 eck$LassoCheckResult]: Loop: 763288#L652 cleanup_~__cil_tmp4~2 := ~cleanupTimeShifts~0 - 1; 801777#L655 assume cleanup_~i~2 < cleanup_~__cil_tmp4~2;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~5;havoc isBlocked_~retValue_acc~5;isBlocked_~retValue_acc~5 := 0;isBlocked_#res := isBlocked_~retValue_acc~5; 801778#L946 cleanup_#t~ret48 := isBlocked_#res;cleanup_~tmp___0~2 := cleanup_#t~ret48;havoc cleanup_#t~ret48; 801755#L659 assume 1 != cleanup_~tmp___0~2; 756670#L659-1 havoc isIdle_#res;havoc isIdle_#t~ret63, isIdle_~retValue_acc~12, isIdle_~tmp~18;havoc isIdle_~retValue_acc~12;havoc isIdle_~tmp~18;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret58, anyStopRequested_#t~ret59, anyStopRequested_#t~ret60, anyStopRequested_#t~ret61, anyStopRequested_#t~ret62, anyStopRequested_~retValue_acc~11, anyStopRequested_~tmp~17, anyStopRequested_~tmp___0~4, anyStopRequested_~tmp___1~3, anyStopRequested_~tmp___2~1, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~11;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~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 756671#L2505-25 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 799579#L2532-25 anyStopRequested_#t~ret58 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret58;havoc anyStopRequested_#t~ret58; 799580#L1232 assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~11 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~11; 802115#L1296 isIdle_#t~ret63 := anyStopRequested_#res;isIdle_~tmp~18 := isIdle_#t~ret63;havoc isIdle_#t~ret63;isIdle_~retValue_acc~12 := (if 0 == isIdle_~tmp~18 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~12; 802114#L1309 cleanup_#t~ret49 := isIdle_#res;cleanup_~tmp~11 := cleanup_#t~ret49;havoc cleanup_#t~ret49; 800493#L671 assume !(0 != cleanup_~tmp~11);havoc timeShift_#t~ret97, timeShift_#t~ret98, timeShift_#t~ret99, timeShift_#t~ret100, timeShift_#t~ret101, timeShift_#t~ret102, timeShift_#t~ret103, timeShift_#t~ret104, timeShift_#t~ret105, timeShift_#t~ret106, timeShift_#t~ret107, timeShift_~tmp~25, timeShift_~tmp___0~10, timeShift_~tmp___1~6, timeShift_~tmp___2~4, timeShift_~tmp___3~3, timeShift_~tmp___4~2, timeShift_~tmp___5~2, timeShift_~tmp___6~2, timeShift_~tmp___7~2, timeShift_~tmp___8~2, timeShift_~tmp___9~2;havoc timeShift_~tmp~25;havoc timeShift_~tmp___0~10;havoc timeShift_~tmp___1~6;havoc timeShift_~tmp___2~4;havoc timeShift_~tmp___3~3;havoc timeShift_~tmp___4~2;havoc timeShift_~tmp___5~2;havoc timeShift_~tmp___6~2;havoc timeShift_~tmp___7~2;havoc timeShift_~tmp___8~2;havoc timeShift_~tmp___9~2;havoc stopRequestedAtCurrentFloor_#res;havoc stopRequestedAtCurrentFloor_#t~ret81, stopRequestedAtCurrentFloor_#t~ret82, stopRequestedAtCurrentFloor_#t~ret83, stopRequestedAtCurrentFloor_#t~ret84, stopRequestedAtCurrentFloor_~retValue_acc~17, stopRequestedAtCurrentFloor_~tmp~23, stopRequestedAtCurrentFloor_~tmp___0~8;havoc stopRequestedAtCurrentFloor_~retValue_acc~17;havoc stopRequestedAtCurrentFloor_~tmp~23;havoc stopRequestedAtCurrentFloor_~tmp___0~8;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 800494#L2505-30 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 786284#L2532-30 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 802099#L2409-3 stopRequestedAtCurrentFloor_#t~ret81 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~23 := stopRequestedAtCurrentFloor_#t~ret81;havoc stopRequestedAtCurrentFloor_#t~ret81; 800464#L1793-1 assume 0 != stopRequestedAtCurrentFloor_~tmp~23;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 800466#L1124-4 stopRequestedAtCurrentFloor_#t~ret82 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~8 := stopRequestedAtCurrentFloor_#t~ret82;havoc stopRequestedAtCurrentFloor_#t~ret82; 800439#L1797-1 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~8);stopRequestedAtCurrentFloor_~retValue_acc~17 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~17; 800440#L1810-1 timeShift_#t~ret97 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret97;havoc timeShift_#t~ret97; 802062#L1946-1 assume !(0 != timeShift_~tmp___9~2); 802061#L2037-3 assume 1 == ~doorState~0;~doorState~0 := 0; 802050#L2037-5 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret75, stopRequestedInDirection_#t~ret76, stopRequestedInDirection_#t~ret77, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~14, stopRequestedInDirection_~tmp~20, stopRequestedInDirection_~tmp___0~6, stopRequestedInDirection_~__cil_tmp7~5, stopRequestedInDirection_~__cil_tmp8~5;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~14;havoc stopRequestedInDirection_~tmp~20;havoc stopRequestedInDirection_~tmp___0~6;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 802049#L2505-33 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 802048#L2532-33 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 755454#L2409-4 stopRequestedInDirection_#t~ret75 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~6 := stopRequestedInDirection_#t~ret75;havoc stopRequestedInDirection_#t~ret75; 755455#L1676-2 assume 0 != stopRequestedInDirection_~tmp___0~6;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 756551#L1124-5 stopRequestedInDirection_#t~ret76 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~20 := stopRequestedInDirection_#t~ret76;havoc stopRequestedInDirection_#t~ret76;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~20 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~14 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~14; 799302#L1689-2 timeShift_#t~ret104 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret104;havoc timeShift_#t~ret104; 799293#L2045-1 assume !(0 != timeShift_~tmp___8~2);getReverseHeading_#in~ofHeading := ~currentHeading~0;havoc getReverseHeading_#res;havoc getReverseHeading_~ofHeading, getReverseHeading_~retValue_acc~18;getReverseHeading_~ofHeading := getReverseHeading_#in~ofHeading;havoc getReverseHeading_~retValue_acc~18; 798971#L1819-2 assume 0 == getReverseHeading_~ofHeading;getReverseHeading_~retValue_acc~18 := 1;getReverseHeading_#res := getReverseHeading_~retValue_acc~18; 754610#L1824-2 timeShift_#t~ret105 := getReverseHeading_#res;timeShift_~tmp___6~2 := timeShift_#t~ret105;havoc timeShift_#t~ret105;stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := timeShift_~tmp___6~2, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret75, stopRequestedInDirection_#t~ret76, stopRequestedInDirection_#t~ret77, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~14, stopRequestedInDirection_~tmp~20, stopRequestedInDirection_~tmp___0~6, stopRequestedInDirection_~__cil_tmp7~5, stopRequestedInDirection_~__cil_tmp8~5;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~14;havoc stopRequestedInDirection_~tmp~20;havoc stopRequestedInDirection_~tmp___0~6;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 754611#L2505-44 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 756946#L2532-44 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 755431#L2409-5 stopRequestedInDirection_#t~ret75 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~6 := stopRequestedInDirection_#t~ret75;havoc stopRequestedInDirection_#t~ret75; 755432#L1676-3 assume 0 != stopRequestedInDirection_~tmp___0~6;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 756476#L1124-6 stopRequestedInDirection_#t~ret76 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~20 := stopRequestedInDirection_#t~ret76;havoc stopRequestedInDirection_#t~ret76;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~20 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~14 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~14; 802043#L1689-3 timeShift_#t~ret106 := stopRequestedInDirection_#res;timeShift_~tmp___7~2 := timeShift_#t~ret106;havoc timeShift_#t~ret106; 802044#L2054-1 assume !(0 != timeShift_~tmp___7~2);continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret78, continueInDirection_~dir, continueInDirection_~tmp~21;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~21;~currentHeading~0 := continueInDirection_~dir; 803898#L1733-5 assume !(1 == ~currentHeading~0); 803896#L1743-15 assume !(0 == ~currentFloorID~0); 803891#L1743-17 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 803860#L1749-11 havoc __utac_acc__Specification9_spec__3_#t~ret156, __utac_acc__Specification9_spec__3_#t~ret157, __utac_acc__Specification9_spec__3_#t~ret158, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~27, __utac_acc__Specification9_spec__3_~tmp___0~12, __utac_acc__Specification9_spec__3_~tmp___1~8;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~27;havoc __utac_acc__Specification9_spec__3_~tmp___0~12;havoc __utac_acc__Specification9_spec__3_~tmp___1~8;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 803850#L1124-7 __utac_acc__Specification9_spec__3_#t~ret156 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~27 := __utac_acc__Specification9_spec__3_#t~ret156;havoc __utac_acc__Specification9_spec__3_#t~ret156;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~27;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~10;havoc isEmpty_~retValue_acc~10; 801859#L1184-13 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~10 := 0;isEmpty_#res := isEmpty_~retValue_acc~10; 801852#L1216-13 __utac_acc__Specification9_spec__3_#t~ret157 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~8 := __utac_acc__Specification9_spec__3_#t~ret157;havoc __utac_acc__Specification9_spec__3_#t~ret157; 801850#L3162-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~8);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~7;havoc areDoorsOpen_~retValue_acc~7;areDoorsOpen_~retValue_acc~7 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~7; 801814#L1133-1 __utac_acc__Specification9_spec__3_#t~ret158 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~12 := __utac_acc__Specification9_spec__3_#t~ret158;havoc __utac_acc__Specification9_spec__3_#t~ret158; 801803#L3172-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___0~12); 801804#L3172-3 cleanup_~i~2 := 1 + cleanup_~i~2; 801784#L651-2 assume !false; 763288#L652 [2019-01-14 04:07:22,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:07:22,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1786296517, now seen corresponding path program 2 times [2019-01-14 04:07:22,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:07:22,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:07:22,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:07:22,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:07:22,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:07:22,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:07:23,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:07:23,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:07:23,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 04:07:23,036 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:07:23,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:07:23,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1020838168, now seen corresponding path program 1 times [2019-01-14 04:07:23,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:07:23,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:07:23,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:07:23,038 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:07:23,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:07:23,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:07:23,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:07:23,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:07:23,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-01-14 04:07:23,244 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:07:23,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 04:07:23,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 04:07:23,245 INFO L87 Difference]: Start difference. First operand 61785 states and 115156 transitions. cyclomatic complexity: 53386 Second operand 6 states. [2019-01-14 04:07:23,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:07:23,484 INFO L93 Difference]: Finished difference Result 61779 states and 115143 transitions. [2019-01-14 04:07:23,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 04:07:23,486 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61779 states and 115143 transitions. [2019-01-14 04:07:23,709 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 31115 [2019-01-14 04:07:23,914 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61779 states to 61779 states and 115143 transitions. [2019-01-14 04:07:23,914 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41544 [2019-01-14 04:07:23,943 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41544 [2019-01-14 04:07:23,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61779 states and 115143 transitions. [2019-01-14 04:07:23,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:07:23,947 INFO L706 BuchiCegarLoop]: Abstraction has 61779 states and 115143 transitions. [2019-01-14 04:07:23,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61779 states and 115143 transitions. [2019-01-14 04:07:25,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61779 to 61779. [2019-01-14 04:07:25,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61779 states. [2019-01-14 04:07:25,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61779 states to 61779 states and 115143 transitions. [2019-01-14 04:07:25,567 INFO L729 BuchiCegarLoop]: Abstraction has 61779 states and 115143 transitions. [2019-01-14 04:07:25,568 INFO L609 BuchiCegarLoop]: Abstraction has 61779 states and 115143 transitions. [2019-01-14 04:07:25,568 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 04:07:25,568 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61779 states and 115143 transitions. [2019-01-14 04:07:25,699 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 31115 [2019-01-14 04:07:25,699 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:07:25,699 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:07:25,702 INFO L867 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] [2019-01-14 04:07:25,703 INFO L868 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:07:25,703 INFO L794 eck$LassoCheckResult]: Stem: 877907#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(30);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(9);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(21);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(30);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(9);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(21);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(30);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(9);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(25);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(25);~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~cleanupTimeShifts~0 := 12;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0;call #t~string108.base, #t~string108.offset := #Ultimate.allocOnStack(10);call #t~string110.base, #t~string110.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string110.base, #t~string110.offset, 1);call write~init~int(95, #t~string110.base, 1 + #t~string110.offset, 1);call write~init~int(93, #t~string110.base, 2 + #t~string110.offset, 1);call write~init~int(0, #t~string110.base, 3 + #t~string110.offset, 1);call #t~string112.base, #t~string112.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string112.base, #t~string112.offset, 1);call write~init~int(93, #t~string112.base, 1 + #t~string112.offset, 1);call write~init~int(32, #t~string112.base, 2 + #t~string112.offset, 1);call write~init~int(0, #t~string112.base, 3 + #t~string112.offset, 1);call #t~string114.base, #t~string114.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string114.base, #t~string114.offset, 1);call write~init~int(97, #t~string114.base, 1 + #t~string114.offset, 1);call write~init~int(116, #t~string114.base, 2 + #t~string114.offset, 1);call write~init~int(32, #t~string114.base, 3 + #t~string114.offset, 1);call write~init~int(0, #t~string114.base, 4 + #t~string114.offset, 1);call #t~string116.base, #t~string116.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string116.base, #t~string116.offset, 1);call write~init~int(105, #t~string116.base, 1 + #t~string116.offset, 1);call write~init~int(0, #t~string116.base, 2 + #t~string116.offset, 1);call #t~string118.base, #t~string118.offset := #Ultimate.allocOnStack(10);call #t~string120.base, #t~string120.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string120.base, #t~string120.offset, 1);call write~init~int(112, #t~string120.base, 1 + #t~string120.offset, 1);call write~init~int(0, #t~string120.base, 2 + #t~string120.offset, 1);call #t~string122.base, #t~string122.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string122.base, #t~string122.offset, 1);call write~init~int(111, #t~string122.base, 1 + #t~string122.offset, 1);call write~init~int(119, #t~string122.base, 2 + #t~string122.offset, 1);call write~init~int(110, #t~string122.base, 3 + #t~string122.offset, 1);call write~init~int(0, #t~string122.base, 4 + #t~string122.offset, 1);call #t~string124.base, #t~string124.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string124.base, #t~string124.offset, 1);call write~init~int(73, #t~string124.base, 1 + #t~string124.offset, 1);call write~init~int(76, #t~string124.base, 2 + #t~string124.offset, 1);call write~init~int(95, #t~string124.base, 3 + #t~string124.offset, 1);call write~init~int(112, #t~string124.base, 4 + #t~string124.offset, 1);call write~init~int(58, #t~string124.base, 5 + #t~string124.offset, 1);call write~init~int(0, #t~string124.base, 6 + #t~string124.offset, 1);call #t~string126.base, #t~string126.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string126.base, #t~string126.offset, 1);call write~init~int(37, #t~string126.base, 1 + #t~string126.offset, 1);call write~init~int(105, #t~string126.base, 2 + #t~string126.offset, 1);call write~init~int(0, #t~string126.base, 3 + #t~string126.offset, 1);call #t~string128.base, #t~string128.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string128.base, #t~string128.offset, 1);call write~init~int(37, #t~string128.base, 1 + #t~string128.offset, 1);call write~init~int(105, #t~string128.base, 2 + #t~string128.offset, 1);call write~init~int(0, #t~string128.base, 3 + #t~string128.offset, 1);call #t~string130.base, #t~string130.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string130.base, #t~string130.offset, 1);call write~init~int(37, #t~string130.base, 1 + #t~string130.offset, 1);call write~init~int(105, #t~string130.base, 2 + #t~string130.offset, 1);call write~init~int(0, #t~string130.base, 3 + #t~string130.offset, 1);call #t~string132.base, #t~string132.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string132.base, #t~string132.offset, 1);call write~init~int(37, #t~string132.base, 1 + #t~string132.offset, 1);call write~init~int(105, #t~string132.base, 2 + #t~string132.offset, 1);call write~init~int(0, #t~string132.base, 3 + #t~string132.offset, 1);call #t~string134.base, #t~string134.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string134.base, #t~string134.offset, 1);call write~init~int(37, #t~string134.base, 1 + #t~string134.offset, 1);call write~init~int(105, #t~string134.base, 2 + #t~string134.offset, 1);call write~init~int(0, #t~string134.base, 3 + #t~string134.offset, 1);call #t~string136.base, #t~string136.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string136.base, #t~string136.offset, 1);call write~init~int(70, #t~string136.base, 1 + #t~string136.offset, 1);call write~init~int(95, #t~string136.base, 2 + #t~string136.offset, 1);call write~init~int(112, #t~string136.base, 3 + #t~string136.offset, 1);call write~init~int(58, #t~string136.base, 4 + #t~string136.offset, 1);call write~init~int(0, #t~string136.base, 5 + #t~string136.offset, 1);call #t~string139.base, #t~string139.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string139.base, #t~string139.offset, 1);call write~init~int(37, #t~string139.base, 1 + #t~string139.offset, 1);call write~init~int(105, #t~string139.base, 2 + #t~string139.offset, 1);call write~init~int(0, #t~string139.base, 3 + #t~string139.offset, 1);call #t~string142.base, #t~string142.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string142.base, #t~string142.offset, 1);call write~init~int(37, #t~string142.base, 1 + #t~string142.offset, 1);call write~init~int(105, #t~string142.base, 2 + #t~string142.offset, 1);call write~init~int(0, #t~string142.base, 3 + #t~string142.offset, 1);call #t~string145.base, #t~string145.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string145.base, #t~string145.offset, 1);call write~init~int(37, #t~string145.base, 1 + #t~string145.offset, 1);call write~init~int(105, #t~string145.base, 2 + #t~string145.offset, 1);call write~init~int(0, #t~string145.base, 3 + #t~string145.offset, 1);call #t~string148.base, #t~string148.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string148.base, #t~string148.offset, 1);call write~init~int(37, #t~string148.base, 1 + #t~string148.offset, 1);call write~init~int(105, #t~string148.base, 2 + #t~string148.offset, 1);call write~init~int(0, #t~string148.base, 3 + #t~string148.offset, 1);call #t~string151.base, #t~string151.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string151.base, #t~string151.offset, 1);call write~init~int(37, #t~string151.base, 1 + #t~string151.offset, 1);call write~init~int(105, #t~string151.base, 2 + #t~string151.offset, 1);call write~init~int(0, #t~string151.base, 3 + #t~string151.offset, 1);call #t~string153.base, #t~string153.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string153.base, #t~string153.offset, 1);call write~init~int(0, #t~string153.base, 1 + #t~string153.offset, 1);~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 877908#L-1 havoc main_#res;havoc main_#t~ret54, main_~retValue_acc~4, main_~tmp~13;havoc main_~retValue_acc~4;havoc main_~tmp~13; 877218#L3286 havoc valid_product_#res;havoc valid_product_~retValue_acc~26;havoc valid_product_~retValue_acc~26;valid_product_~retValue_acc~26 := 1;valid_product_#res := valid_product_~retValue_acc~26; 877219#L3294 main_#t~ret54 := valid_product_#res;main_~tmp~13 := main_#t~ret54;havoc main_#t~ret54; 878947#L850 assume 0 != main_~tmp~13; 876960#L819 ~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 876961#L3119 havoc bigMacCall_#t~ret47, bigMacCall_~tmp~10;havoc bigMacCall_~tmp~10;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~28;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~28; 878368#L3342 assume !(0 == getOrigin_~person); 878369#L3346 assume !(1 == getOrigin_~person); 880066#L3350 assume !(2 == getOrigin_~person); 880067#L3354 assume !(3 == getOrigin_~person); 881230#L3358 assume !(4 == getOrigin_~person); 880734#L3362 assume 5 == getOrigin_~person;getOrigin_~retValue_acc~28 := 1;getOrigin_#res := getOrigin_~retValue_acc~28; 877791#L3367 bigMacCall_#t~ret47 := getOrigin_#res;bigMacCall_~tmp~10 := bigMacCall_#t~ret47;havoc bigMacCall_#t~ret47;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~10;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 877792#L2776 assume !(0 == initPersonOnFloor_~floor); 879159#L2803 assume 1 == initPersonOnFloor_~floor; 879160#L2804 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_1~0 := 1; 877096#L2884-1 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 877971#L2568 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 881058#L2580-2 havoc cleanup_#t~ret48, cleanup_#t~ret49, cleanup_~i~2, cleanup_~tmp~11, cleanup_~tmp___0~2, cleanup_~__cil_tmp4~2;havoc cleanup_~i~2;havoc cleanup_~tmp~11;havoc cleanup_~tmp___0~2;havoc cleanup_~__cil_tmp4~2;havoc timeShift_#t~ret97, timeShift_#t~ret98, timeShift_#t~ret99, timeShift_#t~ret100, timeShift_#t~ret101, timeShift_#t~ret102, timeShift_#t~ret103, timeShift_#t~ret104, timeShift_#t~ret105, timeShift_#t~ret106, timeShift_#t~ret107, timeShift_~tmp~25, timeShift_~tmp___0~10, timeShift_~tmp___1~6, timeShift_~tmp___2~4, timeShift_~tmp___3~3, timeShift_~tmp___4~2, timeShift_~tmp___5~2, timeShift_~tmp___6~2, timeShift_~tmp___7~2, timeShift_~tmp___8~2, timeShift_~tmp___9~2;havoc timeShift_~tmp~25;havoc timeShift_~tmp___0~10;havoc timeShift_~tmp___1~6;havoc timeShift_~tmp___2~4;havoc timeShift_~tmp___3~3;havoc timeShift_~tmp___4~2;havoc timeShift_~tmp___5~2;havoc timeShift_~tmp___6~2;havoc timeShift_~tmp___7~2;havoc timeShift_~tmp___8~2;havoc timeShift_~tmp___9~2;havoc stopRequestedAtCurrentFloor_#res;havoc stopRequestedAtCurrentFloor_#t~ret81, stopRequestedAtCurrentFloor_#t~ret82, stopRequestedAtCurrentFloor_#t~ret83, stopRequestedAtCurrentFloor_#t~ret84, stopRequestedAtCurrentFloor_~retValue_acc~17, stopRequestedAtCurrentFloor_~tmp~23, stopRequestedAtCurrentFloor_~tmp___0~8;havoc stopRequestedAtCurrentFloor_~retValue_acc~17;havoc stopRequestedAtCurrentFloor_~tmp~23;havoc stopRequestedAtCurrentFloor_~tmp___0~8;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 881501#L2505 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 877935#L2532 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 877936#L2409 stopRequestedAtCurrentFloor_#t~ret81 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~23 := stopRequestedAtCurrentFloor_#t~ret81;havoc stopRequestedAtCurrentFloor_#t~ret81; 879017#L1793 assume 0 != stopRequestedAtCurrentFloor_~tmp~23;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 879018#L1124 stopRequestedAtCurrentFloor_#t~ret82 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~8 := stopRequestedAtCurrentFloor_#t~ret82;havoc stopRequestedAtCurrentFloor_#t~ret82; 881423#L1797 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~8);stopRequestedAtCurrentFloor_~retValue_acc~17 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~17; 879326#L1810 timeShift_#t~ret97 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret97;havoc timeShift_#t~ret97; 879327#L1946 assume !(0 != timeShift_~tmp___9~2); 881217#L2037 assume !(1 == ~doorState~0); 881218#L2037-2 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret75, stopRequestedInDirection_#t~ret76, stopRequestedInDirection_#t~ret77, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~14, stopRequestedInDirection_~tmp~20, stopRequestedInDirection_~tmp___0~6, stopRequestedInDirection_~__cil_tmp7~5, stopRequestedInDirection_~__cil_tmp8~5;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~14;havoc stopRequestedInDirection_~tmp~20;havoc stopRequestedInDirection_~tmp___0~6;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 878405#L2505-3 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 878406#L2532-3 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 879056#L2409-1 stopRequestedInDirection_#t~ret75 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~6 := stopRequestedInDirection_#t~ret75;havoc stopRequestedInDirection_#t~ret75; 879057#L1676 assume 0 != stopRequestedInDirection_~tmp___0~6;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 877319#L1124-1 stopRequestedInDirection_#t~ret76 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~20 := stopRequestedInDirection_#t~ret76;havoc stopRequestedInDirection_#t~ret76;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~20 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~14 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~14; 877320#L1689 timeShift_#t~ret104 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret104;havoc timeShift_#t~ret104; 878123#L2045 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret78, continueInDirection_~dir, continueInDirection_~tmp~21;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~21;~currentHeading~0 := continueInDirection_~dir; 878125#L1733 assume !(1 == ~currentHeading~0); 885755#L1743 assume !(0 == ~currentFloorID~0); 885748#L1743-2 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 885726#L1749-5 havoc __utac_acc__Specification9_spec__3_#t~ret156, __utac_acc__Specification9_spec__3_#t~ret157, __utac_acc__Specification9_spec__3_#t~ret158, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~27, __utac_acc__Specification9_spec__3_~tmp___0~12, __utac_acc__Specification9_spec__3_~tmp___1~8;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~27;havoc __utac_acc__Specification9_spec__3_~tmp___0~12;havoc __utac_acc__Specification9_spec__3_~tmp___1~8;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 887399#L1124-3 __utac_acc__Specification9_spec__3_#t~ret156 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~27 := __utac_acc__Specification9_spec__3_#t~ret156;havoc __utac_acc__Specification9_spec__3_#t~ret156;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~27;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~10;havoc isEmpty_~retValue_acc~10; 887394#L1184-6 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~10 := 0;isEmpty_#res := isEmpty_~retValue_acc~10; 887391#L1216-6 __utac_acc__Specification9_spec__3_#t~ret157 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~8 := __utac_acc__Specification9_spec__3_#t~ret157;havoc __utac_acc__Specification9_spec__3_#t~ret157; 887390#L3162 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~8);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~7;havoc areDoorsOpen_~retValue_acc~7;areDoorsOpen_~retValue_acc~7 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~7; 887381#L1133 __utac_acc__Specification9_spec__3_#t~ret158 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~12 := __utac_acc__Specification9_spec__3_#t~ret158;havoc __utac_acc__Specification9_spec__3_#t~ret158; 887384#L3172 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___0~12); 887376#L3172-1 cleanup_~i~2 := 0; 887336#L651-2 assume !false; 887337#L652 [2019-01-14 04:07:25,703 INFO L796 eck$LassoCheckResult]: Loop: 887337#L652 cleanup_~__cil_tmp4~2 := ~cleanupTimeShifts~0 - 1; 933050#L655 assume cleanup_~i~2 < cleanup_~__cil_tmp4~2;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~5;havoc isBlocked_~retValue_acc~5;isBlocked_~retValue_acc~5 := 0;isBlocked_#res := isBlocked_~retValue_acc~5; 933049#L946 cleanup_#t~ret48 := isBlocked_#res;cleanup_~tmp___0~2 := cleanup_#t~ret48;havoc cleanup_#t~ret48; 933048#L659 assume 1 != cleanup_~tmp___0~2; 933047#L659-1 havoc isIdle_#res;havoc isIdle_#t~ret63, isIdle_~retValue_acc~12, isIdle_~tmp~18;havoc isIdle_~retValue_acc~12;havoc isIdle_~tmp~18;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret58, anyStopRequested_#t~ret59, anyStopRequested_#t~ret60, anyStopRequested_#t~ret61, anyStopRequested_#t~ret62, anyStopRequested_~retValue_acc~11, anyStopRequested_~tmp~17, anyStopRequested_~tmp___0~4, anyStopRequested_~tmp___1~3, anyStopRequested_~tmp___2~1, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~11;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~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 933046#L2505-25 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 933045#L2532-25 anyStopRequested_#t~ret58 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret58;havoc anyStopRequested_#t~ret58; 933044#L1232 assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~11 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~11; 931100#L1296 isIdle_#t~ret63 := anyStopRequested_#res;isIdle_~tmp~18 := isIdle_#t~ret63;havoc isIdle_#t~ret63;isIdle_~retValue_acc~12 := (if 0 == isIdle_~tmp~18 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~12; 933037#L1309 cleanup_#t~ret49 := isIdle_#res;cleanup_~tmp~11 := cleanup_#t~ret49;havoc cleanup_#t~ret49; 933036#L671 assume !(0 != cleanup_~tmp~11);havoc timeShift_#t~ret97, timeShift_#t~ret98, timeShift_#t~ret99, timeShift_#t~ret100, timeShift_#t~ret101, timeShift_#t~ret102, timeShift_#t~ret103, timeShift_#t~ret104, timeShift_#t~ret105, timeShift_#t~ret106, timeShift_#t~ret107, timeShift_~tmp~25, timeShift_~tmp___0~10, timeShift_~tmp___1~6, timeShift_~tmp___2~4, timeShift_~tmp___3~3, timeShift_~tmp___4~2, timeShift_~tmp___5~2, timeShift_~tmp___6~2, timeShift_~tmp___7~2, timeShift_~tmp___8~2, timeShift_~tmp___9~2;havoc timeShift_~tmp~25;havoc timeShift_~tmp___0~10;havoc timeShift_~tmp___1~6;havoc timeShift_~tmp___2~4;havoc timeShift_~tmp___3~3;havoc timeShift_~tmp___4~2;havoc timeShift_~tmp___5~2;havoc timeShift_~tmp___6~2;havoc timeShift_~tmp___7~2;havoc timeShift_~tmp___8~2;havoc timeShift_~tmp___9~2;havoc stopRequestedAtCurrentFloor_#res;havoc stopRequestedAtCurrentFloor_#t~ret81, stopRequestedAtCurrentFloor_#t~ret82, stopRequestedAtCurrentFloor_#t~ret83, stopRequestedAtCurrentFloor_#t~ret84, stopRequestedAtCurrentFloor_~retValue_acc~17, stopRequestedAtCurrentFloor_~tmp~23, stopRequestedAtCurrentFloor_~tmp___0~8;havoc stopRequestedAtCurrentFloor_~retValue_acc~17;havoc stopRequestedAtCurrentFloor_~tmp~23;havoc stopRequestedAtCurrentFloor_~tmp___0~8;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 933035#L2505-30 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 910487#L2532-30 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 933034#L2409-3 stopRequestedAtCurrentFloor_#t~ret81 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~23 := stopRequestedAtCurrentFloor_#t~ret81;havoc stopRequestedAtCurrentFloor_#t~ret81; 933033#L1793-1 assume 0 != stopRequestedAtCurrentFloor_~tmp~23;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 933032#L1124-4 stopRequestedAtCurrentFloor_#t~ret82 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~8 := stopRequestedAtCurrentFloor_#t~ret82;havoc stopRequestedAtCurrentFloor_#t~ret82; 933030#L1797-1 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~8);stopRequestedAtCurrentFloor_~retValue_acc~17 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~17; 933031#L1810-1 timeShift_#t~ret97 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret97;havoc timeShift_#t~ret97; 934518#L1946-1 assume !(0 != timeShift_~tmp___9~2); 934519#L2037-3 assume 1 == ~doorState~0;~doorState~0 := 0; 938292#L2037-5 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret75, stopRequestedInDirection_#t~ret76, stopRequestedInDirection_#t~ret77, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~14, stopRequestedInDirection_~tmp~20, stopRequestedInDirection_~tmp___0~6, stopRequestedInDirection_~__cil_tmp7~5, stopRequestedInDirection_~__cil_tmp8~5;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~14;havoc stopRequestedInDirection_~tmp~20;havoc stopRequestedInDirection_~tmp___0~6;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 938290#L2505-33 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 938288#L2532-33 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 938286#L2409-4 stopRequestedInDirection_#t~ret75 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~6 := stopRequestedInDirection_#t~ret75;havoc stopRequestedInDirection_#t~ret75; 938284#L1676-2 assume 0 != stopRequestedInDirection_~tmp___0~6;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 938282#L1124-5 stopRequestedInDirection_#t~ret76 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~20 := stopRequestedInDirection_#t~ret76;havoc stopRequestedInDirection_#t~ret76;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~20 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~14 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~14; 938280#L1689-2 timeShift_#t~ret104 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret104;havoc timeShift_#t~ret104; 938278#L2045-1 assume !(0 != timeShift_~tmp___8~2);getReverseHeading_#in~ofHeading := ~currentHeading~0;havoc getReverseHeading_#res;havoc getReverseHeading_~ofHeading, getReverseHeading_~retValue_acc~18;getReverseHeading_~ofHeading := getReverseHeading_#in~ofHeading;havoc getReverseHeading_~retValue_acc~18; 938276#L1819-2 assume 0 == getReverseHeading_~ofHeading;getReverseHeading_~retValue_acc~18 := 1;getReverseHeading_#res := getReverseHeading_~retValue_acc~18; 938274#L1824-2 timeShift_#t~ret105 := getReverseHeading_#res;timeShift_~tmp___6~2 := timeShift_#t~ret105;havoc timeShift_#t~ret105;stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := timeShift_~tmp___6~2, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret75, stopRequestedInDirection_#t~ret76, stopRequestedInDirection_#t~ret77, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~14, stopRequestedInDirection_~tmp~20, stopRequestedInDirection_~tmp___0~6, stopRequestedInDirection_~__cil_tmp7~5, stopRequestedInDirection_~__cil_tmp8~5;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~14;havoc stopRequestedInDirection_~tmp~20;havoc stopRequestedInDirection_~tmp___0~6;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 938272#L2505-44 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 915673#L2532-44 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 938270#L2409-5 stopRequestedInDirection_#t~ret75 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~6 := stopRequestedInDirection_#t~ret75;havoc stopRequestedInDirection_#t~ret75; 938268#L1676-3 assume 0 != stopRequestedInDirection_~tmp___0~6;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 938266#L1124-6 stopRequestedInDirection_#t~ret76 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~20 := stopRequestedInDirection_#t~ret76;havoc stopRequestedInDirection_#t~ret76;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~20 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~14 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~14; 938264#L1689-3 timeShift_#t~ret106 := stopRequestedInDirection_#res;timeShift_~tmp___7~2 := timeShift_#t~ret106;havoc timeShift_#t~ret106; 938261#L2054-1 assume !(0 != timeShift_~tmp___7~2);continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret78, continueInDirection_~dir, continueInDirection_~tmp~21;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~21;~currentHeading~0 := continueInDirection_~dir; 938260#L1733-5 assume !(1 == ~currentHeading~0); 877005#L1743-15 assume !(0 == ~currentFloorID~0); 876983#L1743-17 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 876984#L1749-11 havoc __utac_acc__Specification9_spec__3_#t~ret156, __utac_acc__Specification9_spec__3_#t~ret157, __utac_acc__Specification9_spec__3_#t~ret158, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~27, __utac_acc__Specification9_spec__3_~tmp___0~12, __utac_acc__Specification9_spec__3_~tmp___1~8;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~27;havoc __utac_acc__Specification9_spec__3_~tmp___0~12;havoc __utac_acc__Specification9_spec__3_~tmp___1~8;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 933096#L1124-7 __utac_acc__Specification9_spec__3_#t~ret156 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~27 := __utac_acc__Specification9_spec__3_#t~ret156;havoc __utac_acc__Specification9_spec__3_#t~ret156;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~27;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~10;havoc isEmpty_~retValue_acc~10; 933095#L1184-13 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~10 := 0;isEmpty_#res := isEmpty_~retValue_acc~10; 933089#L1216-13 __utac_acc__Specification9_spec__3_#t~ret157 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~8 := __utac_acc__Specification9_spec__3_#t~ret157;havoc __utac_acc__Specification9_spec__3_#t~ret157; 933094#L3162-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~8);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~7;havoc areDoorsOpen_~retValue_acc~7;areDoorsOpen_~retValue_acc~7 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~7; 933072#L1133-1 __utac_acc__Specification9_spec__3_#t~ret158 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~12 := __utac_acc__Specification9_spec__3_#t~ret158;havoc __utac_acc__Specification9_spec__3_#t~ret158; 933062#L3172-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___0~12); 933060#L3172-3 cleanup_~i~2 := 1 + cleanup_~i~2; 933058#L651-2 assume !false; 887337#L652 [2019-01-14 04:07:25,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:07:25,704 INFO L82 PathProgramCache]: Analyzing trace with hash -61251997, now seen corresponding path program 1 times [2019-01-14 04:07:25,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:07:25,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:07:25,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:07:25,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:07:25,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:07:25,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:07:25,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:07:25,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:07:25,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 04:07:25,874 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:07:25,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:07:25,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1020838168, now seen corresponding path program 2 times [2019-01-14 04:07:25,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:07:25,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:07:25,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:07:25,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:07:25,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:07:25,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:07:26,549 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-14 04:07:26,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:07:26,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:07:26,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-01-14 04:07:26,678 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:07:26,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-14 04:07:26,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-01-14 04:07:26,679 INFO L87 Difference]: Start difference. First operand 61779 states and 115143 transitions. cyclomatic complexity: 53379 Second operand 14 states. [2019-01-14 04:07:37,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:07:37,993 INFO L93 Difference]: Finished difference Result 465504 states and 865666 transitions. [2019-01-14 04:07:37,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-01-14 04:07:37,994 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 465504 states and 865666 transitions. [2019-01-14 04:07:41,353 INFO L131 ngComponentsAnalysis]: Automaton has 39 accepting balls. 268106 [2019-01-14 04:07:42,695 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 465504 states to 465478 states and 865564 transitions. [2019-01-14 04:07:42,695 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 296236 [2019-01-14 04:07:42,908 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 296236 [2019-01-14 04:07:42,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 465478 states and 865564 transitions. [2019-01-14 04:07:42,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:07:42,909 INFO L706 BuchiCegarLoop]: Abstraction has 465478 states and 865564 transitions. [2019-01-14 04:07:43,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465478 states and 865564 transitions. [2019-01-14 04:07:45,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465478 to 91088. [2019-01-14 04:07:45,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91088 states. [2019-01-14 04:07:55,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91088 states to 91088 states and 169547 transitions. [2019-01-14 04:07:55,938 INFO L729 BuchiCegarLoop]: Abstraction has 91088 states and 169547 transitions. [2019-01-14 04:07:55,938 INFO L609 BuchiCegarLoop]: Abstraction has 91088 states and 169547 transitions. [2019-01-14 04:07:55,938 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-14 04:07:55,938 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91088 states and 169547 transitions. [2019-01-14 04:07:56,094 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 47851 [2019-01-14 04:07:56,094 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:07:56,094 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:07:56,098 INFO L867 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] [2019-01-14 04:07:56,098 INFO L868 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:07:56,100 INFO L794 eck$LassoCheckResult]: Stem: 1405494#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(30);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(9);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(21);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(30);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(9);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(21);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(30);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(9);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(25);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(25);~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~cleanupTimeShifts~0 := 12;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0;call #t~string108.base, #t~string108.offset := #Ultimate.allocOnStack(10);call #t~string110.base, #t~string110.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string110.base, #t~string110.offset, 1);call write~init~int(95, #t~string110.base, 1 + #t~string110.offset, 1);call write~init~int(93, #t~string110.base, 2 + #t~string110.offset, 1);call write~init~int(0, #t~string110.base, 3 + #t~string110.offset, 1);call #t~string112.base, #t~string112.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string112.base, #t~string112.offset, 1);call write~init~int(93, #t~string112.base, 1 + #t~string112.offset, 1);call write~init~int(32, #t~string112.base, 2 + #t~string112.offset, 1);call write~init~int(0, #t~string112.base, 3 + #t~string112.offset, 1);call #t~string114.base, #t~string114.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string114.base, #t~string114.offset, 1);call write~init~int(97, #t~string114.base, 1 + #t~string114.offset, 1);call write~init~int(116, #t~string114.base, 2 + #t~string114.offset, 1);call write~init~int(32, #t~string114.base, 3 + #t~string114.offset, 1);call write~init~int(0, #t~string114.base, 4 + #t~string114.offset, 1);call #t~string116.base, #t~string116.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string116.base, #t~string116.offset, 1);call write~init~int(105, #t~string116.base, 1 + #t~string116.offset, 1);call write~init~int(0, #t~string116.base, 2 + #t~string116.offset, 1);call #t~string118.base, #t~string118.offset := #Ultimate.allocOnStack(10);call #t~string120.base, #t~string120.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string120.base, #t~string120.offset, 1);call write~init~int(112, #t~string120.base, 1 + #t~string120.offset, 1);call write~init~int(0, #t~string120.base, 2 + #t~string120.offset, 1);call #t~string122.base, #t~string122.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string122.base, #t~string122.offset, 1);call write~init~int(111, #t~string122.base, 1 + #t~string122.offset, 1);call write~init~int(119, #t~string122.base, 2 + #t~string122.offset, 1);call write~init~int(110, #t~string122.base, 3 + #t~string122.offset, 1);call write~init~int(0, #t~string122.base, 4 + #t~string122.offset, 1);call #t~string124.base, #t~string124.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string124.base, #t~string124.offset, 1);call write~init~int(73, #t~string124.base, 1 + #t~string124.offset, 1);call write~init~int(76, #t~string124.base, 2 + #t~string124.offset, 1);call write~init~int(95, #t~string124.base, 3 + #t~string124.offset, 1);call write~init~int(112, #t~string124.base, 4 + #t~string124.offset, 1);call write~init~int(58, #t~string124.base, 5 + #t~string124.offset, 1);call write~init~int(0, #t~string124.base, 6 + #t~string124.offset, 1);call #t~string126.base, #t~string126.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string126.base, #t~string126.offset, 1);call write~init~int(37, #t~string126.base, 1 + #t~string126.offset, 1);call write~init~int(105, #t~string126.base, 2 + #t~string126.offset, 1);call write~init~int(0, #t~string126.base, 3 + #t~string126.offset, 1);call #t~string128.base, #t~string128.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string128.base, #t~string128.offset, 1);call write~init~int(37, #t~string128.base, 1 + #t~string128.offset, 1);call write~init~int(105, #t~string128.base, 2 + #t~string128.offset, 1);call write~init~int(0, #t~string128.base, 3 + #t~string128.offset, 1);call #t~string130.base, #t~string130.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string130.base, #t~string130.offset, 1);call write~init~int(37, #t~string130.base, 1 + #t~string130.offset, 1);call write~init~int(105, #t~string130.base, 2 + #t~string130.offset, 1);call write~init~int(0, #t~string130.base, 3 + #t~string130.offset, 1);call #t~string132.base, #t~string132.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string132.base, #t~string132.offset, 1);call write~init~int(37, #t~string132.base, 1 + #t~string132.offset, 1);call write~init~int(105, #t~string132.base, 2 + #t~string132.offset, 1);call write~init~int(0, #t~string132.base, 3 + #t~string132.offset, 1);call #t~string134.base, #t~string134.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string134.base, #t~string134.offset, 1);call write~init~int(37, #t~string134.base, 1 + #t~string134.offset, 1);call write~init~int(105, #t~string134.base, 2 + #t~string134.offset, 1);call write~init~int(0, #t~string134.base, 3 + #t~string134.offset, 1);call #t~string136.base, #t~string136.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string136.base, #t~string136.offset, 1);call write~init~int(70, #t~string136.base, 1 + #t~string136.offset, 1);call write~init~int(95, #t~string136.base, 2 + #t~string136.offset, 1);call write~init~int(112, #t~string136.base, 3 + #t~string136.offset, 1);call write~init~int(58, #t~string136.base, 4 + #t~string136.offset, 1);call write~init~int(0, #t~string136.base, 5 + #t~string136.offset, 1);call #t~string139.base, #t~string139.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string139.base, #t~string139.offset, 1);call write~init~int(37, #t~string139.base, 1 + #t~string139.offset, 1);call write~init~int(105, #t~string139.base, 2 + #t~string139.offset, 1);call write~init~int(0, #t~string139.base, 3 + #t~string139.offset, 1);call #t~string142.base, #t~string142.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string142.base, #t~string142.offset, 1);call write~init~int(37, #t~string142.base, 1 + #t~string142.offset, 1);call write~init~int(105, #t~string142.base, 2 + #t~string142.offset, 1);call write~init~int(0, #t~string142.base, 3 + #t~string142.offset, 1);call #t~string145.base, #t~string145.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string145.base, #t~string145.offset, 1);call write~init~int(37, #t~string145.base, 1 + #t~string145.offset, 1);call write~init~int(105, #t~string145.base, 2 + #t~string145.offset, 1);call write~init~int(0, #t~string145.base, 3 + #t~string145.offset, 1);call #t~string148.base, #t~string148.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string148.base, #t~string148.offset, 1);call write~init~int(37, #t~string148.base, 1 + #t~string148.offset, 1);call write~init~int(105, #t~string148.base, 2 + #t~string148.offset, 1);call write~init~int(0, #t~string148.base, 3 + #t~string148.offset, 1);call #t~string151.base, #t~string151.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string151.base, #t~string151.offset, 1);call write~init~int(37, #t~string151.base, 1 + #t~string151.offset, 1);call write~init~int(105, #t~string151.base, 2 + #t~string151.offset, 1);call write~init~int(0, #t~string151.base, 3 + #t~string151.offset, 1);call #t~string153.base, #t~string153.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string153.base, #t~string153.offset, 1);call write~init~int(0, #t~string153.base, 1 + #t~string153.offset, 1);~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 1405495#L-1 havoc main_#res;havoc main_#t~ret54, main_~retValue_acc~4, main_~tmp~13;havoc main_~retValue_acc~4;havoc main_~tmp~13; 1404795#L3286 havoc valid_product_#res;havoc valid_product_~retValue_acc~26;havoc valid_product_~retValue_acc~26;valid_product_~retValue_acc~26 := 1;valid_product_#res := valid_product_~retValue_acc~26; 1404796#L3294 main_#t~ret54 := valid_product_#res;main_~tmp~13 := main_#t~ret54;havoc main_#t~ret54; 1406549#L850 assume 0 != main_~tmp~13; 1404531#L819 ~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 1404532#L3119 havoc bigMacCall_#t~ret47, bigMacCall_~tmp~10;havoc bigMacCall_~tmp~10;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~28;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~28; 1405969#L3342 assume !(0 == getOrigin_~person); 1405970#L3346 assume !(1 == getOrigin_~person); 1407711#L3350 assume !(2 == getOrigin_~person); 1407712#L3354 assume !(3 == getOrigin_~person); 1408926#L3358 assume !(4 == getOrigin_~person); 1408419#L3362 assume 5 == getOrigin_~person;getOrigin_~retValue_acc~28 := 1;getOrigin_#res := getOrigin_~retValue_acc~28; 1405381#L3367 bigMacCall_#t~ret47 := getOrigin_#res;bigMacCall_~tmp~10 := bigMacCall_#t~ret47;havoc bigMacCall_#t~ret47;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~10;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 1405382#L2776 assume !(0 == initPersonOnFloor_~floor); 1406776#L2803 assume 1 == initPersonOnFloor_~floor; 1406777#L2804 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_1~0 := 1; 1404677#L2884-1 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 1405562#L2568 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 1404602#L2580-2 havoc cleanup_#t~ret48, cleanup_#t~ret49, cleanup_~i~2, cleanup_~tmp~11, cleanup_~tmp___0~2, cleanup_~__cil_tmp4~2;havoc cleanup_~i~2;havoc cleanup_~tmp~11;havoc cleanup_~tmp___0~2;havoc cleanup_~__cil_tmp4~2;havoc timeShift_#t~ret97, timeShift_#t~ret98, timeShift_#t~ret99, timeShift_#t~ret100, timeShift_#t~ret101, timeShift_#t~ret102, timeShift_#t~ret103, timeShift_#t~ret104, timeShift_#t~ret105, timeShift_#t~ret106, timeShift_#t~ret107, timeShift_~tmp~25, timeShift_~tmp___0~10, timeShift_~tmp___1~6, timeShift_~tmp___2~4, timeShift_~tmp___3~3, timeShift_~tmp___4~2, timeShift_~tmp___5~2, timeShift_~tmp___6~2, timeShift_~tmp___7~2, timeShift_~tmp___8~2, timeShift_~tmp___9~2;havoc timeShift_~tmp~25;havoc timeShift_~tmp___0~10;havoc timeShift_~tmp___1~6;havoc timeShift_~tmp___2~4;havoc timeShift_~tmp___3~3;havoc timeShift_~tmp___4~2;havoc timeShift_~tmp___5~2;havoc timeShift_~tmp___6~2;havoc timeShift_~tmp___7~2;havoc timeShift_~tmp___8~2;havoc timeShift_~tmp___9~2;havoc stopRequestedAtCurrentFloor_#res;havoc stopRequestedAtCurrentFloor_#t~ret81, stopRequestedAtCurrentFloor_#t~ret82, stopRequestedAtCurrentFloor_#t~ret83, stopRequestedAtCurrentFloor_#t~ret84, stopRequestedAtCurrentFloor_~retValue_acc~17, stopRequestedAtCurrentFloor_~tmp~23, stopRequestedAtCurrentFloor_~tmp___0~8;havoc stopRequestedAtCurrentFloor_~retValue_acc~17;havoc stopRequestedAtCurrentFloor_~tmp~23;havoc stopRequestedAtCurrentFloor_~tmp___0~8;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 1404603#L2505 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 1405525#L2532 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 1405526#L2409 stopRequestedAtCurrentFloor_#t~ret81 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~23 := stopRequestedAtCurrentFloor_#t~ret81;havoc stopRequestedAtCurrentFloor_#t~ret81; 1409120#L1793 assume 0 != stopRequestedAtCurrentFloor_~tmp~23;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 1409121#L1124 stopRequestedAtCurrentFloor_#t~ret82 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~8 := stopRequestedAtCurrentFloor_#t~ret82;havoc stopRequestedAtCurrentFloor_#t~ret82; 1409103#L1797 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~8);stopRequestedAtCurrentFloor_~retValue_acc~17 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~17; 1406940#L1810 timeShift_#t~ret97 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret97;havoc timeShift_#t~ret97; 1406941#L1946 assume !(0 != timeShift_~tmp___9~2); 1409209#L2037 assume !(1 == ~doorState~0); 1409208#L2037-2 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret75, stopRequestedInDirection_#t~ret76, stopRequestedInDirection_#t~ret77, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~14, stopRequestedInDirection_~tmp~20, stopRequestedInDirection_~tmp___0~6, stopRequestedInDirection_~__cil_tmp7~5, stopRequestedInDirection_~__cil_tmp8~5;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~14;havoc stopRequestedInDirection_~tmp~20;havoc stopRequestedInDirection_~tmp___0~6;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 1406015#L2505-3 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 1405533#L2532-3 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 1405534#L2409-1 stopRequestedInDirection_#t~ret75 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~6 := stopRequestedInDirection_#t~ret75;havoc stopRequestedInDirection_#t~ret75; 1407780#L1676 assume 0 != stopRequestedInDirection_~tmp___0~6;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 1407781#L1124-1 stopRequestedInDirection_#t~ret76 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~20 := stopRequestedInDirection_#t~ret76;havoc stopRequestedInDirection_#t~ret76;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~20 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~14 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~14; 1409499#L1689 timeShift_#t~ret104 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret104;havoc timeShift_#t~ret104; 1409500#L2045 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret78, continueInDirection_~dir, continueInDirection_~tmp~21;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~21;~currentHeading~0 := continueInDirection_~dir; 1409518#L1733 assume !(1 == ~currentHeading~0); 1420863#L1743 assume !(0 == ~currentFloorID~0); 1420860#L1743-2 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 1420848#L1749-5 havoc __utac_acc__Specification9_spec__3_#t~ret156, __utac_acc__Specification9_spec__3_#t~ret157, __utac_acc__Specification9_spec__3_#t~ret158, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~27, __utac_acc__Specification9_spec__3_~tmp___0~12, __utac_acc__Specification9_spec__3_~tmp___1~8;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~27;havoc __utac_acc__Specification9_spec__3_~tmp___0~12;havoc __utac_acc__Specification9_spec__3_~tmp___1~8;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 1433778#L1124-3 __utac_acc__Specification9_spec__3_#t~ret156 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~27 := __utac_acc__Specification9_spec__3_#t~ret156;havoc __utac_acc__Specification9_spec__3_#t~ret156;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~27;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~10;havoc isEmpty_~retValue_acc~10; 1433775#L1184-6 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~10 := 0;isEmpty_#res := isEmpty_~retValue_acc~10; 1433771#L1216-6 __utac_acc__Specification9_spec__3_#t~ret157 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~8 := __utac_acc__Specification9_spec__3_#t~ret157;havoc __utac_acc__Specification9_spec__3_#t~ret157; 1433772#L3162 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~8);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~7;havoc areDoorsOpen_~retValue_acc~7;areDoorsOpen_~retValue_acc~7 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~7; 1433760#L1133 __utac_acc__Specification9_spec__3_#t~ret158 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~12 := __utac_acc__Specification9_spec__3_#t~ret158;havoc __utac_acc__Specification9_spec__3_#t~ret158; 1433763#L3172 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___0~12); 1433755#L3172-1 cleanup_~i~2 := 0; 1433753#L651-2 assume !false; 1433754#L652 [2019-01-14 04:07:56,103 INFO L796 eck$LassoCheckResult]: Loop: 1433754#L652 cleanup_~__cil_tmp4~2 := ~cleanupTimeShifts~0 - 1; 1491474#L655 assume cleanup_~i~2 < cleanup_~__cil_tmp4~2;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~5;havoc isBlocked_~retValue_acc~5;isBlocked_~retValue_acc~5 := 0;isBlocked_#res := isBlocked_~retValue_acc~5; 1441240#L946 cleanup_#t~ret48 := isBlocked_#res;cleanup_~tmp___0~2 := cleanup_#t~ret48;havoc cleanup_#t~ret48; 1441239#L659 assume 1 != cleanup_~tmp___0~2; 1441238#L659-1 havoc isIdle_#res;havoc isIdle_#t~ret63, isIdle_~retValue_acc~12, isIdle_~tmp~18;havoc isIdle_~retValue_acc~12;havoc isIdle_~tmp~18;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret58, anyStopRequested_#t~ret59, anyStopRequested_#t~ret60, anyStopRequested_#t~ret61, anyStopRequested_#t~ret62, anyStopRequested_~retValue_acc~11, anyStopRequested_~tmp~17, anyStopRequested_~tmp___0~4, anyStopRequested_~tmp___1~3, anyStopRequested_~tmp___2~1, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~11;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~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 1441237#L2505-25 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 1441236#L2532-25 anyStopRequested_#t~ret58 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret58;havoc anyStopRequested_#t~ret58; 1441235#L1232 assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~11 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~11; 1438395#L1296 isIdle_#t~ret63 := anyStopRequested_#res;isIdle_~tmp~18 := isIdle_#t~ret63;havoc isIdle_#t~ret63;isIdle_~retValue_acc~12 := (if 0 == isIdle_~tmp~18 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~12; 1441232#L1309 cleanup_#t~ret49 := isIdle_#res;cleanup_~tmp~11 := cleanup_#t~ret49;havoc cleanup_#t~ret49; 1441174#L671 assume !(0 != cleanup_~tmp~11);havoc timeShift_#t~ret97, timeShift_#t~ret98, timeShift_#t~ret99, timeShift_#t~ret100, timeShift_#t~ret101, timeShift_#t~ret102, timeShift_#t~ret103, timeShift_#t~ret104, timeShift_#t~ret105, timeShift_#t~ret106, timeShift_#t~ret107, timeShift_~tmp~25, timeShift_~tmp___0~10, timeShift_~tmp___1~6, timeShift_~tmp___2~4, timeShift_~tmp___3~3, timeShift_~tmp___4~2, timeShift_~tmp___5~2, timeShift_~tmp___6~2, timeShift_~tmp___7~2, timeShift_~tmp___8~2, timeShift_~tmp___9~2;havoc timeShift_~tmp~25;havoc timeShift_~tmp___0~10;havoc timeShift_~tmp___1~6;havoc timeShift_~tmp___2~4;havoc timeShift_~tmp___3~3;havoc timeShift_~tmp___4~2;havoc timeShift_~tmp___5~2;havoc timeShift_~tmp___6~2;havoc timeShift_~tmp___7~2;havoc timeShift_~tmp___8~2;havoc timeShift_~tmp___9~2;havoc stopRequestedAtCurrentFloor_#res;havoc stopRequestedAtCurrentFloor_#t~ret81, stopRequestedAtCurrentFloor_#t~ret82, stopRequestedAtCurrentFloor_#t~ret83, stopRequestedAtCurrentFloor_#t~ret84, stopRequestedAtCurrentFloor_~retValue_acc~17, stopRequestedAtCurrentFloor_~tmp~23, stopRequestedAtCurrentFloor_~tmp___0~8;havoc stopRequestedAtCurrentFloor_~retValue_acc~17;havoc stopRequestedAtCurrentFloor_~tmp~23;havoc stopRequestedAtCurrentFloor_~tmp___0~8;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 1438321#L2505-30 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 1438320#L2532-30 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 1438319#L2409-3 stopRequestedAtCurrentFloor_#t~ret81 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~23 := stopRequestedAtCurrentFloor_#t~ret81;havoc stopRequestedAtCurrentFloor_#t~ret81; 1438317#L1793-1 assume 0 != stopRequestedAtCurrentFloor_~tmp~23;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 1438318#L1124-4 stopRequestedAtCurrentFloor_#t~ret82 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~8 := stopRequestedAtCurrentFloor_#t~ret82;havoc stopRequestedAtCurrentFloor_#t~ret82; 1474369#L1797-1 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~8);stopRequestedAtCurrentFloor_~retValue_acc~17 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~17; 1437135#L1810-1 timeShift_#t~ret97 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret97;havoc timeShift_#t~ret97; 1437134#L1946-1 assume !(0 != timeShift_~tmp___9~2); 1408879#L2037-3 assume 1 == ~doorState~0;~doorState~0 := 0; 1408880#L2037-5 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret75, stopRequestedInDirection_#t~ret76, stopRequestedInDirection_#t~ret77, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~14, stopRequestedInDirection_~tmp~20, stopRequestedInDirection_~tmp___0~6, stopRequestedInDirection_~__cil_tmp7~5, stopRequestedInDirection_~__cil_tmp8~5;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~14;havoc stopRequestedInDirection_~tmp~20;havoc stopRequestedInDirection_~tmp___0~6;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 1474372#L2505-33 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 1474371#L2532-33 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 1474370#L2409-4 stopRequestedInDirection_#t~ret75 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~6 := stopRequestedInDirection_#t~ret75;havoc stopRequestedInDirection_#t~ret75; 1407799#L1676-2 assume 0 != stopRequestedInDirection_~tmp___0~6;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 1407800#L1124-5 stopRequestedInDirection_#t~ret76 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~20 := stopRequestedInDirection_#t~ret76;havoc stopRequestedInDirection_#t~ret76;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~20 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~14 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~14; 1478685#L1689-2 timeShift_#t~ret104 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret104;havoc timeShift_#t~ret104; 1469856#L2045-1 assume !(0 != timeShift_~tmp___8~2);getReverseHeading_#in~ofHeading := ~currentHeading~0;havoc getReverseHeading_#res;havoc getReverseHeading_~ofHeading, getReverseHeading_~retValue_acc~18;getReverseHeading_~ofHeading := getReverseHeading_#in~ofHeading;havoc getReverseHeading_~retValue_acc~18; 1469854#L1819-2 assume !(0 == getReverseHeading_~ofHeading);getReverseHeading_~retValue_acc~18 := 0;getReverseHeading_#res := getReverseHeading_~retValue_acc~18; 1469855#L1824-2 timeShift_#t~ret105 := getReverseHeading_#res;timeShift_~tmp___6~2 := timeShift_#t~ret105;havoc timeShift_#t~ret105;stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := timeShift_~tmp___6~2, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret75, stopRequestedInDirection_#t~ret76, stopRequestedInDirection_#t~ret77, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~14, stopRequestedInDirection_~tmp~20, stopRequestedInDirection_~tmp___0~6, stopRequestedInDirection_~__cil_tmp7~5, stopRequestedInDirection_~__cil_tmp8~5;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~14;havoc stopRequestedInDirection_~tmp~20;havoc stopRequestedInDirection_~tmp___0~6;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 1408224#L2505-44 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 1408225#L2532-44 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 1489137#L2409-5 stopRequestedInDirection_#t~ret75 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~6 := stopRequestedInDirection_#t~ret75;havoc stopRequestedInDirection_#t~ret75; 1489119#L1676-3 assume 0 != stopRequestedInDirection_~tmp___0~6;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 1489118#L1124-6 stopRequestedInDirection_#t~ret76 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~20 := stopRequestedInDirection_#t~ret76;havoc stopRequestedInDirection_#t~ret76;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~20 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~14 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~14; 1489116#L1689-3 timeShift_#t~ret106 := stopRequestedInDirection_#res;timeShift_~tmp___7~2 := timeShift_#t~ret106;havoc timeShift_#t~ret106; 1489113#L2054-1 assume !(0 != timeShift_~tmp___7~2);continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret78, continueInDirection_~dir, continueInDirection_~tmp~21;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~21;~currentHeading~0 := continueInDirection_~dir; 1489114#L1733-5 assume !(1 == ~currentHeading~0); 1489072#L1743-15 assume !(0 == ~currentFloorID~0); 1489065#L1743-17 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 1491516#L1749-11 havoc __utac_acc__Specification9_spec__3_#t~ret156, __utac_acc__Specification9_spec__3_#t~ret157, __utac_acc__Specification9_spec__3_#t~ret158, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~27, __utac_acc__Specification9_spec__3_~tmp___0~12, __utac_acc__Specification9_spec__3_~tmp___1~8;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~27;havoc __utac_acc__Specification9_spec__3_~tmp___0~12;havoc __utac_acc__Specification9_spec__3_~tmp___1~8;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 1491514#L1124-7 __utac_acc__Specification9_spec__3_#t~ret156 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~27 := __utac_acc__Specification9_spec__3_#t~ret156;havoc __utac_acc__Specification9_spec__3_#t~ret156;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~27;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~10;havoc isEmpty_~retValue_acc~10; 1491513#L1184-13 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~10 := 0;isEmpty_#res := isEmpty_~retValue_acc~10; 1491508#L1216-13 __utac_acc__Specification9_spec__3_#t~ret157 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~8 := __utac_acc__Specification9_spec__3_#t~ret157;havoc __utac_acc__Specification9_spec__3_#t~ret157; 1491506#L3162-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~8);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~7;havoc areDoorsOpen_~retValue_acc~7;areDoorsOpen_~retValue_acc~7 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~7; 1491502#L1133-1 __utac_acc__Specification9_spec__3_#t~ret158 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~12 := __utac_acc__Specification9_spec__3_#t~ret158;havoc __utac_acc__Specification9_spec__3_#t~ret158; 1491492#L3172-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___0~12); 1491491#L3172-3 cleanup_~i~2 := 1 + cleanup_~i~2; 1491490#L651-2 assume !false; 1433754#L652 [2019-01-14 04:07:56,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:07:56,104 INFO L82 PathProgramCache]: Analyzing trace with hash -61251997, now seen corresponding path program 2 times [2019-01-14 04:07:56,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:07:56,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:07:56,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:07:56,108 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:07:56,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:07:56,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:07:56,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:07:56,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:07:56,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 04:07:56,245 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:07:56,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:07:56,245 INFO L82 PathProgramCache]: Analyzing trace with hash -598136342, now seen corresponding path program 1 times [2019-01-14 04:07:56,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:07:56,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:07:56,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:07:56,246 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:07:56,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:07:56,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:07:56,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:07:57,746 WARN L181 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 242 DAG size of output: 220 [2019-01-14 04:07:57,748 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-01-14 04:07:59,377 WARN L181 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 185 DAG size of output: 140 [2019-01-14 04:07:59,380 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:07:59,380 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:07:59,380 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:07:59,380 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:07:59,380 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:07:59,380 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:07:59,380 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:07:59,381 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:07:59,381 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec9_product27_true-unreach-call_true-termination.cil.c_Iteration8_Loop [2019-01-14 04:07:59,381 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:07:59,381 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:07:59,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:59,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:59,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:59,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:59,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:59,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:59,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:59,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:59,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:59,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:59,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:59,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:59,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:59,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:59,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:59,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:59,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:59,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:59,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:59,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:59,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:59,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:59,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:59,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:59,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:59,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:59,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:59,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:59,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:59,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:59,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:59,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:59,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:59,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:59,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:59,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:59,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:59,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:59,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:59,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:59,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:59,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:59,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:59,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:59,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:59,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:59,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:59,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:59,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:59,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:59,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:59,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:59,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:59,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:59,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:59,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:59,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:59,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:59,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:59,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:59,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:59,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:59,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:59,845 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-14 04:08:00,460 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 25 [2019-01-14 04:08:00,616 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:08:00,616 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:00,629 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:08:00,630 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:08:00,639 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:08:00,640 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_~tmp___9~2=0, ULTIMATE.start_stopRequestedAtCurrentFloor_#res=0, ULTIMATE.start_stopRequestedAtCurrentFloor_~retValue_acc~17=0} Honda state: {ULTIMATE.start_timeShift_~tmp___9~2=0, ULTIMATE.start_stopRequestedAtCurrentFloor_#res=0, ULTIMATE.start_stopRequestedAtCurrentFloor_~retValue_acc~17=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:00,662 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:08:00,662 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:08:00,669 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:08:00,669 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_#t~ret99=0} Honda state: {ULTIMATE.start_timeShift_#t~ret99=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:00,693 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:08:00,693 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:08:00,696 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:08:00,696 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_continueInDirection_#t~ret78=0} Honda state: {ULTIMATE.start_continueInDirection_#t~ret78=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:00,718 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:08:00,719 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:08:00,721 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:08:00,722 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_#t~ret107=0} Honda state: {ULTIMATE.start_timeShift_#t~ret107=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:00,744 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:08:00,744 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:08:00,747 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:08:00,747 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_~tmp___0~4=0} Honda state: {ULTIMATE.start_anyStopRequested_~tmp___0~4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:00,772 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:08:00,772 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:08:00,776 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:08:00,776 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isExecutiveFloorCalling_#t~ret155=0} Honda state: {ULTIMATE.start_isExecutiveFloorCalling_#t~ret155=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:00,798 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:08:00,798 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:08:00,801 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:08:00,801 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_#t~ret103=0} Honda state: {ULTIMATE.start_timeShift_#t~ret103=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:00,824 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:08:00,824 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:08:00,830 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:08:00,830 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stopRequestedInDirection_~__cil_tmp7~5=0} Honda state: {ULTIMATE.start_stopRequestedInDirection_~__cil_tmp7~5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:00,854 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:08:00,854 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:08:00,858 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:08:00,858 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 04:08:00,881 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:08:00,881 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:00,896 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:08:00,898 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_#res=1, ULTIMATE.start_isIdle_~tmp~18=1, ULTIMATE.start_anyStopRequested_~retValue_acc~11=1} Honda state: {ULTIMATE.start_anyStopRequested_#res=1, ULTIMATE.start_isIdle_~tmp~18=1, ULTIMATE.start_anyStopRequested_~retValue_acc~11=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:00,932 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:08:00,933 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:08:00,947 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:08:00,947 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stopRequestedInDirection_#in~dir=0, ULTIMATE.start_getReverseHeading_~retValue_acc~18=0, ULTIMATE.start_stopRequestedInDirection_~dir=0, ULTIMATE.start_timeShift_~tmp___6~2=0, ULTIMATE.start_getReverseHeading_#res=0} Honda state: {ULTIMATE.start_stopRequestedInDirection_#in~dir=0, ULTIMATE.start_getReverseHeading_~retValue_acc~18=0, ULTIMATE.start_stopRequestedInDirection_~dir=0, ULTIMATE.start_timeShift_~tmp___6~2=0, ULTIMATE.start_getReverseHeading_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 04:08:00,982 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:08:00,982 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:00,990 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:08:00,990 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_cleanup_#t~ret48=0} Honda state: {ULTIMATE.start_cleanup_#t~ret48=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:01,021 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:08:01,021 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:08:01,026 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:08:01,026 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stopRequestedInDirection_~__cil_tmp8~5=1} Honda state: {ULTIMATE.start_stopRequestedInDirection_~__cil_tmp8~5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:01,114 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:08:01,114 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:08:01,118 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:08:01,118 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_#t~ret60=0} Honda state: {ULTIMATE.start_anyStopRequested_#t~ret60=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:01,143 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:08:01,144 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:08:01,147 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:08:01,147 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_#t~ret62=0} Honda state: {ULTIMATE.start_anyStopRequested_#t~ret62=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:01,170 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:08:01,170 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:08:01,173 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:08:01,173 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stopRequestedAtCurrentFloor_#t~ret83=0} Honda state: {ULTIMATE.start_stopRequestedAtCurrentFloor_#t~ret83=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:01,196 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:08:01,196 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:08:01,199 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:08:01,200 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_~tmp___1~6=0} Honda state: {ULTIMATE.start_timeShift_~tmp___1~6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:01,223 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:08:01,223 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:08:01,232 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:08:01,233 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_~tmp___2~4=0} Honda state: {ULTIMATE.start_timeShift_~tmp___2~4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 04:08:01,253 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:08:01,254 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:01,257 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:08:01,257 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_#t~ret59=0} Honda state: {ULTIMATE.start_anyStopRequested_#t~ret59=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:01,279 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:08:01,279 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:08:01,281 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:08:01,282 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_#t~ret100=0} Honda state: {ULTIMATE.start_timeShift_#t~ret100=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 04:08:01,303 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:08:01,303 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:01,307 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:08:01,307 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isIdle_#res=0, ULTIMATE.start_isIdle_~retValue_acc~12=0, ULTIMATE.start_cleanup_~tmp~11=0} Honda state: {ULTIMATE.start_isIdle_#res=0, ULTIMATE.start_isIdle_~retValue_acc~12=0, ULTIMATE.start_cleanup_~tmp~11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:01,330 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:08:01,330 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:01,371 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:08:01,371 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:08:01,383 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:08:01,410 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:08:01,410 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:08:01,411 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:08:01,411 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:08:01,411 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:08:01,411 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:01,411 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:08:01,411 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:08:01,411 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec9_product27_true-unreach-call_true-termination.cil.c_Iteration8_Loop [2019-01-14 04:08:01,411 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:08:01,411 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:08:01,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:01,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:01,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:01,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:01,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:01,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:01,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:01,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:01,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:01,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:01,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:01,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:01,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:01,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:01,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:01,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:01,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:01,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:01,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:01,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:01,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:01,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:01,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:01,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:01,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:01,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:01,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:01,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:01,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:01,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:01,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:01,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:01,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:01,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:01,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:01,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:01,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:01,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:01,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:01,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:01,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:01,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:01,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:01,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:01,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:01,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:01,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:01,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:01,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:01,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:01,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:01,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:01,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:01,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:01,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:01,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:01,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:01,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:01,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:01,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:01,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:01,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:01,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:02,555 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 25 [2019-01-14 04:08:02,708 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:08:02,708 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:08:02,708 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:02,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:02,709 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:02,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:02,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:02,709 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:02,710 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:02,710 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:02,711 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:02,712 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:02,712 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:02,712 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:02,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:02,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:02,712 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:02,713 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:02,713 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:02,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:02,714 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:02,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:02,714 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:02,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:02,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:02,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:02,715 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:02,715 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:02,715 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:02,716 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:02,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:02,716 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:02,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:02,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:02,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:02,717 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:02,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:02,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:02,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:02,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:02,721 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:02,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:02,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:02,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:02,722 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:02,722 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:02,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:02,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:02,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:02,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:02,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:02,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:02,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:02,724 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:02,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:02,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:02,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:02,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:02,726 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:02,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:02,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:02,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:02,726 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:02,726 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:02,727 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:02,727 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:02,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:02,728 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:02,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:02,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:02,728 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:02,728 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:02,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:02,729 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:02,729 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:02,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:02,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:02,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:02,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:02,730 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:02,731 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:02,731 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:02,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:02,732 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:02,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:02,732 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:02,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:02,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:02,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:02,733 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:02,733 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:02,733 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:02,734 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:02,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:02,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:02,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:02,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:02,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:02,735 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:02,735 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:02,735 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:02,736 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:02,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:02,736 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:02,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:02,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:02,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:02,737 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:02,737 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:02,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:02,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:02,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:02,738 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:02,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:02,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:02,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:02,739 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:02,739 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:02,740 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:02,740 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:02,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:02,740 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:02,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:02,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:02,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:02,741 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:02,741 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:02,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:02,743 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:02,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:02,743 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:02,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:02,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:02,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:02,744 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:02,744 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:02,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:02,745 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:02,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:02,746 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:02,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:02,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:02,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:02,746 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:02,746 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:02,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:02,747 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:02,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:02,748 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:02,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:02,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:02,748 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:02,748 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:02,749 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:02,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:02,749 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:02,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:02,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:02,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:02,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:02,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:02,751 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:02,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:02,751 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:02,752 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:02,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:02,752 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:02,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:02,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:02,752 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:02,753 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:02,753 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:02,754 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:02,754 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:02,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:02,755 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:02,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:02,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:02,755 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:02,755 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:02,756 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:02,757 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:08:02,758 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 04:08:02,759 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:08:02,759 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:08:02,759 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:08:02,759 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:08:02,760 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~doorState~0) = 1*~doorState~0 Supporting invariants [] [2019-01-14 04:08:02,760 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:08:03,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:08:03,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:08:03,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:08:03,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:08:03,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:08:03,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:08:03,223 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 04:08:03,223 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 91088 states and 169547 transitions. cyclomatic complexity: 78474 Second operand 4 states. [2019-01-14 04:08:03,869 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 91088 states and 169547 transitions. cyclomatic complexity: 78474. Second operand 4 states. Result 137872 states and 252373 transitions. Complement of second has 5 states. [2019-01-14 04:08:03,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 04:08:03,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 04:08:03,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3173 transitions. [2019-01-14 04:08:03,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3173 transitions. Stem has 49 letters. Loop has 49 letters. [2019-01-14 04:08:03,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:08:03,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3173 transitions. Stem has 98 letters. Loop has 49 letters. [2019-01-14 04:08:03,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:08:03,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3173 transitions. Stem has 49 letters. Loop has 98 letters. [2019-01-14 04:08:03,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:08:03,876 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 137872 states and 252373 transitions. [2019-01-14 04:08:04,299 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 57113 [2019-01-14 04:08:04,649 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 137872 states to 137872 states and 252373 transitions. [2019-01-14 04:08:04,649 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74238 [2019-01-14 04:08:04,702 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 74292 [2019-01-14 04:08:04,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 137872 states and 252373 transitions. [2019-01-14 04:08:04,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:08:04,703 INFO L706 BuchiCegarLoop]: Abstraction has 137872 states and 252373 transitions. [2019-01-14 04:08:04,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137872 states and 252373 transitions. [2019-01-14 04:08:06,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137872 to 137738. [2019-01-14 04:08:06,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137738 states. [2019-01-14 04:08:06,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137738 states to 137738 states and 252179 transitions. [2019-01-14 04:08:06,807 INFO L729 BuchiCegarLoop]: Abstraction has 137738 states and 252179 transitions. [2019-01-14 04:08:06,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 04:08:06,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 04:08:06,808 INFO L87 Difference]: Start difference. First operand 137738 states and 252179 transitions. Second operand 4 states. [2019-01-14 04:08:07,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:08:07,265 INFO L93 Difference]: Finished difference Result 137738 states and 252175 transitions. [2019-01-14 04:08:07,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 04:08:07,267 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 137738 states and 252175 transitions. [2019-01-14 04:08:07,684 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 57113 [2019-01-14 04:08:08,050 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 137738 states to 137738 states and 252175 transitions. [2019-01-14 04:08:08,051 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74243 [2019-01-14 04:08:08,109 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 74243 [2019-01-14 04:08:08,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 137738 states and 252175 transitions. [2019-01-14 04:08:08,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 04:08:08,119 INFO L706 BuchiCegarLoop]: Abstraction has 137738 states and 252175 transitions. [2019-01-14 04:08:08,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137738 states and 252175 transitions. [2019-01-14 04:08:09,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137738 to 137738. [2019-01-14 04:08:09,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137738 states. [2019-01-14 04:08:09,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137738 states to 137738 states and 252175 transitions. [2019-01-14 04:08:09,363 INFO L729 BuchiCegarLoop]: Abstraction has 137738 states and 252175 transitions. [2019-01-14 04:08:09,363 INFO L609 BuchiCegarLoop]: Abstraction has 137738 states and 252175 transitions. [2019-01-14 04:08:09,363 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-14 04:08:09,363 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 137738 states and 252175 transitions. [2019-01-14 04:08:09,638 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 57113 [2019-01-14 04:08:09,638 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:08:09,638 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:08:09,640 INFO L867 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] [2019-01-14 04:08:09,640 INFO L868 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:08:09,640 INFO L794 eck$LassoCheckResult]: Stem: 1910240#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(30);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(9);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(21);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(30);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(9);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(21);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(30);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(9);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(25);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(25);~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~cleanupTimeShifts~0 := 12;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0;call #t~string108.base, #t~string108.offset := #Ultimate.allocOnStack(10);call #t~string110.base, #t~string110.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string110.base, #t~string110.offset, 1);call write~init~int(95, #t~string110.base, 1 + #t~string110.offset, 1);call write~init~int(93, #t~string110.base, 2 + #t~string110.offset, 1);call write~init~int(0, #t~string110.base, 3 + #t~string110.offset, 1);call #t~string112.base, #t~string112.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string112.base, #t~string112.offset, 1);call write~init~int(93, #t~string112.base, 1 + #t~string112.offset, 1);call write~init~int(32, #t~string112.base, 2 + #t~string112.offset, 1);call write~init~int(0, #t~string112.base, 3 + #t~string112.offset, 1);call #t~string114.base, #t~string114.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string114.base, #t~string114.offset, 1);call write~init~int(97, #t~string114.base, 1 + #t~string114.offset, 1);call write~init~int(116, #t~string114.base, 2 + #t~string114.offset, 1);call write~init~int(32, #t~string114.base, 3 + #t~string114.offset, 1);call write~init~int(0, #t~string114.base, 4 + #t~string114.offset, 1);call #t~string116.base, #t~string116.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string116.base, #t~string116.offset, 1);call write~init~int(105, #t~string116.base, 1 + #t~string116.offset, 1);call write~init~int(0, #t~string116.base, 2 + #t~string116.offset, 1);call #t~string118.base, #t~string118.offset := #Ultimate.allocOnStack(10);call #t~string120.base, #t~string120.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string120.base, #t~string120.offset, 1);call write~init~int(112, #t~string120.base, 1 + #t~string120.offset, 1);call write~init~int(0, #t~string120.base, 2 + #t~string120.offset, 1);call #t~string122.base, #t~string122.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string122.base, #t~string122.offset, 1);call write~init~int(111, #t~string122.base, 1 + #t~string122.offset, 1);call write~init~int(119, #t~string122.base, 2 + #t~string122.offset, 1);call write~init~int(110, #t~string122.base, 3 + #t~string122.offset, 1);call write~init~int(0, #t~string122.base, 4 + #t~string122.offset, 1);call #t~string124.base, #t~string124.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string124.base, #t~string124.offset, 1);call write~init~int(73, #t~string124.base, 1 + #t~string124.offset, 1);call write~init~int(76, #t~string124.base, 2 + #t~string124.offset, 1);call write~init~int(95, #t~string124.base, 3 + #t~string124.offset, 1);call write~init~int(112, #t~string124.base, 4 + #t~string124.offset, 1);call write~init~int(58, #t~string124.base, 5 + #t~string124.offset, 1);call write~init~int(0, #t~string124.base, 6 + #t~string124.offset, 1);call #t~string126.base, #t~string126.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string126.base, #t~string126.offset, 1);call write~init~int(37, #t~string126.base, 1 + #t~string126.offset, 1);call write~init~int(105, #t~string126.base, 2 + #t~string126.offset, 1);call write~init~int(0, #t~string126.base, 3 + #t~string126.offset, 1);call #t~string128.base, #t~string128.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string128.base, #t~string128.offset, 1);call write~init~int(37, #t~string128.base, 1 + #t~string128.offset, 1);call write~init~int(105, #t~string128.base, 2 + #t~string128.offset, 1);call write~init~int(0, #t~string128.base, 3 + #t~string128.offset, 1);call #t~string130.base, #t~string130.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string130.base, #t~string130.offset, 1);call write~init~int(37, #t~string130.base, 1 + #t~string130.offset, 1);call write~init~int(105, #t~string130.base, 2 + #t~string130.offset, 1);call write~init~int(0, #t~string130.base, 3 + #t~string130.offset, 1);call #t~string132.base, #t~string132.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string132.base, #t~string132.offset, 1);call write~init~int(37, #t~string132.base, 1 + #t~string132.offset, 1);call write~init~int(105, #t~string132.base, 2 + #t~string132.offset, 1);call write~init~int(0, #t~string132.base, 3 + #t~string132.offset, 1);call #t~string134.base, #t~string134.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string134.base, #t~string134.offset, 1);call write~init~int(37, #t~string134.base, 1 + #t~string134.offset, 1);call write~init~int(105, #t~string134.base, 2 + #t~string134.offset, 1);call write~init~int(0, #t~string134.base, 3 + #t~string134.offset, 1);call #t~string136.base, #t~string136.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string136.base, #t~string136.offset, 1);call write~init~int(70, #t~string136.base, 1 + #t~string136.offset, 1);call write~init~int(95, #t~string136.base, 2 + #t~string136.offset, 1);call write~init~int(112, #t~string136.base, 3 + #t~string136.offset, 1);call write~init~int(58, #t~string136.base, 4 + #t~string136.offset, 1);call write~init~int(0, #t~string136.base, 5 + #t~string136.offset, 1);call #t~string139.base, #t~string139.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string139.base, #t~string139.offset, 1);call write~init~int(37, #t~string139.base, 1 + #t~string139.offset, 1);call write~init~int(105, #t~string139.base, 2 + #t~string139.offset, 1);call write~init~int(0, #t~string139.base, 3 + #t~string139.offset, 1);call #t~string142.base, #t~string142.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string142.base, #t~string142.offset, 1);call write~init~int(37, #t~string142.base, 1 + #t~string142.offset, 1);call write~init~int(105, #t~string142.base, 2 + #t~string142.offset, 1);call write~init~int(0, #t~string142.base, 3 + #t~string142.offset, 1);call #t~string145.base, #t~string145.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string145.base, #t~string145.offset, 1);call write~init~int(37, #t~string145.base, 1 + #t~string145.offset, 1);call write~init~int(105, #t~string145.base, 2 + #t~string145.offset, 1);call write~init~int(0, #t~string145.base, 3 + #t~string145.offset, 1);call #t~string148.base, #t~string148.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string148.base, #t~string148.offset, 1);call write~init~int(37, #t~string148.base, 1 + #t~string148.offset, 1);call write~init~int(105, #t~string148.base, 2 + #t~string148.offset, 1);call write~init~int(0, #t~string148.base, 3 + #t~string148.offset, 1);call #t~string151.base, #t~string151.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string151.base, #t~string151.offset, 1);call write~init~int(37, #t~string151.base, 1 + #t~string151.offset, 1);call write~init~int(105, #t~string151.base, 2 + #t~string151.offset, 1);call write~init~int(0, #t~string151.base, 3 + #t~string151.offset, 1);call #t~string153.base, #t~string153.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string153.base, #t~string153.offset, 1);call write~init~int(0, #t~string153.base, 1 + #t~string153.offset, 1);~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 1910241#L-1 havoc main_#res;havoc main_#t~ret54, main_~retValue_acc~4, main_~tmp~13;havoc main_~retValue_acc~4;havoc main_~tmp~13; 1909545#L3286 havoc valid_product_#res;havoc valid_product_~retValue_acc~26;havoc valid_product_~retValue_acc~26;valid_product_~retValue_acc~26 := 1;valid_product_#res := valid_product_~retValue_acc~26; 1909546#L3294 main_#t~ret54 := valid_product_#res;main_~tmp~13 := main_#t~ret54;havoc main_#t~ret54; 1911287#L850 assume 0 != main_~tmp~13; 1909284#L819 ~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 1909285#L3119 havoc bigMacCall_#t~ret47, bigMacCall_~tmp~10;havoc bigMacCall_~tmp~10;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~28;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~28; 1910708#L3342 assume !(0 == getOrigin_~person); 1910709#L3346 assume !(1 == getOrigin_~person); 1912432#L3350 assume !(2 == getOrigin_~person); 1912433#L3354 assume !(3 == getOrigin_~person); 1913596#L3358 assume !(4 == getOrigin_~person); 1913085#L3362 assume 5 == getOrigin_~person;getOrigin_~retValue_acc~28 := 1;getOrigin_#res := getOrigin_~retValue_acc~28; 1910123#L3367 bigMacCall_#t~ret47 := getOrigin_#res;bigMacCall_~tmp~10 := bigMacCall_#t~ret47;havoc bigMacCall_#t~ret47;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~10;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 1910124#L2776 assume !(0 == initPersonOnFloor_~floor); 1911498#L2803 assume 1 == initPersonOnFloor_~floor; 1911499#L2804 assume !(0 == initPersonOnFloor_~person); 1911484#L2807 assume 1 == initPersonOnFloor_~person;~personOnFloor_1_1~0 := 1; 1909427#L2884-1 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 1910306#L2568 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 1909353#L2580-2 havoc cleanup_#t~ret48, cleanup_#t~ret49, cleanup_~i~2, cleanup_~tmp~11, cleanup_~tmp___0~2, cleanup_~__cil_tmp4~2;havoc cleanup_~i~2;havoc cleanup_~tmp~11;havoc cleanup_~tmp___0~2;havoc cleanup_~__cil_tmp4~2;havoc timeShift_#t~ret97, timeShift_#t~ret98, timeShift_#t~ret99, timeShift_#t~ret100, timeShift_#t~ret101, timeShift_#t~ret102, timeShift_#t~ret103, timeShift_#t~ret104, timeShift_#t~ret105, timeShift_#t~ret106, timeShift_#t~ret107, timeShift_~tmp~25, timeShift_~tmp___0~10, timeShift_~tmp___1~6, timeShift_~tmp___2~4, timeShift_~tmp___3~3, timeShift_~tmp___4~2, timeShift_~tmp___5~2, timeShift_~tmp___6~2, timeShift_~tmp___7~2, timeShift_~tmp___8~2, timeShift_~tmp___9~2;havoc timeShift_~tmp~25;havoc timeShift_~tmp___0~10;havoc timeShift_~tmp___1~6;havoc timeShift_~tmp___2~4;havoc timeShift_~tmp___3~3;havoc timeShift_~tmp___4~2;havoc timeShift_~tmp___5~2;havoc timeShift_~tmp___6~2;havoc timeShift_~tmp___7~2;havoc timeShift_~tmp___8~2;havoc timeShift_~tmp___9~2;havoc stopRequestedAtCurrentFloor_#res;havoc stopRequestedAtCurrentFloor_#t~ret81, stopRequestedAtCurrentFloor_#t~ret82, stopRequestedAtCurrentFloor_#t~ret83, stopRequestedAtCurrentFloor_#t~ret84, stopRequestedAtCurrentFloor_~retValue_acc~17, stopRequestedAtCurrentFloor_~tmp~23, stopRequestedAtCurrentFloor_~tmp___0~8;havoc stopRequestedAtCurrentFloor_~retValue_acc~17;havoc stopRequestedAtCurrentFloor_~tmp~23;havoc stopRequestedAtCurrentFloor_~tmp___0~8;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 1909354#L2505 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 1910270#L2532 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 1910271#L2409 stopRequestedAtCurrentFloor_#t~ret81 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~23 := stopRequestedAtCurrentFloor_#t~ret81;havoc stopRequestedAtCurrentFloor_#t~ret81; 1911392#L1793 assume 0 != stopRequestedAtCurrentFloor_~tmp~23;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 1913762#L1124 stopRequestedAtCurrentFloor_#t~ret82 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~8 := stopRequestedAtCurrentFloor_#t~ret82;havoc stopRequestedAtCurrentFloor_#t~ret82; 1913763#L1797 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~8);stopRequestedAtCurrentFloor_~retValue_acc~17 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~17; 1913862#L1810 timeShift_#t~ret97 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret97;havoc timeShift_#t~ret97; 1913742#L1946 assume !(0 != timeShift_~tmp___9~2); 1913582#L2037 assume !(1 == ~doorState~0); 1913549#L2037-2 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret75, stopRequestedInDirection_#t~ret76, stopRequestedInDirection_#t~ret77, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~14, stopRequestedInDirection_~tmp~20, stopRequestedInDirection_~tmp___0~6, stopRequestedInDirection_~__cil_tmp7~5, stopRequestedInDirection_~__cil_tmp8~5;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~14;havoc stopRequestedInDirection_~tmp~20;havoc stopRequestedInDirection_~tmp___0~6;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 1910754#L2505-3 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 1910278#L2532-3 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 1910279#L2409-1 stopRequestedInDirection_#t~ret75 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~6 := stopRequestedInDirection_#t~ret75;havoc stopRequestedInDirection_#t~ret75; 1911399#L1676 assume 0 != stopRequestedInDirection_~tmp___0~6;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 1914096#L1124-1 stopRequestedInDirection_#t~ret76 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~20 := stopRequestedInDirection_#t~ret76;havoc stopRequestedInDirection_#t~ret76;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~20 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~14 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~14; 1914097#L1689 timeShift_#t~ret104 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret104;havoc timeShift_#t~ret104; 1914092#L2045 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret78, continueInDirection_~dir, continueInDirection_~tmp~21;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~21;~currentHeading~0 := continueInDirection_~dir; 1914093#L1733 assume !(1 == ~currentHeading~0); 1914203#L1743 assume !(0 == ~currentFloorID~0); 1909388#L1743-2 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 1909355#L1749-5 havoc __utac_acc__Specification9_spec__3_#t~ret156, __utac_acc__Specification9_spec__3_#t~ret157, __utac_acc__Specification9_spec__3_#t~ret158, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~27, __utac_acc__Specification9_spec__3_~tmp___0~12, __utac_acc__Specification9_spec__3_~tmp___1~8;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~27;havoc __utac_acc__Specification9_spec__3_~tmp___0~12;havoc __utac_acc__Specification9_spec__3_~tmp___1~8;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 2015459#L1124-3 __utac_acc__Specification9_spec__3_#t~ret156 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~27 := __utac_acc__Specification9_spec__3_#t~ret156;havoc __utac_acc__Specification9_spec__3_#t~ret156;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~27;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~10;havoc isEmpty_~retValue_acc~10; 2015452#L1184-6 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~10 := 0;isEmpty_#res := isEmpty_~retValue_acc~10; 2015444#L1216-6 __utac_acc__Specification9_spec__3_#t~ret157 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~8 := __utac_acc__Specification9_spec__3_#t~ret157;havoc __utac_acc__Specification9_spec__3_#t~ret157; 2015445#L3162 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~8);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~7;havoc areDoorsOpen_~retValue_acc~7;areDoorsOpen_~retValue_acc~7 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~7; 2015419#L1133 __utac_acc__Specification9_spec__3_#t~ret158 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~12 := __utac_acc__Specification9_spec__3_#t~ret158;havoc __utac_acc__Specification9_spec__3_#t~ret158; 2015422#L3172 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___0~12); 2015413#L3172-1 cleanup_~i~2 := 0; 2015396#L651-2 assume !false; 2015398#L652 cleanup_~__cil_tmp4~2 := ~cleanupTimeShifts~0 - 1; 2016639#L655 [2019-01-14 04:08:09,640 INFO L796 eck$LassoCheckResult]: Loop: 2016639#L655 assume cleanup_~i~2 < cleanup_~__cil_tmp4~2;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~5;havoc isBlocked_~retValue_acc~5;isBlocked_~retValue_acc~5 := 0;isBlocked_#res := isBlocked_~retValue_acc~5; 2046464#L946 cleanup_#t~ret48 := isBlocked_#res;cleanup_~tmp___0~2 := cleanup_#t~ret48;havoc cleanup_#t~ret48; 2046462#L659 assume 1 != cleanup_~tmp___0~2; 2046460#L659-1 havoc isIdle_#res;havoc isIdle_#t~ret63, isIdle_~retValue_acc~12, isIdle_~tmp~18;havoc isIdle_~retValue_acc~12;havoc isIdle_~tmp~18;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret58, anyStopRequested_#t~ret59, anyStopRequested_#t~ret60, anyStopRequested_#t~ret61, anyStopRequested_#t~ret62, anyStopRequested_~retValue_acc~11, anyStopRequested_~tmp~17, anyStopRequested_~tmp___0~4, anyStopRequested_~tmp___1~3, anyStopRequested_~tmp___2~1, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~11;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~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 2046458#L2505-25 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 2046456#L2532-25 anyStopRequested_#t~ret58 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret58;havoc anyStopRequested_#t~ret58; 2046454#L1232 assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~11 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~11; 2037535#L1296 isIdle_#t~ret63 := anyStopRequested_#res;isIdle_~tmp~18 := isIdle_#t~ret63;havoc isIdle_#t~ret63;isIdle_~retValue_acc~12 := (if 0 == isIdle_~tmp~18 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~12; 2046451#L1309 cleanup_#t~ret49 := isIdle_#res;cleanup_~tmp~11 := cleanup_#t~ret49;havoc cleanup_#t~ret49; 2046449#L671 assume !(0 != cleanup_~tmp~11);havoc timeShift_#t~ret97, timeShift_#t~ret98, timeShift_#t~ret99, timeShift_#t~ret100, timeShift_#t~ret101, timeShift_#t~ret102, timeShift_#t~ret103, timeShift_#t~ret104, timeShift_#t~ret105, timeShift_#t~ret106, timeShift_#t~ret107, timeShift_~tmp~25, timeShift_~tmp___0~10, timeShift_~tmp___1~6, timeShift_~tmp___2~4, timeShift_~tmp___3~3, timeShift_~tmp___4~2, timeShift_~tmp___5~2, timeShift_~tmp___6~2, timeShift_~tmp___7~2, timeShift_~tmp___8~2, timeShift_~tmp___9~2;havoc timeShift_~tmp~25;havoc timeShift_~tmp___0~10;havoc timeShift_~tmp___1~6;havoc timeShift_~tmp___2~4;havoc timeShift_~tmp___3~3;havoc timeShift_~tmp___4~2;havoc timeShift_~tmp___5~2;havoc timeShift_~tmp___6~2;havoc timeShift_~tmp___7~2;havoc timeShift_~tmp___8~2;havoc timeShift_~tmp___9~2;havoc stopRequestedAtCurrentFloor_#res;havoc stopRequestedAtCurrentFloor_#t~ret81, stopRequestedAtCurrentFloor_#t~ret82, stopRequestedAtCurrentFloor_#t~ret83, stopRequestedAtCurrentFloor_#t~ret84, stopRequestedAtCurrentFloor_~retValue_acc~17, stopRequestedAtCurrentFloor_~tmp~23, stopRequestedAtCurrentFloor_~tmp___0~8;havoc stopRequestedAtCurrentFloor_~retValue_acc~17;havoc stopRequestedAtCurrentFloor_~tmp~23;havoc stopRequestedAtCurrentFloor_~tmp___0~8;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 2046448#L2505-30 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 1987396#L2532-30 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 2046445#L2409-3 stopRequestedAtCurrentFloor_#t~ret81 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~23 := stopRequestedAtCurrentFloor_#t~ret81;havoc stopRequestedAtCurrentFloor_#t~ret81; 2046442#L1793-1 assume 0 != stopRequestedAtCurrentFloor_~tmp~23;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 2046441#L1124-4 stopRequestedAtCurrentFloor_#t~ret82 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~8 := stopRequestedAtCurrentFloor_#t~ret82;havoc stopRequestedAtCurrentFloor_#t~ret82; 2046438#L1797-1 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~8);stopRequestedAtCurrentFloor_~retValue_acc~17 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~17; 2046436#L1810-1 timeShift_#t~ret97 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret97;havoc timeShift_#t~ret97; 2046430#L1946-1 assume !(0 != timeShift_~tmp___9~2); 2046428#L2037-3 assume !(1 == ~doorState~0); 2046429#L2037-5 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret75, stopRequestedInDirection_#t~ret76, stopRequestedInDirection_#t~ret77, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~14, stopRequestedInDirection_~tmp~20, stopRequestedInDirection_~tmp___0~6, stopRequestedInDirection_~__cil_tmp7~5, stopRequestedInDirection_~__cil_tmp8~5;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~14;havoc stopRequestedInDirection_~tmp~20;havoc stopRequestedInDirection_~tmp___0~6;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 2046427#L2505-33 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 2046651#L2532-33 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 2046650#L2409-4 stopRequestedInDirection_#t~ret75 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~6 := stopRequestedInDirection_#t~ret75;havoc stopRequestedInDirection_#t~ret75; 2046649#L1676-2 assume 0 != stopRequestedInDirection_~tmp___0~6;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 2046648#L1124-5 stopRequestedInDirection_#t~ret76 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~20 := stopRequestedInDirection_#t~ret76;havoc stopRequestedInDirection_#t~ret76;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~20 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~14 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~14; 2046647#L1689-2 timeShift_#t~ret104 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret104;havoc timeShift_#t~ret104; 2046646#L2045-1 assume !(0 != timeShift_~tmp___8~2);getReverseHeading_#in~ofHeading := ~currentHeading~0;havoc getReverseHeading_#res;havoc getReverseHeading_~ofHeading, getReverseHeading_~retValue_acc~18;getReverseHeading_~ofHeading := getReverseHeading_#in~ofHeading;havoc getReverseHeading_~retValue_acc~18; 2046643#L1819-2 assume !(0 == getReverseHeading_~ofHeading);getReverseHeading_~retValue_acc~18 := 0;getReverseHeading_#res := getReverseHeading_~retValue_acc~18; 2046644#L1824-2 timeShift_#t~ret105 := getReverseHeading_#res;timeShift_~tmp___6~2 := timeShift_#t~ret105;havoc timeShift_#t~ret105;stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := timeShift_~tmp___6~2, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret75, stopRequestedInDirection_#t~ret76, stopRequestedInDirection_#t~ret77, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~14, stopRequestedInDirection_~tmp~20, stopRequestedInDirection_~tmp___0~6, stopRequestedInDirection_~__cil_tmp7~5, stopRequestedInDirection_~__cil_tmp8~5;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~14;havoc stopRequestedInDirection_~tmp~20;havoc stopRequestedInDirection_~tmp___0~6;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret155, isExecutiveFloorCalling_~retValue_acc~20;havoc isExecutiveFloorCalling_~retValue_acc~20;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 2046760#L2505-44 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 1988933#L2532-44 isExecutiveFloorCalling_#t~ret155 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~20 := isExecutiveFloorCalling_#t~ret155;havoc isExecutiveFloorCalling_#t~ret155;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~20; 2046757#L2409-5 stopRequestedInDirection_#t~ret75 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~6 := stopRequestedInDirection_#t~ret75;havoc stopRequestedInDirection_#t~ret75; 2046755#L1676-3 assume 0 != stopRequestedInDirection_~tmp___0~6;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 2046753#L1124-6 stopRequestedInDirection_#t~ret76 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~20 := stopRequestedInDirection_#t~ret76;havoc stopRequestedInDirection_#t~ret76;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~20 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~14 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~14; 2046417#L1689-3 timeShift_#t~ret106 := stopRequestedInDirection_#res;timeShift_~tmp___7~2 := timeShift_#t~ret106;havoc timeShift_#t~ret106; 2046416#L2054-1 assume !(0 != timeShift_~tmp___7~2);continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret78, continueInDirection_~dir, continueInDirection_~tmp~21;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~21;~currentHeading~0 := continueInDirection_~dir; 1913038#L1733-5 assume !(1 == ~currentHeading~0); 1909329#L1743-15 assume !(0 == ~currentFloorID~0); 1909330#L1743-17 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 2046698#L1749-11 havoc __utac_acc__Specification9_spec__3_#t~ret156, __utac_acc__Specification9_spec__3_#t~ret157, __utac_acc__Specification9_spec__3_#t~ret158, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~27, __utac_acc__Specification9_spec__3_~tmp___0~12, __utac_acc__Specification9_spec__3_~tmp___1~8;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~27;havoc __utac_acc__Specification9_spec__3_~tmp___0~12;havoc __utac_acc__Specification9_spec__3_~tmp___1~8;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~6;havoc getCurrentFloorID_~retValue_acc~6;getCurrentFloorID_~retValue_acc~6 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~6; 2046697#L1124-7 __utac_acc__Specification9_spec__3_#t~ret156 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~27 := __utac_acc__Specification9_spec__3_#t~ret156;havoc __utac_acc__Specification9_spec__3_#t~ret156;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~27;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~10;havoc isEmpty_~retValue_acc~10; 2046696#L1184-13 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~10 := 0;isEmpty_#res := isEmpty_~retValue_acc~10; 2046691#L1216-13 __utac_acc__Specification9_spec__3_#t~ret157 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~8 := __utac_acc__Specification9_spec__3_#t~ret157;havoc __utac_acc__Specification9_spec__3_#t~ret157; 2046689#L3162-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~8);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~7;havoc areDoorsOpen_~retValue_acc~7;areDoorsOpen_~retValue_acc~7 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~7; 2046685#L1133-1 __utac_acc__Specification9_spec__3_#t~ret158 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~12 := __utac_acc__Specification9_spec__3_#t~ret158;havoc __utac_acc__Specification9_spec__3_#t~ret158; 2046675#L3172-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___0~12); 2046674#L3172-3 cleanup_~i~2 := 1 + cleanup_~i~2; 2046500#L651-2 assume !false; 2046486#L652 cleanup_~__cil_tmp4~2 := ~cleanupTimeShifts~0 - 1; 2016639#L655 [2019-01-14 04:08:09,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:08:09,641 INFO L82 PathProgramCache]: Analyzing trace with hash -329673631, now seen corresponding path program 1 times [2019-01-14 04:08:09,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:08:09,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:08:09,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:08:09,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:08:09,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:08:09,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:08:09,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:08:09,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:08:09,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 04:08:09,821 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:08:09,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:08:09,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1245119064, now seen corresponding path program 1 times [2019-01-14 04:08:09,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:08:09,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:08:09,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:08:09,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:08:09,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:08:09,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:08:09,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:08:11,017 WARN L181 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 242 DAG size of output: 219 [2019-01-14 04:08:11,018 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-01-14 04:08:12,992 WARN L181 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 184 DAG size of output: 139 [2019-01-14 04:08:12,996 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:08:12,996 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:08:12,996 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:08:12,996 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:08:12,996 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:08:12,996 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:12,996 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:08:12,996 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:08:12,996 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec9_product27_true-unreach-call_true-termination.cil.c_Iteration9_Loop [2019-01-14 04:08:12,997 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:08:12,997 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:08:13,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:13,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:13,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:13,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:13,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:13,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:13,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:13,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:13,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:13,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:13,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:13,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:13,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:13,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:13,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:13,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:13,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:13,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:13,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:13,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:13,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:13,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:13,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:13,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:13,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:13,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:13,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:13,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:13,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:13,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:13,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:13,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:13,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:13,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:13,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:13,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:13,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:13,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:13,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:13,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:13,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:13,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:13,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:13,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:13,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:13,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:13,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:13,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:13,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:13,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:13,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:13,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:13,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:13,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:13,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:13,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:13,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:13,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:13,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:13,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:13,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:13,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:13,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:14,291 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 25 [2019-01-14 04:08:14,309 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:08:14,309 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:14,320 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:08:14,321 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:08:14,324 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:08:14,324 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_~tmp___0~4=0} Honda state: {ULTIMATE.start_anyStopRequested_~tmp___0~4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:14,347 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:08:14,347 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:08:14,352 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:08:14,352 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_areDoorsOpen_#res=0, ~doorState~0=0, ULTIMATE.start_areDoorsOpen_~retValue_acc~7=0, ULTIMATE.start___utac_acc__Specification9_spec__3_~tmp___0~12=0} Honda state: {ULTIMATE.start_areDoorsOpen_#res=0, ~doorState~0=0, ULTIMATE.start_areDoorsOpen_~retValue_acc~7=0, ULTIMATE.start___utac_acc__Specification9_spec__3_~tmp___0~12=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:14,373 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:08:14,373 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:08:14,376 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:08:14,377 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_cleanup_#t~ret48=0} Honda state: {ULTIMATE.start_cleanup_#t~ret48=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:14,399 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:08:14,399 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:08:14,404 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:08:14,404 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isBlocked_~retValue_acc~5=0, ULTIMATE.start_cleanup_~tmp___0~2=0, ULTIMATE.start_isBlocked_#res=0} Honda state: {ULTIMATE.start_isBlocked_~retValue_acc~5=0, ULTIMATE.start_cleanup_~tmp___0~2=0, ULTIMATE.start_isBlocked_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:14,425 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:08:14,426 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:08:14,429 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:08:14,430 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stopRequestedInDirection_#res=0, ULTIMATE.start_timeShift_~tmp___7~2=0, ULTIMATE.start_stopRequestedInDirection_~retValue_acc~14=0} Honda state: {ULTIMATE.start_stopRequestedInDirection_#res=0, ULTIMATE.start_timeShift_~tmp___7~2=0, ULTIMATE.start_stopRequestedInDirection_~retValue_acc~14=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 04:08:14,451 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:08:14,451 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:14,455 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:08:14,455 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_#t~ret107=0} Honda state: {ULTIMATE.start_timeShift_#t~ret107=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:14,478 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:08:14,478 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:08:14,481 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:08:14,481 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification9_spec__3_#t~ret156=0} Honda state: {ULTIMATE.start___utac_acc__Specification9_spec__3_#t~ret156=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:14,504 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:08:14,504 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:08:14,507 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:08:14,507 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_#t~ret103=0} Honda state: {ULTIMATE.start_timeShift_#t~ret103=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:14,531 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:08:14,531 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:08:14,534 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:08:14,534 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_~tmp___0~10=0} Honda state: {ULTIMATE.start_timeShift_~tmp___0~10=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:14,557 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:08:14,557 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:08:14,560 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:08:14,560 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:14,582 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:08:14,582 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:08:14,585 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:08:14,585 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_#t~ret99=0} Honda state: {ULTIMATE.start_timeShift_#t~ret99=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:14,606 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:08:14,607 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:08:14,610 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:08:14,610 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_~tmp___1~6=0} Honda state: {ULTIMATE.start_timeShift_~tmp___1~6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:14,632 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:08:14,633 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:08:14,636 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:08:14,636 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_continueInDirection_#t~ret78=0} Honda state: {ULTIMATE.start_continueInDirection_#t~ret78=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 04:08:14,657 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:08:14,657 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:14,662 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:08:14,662 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stopRequestedInDirection_#t~ret75=0} Honda state: {ULTIMATE.start_stopRequestedInDirection_#t~ret75=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 04:08:14,683 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:08:14,684 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:14,688 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:08:14,688 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stopRequestedAtCurrentFloor_#t~ret83=0} Honda state: {ULTIMATE.start_stopRequestedAtCurrentFloor_#t~ret83=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 04:08:14,709 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:08:14,709 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:14,718 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:08:14,718 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stopRequestedInDirection_#in~dir=0, ULTIMATE.start_getReverseHeading_~retValue_acc~18=0, ULTIMATE.start_stopRequestedInDirection_~dir=0, ULTIMATE.start_timeShift_~tmp___6~2=0, ULTIMATE.start_getReverseHeading_#res=0} Honda state: {ULTIMATE.start_stopRequestedInDirection_#in~dir=0, ULTIMATE.start_getReverseHeading_~retValue_acc~18=0, ULTIMATE.start_stopRequestedInDirection_~dir=0, ULTIMATE.start_timeShift_~tmp___6~2=0, ULTIMATE.start_getReverseHeading_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 04:08:14,740 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:08:14,740 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:14,744 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:08:14,745 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stopRequestedInDirection_~respectInLiftCalls=1, ULTIMATE.start_stopRequestedInDirection_#in~respectInLiftCalls=1} Honda state: {ULTIMATE.start_stopRequestedInDirection_~respectInLiftCalls=1, ULTIMATE.start_stopRequestedInDirection_#in~respectInLiftCalls=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:14,767 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:08:14,768 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:08:14,772 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:08:14,772 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_~tmp___2~4=0} Honda state: {ULTIMATE.start_timeShift_~tmp___2~4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:14,794 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:08:14,794 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:08:14,797 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:08:14,798 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_~tmp___9~2=0} Honda state: {ULTIMATE.start_timeShift_~tmp___9~2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 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 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:14,820 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:08:14,820 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:08:14,824 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:08:14,825 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_#res=1, ULTIMATE.start_isIdle_~tmp~18=1, ULTIMATE.start_anyStopRequested_~retValue_acc~11=1} Honda state: {ULTIMATE.start_anyStopRequested_#res=1, ULTIMATE.start_isIdle_~tmp~18=1, ULTIMATE.start_anyStopRequested_~retValue_acc~11=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 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 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:14,847 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:08:14,847 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:08:14,851 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:08:14,851 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isIdle_#res=0, ULTIMATE.start_isIdle_~retValue_acc~12=0, ULTIMATE.start_cleanup_~tmp~11=0} Honda state: {ULTIMATE.start_isIdle_#res=0, ULTIMATE.start_isIdle_~retValue_acc~12=0, ULTIMATE.start_cleanup_~tmp~11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 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 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:14,873 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:08:14,873 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:08:14,878 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:08:14,878 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_#t~ret104=0} Honda state: {ULTIMATE.start_timeShift_#t~ret104=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 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 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:14,899 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:08:14,900 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:08:14,903 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:08:14,903 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_#t~ret60=0} Honda state: {ULTIMATE.start_anyStopRequested_#t~ret60=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 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 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:14,924 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:08:14,924 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:08:14,929 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:08:14,929 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_#t~ret98=0} Honda state: {ULTIMATE.start_timeShift_#t~ret98=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 04:08:14,953 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:08:14,953 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:14,963 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:08:14,964 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stopRequestedAtCurrentFloor_~tmp~23=1, ULTIMATE.start_isFloorCalling_#res=1, ~calls_0~0=1, ULTIMATE.start_isExecutiveFloorCalling_#res=1, ULTIMATE.start_anyStopRequested_~tmp___3~0=1, ULTIMATE.start_isFloorCalling_~retValue_acc~22=1, ULTIMATE.start_stopRequestedInDirection_~tmp___0~6=1, ULTIMATE.start_isExecutiveFloorCalling_~retValue_acc~20=1} Honda state: {ULTIMATE.start_stopRequestedAtCurrentFloor_~tmp~23=1, ULTIMATE.start_isFloorCalling_#res=1, ~calls_0~0=1, ULTIMATE.start_isExecutiveFloorCalling_#res=1, ULTIMATE.start_anyStopRequested_~tmp___3~0=1, ULTIMATE.start_isFloorCalling_~retValue_acc~22=1, ULTIMATE.start_stopRequestedInDirection_~tmp___0~6=1, ULTIMATE.start_isExecutiveFloorCalling_~retValue_acc~20=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 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 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:14,986 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:08:14,986 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:08:14,989 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:08:14,989 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~persons_0~0=1} Honda state: {~persons_0~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 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 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:15,011 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:08:15,011 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 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 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:15,038 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:08:15,038 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:08:16,183 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:08:16,183 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~executiveFloor~0=0, ~currentFloorID~0=-8, ULTIMATE.start_getCurrentFloorID_~retValue_acc~6=-5, ULTIMATE.start___utac_acc__Specification9_spec__3_~tmp~27=-8, ULTIMATE.start_getCurrentFloorID_#res=-8, ULTIMATE.start_stopRequestedInDirection_~tmp~20=1, ULTIMATE.start___utac_acc__Specification9_spec__3_~floor~0=-8, ULTIMATE.start_isFloorCalling_#in~floorID=0, ULTIMATE.start_stopRequestedAtCurrentFloor_~tmp___0~8=-2, ULTIMATE.start_isFloorCalling_~floorID=-4} Honda state: {~executiveFloor~0=0, ~currentFloorID~0=-8, ULTIMATE.start_getCurrentFloorID_~retValue_acc~6=-5, ULTIMATE.start___utac_acc__Specification9_spec__3_~tmp~27=-8, ULTIMATE.start_getCurrentFloorID_#res=-8, ULTIMATE.start_stopRequestedInDirection_~tmp~20=1, ULTIMATE.start___utac_acc__Specification9_spec__3_~floor~0=-8, ULTIMATE.start_isFloorCalling_#in~floorID=0, ULTIMATE.start_stopRequestedAtCurrentFloor_~tmp___0~8=-2, ULTIMATE.start_isFloorCalling_~floorID=-4} Generalized eigenvectors: [{~executiveFloor~0=0, ~currentFloorID~0=-1, ULTIMATE.start_getCurrentFloorID_~retValue_acc~6=-1, ULTIMATE.start___utac_acc__Specification9_spec__3_~tmp~27=-1, ULTIMATE.start_getCurrentFloorID_#res=-1, ULTIMATE.start_stopRequestedInDirection_~tmp~20=-1, ULTIMATE.start___utac_acc__Specification9_spec__3_~floor~0=-1, ULTIMATE.start_isFloorCalling_#in~floorID=0, ULTIMATE.start_stopRequestedAtCurrentFloor_~tmp___0~8=-1, ULTIMATE.start_isFloorCalling_~floorID=0}, {~executiveFloor~0=0, ~currentFloorID~0=0, ULTIMATE.start_getCurrentFloorID_~retValue_acc~6=-3, ULTIMATE.start___utac_acc__Specification9_spec__3_~tmp~27=0, ULTIMATE.start_getCurrentFloorID_#res=0, ULTIMATE.start_stopRequestedInDirection_~tmp~20=-8, ULTIMATE.start___utac_acc__Specification9_spec__3_~floor~0=0, ULTIMATE.start_isFloorCalling_#in~floorID=0, ULTIMATE.start_stopRequestedAtCurrentFloor_~tmp___0~8=-5, ULTIMATE.start_isFloorCalling_~floorID=4}, {~executiveFloor~0=0, ~currentFloorID~0=0, ULTIMATE.start_getCurrentFloorID_~retValue_acc~6=0, ULTIMATE.start___utac_acc__Specification9_spec__3_~tmp~27=0, ULTIMATE.start_getCurrentFloorID_#res=0, ULTIMATE.start_stopRequestedInDirection_~tmp~20=0, ULTIMATE.start___utac_acc__Specification9_spec__3_~floor~0=0, ULTIMATE.start_isFloorCalling_#in~floorID=0, ULTIMATE.start_stopRequestedAtCurrentFloor_~tmp___0~8=0, ULTIMATE.start_isFloorCalling_~floorID=0}] Lambdas: [1, 0, 8] Nus: [0, 0] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 04:08:16,228 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:08:16,229 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:16,244 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:08:16,244 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification9_spec__3_#t~ret158=0} Honda state: {ULTIMATE.start___utac_acc__Specification9_spec__3_#t~ret158=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 04:08:16,287 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:08:16,287 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:16,300 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:08:16,300 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stopRequestedInDirection_#t~ret76=0} Honda state: {ULTIMATE.start_stopRequestedInDirection_#t~ret76=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 04:08:16,347 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:08:16,347 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:16,359 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:08:16,359 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stopRequestedAtCurrentFloor_#t~ret84=0} Honda state: {ULTIMATE.start_stopRequestedAtCurrentFloor_#t~ret84=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 04:08:16,406 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:08:16,406 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:16,418 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:08:16,418 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stopRequestedInDirection_~__cil_tmp7~5=0} Honda state: {ULTIMATE.start_stopRequestedInDirection_~__cil_tmp7~5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 04:08:16,456 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:08:16,456 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:16,468 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:08:16,468 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_continueInDirection_~tmp~21=0} Honda state: {ULTIMATE.start_continueInDirection_~tmp~21=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 04:08:16,509 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:08:16,509 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:16,523 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:08:16,523 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification9_spec__3_~tmp___1~8=0} Honda state: {ULTIMATE.start___utac_acc__Specification9_spec__3_~tmp___1~8=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 04:08:16,568 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:08:16,570 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:16,581 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:08:16,581 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isIdle_#t~ret63=0} Honda state: {ULTIMATE.start_isIdle_#t~ret63=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 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 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:16,604 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:08:16,604 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:08:16,608 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:08:16,608 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_#t~ret59=0} Honda state: {ULTIMATE.start_anyStopRequested_#t~ret59=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 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 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:16,630 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:08:16,630 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:08:16,635 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:08:16,636 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isEmpty_~retValue_acc~10=0, ULTIMATE.start_isEmpty_#res=0} Honda state: {ULTIMATE.start_isEmpty_~retValue_acc~10=0, ULTIMATE.start_isEmpty_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 04:08:16,659 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:08:16,659 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:16,663 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:08:16,663 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_~tmp___4~2=0} Honda state: {ULTIMATE.start_timeShift_~tmp___4~2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 04:08:16,683 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:08:16,683 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:16,690 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:08:16,690 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_#t~ret61=0} Honda state: {ULTIMATE.start_anyStopRequested_#t~ret61=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 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 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:16,713 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:08:16,714 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:08:16,721 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:08:16,722 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stopRequestedAtCurrentFloor_#res=0, ULTIMATE.start_stopRequestedAtCurrentFloor_~retValue_acc~17=0} Honda state: {ULTIMATE.start_stopRequestedAtCurrentFloor_#res=0, ULTIMATE.start_stopRequestedAtCurrentFloor_~retValue_acc~17=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 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 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:16,744 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:08:16,745 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:08:16,747 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:08:16,748 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_#t~ret105=0} Honda state: {ULTIMATE.start_timeShift_#t~ret105=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 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 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:16,769 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:08:16,770 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:08:16,775 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:08:16,775 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stopRequestedAtCurrentFloor_#t~ret81=0} Honda state: {ULTIMATE.start_stopRequestedAtCurrentFloor_#t~ret81=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 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 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:16,797 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:08:16,797 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:08:16,802 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:08:16,802 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stopRequestedInDirection_#t~ret77=0} Honda state: {ULTIMATE.start_stopRequestedInDirection_#t~ret77=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 04:08:16,824 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:08:16,824 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:16,829 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:08:16,829 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_#t~ret101=0} Honda state: {ULTIMATE.start_timeShift_#t~ret101=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 04:08:16,850 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:08:16,850 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:16,854 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:08:16,854 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isExecutiveFloorCalling_#t~ret155=0} Honda state: {ULTIMATE.start_isExecutiveFloorCalling_#t~ret155=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 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 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:16,875 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:08:16,875 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 04:08:16,899 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:08:16,899 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:19,322 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:08:19,324 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:08:19,324 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:08:19,325 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:08:19,325 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:08:19,325 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:08:19,325 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:08:19,325 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:08:19,325 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:08:19,325 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec9_product27_true-unreach-call_true-termination.cil.c_Iteration9_Loop [2019-01-14 04:08:19,325 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:08:19,325 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:08:19,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:19,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:19,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:19,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:19,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:19,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:19,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:19,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:19,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:19,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:19,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:19,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:19,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:19,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:19,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:19,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:19,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:19,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:19,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:19,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:19,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:19,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:19,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:19,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:19,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:19,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:19,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:19,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:19,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:19,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:19,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:19,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:19,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:19,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:19,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:19,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:19,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:19,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:19,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:19,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:19,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:19,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:19,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:19,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:19,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:19,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:19,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:19,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:19,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:19,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:19,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:19,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:19,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:19,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:19,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:19,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:19,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:19,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:19,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:19,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:19,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:19,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:19,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:08:20,133 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 25 [2019-01-14 04:08:20,417 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:08:20,417 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:08:20,418 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,418 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,419 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,419 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:20,420 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:20,420 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,421 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,421 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,421 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,422 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,422 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:20,422 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:20,422 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,433 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,434 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,434 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,434 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,438 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,438 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:20,439 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:20,439 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,443 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,443 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,444 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,444 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,444 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,444 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,444 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:20,445 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:20,445 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,445 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,446 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,446 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,446 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,447 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:20,451 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:20,451 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,452 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,452 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,454 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,454 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,454 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:20,455 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:20,455 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,455 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,455 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,459 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,459 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,459 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:20,460 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:20,460 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,460 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,465 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,466 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,466 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:20,466 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:20,466 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,467 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,467 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,468 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:20,468 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:20,469 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,470 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,474 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:20,474 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:20,474 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,478 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,478 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,479 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,479 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:08:20,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:20,483 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:08:20,483 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,495 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,502 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,505 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:20,505 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:20,505 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,506 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,506 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,507 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:20,510 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:20,511 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,511 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,512 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,512 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,512 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:20,515 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:20,515 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,516 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,518 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,519 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:20,520 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:20,520 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,524 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,524 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,525 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,525 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,525 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:20,525 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:20,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,531 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,531 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,532 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,532 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,532 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:20,533 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:20,533 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,533 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,534 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,537 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,537 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:20,538 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:20,538 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,539 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,539 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,539 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,540 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,540 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:20,540 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:20,540 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,541 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,541 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,542 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,542 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,542 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:20,543 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:20,543 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,544 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,544 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,545 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,545 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:20,546 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:20,546 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,546 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,547 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,547 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,547 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:20,548 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:20,548 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,550 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,550 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,550 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,551 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:20,551 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:20,551 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,552 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,552 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,552 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,552 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,552 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:20,554 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:20,554 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,555 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,555 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,555 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:20,557 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:20,557 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,566 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,567 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,568 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:20,569 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:20,569 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,570 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,570 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,570 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,571 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:20,571 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:20,571 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,572 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,572 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,572 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,572 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:20,573 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:20,575 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,576 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,576 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:20,577 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:20,577 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,578 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,579 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,579 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,579 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:20,579 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:20,580 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,580 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,580 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,581 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,581 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,581 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,581 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,581 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:20,581 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:20,582 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,582 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,582 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,583 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,583 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,583 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:20,584 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:20,585 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,586 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,586 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,586 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:20,587 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:20,587 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,587 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,588 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,588 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,588 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,588 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,588 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:20,589 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:20,589 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,590 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,590 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,590 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,590 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,591 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,591 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,591 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:20,591 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:20,591 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,592 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,593 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,593 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,593 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:20,594 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:20,594 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,594 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,595 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,596 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,596 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:20,596 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:20,596 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,597 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,597 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,597 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,598 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:20,598 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:20,598 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,599 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,599 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,599 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,599 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,600 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:20,600 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:20,600 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,601 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,601 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,601 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,601 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,601 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,601 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:20,602 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:20,602 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,602 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,603 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,603 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,603 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,603 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,603 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,603 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:20,604 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:20,604 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,604 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,606 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,606 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,606 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,606 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:20,607 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:20,607 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,607 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,608 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,608 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,608 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,609 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:20,609 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:20,609 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,609 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,610 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,610 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,610 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,611 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,611 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:20,611 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:20,611 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,612 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,616 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,616 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,616 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,617 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:20,617 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:20,617 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,618 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,618 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,619 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,619 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,620 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:20,622 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:20,622 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,624 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,624 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,635 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,635 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:20,636 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:20,636 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,636 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,642 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,642 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,643 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,643 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:20,643 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:20,643 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,644 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,647 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,648 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,648 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:20,648 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:20,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,652 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,653 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,653 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,654 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:20,654 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:20,654 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,657 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,657 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,658 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,658 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,658 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,658 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,658 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:20,659 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:20,659 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,659 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,663 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,663 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:20,664 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:20,664 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,668 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,669 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:20,669 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:20,670 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,673 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,674 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,674 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,674 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:20,681 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:20,681 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,682 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,682 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,683 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:20,683 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:20,684 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,688 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,689 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:20,691 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:20,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,692 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,693 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,695 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,696 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:20,696 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:20,696 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,697 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,697 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,697 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:20,705 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:20,705 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,706 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,706 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,706 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,706 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,707 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:20,707 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:20,707 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,715 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,715 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:20,716 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:20,716 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,721 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:20,725 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:20,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,727 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,727 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,730 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:20,730 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:08:20,730 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,731 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,732 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,732 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:08:20,732 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:08:20,738 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 04:08:20,738 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,746 INFO L497 LassoAnalysis]: Using template '2-nested'. [2019-01-14 04:08:20,746 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,747 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,747 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:08:20,747 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:08:20,748 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,750 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,751 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,751 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,752 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:08:20,752 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:08:20,752 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,753 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,756 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,757 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:08:20,757 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:08:20,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,761 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,765 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:08:20,765 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:08:20,765 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,787 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,788 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,788 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,788 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,789 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:08:20,789 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:08:20,790 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,791 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,791 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,791 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,791 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,792 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:08:20,792 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:08:20,792 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,793 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,793 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,793 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,794 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,794 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:08:20,794 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:08:20,794 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,795 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,795 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,846 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,847 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:08:20,847 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:08:20,847 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,848 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,849 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,849 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:08:20,849 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:08:20,850 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,851 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,851 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,851 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,852 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:08:20,852 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:08:20,852 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,855 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,855 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,856 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,908 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:08:20,908 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:08:20,909 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:08:20,909 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,920 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,920 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,924 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,924 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:08:20,924 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:08:20,925 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,925 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,929 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,929 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,929 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,930 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,930 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:08:20,930 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:08:20,930 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,931 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,932 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,932 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,932 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:08:20,933 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:08:20,933 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,975 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,975 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,975 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,976 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:08:20,976 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:08:20,977 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,978 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,978 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,978 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,978 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,979 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,979 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:08:20,979 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:08:20,979 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,980 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,980 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:20,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:20,984 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:20,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:20,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:20,984 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:08:20,985 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:08:20,985 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:20,985 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:20,989 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:21,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:21,034 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:21,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:21,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:21,034 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:08:21,034 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:08:21,035 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:21,036 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:21,036 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:21,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:21,037 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:21,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:21,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:21,037 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:08:21,037 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:08:21,037 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:21,038 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:21,039 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:21,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:21,047 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:21,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:21,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:21,048 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:08:21,048 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:08:21,048 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:21,053 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:21,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 [2019-01-14 04:08:21,054 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:21,054 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:21,088 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:21,088 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:21,089 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:08:21,089 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:08:21,089 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:21,090 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:21,090 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:21,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:21,091 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:21,091 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:21,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:21,091 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:08:21,091 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:08:21,091 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:21,095 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:21,099 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:21,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:21,099 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:21,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:21,100 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:21,100 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:08:21,100 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:08:21,100 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:21,104 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:21,104 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:21,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:21,105 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:21,105 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:21,105 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:21,105 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:08:21,106 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:08:21,106 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:21,153 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:21,153 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:21,154 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:21,154 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:21,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:21,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:21,154 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:08:21,157 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:08:21,157 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:21,167 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:21,167 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:21,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:21,168 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:21,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:21,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:21,168 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:08:21,175 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:08:21,175 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:21,176 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:21,176 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:21,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:21,177 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:21,177 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:21,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:21,177 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:08:21,177 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:08:21,177 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:21,180 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:21,180 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:21,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:21,211 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:21,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:21,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:21,212 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:08:21,212 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:08:21,212 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:21,213 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:21,213 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:21,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:21,213 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:21,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:21,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:21,214 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:08:21,214 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:08:21,214 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:21,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:21,216 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:21,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:21,218 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:21,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:21,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:21,218 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:08:21,219 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:08:21,219 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:21,219 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:21,220 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:21,223 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:21,223 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:21,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:21,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:21,298 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:08:21,299 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:08:21,299 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:21,299 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:21,300 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:21,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:21,300 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:21,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:21,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:21,301 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:08:21,301 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:08:21,301 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:21,302 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:21,302 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:21,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:21,302 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:21,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:21,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:21,303 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:08:21,303 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:08:21,303 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:21,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:21,304 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:21,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:21,305 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:21,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:21,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:21,308 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:08:21,308 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:08:21,308 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:21,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:21,377 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:21,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:21,377 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:21,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:21,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:21,378 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:08:21,378 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:08:21,378 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:21,379 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:21,379 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:21,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:21,380 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:21,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:21,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:21,380 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:08:21,380 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:08:21,381 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:21,384 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:21,384 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:21,385 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:21,385 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:21,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:21,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:21,385 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:08:21,386 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:08:21,386 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:21,390 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:21,390 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:21,449 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:21,449 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:21,449 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:21,450 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:21,450 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:08:21,450 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:08:21,450 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:21,452 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:21,452 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:21,452 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:21,453 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:21,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:21,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:21,453 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:08:21,454 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:08:21,454 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:21,455 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:21,458 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:21,459 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:21,459 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:21,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:21,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:21,459 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:08:21,463 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:08:21,463 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:21,464 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:21,465 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:21,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:21,465 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:21,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:21,534 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:21,534 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:08:21,534 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:08:21,535 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:21,535 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:21,536 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:21,536 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:21,536 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:21,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:21,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:21,537 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:08:21,537 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:08:21,537 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:21,538 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:21,538 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:21,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:21,538 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:21,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:21,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:21,539 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:08:21,542 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:08:21,542 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:21,543 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:21,543 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:21,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:21,544 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:21,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:21,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:21,544 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:08:21,544 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:08:21,544 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:21,610 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:21,610 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:21,610 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:21,610 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:21,611 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:21,611 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:21,611 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:08:21,611 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:08:21,611 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:21,612 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:08:21,612 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:08:21,612 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:08:21,612 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:08:21,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:08:21,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:08:21,613 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 04:08:21,613 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 04:08:21,613 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:08:21,616 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:08:21,631 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-01-14 04:08:21,631 INFO L444 ModelExtractionUtils]: 2 out of 9 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-14 04:08:21,632 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:08:21,632 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:08:21,633 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:08:21,633 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function 2-nested ranking function: f0 = 1*~cleanupTimeShifts~0 - 1*ULTIMATE.start_cleanup_~i~2 f1 = 1*ULTIMATE.start_cleanup_~__cil_tmp4~2 - 1*ULTIMATE.start_cleanup_~i~2 Supporting invariants [] [2019-01-14 04:08:21,633 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:08:21,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:08:22,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:08:22,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:08:22,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:08:22,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:08:22,681 WARN L181 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 19 [2019-01-14 04:08:22,916 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 17 [2019-01-14 04:08:22,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:08:22,918 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-14 04:08:22,919 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 137738 states and 252175 transitions. cyclomatic complexity: 114480 Second operand 4 states. [2019-01-14 04:08:23,932 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 137738 states and 252175 transitions. cyclomatic complexity: 114480. Second operand 4 states. Result 280606 states and 515455 transitions. Complement of second has 7 states. [2019-01-14 04:08:23,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 04:08:23,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 04:08:23,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4846 transitions. [2019-01-14 04:08:23,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 4846 transitions. Stem has 51 letters. Loop has 49 letters. [2019-01-14 04:08:23,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:08:23,939 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 04:08:23,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:08:24,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:08:24,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:08:24,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:08:24,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:08:24,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:08:24,394 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-14 04:08:24,394 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 137738 states and 252175 transitions. cyclomatic complexity: 114480 Second operand 4 states. [2019-01-14 04:08:25,737 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 137738 states and 252175 transitions. cyclomatic complexity: 114480. Second operand 4 states. Result 278264 states and 508653 transitions. Complement of second has 6 states. [2019-01-14 04:08:25,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 04:08:25,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 04:08:25,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4847 transitions. [2019-01-14 04:08:25,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 4847 transitions. Stem has 51 letters. Loop has 49 letters. [2019-01-14 04:08:25,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:08:25,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 4847 transitions. Stem has 100 letters. Loop has 49 letters. [2019-01-14 04:08:25,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:08:25,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 4847 transitions. Stem has 51 letters. Loop has 98 letters. [2019-01-14 04:08:25,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:08:25,743 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 278264 states and 508653 transitions. [2019-01-14 04:08:26,567 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:08:26,568 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 278264 states to 0 states and 0 transitions. [2019-01-14 04:08:26,568 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:08:26,568 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:08:26,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:08:26,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:08:26,568 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:08:26,569 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:08:26,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 04:08:26,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 04:08:26,569 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 4 states. [2019-01-14 04:08:26,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:08:26,569 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-14 04:08:26,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 04:08:26,570 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-14 04:08:26,570 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:08:26,570 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 04:08:26,570 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:08:26,570 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:08:26,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:08:26,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:08:26,570 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:08:26,570 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:08:26,570 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:08:26,570 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-14 04:08:26,570 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 04:08:26,571 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:08:26,571 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 04:08:26,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:08:26 BoogieIcfgContainer [2019-01-14 04:08:26,579 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:08:26,580 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:08:26,580 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:08:26,580 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:08:26,581 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:06:18" (3/4) ... [2019-01-14 04:08:26,584 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 04:08:26,584 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:08:26,585 INFO L168 Benchmark]: Toolchain (without parser) took 140752.92 ms. Allocated memory was 1.0 GB in the beginning and 6.4 GB in the end (delta: 5.4 GB). Free memory was 945.9 MB in the beginning and 3.8 GB in the end (delta: -2.9 GB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. [2019-01-14 04:08:26,586 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:08:26,586 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1240.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -169.8 MB). Peak memory consumption was 51.3 MB. Max. memory is 11.5 GB. [2019-01-14 04:08:26,587 INFO L168 Benchmark]: Boogie Procedure Inliner took 235.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. [2019-01-14 04:08:26,588 INFO L168 Benchmark]: Boogie Preprocessor took 208.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. [2019-01-14 04:08:26,588 INFO L168 Benchmark]: RCFGBuilder took 11035.87 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 185.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -181.8 MB). Peak memory consumption was 386.2 MB. Max. memory is 11.5 GB. [2019-01-14 04:08:26,589 INFO L168 Benchmark]: BuchiAutomizer took 128021.62 ms. Allocated memory was 1.4 GB in the beginning and 6.4 GB in the end (delta: 5.1 GB). Free memory was 1.2 GB in the beginning and 3.8 GB in the end (delta: -2.6 GB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. [2019-01-14 04:08:26,589 INFO L168 Benchmark]: Witness Printer took 4.62 ms. Allocated memory is still 6.4 GB. Free memory is still 3.8 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:08:26,594 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1240.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -169.8 MB). Peak memory consumption was 51.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 235.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 208.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 11035.87 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 185.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -181.8 MB). Peak memory consumption was 386.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 128021.62 ms. Allocated memory was 1.4 GB in the beginning and 6.4 GB in the end (delta: 5.1 GB). Free memory was 1.2 GB in the beginning and 3.8 GB in the end (delta: -2.6 GB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. * Witness Printer took 4.62 ms. Allocated memory is still 6.4 GB. Free memory is still 3.8 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 12 terminating modules (9 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function currentFloorID and consists of 85 locations. One deterministic module has affine ranking function doorState and consists of 3 locations. One deterministic module has 2-nested ranking function (if cleanupTimeShifts + -1 * i > 0 then 1 else 0), (if cleanupTimeShifts + -1 * i > 0 then cleanupTimeShifts + -1 * i else __cil_tmp4 + -1 * i) and consists of 4 locations. 9 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 127.9s and 10 iterations. TraceHistogramMax:1. Analysis of lassos took 28.7s. Construction of modules took 22.4s. Büchi inclusion checks took 30.6s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 7. Automata minimization 22.7s AutomataMinimizationTime, 10 MinimizatonAttempts, 871737 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 21.2s Buchi closure took 0.7s. Biggest automaton had 137738 states and ocurred in iteration 8. Nontrivial modules had stage [2, 1, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 72314 SDtfs, 428422 SDslu, 226119 SDs, 0 SdLazy, 14107 SolverSat, 2731 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI6 SILT3 lasso0 LassoPreprocessingBenchmarks: Lassos: inital199 mio100 ax100 hnf99 lsp19 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq213 hnf87 smp96 dnf198 smp73 tf102 neg97 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 64ms VariablesStem: 0 VariablesLoop: 6 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 68 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 4.6s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...