./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/elevator_spec2_product11_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_spec2_product11_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 460580ad6ad89b7c8323bbef624e175810b41813 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:00:21,120 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:00:21,122 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:00:21,135 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:00:21,135 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:00:21,137 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:00:21,139 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:00:21,141 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:00:21,143 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:00:21,144 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:00:21,145 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:00:21,145 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:00:21,146 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:00:21,148 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:00:21,149 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:00:21,150 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:00:21,151 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:00:21,154 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:00:21,156 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:00:21,158 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:00:21,159 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:00:21,161 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:00:21,164 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:00:21,164 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:00:21,164 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:00:21,166 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:00:21,167 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:00:21,168 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:00:21,169 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:00:21,171 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:00:21,171 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:00:21,172 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:00:21,172 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:00:21,172 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:00:21,174 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:00:21,175 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:00:21,176 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:00:21,212 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:00:21,215 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:00:21,218 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:00:21,218 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:00:21,219 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:00:21,220 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:00:21,220 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:00:21,220 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:00:21,220 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:00:21,221 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:00:21,221 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:00:21,222 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:00:21,222 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:00:21,222 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:00:21,222 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:00:21,222 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:00:21,223 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:00:21,223 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:00:21,223 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:00:21,223 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:00:21,223 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:00:21,223 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:00:21,224 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:00:21,227 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:00:21,227 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:00:21,227 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:00:21,227 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:00:21,227 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:00:21,228 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:00:21,228 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:00:21,228 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:00:21,229 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:00:21,230 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 -> 460580ad6ad89b7c8323bbef624e175810b41813 [2019-01-14 04:00:21,291 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:00:21,304 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:00:21,311 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:00:21,312 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:00:21,313 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:00:21,313 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/elevator_spec2_product11_true-unreach-call_true-termination.cil.c [2019-01-14 04:00:21,380 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77efb9f81/f16de5a670bf413aa502f4fa026becb7/FLAG057d31cb5 [2019-01-14 04:00:22,021 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:00:22,023 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/elevator_spec2_product11_true-unreach-call_true-termination.cil.c [2019-01-14 04:00:22,057 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77efb9f81/f16de5a670bf413aa502f4fa026becb7/FLAG057d31cb5 [2019-01-14 04:00:22,171 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77efb9f81/f16de5a670bf413aa502f4fa026becb7 [2019-01-14 04:00:22,175 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:00:22,176 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:00:22,177 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:00:22,177 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:00:22,181 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:00:22,182 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:00:22" (1/1) ... [2019-01-14 04:00:22,185 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@673f838f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:00:22, skipping insertion in model container [2019-01-14 04:00:22,185 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:00:22" (1/1) ... [2019-01-14 04:00:22,194 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:00:22,285 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:00:22,964 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:00:22,983 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:00:23,256 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:00:23,332 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:00:23,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:00:23 WrapperNode [2019-01-14 04:00:23,333 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:00:23,334 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:00:23,334 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:00:23,334 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:00:23,342 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:00:23" (1/1) ... [2019-01-14 04:00:23,374 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:00:23" (1/1) ... [2019-01-14 04:00:23,565 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:00:23,566 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:00:23,566 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:00:23,566 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:00:23,578 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:00:23" (1/1) ... [2019-01-14 04:00:23,578 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:00:23" (1/1) ... [2019-01-14 04:00:23,599 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:00:23" (1/1) ... [2019-01-14 04:00:23,599 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:00:23" (1/1) ... [2019-01-14 04:00:23,687 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:00:23" (1/1) ... [2019-01-14 04:00:23,764 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:00:23" (1/1) ... [2019-01-14 04:00:23,786 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:00:23" (1/1) ... [2019-01-14 04:00:23,817 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:00:23,817 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:00:23,818 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:00:23,818 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:00:23,819 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:00:23" (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:00:23,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 04:00:23,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-14 04:00:23,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:00:23,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:00:35,382 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:00:35,382 INFO L286 CfgBuilder]: Removed 565 assue(true) statements. [2019-01-14 04:00:35,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:00:35 BoogieIcfgContainer [2019-01-14 04:00:35,385 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:00:35,386 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:00:35,386 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:00:35,389 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:00:35,390 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:00:35,390 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:00:22" (1/3) ... [2019-01-14 04:00:35,392 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1048d9b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:00:35, skipping insertion in model container [2019-01-14 04:00:35,392 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:00:35,393 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:00:23" (2/3) ... [2019-01-14 04:00:35,394 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1048d9b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:00:35, skipping insertion in model container [2019-01-14 04:00:35,394 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:00:35,394 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:00:35" (3/3) ... [2019-01-14 04:00:35,397 INFO L375 chiAutomizerObserver]: Analyzing ICFG elevator_spec2_product11_true-unreach-call_true-termination.cil.c [2019-01-14 04:00:35,446 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:00:35,447 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:00:35,447 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:00:35,447 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:00:35,447 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:00:35,447 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:00:35,447 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:00:35,448 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:00:35,448 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:00:35,582 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2407 states. [2019-01-14 04:00:35,725 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1193 [2019-01-14 04:00:35,725 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:00:35,725 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:00:35,750 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] [2019-01-14 04:00:35,750 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] [2019-01-14 04:00:35,750 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:00:35,751 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2407 states. [2019-01-14 04:00:35,785 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1193 [2019-01-14 04:00:35,785 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:00:35,785 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:00:35,790 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] [2019-01-14 04:00:35,790 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] [2019-01-14 04:00:35,799 INFO L794 eck$LassoCheckResult]: Stem: 478#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~cleanupTimeShifts~0 := 12;~head~0.base, ~head~0.offset := 0, 0;call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(30);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(9);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(21);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(30);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(9);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(21);call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(30);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(9);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(25);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(30);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(9);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(25);~executiveFloor~0 := 4;~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~string100.base, #t~string100.offset := #Ultimate.allocOnStack(10);call #t~string102.base, #t~string102.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string102.base, #t~string102.offset, 1);call write~init~int(95, #t~string102.base, 1 + #t~string102.offset, 1);call write~init~int(93, #t~string102.base, 2 + #t~string102.offset, 1);call write~init~int(0, #t~string102.base, 3 + #t~string102.offset, 1);call #t~string104.base, #t~string104.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string104.base, #t~string104.offset, 1);call write~init~int(93, #t~string104.base, 1 + #t~string104.offset, 1);call write~init~int(32, #t~string104.base, 2 + #t~string104.offset, 1);call write~init~int(0, #t~string104.base, 3 + #t~string104.offset, 1);call #t~string106.base, #t~string106.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string106.base, #t~string106.offset, 1);call write~init~int(97, #t~string106.base, 1 + #t~string106.offset, 1);call write~init~int(116, #t~string106.base, 2 + #t~string106.offset, 1);call write~init~int(32, #t~string106.base, 3 + #t~string106.offset, 1);call write~init~int(0, #t~string106.base, 4 + #t~string106.offset, 1);call #t~string108.base, #t~string108.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string108.base, #t~string108.offset, 1);call write~init~int(105, #t~string108.base, 1 + #t~string108.offset, 1);call write~init~int(0, #t~string108.base, 2 + #t~string108.offset, 1);call #t~string110.base, #t~string110.offset := #Ultimate.allocOnStack(10);call #t~string112.base, #t~string112.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string112.base, #t~string112.offset, 1);call write~init~int(112, #t~string112.base, 1 + #t~string112.offset, 1);call write~init~int(0, #t~string112.base, 2 + #t~string112.offset, 1);call #t~string114.base, #t~string114.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string114.base, #t~string114.offset, 1);call write~init~int(111, #t~string114.base, 1 + #t~string114.offset, 1);call write~init~int(119, #t~string114.base, 2 + #t~string114.offset, 1);call write~init~int(110, #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(7);call write~init~int(32, #t~string116.base, #t~string116.offset, 1);call write~init~int(73, #t~string116.base, 1 + #t~string116.offset, 1);call write~init~int(76, #t~string116.base, 2 + #t~string116.offset, 1);call write~init~int(95, #t~string116.base, 3 + #t~string116.offset, 1);call write~init~int(112, #t~string116.base, 4 + #t~string116.offset, 1);call write~init~int(58, #t~string116.base, 5 + #t~string116.offset, 1);call write~init~int(0, #t~string116.base, 6 + #t~string116.offset, 1);call #t~string118.base, #t~string118.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string118.base, #t~string118.offset, 1);call write~init~int(37, #t~string118.base, 1 + #t~string118.offset, 1);call write~init~int(105, #t~string118.base, 2 + #t~string118.offset, 1);call write~init~int(0, #t~string118.base, 3 + #t~string118.offset, 1);call #t~string120.base, #t~string120.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string120.base, #t~string120.offset, 1);call write~init~int(37, #t~string120.base, 1 + #t~string120.offset, 1);call write~init~int(105, #t~string120.base, 2 + #t~string120.offset, 1);call write~init~int(0, #t~string120.base, 3 + #t~string120.offset, 1);call #t~string122.base, #t~string122.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string122.base, #t~string122.offset, 1);call write~init~int(37, #t~string122.base, 1 + #t~string122.offset, 1);call write~init~int(105, #t~string122.base, 2 + #t~string122.offset, 1);call write~init~int(0, #t~string122.base, 3 + #t~string122.offset, 1);call #t~string124.base, #t~string124.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string124.base, #t~string124.offset, 1);call write~init~int(37, #t~string124.base, 1 + #t~string124.offset, 1);call write~init~int(105, #t~string124.base, 2 + #t~string124.offset, 1);call write~init~int(0, #t~string124.base, 3 + #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(6);call write~init~int(32, #t~string128.base, #t~string128.offset, 1);call write~init~int(70, #t~string128.base, 1 + #t~string128.offset, 1);call write~init~int(95, #t~string128.base, 2 + #t~string128.offset, 1);call write~init~int(112, #t~string128.base, 3 + #t~string128.offset, 1);call write~init~int(58, #t~string128.base, 4 + #t~string128.offset, 1);call write~init~int(0, #t~string128.base, 5 + #t~string128.offset, 1);call #t~string131.base, #t~string131.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string131.base, #t~string131.offset, 1);call write~init~int(37, #t~string131.base, 1 + #t~string131.offset, 1);call write~init~int(105, #t~string131.base, 2 + #t~string131.offset, 1);call write~init~int(0, #t~string131.base, 3 + #t~string131.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~string137.base, #t~string137.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string137.base, #t~string137.offset, 1);call write~init~int(37, #t~string137.base, 1 + #t~string137.offset, 1);call write~init~int(105, #t~string137.base, 2 + #t~string137.offset, 1);call write~init~int(0, #t~string137.base, 3 + #t~string137.offset, 1);call #t~string140.base, #t~string140.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string140.base, #t~string140.offset, 1);call write~init~int(37, #t~string140.base, 1 + #t~string140.offset, 1);call write~init~int(105, #t~string140.base, 2 + #t~string140.offset, 1);call write~init~int(0, #t~string140.base, 3 + #t~string140.offset, 1);call #t~string143.base, #t~string143.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string143.base, #t~string143.offset, 1);call write~init~int(37, #t~string143.base, 1 + #t~string143.offset, 1);call write~init~int(105, #t~string143.base, 2 + #t~string143.offset, 1);call write~init~int(0, #t~string143.base, 3 + #t~string143.offset, 1);call #t~string145.base, #t~string145.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string145.base, #t~string145.offset, 1);call write~init~int(0, #t~string145.base, 1 + #t~string145.offset, 1);~floorButtons_spc2_0~0 := 0;~floorButtons_spc2_1~0 := 0;~floorButtons_spc2_2~0 := 0;~floorButtons_spc2_3~0 := 0;~floorButtons_spc2_4~0 := 0;~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0; 1518#L-1true havoc main_#res;havoc main_#t~ret13, main_~retValue_acc~1, main_~tmp~8;havoc main_~retValue_acc~1;havoc main_~tmp~8; 2267#L3400true havoc valid_product_#res;havoc valid_product_~retValue_acc~29;havoc valid_product_~retValue_acc~29;valid_product_~retValue_acc~29 := 1;valid_product_#res := valid_product_~retValue_acc~29; 1878#L3408true main_#t~ret13 := valid_product_#res;main_~tmp~8 := main_#t~ret13;havoc main_#t~ret13; 1427#L398true assume 0 != main_~tmp~8; 1818#L367true ~floorButtons_spc2_0~0 := 0;~floorButtons_spc2_1~0 := 0;~floorButtons_spc2_2~0 := 0;~floorButtons_spc2_3~0 := 0;~floorButtons_spc2_4~0 := 0; 122#L2538true havoc bigMacCall_#t~ret6, bigMacCall_~tmp~5;havoc bigMacCall_~tmp~5;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~3;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~3; 1870#L457true assume 0 == getOrigin_~person;getOrigin_~retValue_acc~3 := 4;getOrigin_#res := getOrigin_~retValue_acc~3; 1705#L482true bigMacCall_#t~ret6 := getOrigin_#res;bigMacCall_~tmp~5 := bigMacCall_#t~ret6;havoc bigMacCall_#t~ret6;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~5;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 666#L3058true assume 0 == initPersonOnFloor_~floor; 411#L3059true assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 1701#L3166-1true callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 963#L2850true assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 1630#L2862-2true havoc cleanup_#t~ret7, cleanup_#t~ret8, cleanup_~i~0, cleanup_~tmp~6, cleanup_~tmp___0~0, cleanup_~__cil_tmp4~0;havoc cleanup_~i~0;havoc cleanup_~tmp~6;havoc cleanup_~tmp___0~0;havoc cleanup_~__cil_tmp4~0;havoc timeShift_#t~ret89, timeShift_#t~ret90, timeShift_#t~ret91, timeShift_#t~ret92, timeShift_#t~ret93, timeShift_#t~ret94, timeShift_#t~ret95, timeShift_#t~ret96, timeShift_#t~ret97, timeShift_#t~ret98, timeShift_#t~ret99, timeShift_~tmp~21, timeShift_~tmp___0~8, timeShift_~tmp___1~4, 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~21;havoc timeShift_~tmp___0~8;havoc timeShift_~tmp___1~4;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~ret73, stopRequestedAtCurrentFloor_#t~ret74, stopRequestedAtCurrentFloor_#t~ret75, stopRequestedAtCurrentFloor_#t~ret76, stopRequestedAtCurrentFloor_~retValue_acc~20, stopRequestedAtCurrentFloor_~tmp~19, stopRequestedAtCurrentFloor_~tmp___0~6;havoc stopRequestedAtCurrentFloor_~retValue_acc~20;havoc stopRequestedAtCurrentFloor_~tmp~19;havoc stopRequestedAtCurrentFloor_~tmp___0~6;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret147, isExecutiveFloorCalling_~retValue_acc~23;havoc isExecutiveFloorCalling_~retValue_acc~23;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~25;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~25; 2038#L2787true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~25 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~25; 1679#L2814true isExecutiveFloorCalling_#t~ret147 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~23 := isExecutiveFloorCalling_#t~ret147;havoc isExecutiveFloorCalling_#t~ret147;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~23; 1737#L2419true stopRequestedAtCurrentFloor_#t~ret73 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~19 := stopRequestedAtCurrentFloor_#t~ret73;havoc stopRequestedAtCurrentFloor_#t~ret73; 1714#L1803true assume 0 != stopRequestedAtCurrentFloor_~tmp~19;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~9;havoc getCurrentFloorID_~retValue_acc~9;getCurrentFloorID_~retValue_acc~9 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~9; 1007#L1134true stopRequestedAtCurrentFloor_#t~ret74 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~6 := stopRequestedAtCurrentFloor_#t~ret74;havoc stopRequestedAtCurrentFloor_#t~ret74; 1447#L1807true assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~6);stopRequestedAtCurrentFloor_~retValue_acc~20 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~20; 1847#L1820true timeShift_#t~ret89 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret89;havoc timeShift_#t~ret89; 548#L1956true assume !(0 != timeShift_~tmp___9~2); 338#L2047true assume !(1 == ~doorState~0); 530#L2047-2true stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret67, stopRequestedInDirection_#t~ret68, stopRequestedInDirection_#t~ret69, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~17, stopRequestedInDirection_~tmp~16, stopRequestedInDirection_~tmp___0~4, 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~17;havoc stopRequestedInDirection_~tmp~16;havoc stopRequestedInDirection_~tmp___0~4;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret147, isExecutiveFloorCalling_~retValue_acc~23;havoc isExecutiveFloorCalling_~retValue_acc~23;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~25;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~25; 2047#L2787-3true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~25 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~25; 1685#L2814-3true isExecutiveFloorCalling_#t~ret147 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~23 := isExecutiveFloorCalling_#t~ret147;havoc isExecutiveFloorCalling_#t~ret147;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~23; 1742#L2419-1true stopRequestedInDirection_#t~ret67 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~4 := stopRequestedInDirection_#t~ret67;havoc stopRequestedInDirection_#t~ret67; 2044#L1686true assume 0 != stopRequestedInDirection_~tmp___0~4;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~9;havoc getCurrentFloorID_~retValue_acc~9;getCurrentFloorID_~retValue_acc~9 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~9; 1008#L1134-1true stopRequestedInDirection_#t~ret68 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~16 := stopRequestedInDirection_#t~ret68;havoc stopRequestedInDirection_#t~ret68;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~16 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~17 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~17; 57#L1699true timeShift_#t~ret96 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret96;havoc timeShift_#t~ret96; 1093#L2055true assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret70, continueInDirection_~dir, continueInDirection_~tmp~17;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~17;~currentHeading~0 := continueInDirection_~dir; 93#L1743true assume !(1 == ~currentHeading~0); 873#L1753true assume 0 == ~currentFloorID~0;~currentHeading~0 := 1; 875#L1753-2true assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 1711#L1759-5true havoc __utac_acc__Specification2_spec__3_#t~ret154, __utac_acc__Specification2_spec__3_#t~ret155, __utac_acc__Specification2_spec__3_#t~ret156, __utac_acc__Specification2_spec__3_#t~ret157, __utac_acc__Specification2_spec__3_#t~ret158, __utac_acc__Specification2_spec__3_#t~ret159, __utac_acc__Specification2_spec__3_~floor~0, __utac_acc__Specification2_spec__3_~tmp~25, __utac_acc__Specification2_spec__3_~tmp___0~12, __utac_acc__Specification2_spec__3_~tmp___1~8, __utac_acc__Specification2_spec__3_~tmp___2~6, __utac_acc__Specification2_spec__3_~tmp___3~5, __utac_acc__Specification2_spec__3_~tmp___4~3;havoc __utac_acc__Specification2_spec__3_~floor~0;havoc __utac_acc__Specification2_spec__3_~tmp~25;havoc __utac_acc__Specification2_spec__3_~tmp___0~12;havoc __utac_acc__Specification2_spec__3_~tmp___1~8;havoc __utac_acc__Specification2_spec__3_~tmp___2~6;havoc __utac_acc__Specification2_spec__3_~tmp___3~5;havoc __utac_acc__Specification2_spec__3_~tmp___4~3;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~9;havoc getCurrentFloorID_~retValue_acc~9;getCurrentFloorID_~retValue_acc~9 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~9; 1011#L1134-3true __utac_acc__Specification2_spec__3_#t~ret154 := getCurrentFloorID_#res;__utac_acc__Specification2_spec__3_~tmp~25 := __utac_acc__Specification2_spec__3_#t~ret154;havoc __utac_acc__Specification2_spec__3_#t~ret154;__utac_acc__Specification2_spec__3_~floor~0 := __utac_acc__Specification2_spec__3_~tmp~25; 1134#L2583true assume 0 == __utac_acc__Specification2_spec__3_~floor~0; 1266#L2584true assume 0 != ~floorButtons_spc2_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~10;havoc areDoorsOpen_~retValue_acc~10;areDoorsOpen_~retValue_acc~10 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~10; 1562#L1143true __utac_acc__Specification2_spec__3_#t~ret155 := areDoorsOpen_#res;__utac_acc__Specification2_spec__3_~tmp___4~3 := __utac_acc__Specification2_spec__3_#t~ret155;havoc __utac_acc__Specification2_spec__3_#t~ret155; 853#L2588true assume 0 != __utac_acc__Specification2_spec__3_~tmp___4~3;~floorButtons_spc2_0~0 := 0; 1458#L2643true cleanup_~i~0 := 0; 353#L197-2true [2019-01-14 04:00:35,800 INFO L796 eck$LassoCheckResult]: Loop: 353#L197-2true assume !false; 467#L198true cleanup_~__cil_tmp4~0 := ~cleanupTimeShifts~0 - 1; 231#L201true assume cleanup_~i~0 < cleanup_~__cil_tmp4~0;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~8;havoc isBlocked_~retValue_acc~8;isBlocked_~retValue_acc~8 := 0;isBlocked_#res := isBlocked_~retValue_acc~8; 2278#L980true cleanup_#t~ret7 := isBlocked_#res;cleanup_~tmp___0~0 := cleanup_#t~ret7;havoc cleanup_#t~ret7; 1121#L205true assume 1 != cleanup_~tmp___0~0; 1117#L205-1true havoc isIdle_#res;havoc isIdle_#t~ret55, isIdle_~retValue_acc~15, isIdle_~tmp~14;havoc isIdle_~retValue_acc~15;havoc isIdle_~tmp~14;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret50, anyStopRequested_#t~ret51, anyStopRequested_#t~ret52, anyStopRequested_#t~ret53, anyStopRequested_#t~ret54, anyStopRequested_~retValue_acc~14, anyStopRequested_~tmp~13, anyStopRequested_~tmp___0~2, anyStopRequested_~tmp___1~1, anyStopRequested_~tmp___2~1, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~14;havoc anyStopRequested_~tmp~13;havoc anyStopRequested_~tmp___0~2;havoc anyStopRequested_~tmp___1~1;havoc anyStopRequested_~tmp___2~1;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~25;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~25; 2196#L2787-25true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~25 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~25; 1652#L2814-25true anyStopRequested_#t~ret50 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret50;havoc anyStopRequested_#t~ret50; 2269#L1242true assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~14 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~14; 1125#L1306true isIdle_#t~ret55 := anyStopRequested_#res;isIdle_~tmp~14 := isIdle_#t~ret55;havoc isIdle_#t~ret55;isIdle_~retValue_acc~15 := (if 0 == isIdle_~tmp~14 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~15; 1571#L1319true cleanup_#t~ret8 := isIdle_#res;cleanup_~tmp~6 := cleanup_#t~ret8;havoc cleanup_#t~ret8; 1752#L217true assume !(0 != cleanup_~tmp~6);havoc timeShift_#t~ret89, timeShift_#t~ret90, timeShift_#t~ret91, timeShift_#t~ret92, timeShift_#t~ret93, timeShift_#t~ret94, timeShift_#t~ret95, timeShift_#t~ret96, timeShift_#t~ret97, timeShift_#t~ret98, timeShift_#t~ret99, timeShift_~tmp~21, timeShift_~tmp___0~8, timeShift_~tmp___1~4, 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~21;havoc timeShift_~tmp___0~8;havoc timeShift_~tmp___1~4;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~ret73, stopRequestedAtCurrentFloor_#t~ret74, stopRequestedAtCurrentFloor_#t~ret75, stopRequestedAtCurrentFloor_#t~ret76, stopRequestedAtCurrentFloor_~retValue_acc~20, stopRequestedAtCurrentFloor_~tmp~19, stopRequestedAtCurrentFloor_~tmp___0~6;havoc stopRequestedAtCurrentFloor_~retValue_acc~20;havoc stopRequestedAtCurrentFloor_~tmp~19;havoc stopRequestedAtCurrentFloor_~tmp___0~6;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret147, isExecutiveFloorCalling_~retValue_acc~23;havoc isExecutiveFloorCalling_~retValue_acc~23;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~25;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~25; 2180#L2787-30true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~25 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~25; 1647#L2814-30true isExecutiveFloorCalling_#t~ret147 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~23 := isExecutiveFloorCalling_#t~ret147;havoc isExecutiveFloorCalling_#t~ret147;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~23; 1753#L2419-3true stopRequestedAtCurrentFloor_#t~ret73 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~19 := stopRequestedAtCurrentFloor_#t~ret73;havoc stopRequestedAtCurrentFloor_#t~ret73; 1716#L1803-1true assume 0 != stopRequestedAtCurrentFloor_~tmp~19;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~9;havoc getCurrentFloorID_~retValue_acc~9;getCurrentFloorID_~retValue_acc~9 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~9; 1014#L1134-4true stopRequestedAtCurrentFloor_#t~ret74 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~6 := stopRequestedAtCurrentFloor_#t~ret74;havoc stopRequestedAtCurrentFloor_#t~ret74; 1442#L1807-1true assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~6);stopRequestedAtCurrentFloor_~retValue_acc~20 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~20; 1845#L1820-1true timeShift_#t~ret89 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret89;havoc timeShift_#t~ret89; 546#L1956-1true assume !(0 != timeShift_~tmp___9~2); 535#L2047-3true assume 1 == ~doorState~0;~doorState~0 := 0; 539#L2047-5true stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret67, stopRequestedInDirection_#t~ret68, stopRequestedInDirection_#t~ret69, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~17, stopRequestedInDirection_~tmp~16, stopRequestedInDirection_~tmp___0~4, 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~17;havoc stopRequestedInDirection_~tmp~16;havoc stopRequestedInDirection_~tmp___0~4;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret147, isExecutiveFloorCalling_~retValue_acc~23;havoc isExecutiveFloorCalling_~retValue_acc~23;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~25;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~25; 2157#L2787-33true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~25 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~25; 1764#L2814-33true isExecutiveFloorCalling_#t~ret147 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~23 := isExecutiveFloorCalling_#t~ret147;havoc isExecutiveFloorCalling_#t~ret147;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~23; 1750#L2419-4true stopRequestedInDirection_#t~ret67 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~4 := stopRequestedInDirection_#t~ret67;havoc stopRequestedInDirection_#t~ret67; 2029#L1686-2true assume 0 != stopRequestedInDirection_~tmp___0~4;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~9;havoc getCurrentFloorID_~retValue_acc~9;getCurrentFloorID_~retValue_acc~9 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~9; 999#L1134-5true stopRequestedInDirection_#t~ret68 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~16 := stopRequestedInDirection_#t~ret68;havoc stopRequestedInDirection_#t~ret68;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~16 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~17 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~17; 63#L1699-2true timeShift_#t~ret96 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret96;havoc timeShift_#t~ret96; 1097#L2055-1true assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret70, continueInDirection_~dir, continueInDirection_~tmp~17;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~17;~currentHeading~0 := continueInDirection_~dir; 67#L1743-3true assume !(1 == ~currentHeading~0); 871#L1753-9true assume 0 == ~currentFloorID~0;~currentHeading~0 := 1; 863#L1753-11true assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 1568#L1759-11true havoc __utac_acc__Specification2_spec__3_#t~ret154, __utac_acc__Specification2_spec__3_#t~ret155, __utac_acc__Specification2_spec__3_#t~ret156, __utac_acc__Specification2_spec__3_#t~ret157, __utac_acc__Specification2_spec__3_#t~ret158, __utac_acc__Specification2_spec__3_#t~ret159, __utac_acc__Specification2_spec__3_~floor~0, __utac_acc__Specification2_spec__3_~tmp~25, __utac_acc__Specification2_spec__3_~tmp___0~12, __utac_acc__Specification2_spec__3_~tmp___1~8, __utac_acc__Specification2_spec__3_~tmp___2~6, __utac_acc__Specification2_spec__3_~tmp___3~5, __utac_acc__Specification2_spec__3_~tmp___4~3;havoc __utac_acc__Specification2_spec__3_~floor~0;havoc __utac_acc__Specification2_spec__3_~tmp~25;havoc __utac_acc__Specification2_spec__3_~tmp___0~12;havoc __utac_acc__Specification2_spec__3_~tmp___1~8;havoc __utac_acc__Specification2_spec__3_~tmp___2~6;havoc __utac_acc__Specification2_spec__3_~tmp___3~5;havoc __utac_acc__Specification2_spec__3_~tmp___4~3;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~9;havoc getCurrentFloorID_~retValue_acc~9;getCurrentFloorID_~retValue_acc~9 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~9; 1002#L1134-7true __utac_acc__Specification2_spec__3_#t~ret154 := getCurrentFloorID_#res;__utac_acc__Specification2_spec__3_~tmp~25 := __utac_acc__Specification2_spec__3_#t~ret154;havoc __utac_acc__Specification2_spec__3_#t~ret154;__utac_acc__Specification2_spec__3_~floor~0 := __utac_acc__Specification2_spec__3_~tmp~25; 1143#L2583-1true assume 0 == __utac_acc__Specification2_spec__3_~floor~0; 1263#L2584-1true assume 0 != ~floorButtons_spc2_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~10;havoc areDoorsOpen_~retValue_acc~10;areDoorsOpen_~retValue_acc~10 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~10; 1555#L1143-5true __utac_acc__Specification2_spec__3_#t~ret155 := areDoorsOpen_#res;__utac_acc__Specification2_spec__3_~tmp___4~3 := __utac_acc__Specification2_spec__3_#t~ret155;havoc __utac_acc__Specification2_spec__3_#t~ret155; 854#L2588-2true assume 0 != __utac_acc__Specification2_spec__3_~tmp___4~3;~floorButtons_spc2_0~0 := 0; 1462#L2643-1true cleanup_~i~0 := 1 + cleanup_~i~0; 353#L197-2true [2019-01-14 04:00:35,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:00:35,807 INFO L82 PathProgramCache]: Analyzing trace with hash -740156324, now seen corresponding path program 1 times [2019-01-14 04:00:35,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:00:35,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:00:35,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:00:35,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:00:35,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:00:36,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:00:36,226 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:00:36,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:00:36,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:00:36,236 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:00:36,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:00:36,237 INFO L82 PathProgramCache]: Analyzing trace with hash -380015225, now seen corresponding path program 1 times [2019-01-14 04:00:36,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:00:36,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:00:36,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:00:36,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:00:36,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:00:36,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:00:36,718 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:00:36,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:00:36,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 04:00:36,720 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:00:36,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 04:00:36,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-14 04:00:36,740 INFO L87 Difference]: Start difference. First operand 2407 states. Second operand 7 states. [2019-01-14 04:00:38,191 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-14 04:00:39,244 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-14 04:00:46,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:00:46,356 INFO L93 Difference]: Finished difference Result 18275 states and 34284 transitions. [2019-01-14 04:00:46,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-14 04:00:46,360 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18275 states and 34284 transitions. [2019-01-14 04:00:46,581 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8764 [2019-01-14 04:00:46,763 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18275 states to 18135 states and 34128 transitions. [2019-01-14 04:00:46,765 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18135 [2019-01-14 04:00:46,794 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18135 [2019-01-14 04:00:46,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18135 states and 34128 transitions. [2019-01-14 04:00:46,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:00:46,850 INFO L706 BuchiCegarLoop]: Abstraction has 18135 states and 34128 transitions. [2019-01-14 04:00:46,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18135 states and 34128 transitions. [2019-01-14 04:00:47,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18135 to 6877. [2019-01-14 04:00:47,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6877 states. [2019-01-14 04:00:47,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6877 states to 6877 states and 12959 transitions. [2019-01-14 04:00:47,179 INFO L729 BuchiCegarLoop]: Abstraction has 6877 states and 12959 transitions. [2019-01-14 04:00:47,179 INFO L609 BuchiCegarLoop]: Abstraction has 6877 states and 12959 transitions. [2019-01-14 04:00:47,179 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:00:47,179 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6877 states and 12959 transitions. [2019-01-14 04:00:47,210 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3491 [2019-01-14 04:00:47,210 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:00:47,210 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:00:47,214 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] [2019-01-14 04:00:47,215 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] [2019-01-14 04:00:47,215 INFO L794 eck$LassoCheckResult]: Stem: 21641#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~cleanupTimeShifts~0 := 12;~head~0.base, ~head~0.offset := 0, 0;call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(30);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(9);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(21);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(30);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(9);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(21);call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(30);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(9);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(25);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(30);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(9);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(25);~executiveFloor~0 := 4;~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~string100.base, #t~string100.offset := #Ultimate.allocOnStack(10);call #t~string102.base, #t~string102.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string102.base, #t~string102.offset, 1);call write~init~int(95, #t~string102.base, 1 + #t~string102.offset, 1);call write~init~int(93, #t~string102.base, 2 + #t~string102.offset, 1);call write~init~int(0, #t~string102.base, 3 + #t~string102.offset, 1);call #t~string104.base, #t~string104.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string104.base, #t~string104.offset, 1);call write~init~int(93, #t~string104.base, 1 + #t~string104.offset, 1);call write~init~int(32, #t~string104.base, 2 + #t~string104.offset, 1);call write~init~int(0, #t~string104.base, 3 + #t~string104.offset, 1);call #t~string106.base, #t~string106.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string106.base, #t~string106.offset, 1);call write~init~int(97, #t~string106.base, 1 + #t~string106.offset, 1);call write~init~int(116, #t~string106.base, 2 + #t~string106.offset, 1);call write~init~int(32, #t~string106.base, 3 + #t~string106.offset, 1);call write~init~int(0, #t~string106.base, 4 + #t~string106.offset, 1);call #t~string108.base, #t~string108.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string108.base, #t~string108.offset, 1);call write~init~int(105, #t~string108.base, 1 + #t~string108.offset, 1);call write~init~int(0, #t~string108.base, 2 + #t~string108.offset, 1);call #t~string110.base, #t~string110.offset := #Ultimate.allocOnStack(10);call #t~string112.base, #t~string112.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string112.base, #t~string112.offset, 1);call write~init~int(112, #t~string112.base, 1 + #t~string112.offset, 1);call write~init~int(0, #t~string112.base, 2 + #t~string112.offset, 1);call #t~string114.base, #t~string114.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string114.base, #t~string114.offset, 1);call write~init~int(111, #t~string114.base, 1 + #t~string114.offset, 1);call write~init~int(119, #t~string114.base, 2 + #t~string114.offset, 1);call write~init~int(110, #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(7);call write~init~int(32, #t~string116.base, #t~string116.offset, 1);call write~init~int(73, #t~string116.base, 1 + #t~string116.offset, 1);call write~init~int(76, #t~string116.base, 2 + #t~string116.offset, 1);call write~init~int(95, #t~string116.base, 3 + #t~string116.offset, 1);call write~init~int(112, #t~string116.base, 4 + #t~string116.offset, 1);call write~init~int(58, #t~string116.base, 5 + #t~string116.offset, 1);call write~init~int(0, #t~string116.base, 6 + #t~string116.offset, 1);call #t~string118.base, #t~string118.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string118.base, #t~string118.offset, 1);call write~init~int(37, #t~string118.base, 1 + #t~string118.offset, 1);call write~init~int(105, #t~string118.base, 2 + #t~string118.offset, 1);call write~init~int(0, #t~string118.base, 3 + #t~string118.offset, 1);call #t~string120.base, #t~string120.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string120.base, #t~string120.offset, 1);call write~init~int(37, #t~string120.base, 1 + #t~string120.offset, 1);call write~init~int(105, #t~string120.base, 2 + #t~string120.offset, 1);call write~init~int(0, #t~string120.base, 3 + #t~string120.offset, 1);call #t~string122.base, #t~string122.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string122.base, #t~string122.offset, 1);call write~init~int(37, #t~string122.base, 1 + #t~string122.offset, 1);call write~init~int(105, #t~string122.base, 2 + #t~string122.offset, 1);call write~init~int(0, #t~string122.base, 3 + #t~string122.offset, 1);call #t~string124.base, #t~string124.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string124.base, #t~string124.offset, 1);call write~init~int(37, #t~string124.base, 1 + #t~string124.offset, 1);call write~init~int(105, #t~string124.base, 2 + #t~string124.offset, 1);call write~init~int(0, #t~string124.base, 3 + #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(6);call write~init~int(32, #t~string128.base, #t~string128.offset, 1);call write~init~int(70, #t~string128.base, 1 + #t~string128.offset, 1);call write~init~int(95, #t~string128.base, 2 + #t~string128.offset, 1);call write~init~int(112, #t~string128.base, 3 + #t~string128.offset, 1);call write~init~int(58, #t~string128.base, 4 + #t~string128.offset, 1);call write~init~int(0, #t~string128.base, 5 + #t~string128.offset, 1);call #t~string131.base, #t~string131.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string131.base, #t~string131.offset, 1);call write~init~int(37, #t~string131.base, 1 + #t~string131.offset, 1);call write~init~int(105, #t~string131.base, 2 + #t~string131.offset, 1);call write~init~int(0, #t~string131.base, 3 + #t~string131.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~string137.base, #t~string137.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string137.base, #t~string137.offset, 1);call write~init~int(37, #t~string137.base, 1 + #t~string137.offset, 1);call write~init~int(105, #t~string137.base, 2 + #t~string137.offset, 1);call write~init~int(0, #t~string137.base, 3 + #t~string137.offset, 1);call #t~string140.base, #t~string140.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string140.base, #t~string140.offset, 1);call write~init~int(37, #t~string140.base, 1 + #t~string140.offset, 1);call write~init~int(105, #t~string140.base, 2 + #t~string140.offset, 1);call write~init~int(0, #t~string140.base, 3 + #t~string140.offset, 1);call #t~string143.base, #t~string143.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string143.base, #t~string143.offset, 1);call write~init~int(37, #t~string143.base, 1 + #t~string143.offset, 1);call write~init~int(105, #t~string143.base, 2 + #t~string143.offset, 1);call write~init~int(0, #t~string143.base, 3 + #t~string143.offset, 1);call #t~string145.base, #t~string145.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string145.base, #t~string145.offset, 1);call write~init~int(0, #t~string145.base, 1 + #t~string145.offset, 1);~floorButtons_spc2_0~0 := 0;~floorButtons_spc2_1~0 := 0;~floorButtons_spc2_2~0 := 0;~floorButtons_spc2_3~0 := 0;~floorButtons_spc2_4~0 := 0;~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0; 21642#L-1 havoc main_#res;havoc main_#t~ret13, main_~retValue_acc~1, main_~tmp~8;havoc main_~retValue_acc~1;havoc main_~tmp~8; 22686#L3400 havoc valid_product_#res;havoc valid_product_~retValue_acc~29;havoc valid_product_~retValue_acc~29;valid_product_~retValue_acc~29 := 1;valid_product_#res := valid_product_~retValue_acc~29; 22935#L3408 main_#t~ret13 := valid_product_#res;main_~tmp~8 := main_#t~ret13;havoc main_#t~ret13; 22574#L398 assume 0 != main_~tmp~8; 22575#L367 ~floorButtons_spc2_0~0 := 0;~floorButtons_spc2_1~0 := 0;~floorButtons_spc2_2~0 := 0;~floorButtons_spc2_3~0 := 0;~floorButtons_spc2_4~0 := 0; 21059#L2538 havoc bigMacCall_#t~ret6, bigMacCall_~tmp~5;havoc bigMacCall_~tmp~5;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~3;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~3; 21060#L457 assume 0 == getOrigin_~person;getOrigin_~retValue_acc~3 := 4;getOrigin_#res := getOrigin_~retValue_acc~3; 21325#L482 bigMacCall_#t~ret6 := getOrigin_#res;bigMacCall_~tmp~5 := bigMacCall_#t~ret6;havoc bigMacCall_#t~ret6;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~5;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 21852#L3058 assume 0 == initPersonOnFloor_~floor; 21569#L3059 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 20766#L3166-1 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 22205#L2850 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 21876#L2862-2 havoc cleanup_#t~ret7, cleanup_#t~ret8, cleanup_~i~0, cleanup_~tmp~6, cleanup_~tmp___0~0, cleanup_~__cil_tmp4~0;havoc cleanup_~i~0;havoc cleanup_~tmp~6;havoc cleanup_~tmp___0~0;havoc cleanup_~__cil_tmp4~0;havoc timeShift_#t~ret89, timeShift_#t~ret90, timeShift_#t~ret91, timeShift_#t~ret92, timeShift_#t~ret93, timeShift_#t~ret94, timeShift_#t~ret95, timeShift_#t~ret96, timeShift_#t~ret97, timeShift_#t~ret98, timeShift_#t~ret99, timeShift_~tmp~21, timeShift_~tmp___0~8, timeShift_~tmp___1~4, 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~21;havoc timeShift_~tmp___0~8;havoc timeShift_~tmp___1~4;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~ret73, stopRequestedAtCurrentFloor_#t~ret74, stopRequestedAtCurrentFloor_#t~ret75, stopRequestedAtCurrentFloor_#t~ret76, stopRequestedAtCurrentFloor_~retValue_acc~20, stopRequestedAtCurrentFloor_~tmp~19, stopRequestedAtCurrentFloor_~tmp___0~6;havoc stopRequestedAtCurrentFloor_~retValue_acc~20;havoc stopRequestedAtCurrentFloor_~tmp~19;havoc stopRequestedAtCurrentFloor_~tmp___0~6;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret147, isExecutiveFloorCalling_~retValue_acc~23;havoc isExecutiveFloorCalling_~retValue_acc~23;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~25;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~25; 22765#L2787 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~25 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~25; 23056#L2814 isExecutiveFloorCalling_#t~ret147 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~23 := isExecutiveFloorCalling_#t~ret147;havoc isExecutiveFloorCalling_#t~ret147;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~23; 23349#L2419 stopRequestedAtCurrentFloor_#t~ret73 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~19 := stopRequestedAtCurrentFloor_#t~ret73;havoc stopRequestedAtCurrentFloor_#t~ret73; 23344#L1803 assume 0 != stopRequestedAtCurrentFloor_~tmp~19;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~9;havoc getCurrentFloorID_~retValue_acc~9;getCurrentFloorID_~retValue_acc~9 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~9; 23339#L1134 stopRequestedAtCurrentFloor_#t~ret74 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~6 := stopRequestedAtCurrentFloor_#t~ret74;havoc stopRequestedAtCurrentFloor_#t~ret74; 23331#L1807 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~6);stopRequestedAtCurrentFloor_~retValue_acc~20 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~20; 23332#L1820 timeShift_#t~ret89 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret89;havoc timeShift_#t~ret89; 26136#L1956 assume !(0 != timeShift_~tmp___9~2); 26137#L2047 assume !(1 == ~doorState~0); 27430#L2047-2 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret67, stopRequestedInDirection_#t~ret68, stopRequestedInDirection_#t~ret69, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~17, stopRequestedInDirection_~tmp~16, stopRequestedInDirection_~tmp___0~4, 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~17;havoc stopRequestedInDirection_~tmp~16;havoc stopRequestedInDirection_~tmp___0~4;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret147, isExecutiveFloorCalling_~retValue_acc~23;havoc isExecutiveFloorCalling_~retValue_acc~23;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~25;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~25; 27429#L2787-3 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~25 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~25; 27428#L2814-3 isExecutiveFloorCalling_#t~ret147 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~23 := isExecutiveFloorCalling_#t~ret147;havoc isExecutiveFloorCalling_#t~ret147;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~23; 27427#L2419-1 stopRequestedInDirection_#t~ret67 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~4 := stopRequestedInDirection_#t~ret67;havoc stopRequestedInDirection_#t~ret67; 27425#L1686 assume 0 != stopRequestedInDirection_~tmp___0~4;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~9;havoc getCurrentFloorID_~retValue_acc~9;getCurrentFloorID_~retValue_acc~9 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~9; 27426#L1134-1 stopRequestedInDirection_#t~ret68 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~16 := stopRequestedInDirection_#t~ret68;havoc stopRequestedInDirection_#t~ret68;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~16 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~17 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~17; 27434#L1699 timeShift_#t~ret96 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret96;havoc timeShift_#t~ret96; 27432#L2055 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret70, continueInDirection_~dir, continueInDirection_~tmp~17;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~17;~currentHeading~0 := continueInDirection_~dir; 27431#L1743 assume !(1 == ~currentHeading~0); 22123#L1753 assume !(0 == ~currentFloorID~0); 22124#L1753-2 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 22119#L1759-5 havoc __utac_acc__Specification2_spec__3_#t~ret154, __utac_acc__Specification2_spec__3_#t~ret155, __utac_acc__Specification2_spec__3_#t~ret156, __utac_acc__Specification2_spec__3_#t~ret157, __utac_acc__Specification2_spec__3_#t~ret158, __utac_acc__Specification2_spec__3_#t~ret159, __utac_acc__Specification2_spec__3_~floor~0, __utac_acc__Specification2_spec__3_~tmp~25, __utac_acc__Specification2_spec__3_~tmp___0~12, __utac_acc__Specification2_spec__3_~tmp___1~8, __utac_acc__Specification2_spec__3_~tmp___2~6, __utac_acc__Specification2_spec__3_~tmp___3~5, __utac_acc__Specification2_spec__3_~tmp___4~3;havoc __utac_acc__Specification2_spec__3_~floor~0;havoc __utac_acc__Specification2_spec__3_~tmp~25;havoc __utac_acc__Specification2_spec__3_~tmp___0~12;havoc __utac_acc__Specification2_spec__3_~tmp___1~8;havoc __utac_acc__Specification2_spec__3_~tmp___2~6;havoc __utac_acc__Specification2_spec__3_~tmp___3~5;havoc __utac_acc__Specification2_spec__3_~tmp___4~3;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~9;havoc getCurrentFloorID_~retValue_acc~9;getCurrentFloorID_~retValue_acc~9 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~9; 25449#L1134-3 __utac_acc__Specification2_spec__3_#t~ret154 := getCurrentFloorID_#res;__utac_acc__Specification2_spec__3_~tmp~25 := __utac_acc__Specification2_spec__3_#t~ret154;havoc __utac_acc__Specification2_spec__3_#t~ret154;__utac_acc__Specification2_spec__3_~floor~0 := __utac_acc__Specification2_spec__3_~tmp~25; 25445#L2583 assume 0 == __utac_acc__Specification2_spec__3_~floor~0; 25444#L2584 assume 0 != ~floorButtons_spc2_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~10;havoc areDoorsOpen_~retValue_acc~10;areDoorsOpen_~retValue_acc~10 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~10; 25442#L1143 __utac_acc__Specification2_spec__3_#t~ret155 := areDoorsOpen_#res;__utac_acc__Specification2_spec__3_~tmp___4~3 := __utac_acc__Specification2_spec__3_#t~ret155;havoc __utac_acc__Specification2_spec__3_#t~ret155; 25423#L2588 assume 0 != __utac_acc__Specification2_spec__3_~tmp___4~3;~floorButtons_spc2_0~0 := 0; 25419#L2643 cleanup_~i~0 := 0; 25418#L197-2 [2019-01-14 04:00:47,216 INFO L796 eck$LassoCheckResult]: Loop: 25418#L197-2 assume !false; 25417#L198 cleanup_~__cil_tmp4~0 := ~cleanupTimeShifts~0 - 1; 25416#L201 assume cleanup_~i~0 < cleanup_~__cil_tmp4~0;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~8;havoc isBlocked_~retValue_acc~8;isBlocked_~retValue_acc~8 := 0;isBlocked_#res := isBlocked_~retValue_acc~8; 25415#L980 cleanup_#t~ret7 := isBlocked_#res;cleanup_~tmp___0~0 := cleanup_#t~ret7;havoc cleanup_#t~ret7; 25414#L205 assume 1 != cleanup_~tmp___0~0; 25413#L205-1 havoc isIdle_#res;havoc isIdle_#t~ret55, isIdle_~retValue_acc~15, isIdle_~tmp~14;havoc isIdle_~retValue_acc~15;havoc isIdle_~tmp~14;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret50, anyStopRequested_#t~ret51, anyStopRequested_#t~ret52, anyStopRequested_#t~ret53, anyStopRequested_#t~ret54, anyStopRequested_~retValue_acc~14, anyStopRequested_~tmp~13, anyStopRequested_~tmp___0~2, anyStopRequested_~tmp___1~1, anyStopRequested_~tmp___2~1, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~14;havoc anyStopRequested_~tmp~13;havoc anyStopRequested_~tmp___0~2;havoc anyStopRequested_~tmp___1~1;havoc anyStopRequested_~tmp___2~1;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~25;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~25; 25412#L2787-25 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~25 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~25; 25410#L2814-25 anyStopRequested_#t~ret50 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret50;havoc anyStopRequested_#t~ret50; 23187#L1242 assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~14 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~14; 21443#L1306 isIdle_#t~ret55 := anyStopRequested_#res;isIdle_~tmp~14 := isIdle_#t~ret55;havoc isIdle_#t~ret55;isIdle_~retValue_acc~15 := (if 0 == isIdle_~tmp~14 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~15; 22336#L1319 cleanup_#t~ret8 := isIdle_#res;cleanup_~tmp~6 := cleanup_#t~ret8;havoc cleanup_#t~ret8; 22721#L217 assume !(0 != cleanup_~tmp~6);havoc timeShift_#t~ret89, timeShift_#t~ret90, timeShift_#t~ret91, timeShift_#t~ret92, timeShift_#t~ret93, timeShift_#t~ret94, timeShift_#t~ret95, timeShift_#t~ret96, timeShift_#t~ret97, timeShift_#t~ret98, timeShift_#t~ret99, timeShift_~tmp~21, timeShift_~tmp___0~8, timeShift_~tmp___1~4, 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~21;havoc timeShift_~tmp___0~8;havoc timeShift_~tmp___1~4;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~ret73, stopRequestedAtCurrentFloor_#t~ret74, stopRequestedAtCurrentFloor_#t~ret75, stopRequestedAtCurrentFloor_#t~ret76, stopRequestedAtCurrentFloor_~retValue_acc~20, stopRequestedAtCurrentFloor_~tmp~19, stopRequestedAtCurrentFloor_~tmp___0~6;havoc stopRequestedAtCurrentFloor_~retValue_acc~20;havoc stopRequestedAtCurrentFloor_~tmp~19;havoc stopRequestedAtCurrentFloor_~tmp___0~6;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret147, isExecutiveFloorCalling_~retValue_acc~23;havoc isExecutiveFloorCalling_~retValue_acc~23;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~25;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~25; 22821#L2787-30 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~25 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~25; 23250#L2814-30 isExecutiveFloorCalling_#t~ret147 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~23 := isExecutiveFloorCalling_#t~ret147;havoc isExecutiveFloorCalling_#t~ret147;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~23; 23371#L2419-3 stopRequestedAtCurrentFloor_#t~ret73 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~19 := stopRequestedAtCurrentFloor_#t~ret73;havoc stopRequestedAtCurrentFloor_#t~ret73; 23345#L1803-1 assume 0 != stopRequestedAtCurrentFloor_~tmp~19;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~9;havoc getCurrentFloorID_~retValue_acc~9;getCurrentFloorID_~retValue_acc~9 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~9; 23340#L1134-4 stopRequestedAtCurrentFloor_#t~ret74 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~6 := stopRequestedAtCurrentFloor_#t~ret74;havoc stopRequestedAtCurrentFloor_#t~ret74; 23333#L1807-1 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~6);stopRequestedAtCurrentFloor_~retValue_acc~20 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~20; 22599#L1820-1 timeShift_#t~ret89 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret89;havoc timeShift_#t~ret89; 27235#L1956-1 assume !(0 != timeShift_~tmp___9~2); 27236#L2047-3 assume 1 == ~doorState~0;~doorState~0 := 0; 27565#L2047-5 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret67, stopRequestedInDirection_#t~ret68, stopRequestedInDirection_#t~ret69, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~17, stopRequestedInDirection_~tmp~16, stopRequestedInDirection_~tmp___0~4, 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~17;havoc stopRequestedInDirection_~tmp~16;havoc stopRequestedInDirection_~tmp___0~4;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret147, isExecutiveFloorCalling_~retValue_acc~23;havoc isExecutiveFloorCalling_~retValue_acc~23;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~25;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~25; 27564#L2787-33 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~25 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~25; 27563#L2814-33 isExecutiveFloorCalling_#t~ret147 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~23 := isExecutiveFloorCalling_#t~ret147;havoc isExecutiveFloorCalling_#t~ret147;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~23; 27562#L2419-4 stopRequestedInDirection_#t~ret67 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~4 := stopRequestedInDirection_#t~ret67;havoc stopRequestedInDirection_#t~ret67; 27560#L1686-2 assume 0 != stopRequestedInDirection_~tmp___0~4;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~9;havoc getCurrentFloorID_~retValue_acc~9;getCurrentFloorID_~retValue_acc~9 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~9; 22253#L1134-5 stopRequestedInDirection_#t~ret68 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~16 := stopRequestedInDirection_#t~ret68;havoc stopRequestedInDirection_#t~ret68;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~16 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~17 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~17; 20897#L1699-2 timeShift_#t~ret96 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret96;havoc timeShift_#t~ret96; 20898#L2055-1 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret70, continueInDirection_~dir, continueInDirection_~tmp~17;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~17;~currentHeading~0 := continueInDirection_~dir; 27557#L1743-3 assume !(1 == ~currentHeading~0); 22120#L1753-9 assume !(0 == ~currentFloorID~0); 22113#L1753-11 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 22110#L1759-11 havoc __utac_acc__Specification2_spec__3_#t~ret154, __utac_acc__Specification2_spec__3_#t~ret155, __utac_acc__Specification2_spec__3_#t~ret156, __utac_acc__Specification2_spec__3_#t~ret157, __utac_acc__Specification2_spec__3_#t~ret158, __utac_acc__Specification2_spec__3_#t~ret159, __utac_acc__Specification2_spec__3_~floor~0, __utac_acc__Specification2_spec__3_~tmp~25, __utac_acc__Specification2_spec__3_~tmp___0~12, __utac_acc__Specification2_spec__3_~tmp___1~8, __utac_acc__Specification2_spec__3_~tmp___2~6, __utac_acc__Specification2_spec__3_~tmp___3~5, __utac_acc__Specification2_spec__3_~tmp___4~3;havoc __utac_acc__Specification2_spec__3_~floor~0;havoc __utac_acc__Specification2_spec__3_~tmp~25;havoc __utac_acc__Specification2_spec__3_~tmp___0~12;havoc __utac_acc__Specification2_spec__3_~tmp___1~8;havoc __utac_acc__Specification2_spec__3_~tmp___2~6;havoc __utac_acc__Specification2_spec__3_~tmp___3~5;havoc __utac_acc__Specification2_spec__3_~tmp___4~3;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~9;havoc getCurrentFloorID_~retValue_acc~9;getCurrentFloorID_~retValue_acc~9 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~9; 25470#L1134-7 __utac_acc__Specification2_spec__3_#t~ret154 := getCurrentFloorID_#res;__utac_acc__Specification2_spec__3_~tmp~25 := __utac_acc__Specification2_spec__3_#t~ret154;havoc __utac_acc__Specification2_spec__3_#t~ret154;__utac_acc__Specification2_spec__3_~floor~0 := __utac_acc__Specification2_spec__3_~tmp~25; 25464#L2583-1 assume 0 == __utac_acc__Specification2_spec__3_~floor~0; 25462#L2584-1 assume 0 != ~floorButtons_spc2_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~10;havoc areDoorsOpen_~retValue_acc~10;areDoorsOpen_~retValue_acc~10 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~10; 25453#L1143-5 __utac_acc__Specification2_spec__3_#t~ret155 := areDoorsOpen_#res;__utac_acc__Specification2_spec__3_~tmp___4~3 := __utac_acc__Specification2_spec__3_#t~ret155;havoc __utac_acc__Specification2_spec__3_#t~ret155; 25430#L2588-2 assume 0 != __utac_acc__Specification2_spec__3_~tmp___4~3;~floorButtons_spc2_0~0 := 0; 25420#L2643-1 cleanup_~i~0 := 1 + cleanup_~i~0; 25418#L197-2 [2019-01-14 04:00:47,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:00:47,216 INFO L82 PathProgramCache]: Analyzing trace with hash -60097954, now seen corresponding path program 1 times [2019-01-14 04:00:47,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:00:47,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:00:47,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:00:47,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:00:47,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:00:47,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:00:47,378 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:00:47,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:00:47,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:00:47,379 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:00:47,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:00:47,380 INFO L82 PathProgramCache]: Analyzing trace with hash 300043145, now seen corresponding path program 1 times [2019-01-14 04:00:47,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:00:47,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:00:47,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:00:47,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:00:47,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:00:47,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:00:47,511 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:00:47,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:00:47,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:00:47,512 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:00:47,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:00:47,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:00:47,513 INFO L87 Difference]: Start difference. First operand 6877 states and 12959 transitions. cyclomatic complexity: 6084 Second operand 5 states. [2019-01-14 04:00:48,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:00:48,526 INFO L93 Difference]: Finished difference Result 21070 states and 39421 transitions. [2019-01-14 04:00:48,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 04:00:48,528 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21070 states and 39421 transitions. [2019-01-14 04:00:48,633 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16716 [2019-01-14 04:00:48,738 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21070 states to 21070 states and 39421 transitions. [2019-01-14 04:00:48,739 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21070 [2019-01-14 04:00:48,760 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21070 [2019-01-14 04:00:48,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21070 states and 39421 transitions. [2019-01-14 04:00:48,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:00:48,789 INFO L706 BuchiCegarLoop]: Abstraction has 21070 states and 39421 transitions. [2019-01-14 04:00:48,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21070 states and 39421 transitions. [2019-01-14 04:00:49,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21070 to 8790. [2019-01-14 04:00:49,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8790 states. [2019-01-14 04:00:49,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8790 states to 8790 states and 16426 transitions. [2019-01-14 04:00:49,084 INFO L729 BuchiCegarLoop]: Abstraction has 8790 states and 16426 transitions. [2019-01-14 04:00:49,084 INFO L609 BuchiCegarLoop]: Abstraction has 8790 states and 16426 transitions. [2019-01-14 04:00:49,084 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:00:49,084 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8790 states and 16426 transitions. [2019-01-14 04:00:49,127 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4535 [2019-01-14 04:00:49,127 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:00:49,127 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:00:49,138 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] [2019-01-14 04:00:49,139 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] [2019-01-14 04:00:49,140 INFO L794 eck$LassoCheckResult]: Stem: 49622#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~cleanupTimeShifts~0 := 12;~head~0.base, ~head~0.offset := 0, 0;call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(30);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(9);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(21);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(30);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(9);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(21);call #t~string41.base, #t~string41.offset := #Ultimate.allocOnStack(30);call #t~string42.base, #t~string42.offset := #Ultimate.allocOnStack(9);call #t~string43.base, #t~string43.offset := #Ultimate.allocOnStack(25);call #t~string44.base, #t~string44.offset := #Ultimate.allocOnStack(30);call #t~string45.base, #t~string45.offset := #Ultimate.allocOnStack(9);call #t~string46.base, #t~string46.offset := #Ultimate.allocOnStack(25);~executiveFloor~0 := 4;~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~string100.base, #t~string100.offset := #Ultimate.allocOnStack(10);call #t~string102.base, #t~string102.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string102.base, #t~string102.offset, 1);call write~init~int(95, #t~string102.base, 1 + #t~string102.offset, 1);call write~init~int(93, #t~string102.base, 2 + #t~string102.offset, 1);call write~init~int(0, #t~string102.base, 3 + #t~string102.offset, 1);call #t~string104.base, #t~string104.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string104.base, #t~string104.offset, 1);call write~init~int(93, #t~string104.base, 1 + #t~string104.offset, 1);call write~init~int(32, #t~string104.base, 2 + #t~string104.offset, 1);call write~init~int(0, #t~string104.base, 3 + #t~string104.offset, 1);call #t~string106.base, #t~string106.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string106.base, #t~string106.offset, 1);call write~init~int(97, #t~string106.base, 1 + #t~string106.offset, 1);call write~init~int(116, #t~string106.base, 2 + #t~string106.offset, 1);call write~init~int(32, #t~string106.base, 3 + #t~string106.offset, 1);call write~init~int(0, #t~string106.base, 4 + #t~string106.offset, 1);call #t~string108.base, #t~string108.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string108.base, #t~string108.offset, 1);call write~init~int(105, #t~string108.base, 1 + #t~string108.offset, 1);call write~init~int(0, #t~string108.base, 2 + #t~string108.offset, 1);call #t~string110.base, #t~string110.offset := #Ultimate.allocOnStack(10);call #t~string112.base, #t~string112.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string112.base, #t~string112.offset, 1);call write~init~int(112, #t~string112.base, 1 + #t~string112.offset, 1);call write~init~int(0, #t~string112.base, 2 + #t~string112.offset, 1);call #t~string114.base, #t~string114.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string114.base, #t~string114.offset, 1);call write~init~int(111, #t~string114.base, 1 + #t~string114.offset, 1);call write~init~int(119, #t~string114.base, 2 + #t~string114.offset, 1);call write~init~int(110, #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(7);call write~init~int(32, #t~string116.base, #t~string116.offset, 1);call write~init~int(73, #t~string116.base, 1 + #t~string116.offset, 1);call write~init~int(76, #t~string116.base, 2 + #t~string116.offset, 1);call write~init~int(95, #t~string116.base, 3 + #t~string116.offset, 1);call write~init~int(112, #t~string116.base, 4 + #t~string116.offset, 1);call write~init~int(58, #t~string116.base, 5 + #t~string116.offset, 1);call write~init~int(0, #t~string116.base, 6 + #t~string116.offset, 1);call #t~string118.base, #t~string118.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string118.base, #t~string118.offset, 1);call write~init~int(37, #t~string118.base, 1 + #t~string118.offset, 1);call write~init~int(105, #t~string118.base, 2 + #t~string118.offset, 1);call write~init~int(0, #t~string118.base, 3 + #t~string118.offset, 1);call #t~string120.base, #t~string120.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string120.base, #t~string120.offset, 1);call write~init~int(37, #t~string120.base, 1 + #t~string120.offset, 1);call write~init~int(105, #t~string120.base, 2 + #t~string120.offset, 1);call write~init~int(0, #t~string120.base, 3 + #t~string120.offset, 1);call #t~string122.base, #t~string122.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string122.base, #t~string122.offset, 1);call write~init~int(37, #t~string122.base, 1 + #t~string122.offset, 1);call write~init~int(105, #t~string122.base, 2 + #t~string122.offset, 1);call write~init~int(0, #t~string122.base, 3 + #t~string122.offset, 1);call #t~string124.base, #t~string124.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string124.base, #t~string124.offset, 1);call write~init~int(37, #t~string124.base, 1 + #t~string124.offset, 1);call write~init~int(105, #t~string124.base, 2 + #t~string124.offset, 1);call write~init~int(0, #t~string124.base, 3 + #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(6);call write~init~int(32, #t~string128.base, #t~string128.offset, 1);call write~init~int(70, #t~string128.base, 1 + #t~string128.offset, 1);call write~init~int(95, #t~string128.base, 2 + #t~string128.offset, 1);call write~init~int(112, #t~string128.base, 3 + #t~string128.offset, 1);call write~init~int(58, #t~string128.base, 4 + #t~string128.offset, 1);call write~init~int(0, #t~string128.base, 5 + #t~string128.offset, 1);call #t~string131.base, #t~string131.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string131.base, #t~string131.offset, 1);call write~init~int(37, #t~string131.base, 1 + #t~string131.offset, 1);call write~init~int(105, #t~string131.base, 2 + #t~string131.offset, 1);call write~init~int(0, #t~string131.base, 3 + #t~string131.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~string137.base, #t~string137.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string137.base, #t~string137.offset, 1);call write~init~int(37, #t~string137.base, 1 + #t~string137.offset, 1);call write~init~int(105, #t~string137.base, 2 + #t~string137.offset, 1);call write~init~int(0, #t~string137.base, 3 + #t~string137.offset, 1);call #t~string140.base, #t~string140.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string140.base, #t~string140.offset, 1);call write~init~int(37, #t~string140.base, 1 + #t~string140.offset, 1);call write~init~int(105, #t~string140.base, 2 + #t~string140.offset, 1);call write~init~int(0, #t~string140.base, 3 + #t~string140.offset, 1);call #t~string143.base, #t~string143.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string143.base, #t~string143.offset, 1);call write~init~int(37, #t~string143.base, 1 + #t~string143.offset, 1);call write~init~int(105, #t~string143.base, 2 + #t~string143.offset, 1);call write~init~int(0, #t~string143.base, 3 + #t~string143.offset, 1);call #t~string145.base, #t~string145.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string145.base, #t~string145.offset, 1);call write~init~int(0, #t~string145.base, 1 + #t~string145.offset, 1);~floorButtons_spc2_0~0 := 0;~floorButtons_spc2_1~0 := 0;~floorButtons_spc2_2~0 := 0;~floorButtons_spc2_3~0 := 0;~floorButtons_spc2_4~0 := 0;~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0; 49623#L-1 havoc main_#res;havoc main_#t~ret13, main_~retValue_acc~1, main_~tmp~8;havoc main_~retValue_acc~1;havoc main_~tmp~8; 50766#L3400 havoc valid_product_#res;havoc valid_product_~retValue_acc~29;havoc valid_product_~retValue_acc~29;valid_product_~retValue_acc~29 := 1;valid_product_#res := valid_product_~retValue_acc~29; 51067#L3408 main_#t~ret13 := valid_product_#res;main_~tmp~8 := main_#t~ret13;havoc main_#t~ret13; 50641#L398 assume 0 != main_~tmp~8; 50642#L367 ~floorButtons_spc2_0~0 := 0;~floorButtons_spc2_1~0 := 0;~floorButtons_spc2_2~0 := 0;~floorButtons_spc2_3~0 := 0;~floorButtons_spc2_4~0 := 0; 49024#L2538 havoc bigMacCall_#t~ret6, bigMacCall_~tmp~5;havoc bigMacCall_~tmp~5;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~3;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~3; 49025#L457 assume 0 == getOrigin_~person;getOrigin_~retValue_acc~3 := 4;getOrigin_#res := getOrigin_~retValue_acc~3; 49296#L482 bigMacCall_#t~ret6 := getOrigin_#res;bigMacCall_~tmp~5 := bigMacCall_#t~ret6;havoc bigMacCall_#t~ret6;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~5;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 49836#L3058 assume 0 == initPersonOnFloor_~floor; 49542#L3059 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 48735#L3166-1 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 50219#L2850 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 49862#L2862-2 havoc cleanup_#t~ret7, cleanup_#t~ret8, cleanup_~i~0, cleanup_~tmp~6, cleanup_~tmp___0~0, cleanup_~__cil_tmp4~0;havoc cleanup_~i~0;havoc cleanup_~tmp~6;havoc cleanup_~tmp___0~0;havoc cleanup_~__cil_tmp4~0;havoc timeShift_#t~ret89, timeShift_#t~ret90, timeShift_#t~ret91, timeShift_#t~ret92, timeShift_#t~ret93, timeShift_#t~ret94, timeShift_#t~ret95, timeShift_#t~ret96, timeShift_#t~ret97, timeShift_#t~ret98, timeShift_#t~ret99, timeShift_~tmp~21, timeShift_~tmp___0~8, timeShift_~tmp___1~4, 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~21;havoc timeShift_~tmp___0~8;havoc timeShift_~tmp___1~4;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~ret73, stopRequestedAtCurrentFloor_#t~ret74, stopRequestedAtCurrentFloor_#t~ret75, stopRequestedAtCurrentFloor_#t~ret76, stopRequestedAtCurrentFloor_~retValue_acc~20, stopRequestedAtCurrentFloor_~tmp~19, stopRequestedAtCurrentFloor_~tmp___0~6;havoc stopRequestedAtCurrentFloor_~retValue_acc~20;havoc stopRequestedAtCurrentFloor_~tmp~19;havoc stopRequestedAtCurrentFloor_~tmp___0~6;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret147, isExecutiveFloorCalling_~retValue_acc~23;havoc isExecutiveFloorCalling_~retValue_acc~23;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~25;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~25; 50859#L2787 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~25 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~25; 50902#L2814 isExecutiveFloorCalling_#t~ret147 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~23 := isExecutiveFloorCalling_#t~ret147;havoc isExecutiveFloorCalling_#t~ret147;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~23; 50903#L2419 stopRequestedAtCurrentFloor_#t~ret73 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~19 := stopRequestedAtCurrentFloor_#t~ret73;havoc stopRequestedAtCurrentFloor_#t~ret73; 50919#L1803 assume 0 != stopRequestedAtCurrentFloor_~tmp~19;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~9;havoc getCurrentFloorID_~retValue_acc~9;getCurrentFloorID_~retValue_acc~9 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~9; 50275#L1134 stopRequestedAtCurrentFloor_#t~ret74 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~6 := stopRequestedAtCurrentFloor_#t~ret74;havoc stopRequestedAtCurrentFloor_#t~ret74; 50276#L1807 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~6);stopRequestedAtCurrentFloor_~retValue_acc~20 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~20; 50673#L1820 timeShift_#t~ret89 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret89;havoc timeShift_#t~ret89; 49700#L1956 assume !(0 != timeShift_~tmp___9~2); 49701#L2047 assume !(1 == ~doorState~0); 51658#L2047-2 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret67, stopRequestedInDirection_#t~ret68, stopRequestedInDirection_#t~ret69, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~17, stopRequestedInDirection_~tmp~16, stopRequestedInDirection_~tmp___0~4, 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~17;havoc stopRequestedInDirection_~tmp~16;havoc stopRequestedInDirection_~tmp___0~4;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret147, isExecutiveFloorCalling_~retValue_acc~23;havoc isExecutiveFloorCalling_~retValue_acc~23;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~25;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~25; 54315#L2787-3 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~25 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~25; 54314#L2814-3 isExecutiveFloorCalling_#t~ret147 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~23 := isExecutiveFloorCalling_#t~ret147;havoc isExecutiveFloorCalling_#t~ret147;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~23; 54313#L2419-1 stopRequestedInDirection_#t~ret67 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~4 := stopRequestedInDirection_#t~ret67;havoc stopRequestedInDirection_#t~ret67; 54312#L1686 assume 0 != stopRequestedInDirection_~tmp___0~4;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~9;havoc getCurrentFloorID_~retValue_acc~9;getCurrentFloorID_~retValue_acc~9 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~9; 54277#L1134-1 stopRequestedInDirection_#t~ret68 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~16 := stopRequestedInDirection_#t~ret68;havoc stopRequestedInDirection_#t~ret68;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~16 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~17 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~17; 54276#L1699 timeShift_#t~ret96 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret96;havoc timeShift_#t~ret96; 51545#L2055 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret70, continueInDirection_~dir, continueInDirection_~tmp~17;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~17;~currentHeading~0 := continueInDirection_~dir; 48949#L1743 assume !(1 == ~currentHeading~0); 48951#L1753 assume !(0 == ~currentFloorID~0); 50138#L1753-2 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 50128#L1759-5 havoc __utac_acc__Specification2_spec__3_#t~ret154, __utac_acc__Specification2_spec__3_#t~ret155, __utac_acc__Specification2_spec__3_#t~ret156, __utac_acc__Specification2_spec__3_#t~ret157, __utac_acc__Specification2_spec__3_#t~ret158, __utac_acc__Specification2_spec__3_#t~ret159, __utac_acc__Specification2_spec__3_~floor~0, __utac_acc__Specification2_spec__3_~tmp~25, __utac_acc__Specification2_spec__3_~tmp___0~12, __utac_acc__Specification2_spec__3_~tmp___1~8, __utac_acc__Specification2_spec__3_~tmp___2~6, __utac_acc__Specification2_spec__3_~tmp___3~5, __utac_acc__Specification2_spec__3_~tmp___4~3;havoc __utac_acc__Specification2_spec__3_~floor~0;havoc __utac_acc__Specification2_spec__3_~tmp~25;havoc __utac_acc__Specification2_spec__3_~tmp___0~12;havoc __utac_acc__Specification2_spec__3_~tmp___1~8;havoc __utac_acc__Specification2_spec__3_~tmp___2~6;havoc __utac_acc__Specification2_spec__3_~tmp___3~5;havoc __utac_acc__Specification2_spec__3_~tmp___4~3;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~9;havoc getCurrentFloorID_~retValue_acc~9;getCurrentFloorID_~retValue_acc~9 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~9; 50281#L1134-3 __utac_acc__Specification2_spec__3_#t~ret154 := getCurrentFloorID_#res;__utac_acc__Specification2_spec__3_~tmp~25 := __utac_acc__Specification2_spec__3_#t~ret154;havoc __utac_acc__Specification2_spec__3_#t~ret154;__utac_acc__Specification2_spec__3_~floor~0 := __utac_acc__Specification2_spec__3_~tmp~25; 50282#L2583 assume 0 == __utac_acc__Specification2_spec__3_~floor~0; 50404#L2584 assume 0 != ~floorButtons_spc2_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~10;havoc areDoorsOpen_~retValue_acc~10;areDoorsOpen_~retValue_acc~10 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~10; 50405#L1143 __utac_acc__Specification2_spec__3_#t~ret155 := areDoorsOpen_#res;__utac_acc__Specification2_spec__3_~tmp___4~3 := __utac_acc__Specification2_spec__3_#t~ret155;havoc __utac_acc__Specification2_spec__3_#t~ret155; 54256#L2588 assume 0 != __utac_acc__Specification2_spec__3_~tmp___4~3;~floorButtons_spc2_0~0 := 0; 54257#L2643 cleanup_~i~0 := 0; 55383#L197-2 [2019-01-14 04:00:49,145 INFO L796 eck$LassoCheckResult]: Loop: 55383#L197-2 assume !false; 55382#L198 cleanup_~__cil_tmp4~0 := ~cleanupTimeShifts~0 - 1; 55381#L201 assume cleanup_~i~0 < cleanup_~__cil_tmp4~0;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~8;havoc isBlocked_~retValue_acc~8;isBlocked_~retValue_acc~8 := 0;isBlocked_#res := isBlocked_~retValue_acc~8; 55375#L980 cleanup_#t~ret7 := isBlocked_#res;cleanup_~tmp___0~0 := cleanup_#t~ret7;havoc cleanup_#t~ret7; 55374#L205 assume 1 != cleanup_~tmp___0~0; 55369#L205-1 havoc isIdle_#res;havoc isIdle_#t~ret55, isIdle_~retValue_acc~15, isIdle_~tmp~14;havoc isIdle_~retValue_acc~15;havoc isIdle_~tmp~14;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret50, anyStopRequested_#t~ret51, anyStopRequested_#t~ret52, anyStopRequested_#t~ret53, anyStopRequested_#t~ret54, anyStopRequested_~retValue_acc~14, anyStopRequested_~tmp~13, anyStopRequested_~tmp___0~2, anyStopRequested_~tmp___1~1, anyStopRequested_~tmp___2~1, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~14;havoc anyStopRequested_~tmp~13;havoc anyStopRequested_~tmp___0~2;havoc anyStopRequested_~tmp___1~1;havoc anyStopRequested_~tmp___2~1;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~25;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~25; 55367#L2787-25 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~25 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~25; 55353#L2814-25 anyStopRequested_#t~ret50 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret50;havoc anyStopRequested_#t~ret50; 55354#L1242 assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~14 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~14; 55332#L1306 isIdle_#t~ret55 := anyStopRequested_#res;isIdle_~tmp~14 := isIdle_#t~ret55;havoc isIdle_#t~ret55;isIdle_~retValue_acc~15 := (if 0 == isIdle_~tmp~14 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~15; 55333#L1319 cleanup_#t~ret8 := isIdle_#res;cleanup_~tmp~6 := cleanup_#t~ret8;havoc cleanup_#t~ret8; 55328#L217 assume !(0 != cleanup_~tmp~6);havoc timeShift_#t~ret89, timeShift_#t~ret90, timeShift_#t~ret91, timeShift_#t~ret92, timeShift_#t~ret93, timeShift_#t~ret94, timeShift_#t~ret95, timeShift_#t~ret96, timeShift_#t~ret97, timeShift_#t~ret98, timeShift_#t~ret99, timeShift_~tmp~21, timeShift_~tmp___0~8, timeShift_~tmp___1~4, 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~21;havoc timeShift_~tmp___0~8;havoc timeShift_~tmp___1~4;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~ret73, stopRequestedAtCurrentFloor_#t~ret74, stopRequestedAtCurrentFloor_#t~ret75, stopRequestedAtCurrentFloor_#t~ret76, stopRequestedAtCurrentFloor_~retValue_acc~20, stopRequestedAtCurrentFloor_~tmp~19, stopRequestedAtCurrentFloor_~tmp___0~6;havoc stopRequestedAtCurrentFloor_~retValue_acc~20;havoc stopRequestedAtCurrentFloor_~tmp~19;havoc stopRequestedAtCurrentFloor_~tmp___0~6;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret147, isExecutiveFloorCalling_~retValue_acc~23;havoc isExecutiveFloorCalling_~retValue_acc~23;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~25;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~25; 55329#L2787-30 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~25 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~25; 53652#L2814-30 isExecutiveFloorCalling_#t~ret147 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~23 := isExecutiveFloorCalling_#t~ret147;havoc isExecutiveFloorCalling_#t~ret147;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~23; 55326#L2419-3 stopRequestedAtCurrentFloor_#t~ret73 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~19 := stopRequestedAtCurrentFloor_#t~ret73;havoc stopRequestedAtCurrentFloor_#t~ret73; 56958#L1803-1 assume 0 != stopRequestedAtCurrentFloor_~tmp~19;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~9;havoc getCurrentFloorID_~retValue_acc~9;getCurrentFloorID_~retValue_acc~9 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~9; 56959#L1134-4 stopRequestedAtCurrentFloor_#t~ret74 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~6 := stopRequestedAtCurrentFloor_#t~ret74;havoc stopRequestedAtCurrentFloor_#t~ret74; 56972#L1807-1 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~6);stopRequestedAtCurrentFloor_~retValue_acc~20 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~20; 50667#L1820-1 timeShift_#t~ret89 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret89;havoc timeShift_#t~ret89; 57145#L1956-1 assume !(0 != timeShift_~tmp___9~2); 57144#L2047-3 assume !(1 == ~doorState~0); 57143#L2047-5 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret67, stopRequestedInDirection_#t~ret68, stopRequestedInDirection_#t~ret69, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~17, stopRequestedInDirection_~tmp~16, stopRequestedInDirection_~tmp___0~4, 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~17;havoc stopRequestedInDirection_~tmp~16;havoc stopRequestedInDirection_~tmp___0~4;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret147, isExecutiveFloorCalling_~retValue_acc~23;havoc isExecutiveFloorCalling_~retValue_acc~23;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~25;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~25; 57142#L2787-33 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~25 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~25; 57055#L2814-33 isExecutiveFloorCalling_#t~ret147 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~23 := isExecutiveFloorCalling_#t~ret147;havoc isExecutiveFloorCalling_#t~ret147;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~23; 57050#L2419-4 stopRequestedInDirection_#t~ret67 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~4 := stopRequestedInDirection_#t~ret67;havoc stopRequestedInDirection_#t~ret67; 57005#L1686-2 assume 0 != stopRequestedInDirection_~tmp___0~4;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~9;havoc getCurrentFloorID_~retValue_acc~9;getCurrentFloorID_~retValue_acc~9 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~9; 57004#L1134-5 stopRequestedInDirection_#t~ret68 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~16 := stopRequestedInDirection_#t~ret68;havoc stopRequestedInDirection_#t~ret68;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~16 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~17 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~17; 57003#L1699-2 timeShift_#t~ret96 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret96;havoc timeShift_#t~ret96; 57002#L2055-1 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret70, continueInDirection_~dir, continueInDirection_~tmp~17;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~17;~currentHeading~0 := continueInDirection_~dir; 48874#L1743-3 assume !(1 == ~currentHeading~0); 48875#L1753-9 assume !(0 == ~currentFloorID~0); 50120#L1753-11 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 50117#L1759-11 havoc __utac_acc__Specification2_spec__3_#t~ret154, __utac_acc__Specification2_spec__3_#t~ret155, __utac_acc__Specification2_spec__3_#t~ret156, __utac_acc__Specification2_spec__3_#t~ret157, __utac_acc__Specification2_spec__3_#t~ret158, __utac_acc__Specification2_spec__3_#t~ret159, __utac_acc__Specification2_spec__3_~floor~0, __utac_acc__Specification2_spec__3_~tmp~25, __utac_acc__Specification2_spec__3_~tmp___0~12, __utac_acc__Specification2_spec__3_~tmp___1~8, __utac_acc__Specification2_spec__3_~tmp___2~6, __utac_acc__Specification2_spec__3_~tmp___3~5, __utac_acc__Specification2_spec__3_~tmp___4~3;havoc __utac_acc__Specification2_spec__3_~floor~0;havoc __utac_acc__Specification2_spec__3_~tmp~25;havoc __utac_acc__Specification2_spec__3_~tmp___0~12;havoc __utac_acc__Specification2_spec__3_~tmp___1~8;havoc __utac_acc__Specification2_spec__3_~tmp___2~6;havoc __utac_acc__Specification2_spec__3_~tmp___3~5;havoc __utac_acc__Specification2_spec__3_~tmp___4~3;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~9;havoc getCurrentFloorID_~retValue_acc~9;getCurrentFloorID_~retValue_acc~9 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~9; 50811#L1134-7 __utac_acc__Specification2_spec__3_#t~ret154 := getCurrentFloorID_#res;__utac_acc__Specification2_spec__3_~tmp~25 := __utac_acc__Specification2_spec__3_#t~ret154;havoc __utac_acc__Specification2_spec__3_#t~ret154;__utac_acc__Specification2_spec__3_~floor~0 := __utac_acc__Specification2_spec__3_~tmp~25; 50371#L2583-1 assume 0 == __utac_acc__Specification2_spec__3_~floor~0; 50372#L2584-1 assume 0 != ~floorButtons_spc2_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~10;havoc areDoorsOpen_~retValue_acc~10;areDoorsOpen_~retValue_acc~10 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~10; 50795#L1143-5 __utac_acc__Specification2_spec__3_#t~ret155 := areDoorsOpen_#res;__utac_acc__Specification2_spec__3_~tmp___4~3 := __utac_acc__Specification2_spec__3_#t~ret155;havoc __utac_acc__Specification2_spec__3_#t~ret155; 50796#L2588-2 assume 0 != __utac_acc__Specification2_spec__3_~tmp___4~3;~floorButtons_spc2_0~0 := 0; 55384#L2643-1 cleanup_~i~0 := 1 + cleanup_~i~0; 55383#L197-2 [2019-01-14 04:00:49,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:00:49,146 INFO L82 PathProgramCache]: Analyzing trace with hash -60097954, now seen corresponding path program 2 times [2019-01-14 04:00:49,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:00:49,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:00:49,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:00:49,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:00:49,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:00:49,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:00:49,332 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:00:49,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:00:49,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:00:49,333 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:00:49,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:00:49,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1388900597, now seen corresponding path program 1 times [2019-01-14 04:00:49,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:00:49,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:00:49,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:00:49,334 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:00:49,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:00:49,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:00:49,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:00:50,301 WARN L181 SmtUtils]: Spent 865.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 160 [2019-01-14 04:00:51,727 WARN L181 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 152 DAG size of output: 124 [2019-01-14 04:00:51,739 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:00:51,740 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:00:51,740 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:00:51,741 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:00:51,741 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:00:51,741 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:00:51,741 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:00:51,741 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:00:51,742 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec2_product11_true-unreach-call_true-termination.cil.c_Iteration3_Loop [2019-01-14 04:00:51,744 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:00:51,745 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:00:51,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:51,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:51,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:51,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:51,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:00:51,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:51,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:51,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:51,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:51,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:00:51,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:51,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:00:51,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:51,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:00:51,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:51,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:51,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:51,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:51,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:51,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:00:51,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:00:51,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:51,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:51,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:51,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:51,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:51,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:51,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:51,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:51,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:51,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:51,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:51,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:51,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:51,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:51,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:51,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:51,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:51,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:51,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:51,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:51,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:51,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:51,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:52,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:00:52,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:52,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:52,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:52,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:00:52,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:52,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:52,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:52,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:52,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:00:52,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:52,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:52,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:00:52,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:52,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:52,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:52,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:52,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:52,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:00:52,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:00:52,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:52,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:52,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:00:52,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:52,749 WARN L181 SmtUtils]: Spent 275.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-14 04:00:53,257 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 19 [2019-01-14 04:00:53,413 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:00:53,414 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:00:53,425 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:00:53,426 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:00:53,443 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:00:53,444 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) [2019-01-14 04:00:53,477 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:00:53,477 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:00:53,490 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:00:53,490 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_~tmp___9~2=0, ULTIMATE.start_stopRequestedAtCurrentFloor_#res=0} Honda state: {ULTIMATE.start_timeShift_~tmp___9~2=0, ULTIMATE.start_stopRequestedAtCurrentFloor_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:00:53,527 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:00:53,528 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:00:53,554 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:00:53,555 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isIdle_#t~ret55=0} Honda state: {ULTIMATE.start_isIdle_#t~ret55=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) [2019-01-14 04:00:53,616 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:00:53,617 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:00:53,645 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:00:53,645 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_continueInDirection_#t~ret70=0} Honda state: {ULTIMATE.start_continueInDirection_#t~ret70=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:00:53,705 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:00:53,705 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:00:53,712 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:00:53,713 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stopRequestedInDirection_#t~ret68=0} Honda state: {ULTIMATE.start_stopRequestedInDirection_#t~ret68=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 04:00:53,750 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:00:53,750 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:00:53,762 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:00:53,762 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_continueInDirection_~tmp~17=0} Honda state: {ULTIMATE.start_continueInDirection_~tmp~17=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 04:00:53,799 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:00:53,799 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:00:53,813 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:00:53,814 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isExecutiveFloorCalling_#t~ret147=0} Honda state: {ULTIMATE.start_isExecutiveFloorCalling_#t~ret147=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:00:53,840 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:00:53,841 INFO L163 nArgumentSynthesizer]: Using integer mode. 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:00:53,878 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:00:53,878 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:00:54,475 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:00:54,477 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:00:54,477 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:00:54,477 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:00:54,477 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:00:54,477 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:00:54,477 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:00:54,478 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:00:54,478 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:00:54,478 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec2_product11_true-unreach-call_true-termination.cil.c_Iteration3_Loop [2019-01-14 04:00:54,478 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:00:54,478 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:00:54,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:00:54,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:54,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:54,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:54,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:54,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:54,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:54,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:54,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:54,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:54,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:00:54,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:54,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:54,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:54,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:55,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:55,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:55,318 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-01-14 04:00:55,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:00:55,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:00:55,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:55,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:00:55,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:00:55,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:00:55,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:00:55,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:00:55,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:55,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:55,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:00:55,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:55,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:55,816 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-14 04:00:55,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:55,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:55,994 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-14 04:00:55,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:56,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:56,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:56,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:56,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:56,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:56,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:00:56,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:56,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:56,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:56,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:56,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:56,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:00:56,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:56,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:56,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:00:56,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:56,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:56,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:56,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:56,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:00:56,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:56,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:00:56,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:56,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:00:56,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:56,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:56,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:56,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:56,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:56,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:56,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:56,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:56,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:00:56,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:00:56,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:00:56,384 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-14 04:00:56,564 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-14 04:00:57,413 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:00:57,420 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:00:57,423 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:00:57,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:00:57,427 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:00:57,428 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:00:57,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:00:57,429 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:00:57,432 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:00:57,432 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:00:57,434 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:00:57,435 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:00:57,436 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:00:57,436 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:00:57,436 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:00:57,436 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:00:57,436 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:00:57,437 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:00:57,437 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:00:57,438 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:00:57,441 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:00:57,445 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:00:57,445 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:00:57,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:00:57,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:00:57,445 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:00:57,446 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:00:57,446 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:00:57,447 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:00:57,447 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:00:57,447 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:00:57,448 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:00:57,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:00:57,448 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:00:57,448 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:00:57,448 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:00:57,448 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:00:57,450 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:00:57,451 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:00:57,451 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:00:57,451 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:00:57,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:00:57,452 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:00:57,452 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:00:57,453 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:00:57,453 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:00:57,460 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:00:57,460 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:00:57,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:00:57,461 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:00:57,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:00:57,461 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:00:57,461 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:00:57,463 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:00:57,463 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:00:57,464 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:00:57,472 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:00:57,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:00:57,473 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:00:57,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:00:57,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:00:57,473 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:00:57,474 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:00:57,474 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:00:57,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:00:57,476 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:00:57,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:00:57,477 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:00:57,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:00:57,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:00:57,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:00:57,482 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:00:57,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:00:57,488 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:00:57,506 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 04:00:57,507 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:00:57,509 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:00:57,509 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:00:57,509 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:00:57,510 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~cleanupTimeShifts~0, ULTIMATE.start_cleanup_~i~0) = 1*~cleanupTimeShifts~0 - 1*ULTIMATE.start_cleanup_~i~0 Supporting invariants [] [2019-01-14 04:00:57,513 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:00:57,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:00:57,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:00:57,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:00:57,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:00:57,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:00:57,924 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:00:57,931 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:00:57,933 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8790 states and 16426 transitions. cyclomatic complexity: 7638 Second operand 5 states. [2019-01-14 04:00:58,470 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8790 states and 16426 transitions. cyclomatic complexity: 7638. Second operand 5 states. Result 13325 states and 24875 transitions. Complement of second has 8 states. [2019-01-14 04:00:58,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 04:00:58,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 04:00:58,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 4526 transitions. [2019-01-14 04:00:58,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 4526 transitions. Stem has 41 letters. Loop has 39 letters. [2019-01-14 04:00:58,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:00:58,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 4526 transitions. Stem has 80 letters. Loop has 39 letters. [2019-01-14 04:00:58,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:00:58,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 4526 transitions. Stem has 41 letters. Loop has 78 letters. [2019-01-14 04:00:58,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:00:58,491 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13325 states and 24875 transitions. [2019-01-14 04:00:58,582 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:00:58,583 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13325 states to 0 states and 0 transitions. [2019-01-14 04:00:58,583 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:00:58,583 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:00:58,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:00:58,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:00:58,584 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:00:58,584 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:00:58,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:00:58,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:00:58,584 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2019-01-14 04:00:58,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:00:58,585 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-14 04:00:58,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 04:00:58,590 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-14 04:00:58,590 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:00:58,591 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 04:00:58,591 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:00:58,591 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:00:58,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:00:58,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:00:58,591 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:00:58,591 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:00:58,591 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:00:58,591 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 04:00:58,591 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 04:00:58,592 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:00:58,592 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 04:00:58,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:00:58 BoogieIcfgContainer [2019-01-14 04:00:58,607 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:00:58,607 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:00:58,607 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:00:58,607 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:00:58,610 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:00:35" (3/4) ... [2019-01-14 04:00:58,615 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 04:00:58,615 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:00:58,616 INFO L168 Benchmark]: Toolchain (without parser) took 36440.73 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 467.1 MB). Free memory was 947.2 MB in the beginning and 760.6 MB in the end (delta: 186.6 MB). Peak memory consumption was 653.8 MB. Max. memory is 11.5 GB. [2019-01-14 04:00:58,619 INFO L168 Benchmark]: CDTParser took 0.19 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:00:58,619 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1156.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 947.2 MB in the beginning and 1.1 GB in the end (delta: -148.4 MB). Peak memory consumption was 57.8 MB. Max. memory is 11.5 GB. [2019-01-14 04:00:58,621 INFO L168 Benchmark]: Boogie Procedure Inliner took 231.56 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: 20.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2019-01-14 04:00:58,622 INFO L168 Benchmark]: Boogie Preprocessor took 251.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 34.0 MB). Peak memory consumption was 34.0 MB. Max. memory is 11.5 GB. [2019-01-14 04:00:58,624 INFO L168 Benchmark]: RCFGBuilder took 11567.74 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 117.4 MB). Free memory was 1.0 GB in the beginning and 785.5 MB in the end (delta: 255.7 MB). Peak memory consumption was 373.1 MB. Max. memory is 11.5 GB. [2019-01-14 04:00:58,625 INFO L168 Benchmark]: BuchiAutomizer took 23221.13 ms. Allocated memory was 1.3 GB in the beginning and 1.5 GB in the end (delta: 219.2 MB). Free memory was 785.5 MB in the beginning and 760.6 MB in the end (delta: 24.9 MB). Peak memory consumption was 244.1 MB. Max. memory is 11.5 GB. [2019-01-14 04:00:58,626 INFO L168 Benchmark]: Witness Printer took 8.26 ms. Allocated memory is still 1.5 GB. Free memory is still 760.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:00:58,633 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.19 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 1156.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 947.2 MB in the beginning and 1.1 GB in the end (delta: -148.4 MB). Peak memory consumption was 57.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 231.56 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: 20.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 251.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 34.0 MB). Peak memory consumption was 34.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 11567.74 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 117.4 MB). Free memory was 1.0 GB in the beginning and 785.5 MB in the end (delta: 255.7 MB). Peak memory consumption was 373.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 23221.13 ms. Allocated memory was 1.3 GB in the beginning and 1.5 GB in the end (delta: 219.2 MB). Free memory was 785.5 MB in the beginning and 760.6 MB in the end (delta: 24.9 MB). Peak memory consumption was 244.1 MB. Max. memory is 11.5 GB. * Witness Printer took 8.26 ms. Allocated memory is still 1.5 GB. Free memory is still 760.6 MB. 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 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function cleanupTimeShifts + -1 * i and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 23.1s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 9.6s. Construction of modules took 8.0s. Büchi inclusion checks took 3.5s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.6s AutomataMinimizationTime, 2 MinimizatonAttempts, 23538 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.7s Buchi closure took 0.0s. Biggest automaton had 8790 states and ocurred in iteration 2. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 17928 SDtfs, 77627 SDslu, 53224 SDs, 0 SdLazy, 2577 SolverSat, 699 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI2 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital181 mio100 ax100 hnf100 lsp15 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq221 hnf87 smp100 dnf203 smp87 tf102 neg97 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 12ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 7 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.8s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...