./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/product-lines/elevator_spec9_product31.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_0ec4fb2a-0484-45a7-afb1-498f8ffd02f9/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_0ec4fb2a-0484-45a7-afb1-498f8ffd02f9/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0ec4fb2a-0484-45a7-afb1-498f8ffd02f9/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0ec4fb2a-0484-45a7-afb1-498f8ffd02f9/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/product-lines/elevator_spec9_product31.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_0ec4fb2a-0484-45a7-afb1-498f8ffd02f9/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0ec4fb2a-0484-45a7-afb1-498f8ffd02f9/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8dd8d23e89400e7d41ca0a1d3482e52034eec047 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 22:47:42,162 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:47:42,164 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:47:42,177 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:47:42,178 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:47:42,179 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:47:42,181 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:47:42,183 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:47:42,186 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:47:42,187 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:47:42,188 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:47:42,189 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:47:42,190 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:47:42,191 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:47:42,192 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:47:42,193 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:47:42,194 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:47:42,195 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:47:42,197 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:47:42,199 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:47:42,201 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:47:42,202 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:47:42,203 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:47:42,204 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:47:42,207 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:47:42,207 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:47:42,207 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:47:42,208 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:47:42,208 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:47:42,209 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:47:42,210 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:47:42,210 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:47:42,211 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:47:42,212 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:47:42,213 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:47:42,213 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:47:42,214 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:47:42,214 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:47:42,214 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:47:42,215 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:47:42,216 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:47:42,217 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0ec4fb2a-0484-45a7-afb1-498f8ffd02f9/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 22:47:42,234 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:47:42,235 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:47:42,236 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:47:42,236 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:47:42,237 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:47:42,237 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 22:47:42,237 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 22:47:42,237 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 22:47:42,238 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 22:47:42,238 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 22:47:42,238 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 22:47:42,238 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:47:42,239 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:47:42,239 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 22:47:42,239 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:47:42,239 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:47:42,240 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:47:42,240 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 22:47:42,240 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 22:47:42,240 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 22:47:42,241 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:47:42,241 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:47:42,241 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 22:47:42,242 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:47:42,242 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 22:47:42,242 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:47:42,242 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:47:42,243 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 22:47:42,243 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:47:42,243 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:47:42,243 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 22:47:42,244 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 22:47:42,245 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_0ec4fb2a-0484-45a7-afb1-498f8ffd02f9/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8dd8d23e89400e7d41ca0a1d3482e52034eec047 [2019-11-15 22:47:42,275 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:47:42,288 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:47:42,293 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:47:42,295 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:47:42,295 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:47:42,296 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0ec4fb2a-0484-45a7-afb1-498f8ffd02f9/bin/uautomizer/../../sv-benchmarks/c/product-lines/elevator_spec9_product31.cil.c [2019-11-15 22:47:42,374 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0ec4fb2a-0484-45a7-afb1-498f8ffd02f9/bin/uautomizer/data/86fecdde6/138cbbe0e6d94a9f9b280a0aba481964/FLAGac7f97fd9 [2019-11-15 22:47:43,128 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:47:43,134 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0ec4fb2a-0484-45a7-afb1-498f8ffd02f9/sv-benchmarks/c/product-lines/elevator_spec9_product31.cil.c [2019-11-15 22:47:43,168 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0ec4fb2a-0484-45a7-afb1-498f8ffd02f9/bin/uautomizer/data/86fecdde6/138cbbe0e6d94a9f9b280a0aba481964/FLAGac7f97fd9 [2019-11-15 22:47:43,218 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0ec4fb2a-0484-45a7-afb1-498f8ffd02f9/bin/uautomizer/data/86fecdde6/138cbbe0e6d94a9f9b280a0aba481964 [2019-11-15 22:47:43,222 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:47:43,224 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:47:43,227 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:47:43,228 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:47:43,232 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:47:43,233 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:47:43" (1/1) ... [2019-11-15 22:47:43,236 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f09ad54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:47:43, skipping insertion in model container [2019-11-15 22:47:43,236 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:47:43" (1/1) ... [2019-11-15 22:47:43,244 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:47:43,350 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:47:44,172 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:47:44,188 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:47:44,381 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:47:44,494 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:47:44,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:47:44 WrapperNode [2019-11-15 22:47:44,495 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:47:44,498 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:47:44,498 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:47:44,498 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:47:44,508 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:47:44" (1/1) ... [2019-11-15 22:47:44,583 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:47:44" (1/1) ... [2019-11-15 22:47:44,855 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:47:44,855 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:47:44,863 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:47:44,863 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:47:44,874 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:47:44" (1/1) ... [2019-11-15 22:47:44,875 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:47:44" (1/1) ... [2019-11-15 22:47:44,922 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:47:44" (1/1) ... [2019-11-15 22:47:44,937 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:47:44" (1/1) ... [2019-11-15 22:47:45,059 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:47:44" (1/1) ... [2019-11-15 22:47:45,160 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:47:44" (1/1) ... [2019-11-15 22:47:45,189 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:47:44" (1/1) ... [2019-11-15 22:47:45,234 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:47:45,234 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:47:45,235 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:47:45,235 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:47:45,236 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:47:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0ec4fb2a-0484-45a7-afb1-498f8ffd02f9/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:47:45,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:47:45,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-15 22:47:45,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:47:45,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:47:55,435 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:47:55,435 INFO L284 CfgBuilder]: Removed 881 assume(true) statements. [2019-11-15 22:47:55,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:47:55 BoogieIcfgContainer [2019-11-15 22:47:55,438 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:47:55,439 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 22:47:55,439 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 22:47:55,443 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 22:47:55,444 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:47:55,444 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 10:47:43" (1/3) ... [2019-11-15 22:47:55,446 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@110282c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:47:55, skipping insertion in model container [2019-11-15 22:47:55,446 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:47:55,446 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:47:44" (2/3) ... [2019-11-15 22:47:55,447 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@110282c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:47:55, skipping insertion in model container [2019-11-15 22:47:55,447 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:47:55,447 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:47:55" (3/3) ... [2019-11-15 22:47:55,449 INFO L371 chiAutomizerObserver]: Analyzing ICFG elevator_spec9_product31.cil.c [2019-11-15 22:47:55,501 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 22:47:55,501 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 22:47:55,502 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 22:47:55,502 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:47:55,502 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:47:55,502 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 22:47:55,502 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:47:55,503 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 22:47:55,573 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3671 states. [2019-11-15 22:47:55,699 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1825 [2019-11-15 22:47:55,699 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:47:55,699 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:47:55,722 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:47:55,722 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:47:55,722 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 22:47:55,722 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3671 states. [2019-11-15 22:47:55,769 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1825 [2019-11-15 22:47:55,770 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:47:55,770 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:47:55,776 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:47:55,777 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:47:55,786 INFO L791 eck$LassoCheckResult]: Stem: 2093#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~cleanupTimeShifts~0 := 12;~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0;~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~string69.base, #t~string69.offset := #Ultimate.allocOnStack(10);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string71.base, #t~string71.offset, 1);call write~init~int(95, #t~string71.base, 1 + #t~string71.offset, 1);call write~init~int(93, #t~string71.base, 2 + #t~string71.offset, 1);call write~init~int(0, #t~string71.base, 3 + #t~string71.offset, 1);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string73.base, #t~string73.offset, 1);call write~init~int(93, #t~string73.base, 1 + #t~string73.offset, 1);call write~init~int(32, #t~string73.base, 2 + #t~string73.offset, 1);call write~init~int(0, #t~string73.base, 3 + #t~string73.offset, 1);call #t~string75.base, #t~string75.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string75.base, #t~string75.offset, 1);call write~init~int(97, #t~string75.base, 1 + #t~string75.offset, 1);call write~init~int(116, #t~string75.base, 2 + #t~string75.offset, 1);call write~init~int(32, #t~string75.base, 3 + #t~string75.offset, 1);call write~init~int(0, #t~string75.base, 4 + #t~string75.offset, 1);call #t~string77.base, #t~string77.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string77.base, #t~string77.offset, 1);call write~init~int(105, #t~string77.base, 1 + #t~string77.offset, 1);call write~init~int(0, #t~string77.base, 2 + #t~string77.offset, 1);call #t~string79.base, #t~string79.offset := #Ultimate.allocOnStack(10);call #t~string81.base, #t~string81.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string81.base, #t~string81.offset, 1);call write~init~int(112, #t~string81.base, 1 + #t~string81.offset, 1);call write~init~int(0, #t~string81.base, 2 + #t~string81.offset, 1);call #t~string83.base, #t~string83.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string83.base, #t~string83.offset, 1);call write~init~int(111, #t~string83.base, 1 + #t~string83.offset, 1);call write~init~int(119, #t~string83.base, 2 + #t~string83.offset, 1);call write~init~int(110, #t~string83.base, 3 + #t~string83.offset, 1);call write~init~int(0, #t~string83.base, 4 + #t~string83.offset, 1);call #t~string85.base, #t~string85.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string85.base, #t~string85.offset, 1);call write~init~int(73, #t~string85.base, 1 + #t~string85.offset, 1);call write~init~int(76, #t~string85.base, 2 + #t~string85.offset, 1);call write~init~int(95, #t~string85.base, 3 + #t~string85.offset, 1);call write~init~int(112, #t~string85.base, 4 + #t~string85.offset, 1);call write~init~int(58, #t~string85.base, 5 + #t~string85.offset, 1);call write~init~int(0, #t~string85.base, 6 + #t~string85.offset, 1);call #t~string87.base, #t~string87.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string87.base, #t~string87.offset, 1);call write~init~int(37, #t~string87.base, 1 + #t~string87.offset, 1);call write~init~int(105, #t~string87.base, 2 + #t~string87.offset, 1);call write~init~int(0, #t~string87.base, 3 + #t~string87.offset, 1);call #t~string89.base, #t~string89.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string89.base, #t~string89.offset, 1);call write~init~int(37, #t~string89.base, 1 + #t~string89.offset, 1);call write~init~int(105, #t~string89.base, 2 + #t~string89.offset, 1);call write~init~int(0, #t~string89.base, 3 + #t~string89.offset, 1);call #t~string91.base, #t~string91.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string91.base, #t~string91.offset, 1);call write~init~int(37, #t~string91.base, 1 + #t~string91.offset, 1);call write~init~int(105, #t~string91.base, 2 + #t~string91.offset, 1);call write~init~int(0, #t~string91.base, 3 + #t~string91.offset, 1);call #t~string93.base, #t~string93.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string93.base, #t~string93.offset, 1);call write~init~int(37, #t~string93.base, 1 + #t~string93.offset, 1);call write~init~int(105, #t~string93.base, 2 + #t~string93.offset, 1);call write~init~int(0, #t~string93.base, 3 + #t~string93.offset, 1);call #t~string95.base, #t~string95.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string95.base, #t~string95.offset, 1);call write~init~int(37, #t~string95.base, 1 + #t~string95.offset, 1);call write~init~int(105, #t~string95.base, 2 + #t~string95.offset, 1);call write~init~int(0, #t~string95.base, 3 + #t~string95.offset, 1);call #t~string97.base, #t~string97.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string97.base, #t~string97.offset, 1);call write~init~int(70, #t~string97.base, 1 + #t~string97.offset, 1);call write~init~int(95, #t~string97.base, 2 + #t~string97.offset, 1);call write~init~int(112, #t~string97.base, 3 + #t~string97.offset, 1);call write~init~int(58, #t~string97.base, 4 + #t~string97.offset, 1);call write~init~int(0, #t~string97.base, 5 + #t~string97.offset, 1);call #t~string100.base, #t~string100.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string100.base, #t~string100.offset, 1);call write~init~int(37, #t~string100.base, 1 + #t~string100.offset, 1);call write~init~int(105, #t~string100.base, 2 + #t~string100.offset, 1);call write~init~int(0, #t~string100.base, 3 + #t~string100.offset, 1);call #t~string103.base, #t~string103.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string103.base, #t~string103.offset, 1);call write~init~int(37, #t~string103.base, 1 + #t~string103.offset, 1);call write~init~int(105, #t~string103.base, 2 + #t~string103.offset, 1);call write~init~int(0, #t~string103.base, 3 + #t~string103.offset, 1);call #t~string106.base, #t~string106.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string106.base, #t~string106.offset, 1);call write~init~int(37, #t~string106.base, 1 + #t~string106.offset, 1);call write~init~int(105, #t~string106.base, 2 + #t~string106.offset, 1);call write~init~int(0, #t~string106.base, 3 + #t~string106.offset, 1);call #t~string109.base, #t~string109.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string109.base, #t~string109.offset, 1);call write~init~int(37, #t~string109.base, 1 + #t~string109.offset, 1);call write~init~int(105, #t~string109.base, 2 + #t~string109.offset, 1);call write~init~int(0, #t~string109.base, 3 + #t~string109.offset, 1);call #t~string112.base, #t~string112.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string112.base, #t~string112.offset, 1);call write~init~int(37, #t~string112.base, 1 + #t~string112.offset, 1);call write~init~int(105, #t~string112.base, 2 + #t~string112.offset, 1);call write~init~int(0, #t~string112.base, 3 + #t~string112.offset, 1);call #t~string114.base, #t~string114.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string114.base, #t~string114.offset, 1);call write~init~int(0, #t~string114.base, 1 + #t~string114.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string136.base, #t~string136.offset := #Ultimate.allocOnStack(30);call #t~string137.base, #t~string137.offset := #Ultimate.allocOnStack(9);call #t~string138.base, #t~string138.offset := #Ultimate.allocOnStack(21);call #t~string139.base, #t~string139.offset := #Ultimate.allocOnStack(30);call #t~string140.base, #t~string140.offset := #Ultimate.allocOnStack(9);call #t~string141.base, #t~string141.offset := #Ultimate.allocOnStack(21);call #t~string145.base, #t~string145.offset := #Ultimate.allocOnStack(30);call #t~string146.base, #t~string146.offset := #Ultimate.allocOnStack(9);call #t~string147.base, #t~string147.offset := #Ultimate.allocOnStack(25);call #t~string148.base, #t~string148.offset := #Ultimate.allocOnStack(30);call #t~string149.base, #t~string149.offset := #Ultimate.allocOnStack(9);call #t~string150.base, #t~string150.offset := #Ultimate.allocOnStack(25); 3155#L-1true havoc main_#res;havoc main_#t~ret166, main_~retValue_acc~31, main_~tmp~29;havoc main_~retValue_acc~31;havoc main_~tmp~29; 2070#L2753true havoc valid_product_#res;havoc valid_product_~retValue_acc~26;havoc valid_product_~retValue_acc~26;valid_product_~retValue_acc~26 := 1;valid_product_#res := valid_product_~retValue_acc~26; 2952#L2761true main_#t~ret166 := valid_product_#res;main_~tmp~29 := main_#t~ret166;havoc main_#t~ret166; 2826#L3468true assume 0 != main_~tmp~29; 3633#L3443true ~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 3188#L968true havoc bigMacCall_#t~ret159, bigMacCall_~tmp~26;havoc bigMacCall_~tmp~26;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~1;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~1; 3279#L85true assume 0 == getOrigin_~person;getOrigin_~retValue_acc~1 := 4;getOrigin_#res := getOrigin_~retValue_acc~1; 2105#L110true bigMacCall_#t~ret159 := getOrigin_#res;bigMacCall_~tmp~26 := bigMacCall_#t~ret159;havoc bigMacCall_#t~ret159;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~26;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 1619#L643true assume 0 == initPersonOnFloor_~floor; 1736#L644true assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 969#L751-1true callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 518#L435true assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 3560#L447-2true havoc cleanup_#t~ret160, cleanup_#t~ret161, cleanup_~i~3, cleanup_~tmp~27, cleanup_~tmp___0~12, cleanup_~__cil_tmp4~3;havoc cleanup_~i~3;havoc cleanup_~tmp~27;havoc cleanup_~tmp___0~12;havoc cleanup_~__cil_tmp4~3;havoc timeShift_#t~ret58, timeShift_#t~ret59, timeShift_#t~ret60, timeShift_#t~ret61, timeShift_#t~ret62, timeShift_#t~ret63, timeShift_#t~ret64, timeShift_#t~ret65, timeShift_#t~ret66, timeShift_#t~ret67, timeShift_#t~ret68, timeShift_~tmp~16, timeShift_~tmp___0~10, timeShift_~tmp___1~6, timeShift_~tmp___2~3, 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~16;havoc timeShift_~tmp___0~10;havoc timeShift_~tmp___1~6;havoc timeShift_~tmp___2~3;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~ret42, stopRequestedAtCurrentFloor_#t~ret43, stopRequestedAtCurrentFloor_#t~ret44, stopRequestedAtCurrentFloor_#t~ret45, stopRequestedAtCurrentFloor_~retValue_acc~20, stopRequestedAtCurrentFloor_~tmp~14, stopRequestedAtCurrentFloor_~tmp___0~8;havoc stopRequestedAtCurrentFloor_~retValue_acc~20;havoc stopRequestedAtCurrentFloor_~tmp~14;havoc stopRequestedAtCurrentFloor_~tmp___0~8;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret116, isExecutiveFloorCalling_~retValue_acc~23;havoc isExecutiveFloorCalling_~retValue_acc~23;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~3;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~3; 2048#L372true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~3 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~3; 968#L399true isExecutiveFloorCalling_#t~ret116 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~23 := isExecutiveFloorCalling_#t~ret116;havoc isExecutiveFloorCalling_#t~ret116;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~23; 68#L2714true stopRequestedAtCurrentFloor_#t~ret42 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~14 := stopRequestedAtCurrentFloor_#t~ret42;havoc stopRequestedAtCurrentFloor_#t~ret42; 693#L2099true assume 0 != stopRequestedAtCurrentFloor_~tmp~14;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~7;havoc getCurrentFloorID_~retValue_acc~7;getCurrentFloorID_~retValue_acc~7 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~7; 1152#L1362true stopRequestedAtCurrentFloor_#t~ret43 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~8 := stopRequestedAtCurrentFloor_#t~ret43;havoc stopRequestedAtCurrentFloor_#t~ret43; 661#L2103true assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~8);stopRequestedAtCurrentFloor_~retValue_acc~20 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~20; 3148#L2116true timeShift_#t~ret58 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret58;havoc timeShift_#t~ret58; 883#L2251true assume !(0 != timeShift_~tmp___9~2); 1611#L2342true assume !(1 == ~doorState~0); 1602#L2342-2true stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret33, stopRequestedInDirection_#t~ret34, stopRequestedInDirection_#t~ret35, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~16, stopRequestedInDirection_~tmp~10, stopRequestedInDirection_~tmp___0~5, stopRequestedInDirection_~__cil_tmp7~0, stopRequestedInDirection_~__cil_tmp8~1;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~16;havoc stopRequestedInDirection_~tmp~10;havoc stopRequestedInDirection_~tmp___0~5;havoc stopRequestedInDirection_~__cil_tmp7~0;havoc stopRequestedInDirection_~__cil_tmp8~1;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret116, isExecutiveFloorCalling_~retValue_acc~23;havoc isExecutiveFloorCalling_~retValue_acc~23;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~3;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~3; 2056#L372-3true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~3 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~3; 953#L399-3true isExecutiveFloorCalling_#t~ret116 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~23 := isExecutiveFloorCalling_#t~ret116;havoc isExecutiveFloorCalling_#t~ret116;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~23; 39#L2714-1true stopRequestedInDirection_#t~ret33 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~5 := stopRequestedInDirection_#t~ret33;havoc stopRequestedInDirection_#t~ret33; 3357#L1954true assume 0 != stopRequestedInDirection_~tmp___0~5;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~7;havoc getCurrentFloorID_~retValue_acc~7;getCurrentFloorID_~retValue_acc~7 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~7; 1155#L1362-3true stopRequestedInDirection_#t~ret34 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~10 := stopRequestedInDirection_#t~ret34;havoc stopRequestedInDirection_#t~ret34;stopRequestedInDirection_~__cil_tmp7~0 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~1 := (if stopRequestedInDirection_~tmp~10 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~16 := (if stopRequestedInDirection_~__cil_tmp8~1 == stopRequestedInDirection_~__cil_tmp7~0 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~16; 2873#L1967true timeShift_#t~ret65 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret65;havoc timeShift_#t~ret65; 1236#L2350true assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret36, continueInDirection_~dir, continueInDirection_~tmp~11;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~11;~currentHeading~0 := continueInDirection_~dir; 695#L2011true assume !(1 == ~currentHeading~0); 3263#L2021true assume !(0 == ~currentFloorID~0); 3256#L2021-2true assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 3114#L2027-5true havoc __utac_acc__Specification9_spec__3_#t~ret6, __utac_acc__Specification9_spec__3_#t~ret7, __utac_acc__Specification9_spec__3_#t~ret8, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~2, __utac_acc__Specification9_spec__3_~tmp___0~2, __utac_acc__Specification9_spec__3_~tmp___1~2;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~2;havoc __utac_acc__Specification9_spec__3_~tmp___0~2;havoc __utac_acc__Specification9_spec__3_~tmp___1~2;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~7;havoc getCurrentFloorID_~retValue_acc~7;getCurrentFloorID_~retValue_acc~7 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~7; 1142#L1362-5true __utac_acc__Specification9_spec__3_#t~ret6 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~2 := __utac_acc__Specification9_spec__3_#t~ret6;havoc __utac_acc__Specification9_spec__3_#t~ret6;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~2;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~11;havoc isEmpty_~retValue_acc~11; 3460#L1422-6true assume 1 == ~persons_0~0;isEmpty_~retValue_acc~11 := 0;isEmpty_#res := isEmpty_~retValue_acc~11; 908#L1454-6true __utac_acc__Specification9_spec__3_#t~ret7 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~2 := __utac_acc__Specification9_spec__3_#t~ret7;havoc __utac_acc__Specification9_spec__3_#t~ret7; 1018#L1011true assume 0 != __utac_acc__Specification9_spec__3_~tmp___1~2;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 1595#L1021-1true cleanup_~i~3 := 0; 3366#L3275-2true [2019-11-15 22:47:55,789 INFO L793 eck$LassoCheckResult]: Loop: 3366#L3275-2true assume !false; 3344#L3276true cleanup_~__cil_tmp4~3 := ~cleanupTimeShifts~0 - 1; 2057#L3279true assume cleanup_~i~3 < cleanup_~__cil_tmp4~3;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~6;havoc isBlocked_~retValue_acc~6;isBlocked_~retValue_acc~6 := 0;isBlocked_#res := isBlocked_~retValue_acc~6; 1076#L1185true cleanup_#t~ret160 := isBlocked_#res;cleanup_~tmp___0~12 := cleanup_#t~ret160;havoc cleanup_#t~ret160; 1969#L3283true assume 1 != cleanup_~tmp___0~12; 1962#L3283-1true havoc isIdle_#res;havoc isIdle_#t~ret17, isIdle_~retValue_acc~13, isIdle_~tmp~7;havoc isIdle_~retValue_acc~13;havoc isIdle_~tmp~7;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret12, anyStopRequested_#t~ret13, anyStopRequested_#t~ret14, anyStopRequested_#t~ret15, anyStopRequested_#t~ret16, anyStopRequested_~retValue_acc~12, anyStopRequested_~tmp~6, anyStopRequested_~tmp___0~3, anyStopRequested_~tmp___1~3, anyStopRequested_~tmp___2~0, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~12;havoc anyStopRequested_~tmp~6;havoc anyStopRequested_~tmp___0~3;havoc anyStopRequested_~tmp___1~3;havoc anyStopRequested_~tmp___2~0;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~3;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~3; 2094#L372-65true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~3 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~3; 879#L399-65true anyStopRequested_#t~ret12 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret12;havoc anyStopRequested_#t~ret12; 1213#L1470true assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~12 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~12; 2335#L1534true isIdle_#t~ret17 := anyStopRequested_#res;isIdle_~tmp~7 := isIdle_#t~ret17;havoc isIdle_#t~ret17;isIdle_~retValue_acc~13 := (if 0 == isIdle_~tmp~7 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~13; 858#L1547true cleanup_#t~ret161 := isIdle_#res;cleanup_~tmp~27 := cleanup_#t~ret161;havoc cleanup_#t~ret161; 2643#L3295true assume !(0 != cleanup_~tmp~27);havoc timeShift_#t~ret58, timeShift_#t~ret59, timeShift_#t~ret60, timeShift_#t~ret61, timeShift_#t~ret62, timeShift_#t~ret63, timeShift_#t~ret64, timeShift_#t~ret65, timeShift_#t~ret66, timeShift_#t~ret67, timeShift_#t~ret68, timeShift_~tmp~16, timeShift_~tmp___0~10, timeShift_~tmp___1~6, timeShift_~tmp___2~3, 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~16;havoc timeShift_~tmp___0~10;havoc timeShift_~tmp___1~6;havoc timeShift_~tmp___2~3;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~ret42, stopRequestedAtCurrentFloor_#t~ret43, stopRequestedAtCurrentFloor_#t~ret44, stopRequestedAtCurrentFloor_#t~ret45, stopRequestedAtCurrentFloor_~retValue_acc~20, stopRequestedAtCurrentFloor_~tmp~14, stopRequestedAtCurrentFloor_~tmp___0~8;havoc stopRequestedAtCurrentFloor_~retValue_acc~20;havoc stopRequestedAtCurrentFloor_~tmp~14;havoc stopRequestedAtCurrentFloor_~tmp___0~8;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret116, isExecutiveFloorCalling_~retValue_acc~23;havoc isExecutiveFloorCalling_~retValue_acc~23;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~3;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~3; 2085#L372-70true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~3 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~3; 874#L399-70true isExecutiveFloorCalling_#t~ret116 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~23 := isExecutiveFloorCalling_#t~ret116;havoc isExecutiveFloorCalling_#t~ret116;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~23; 42#L2714-3true stopRequestedAtCurrentFloor_#t~ret42 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~14 := stopRequestedAtCurrentFloor_#t~ret42;havoc stopRequestedAtCurrentFloor_#t~ret42; 694#L2099-1true assume 0 != stopRequestedAtCurrentFloor_~tmp~14;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~7;havoc getCurrentFloorID_~retValue_acc~7;getCurrentFloorID_~retValue_acc~7 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~7; 1145#L1362-6true stopRequestedAtCurrentFloor_#t~ret43 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~8 := stopRequestedAtCurrentFloor_#t~ret43;havoc stopRequestedAtCurrentFloor_#t~ret43; 662#L2103-1true assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~8);stopRequestedAtCurrentFloor_~retValue_acc~20 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~20; 3147#L2116-1true timeShift_#t~ret58 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret58;havoc timeShift_#t~ret58; 886#L2251-1true assume !(0 != timeShift_~tmp___9~2); 1601#L2342-3true assume 1 == ~doorState~0;~doorState~0 := 0; 1605#L2342-5true stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret33, stopRequestedInDirection_#t~ret34, stopRequestedInDirection_#t~ret35, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~16, stopRequestedInDirection_~tmp~10, stopRequestedInDirection_~tmp___0~5, stopRequestedInDirection_~__cil_tmp7~0, stopRequestedInDirection_~__cil_tmp8~1;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~16;havoc stopRequestedInDirection_~tmp~10;havoc stopRequestedInDirection_~tmp___0~5;havoc stopRequestedInDirection_~__cil_tmp7~0;havoc stopRequestedInDirection_~__cil_tmp8~1;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret116, isExecutiveFloorCalling_~retValue_acc~23;havoc isExecutiveFloorCalling_~retValue_acc~23;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~3;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~3; 2088#L372-73true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~3 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~3; 877#L399-73true isExecutiveFloorCalling_#t~ret116 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~23 := isExecutiveFloorCalling_#t~ret116;havoc isExecutiveFloorCalling_#t~ret116;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~23; 49#L2714-4true stopRequestedInDirection_#t~ret33 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~5 := stopRequestedInDirection_#t~ret33;havoc stopRequestedInDirection_#t~ret33; 3362#L1954-2true assume 0 != stopRequestedInDirection_~tmp___0~5;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~7;havoc getCurrentFloorID_~retValue_acc~7;getCurrentFloorID_~retValue_acc~7 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~7; 1131#L1362-9true stopRequestedInDirection_#t~ret34 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~10 := stopRequestedInDirection_#t~ret34;havoc stopRequestedInDirection_#t~ret34;stopRequestedInDirection_~__cil_tmp7~0 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~1 := (if stopRequestedInDirection_~tmp~10 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~16 := (if stopRequestedInDirection_~__cil_tmp8~1 == stopRequestedInDirection_~__cil_tmp7~0 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~16; 2858#L1967-2true timeShift_#t~ret65 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret65;havoc timeShift_#t~ret65; 1239#L2350-1true assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret36, continueInDirection_~dir, continueInDirection_~tmp~11;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~11;~currentHeading~0 := continueInDirection_~dir; 691#L2011-3true assume !(1 == ~currentHeading~0); 3251#L2021-9true assume 0 == ~currentFloorID~0;~currentHeading~0 := 1; 3253#L2021-11true assume 1 == ~currentHeading~0;~currentFloorID~0 := 1 + ~currentFloorID~0; 3111#L2027-11true havoc __utac_acc__Specification9_spec__3_#t~ret6, __utac_acc__Specification9_spec__3_#t~ret7, __utac_acc__Specification9_spec__3_#t~ret8, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~2, __utac_acc__Specification9_spec__3_~tmp___0~2, __utac_acc__Specification9_spec__3_~tmp___1~2;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~2;havoc __utac_acc__Specification9_spec__3_~tmp___0~2;havoc __utac_acc__Specification9_spec__3_~tmp___1~2;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~7;havoc getCurrentFloorID_~retValue_acc~7;getCurrentFloorID_~retValue_acc~7 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~7; 1135#L1362-11true __utac_acc__Specification9_spec__3_#t~ret6 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~2 := __utac_acc__Specification9_spec__3_#t~ret6;havoc __utac_acc__Specification9_spec__3_#t~ret6;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~2;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~11;havoc isEmpty_~retValue_acc~11; 3456#L1422-13true assume 1 == ~persons_0~0;isEmpty_~retValue_acc~11 := 0;isEmpty_#res := isEmpty_~retValue_acc~11; 903#L1454-13true __utac_acc__Specification9_spec__3_#t~ret7 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~2 := __utac_acc__Specification9_spec__3_#t~ret7;havoc __utac_acc__Specification9_spec__3_#t~ret7; 1019#L1011-2true assume 0 != __utac_acc__Specification9_spec__3_~tmp___1~2;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 1600#L1021-3true cleanup_~i~3 := 1 + cleanup_~i~3; 3366#L3275-2true [2019-11-15 22:47:55,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:47:55,797 INFO L82 PathProgramCache]: Analyzing trace with hash -2000350140, now seen corresponding path program 1 times [2019-11-15 22:47:55,807 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:47:55,807 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101935601] [2019-11-15 22:47:55,808 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:47:55,808 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:47:55,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:47:56,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:47:56,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:47:56,223 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101935601] [2019-11-15 22:47:56,224 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:47:56,225 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:47:56,225 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335105505] [2019-11-15 22:47:56,230 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:47:56,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:47:56,231 INFO L82 PathProgramCache]: Analyzing trace with hash -415102220, now seen corresponding path program 1 times [2019-11-15 22:47:56,231 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:47:56,232 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145764643] [2019-11-15 22:47:56,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:47:56,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:47:56,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:47:56,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:47:56,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:47:56,350 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145764643] [2019-11-15 22:47:56,351 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:47:56,351 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 22:47:56,352 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583355997] [2019-11-15 22:47:56,354 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 22:47:56,355 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:47:56,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:47:56,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:47:56,376 INFO L87 Difference]: Start difference. First operand 3671 states. Second operand 7 states. [2019-11-15 22:48:08,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:48:08,281 INFO L93 Difference]: Finished difference Result 31176 states and 58291 transitions. [2019-11-15 22:48:08,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-15 22:48:08,283 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31176 states and 58291 transitions. [2019-11-15 22:48:08,619 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13613 [2019-11-15 22:48:08,916 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31176 states to 31036 states and 58133 transitions. [2019-11-15 22:48:08,917 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31036 [2019-11-15 22:48:08,962 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31036 [2019-11-15 22:48:08,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31036 states and 58133 transitions. [2019-11-15 22:48:09,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:48:09,034 INFO L688 BuchiCegarLoop]: Abstraction has 31036 states and 58133 transitions. [2019-11-15 22:48:09,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31036 states and 58133 transitions. [2019-11-15 22:48:09,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31036 to 10466. [2019-11-15 22:48:09,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10466 states. [2019-11-15 22:48:09,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10466 states to 10466 states and 19644 transitions. [2019-11-15 22:48:09,617 INFO L711 BuchiCegarLoop]: Abstraction has 10466 states and 19644 transitions. [2019-11-15 22:48:09,618 INFO L591 BuchiCegarLoop]: Abstraction has 10466 states and 19644 transitions. [2019-11-15 22:48:09,618 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 22:48:09,618 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10466 states and 19644 transitions. [2019-11-15 22:48:09,670 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5290 [2019-11-15 22:48:09,670 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:48:09,670 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:48:09,680 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:48:09,680 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:48:09,681 INFO L791 eck$LassoCheckResult]: Stem: 37727#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~cleanupTimeShifts~0 := 12;~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0;~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~string69.base, #t~string69.offset := #Ultimate.allocOnStack(10);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string71.base, #t~string71.offset, 1);call write~init~int(95, #t~string71.base, 1 + #t~string71.offset, 1);call write~init~int(93, #t~string71.base, 2 + #t~string71.offset, 1);call write~init~int(0, #t~string71.base, 3 + #t~string71.offset, 1);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string73.base, #t~string73.offset, 1);call write~init~int(93, #t~string73.base, 1 + #t~string73.offset, 1);call write~init~int(32, #t~string73.base, 2 + #t~string73.offset, 1);call write~init~int(0, #t~string73.base, 3 + #t~string73.offset, 1);call #t~string75.base, #t~string75.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string75.base, #t~string75.offset, 1);call write~init~int(97, #t~string75.base, 1 + #t~string75.offset, 1);call write~init~int(116, #t~string75.base, 2 + #t~string75.offset, 1);call write~init~int(32, #t~string75.base, 3 + #t~string75.offset, 1);call write~init~int(0, #t~string75.base, 4 + #t~string75.offset, 1);call #t~string77.base, #t~string77.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string77.base, #t~string77.offset, 1);call write~init~int(105, #t~string77.base, 1 + #t~string77.offset, 1);call write~init~int(0, #t~string77.base, 2 + #t~string77.offset, 1);call #t~string79.base, #t~string79.offset := #Ultimate.allocOnStack(10);call #t~string81.base, #t~string81.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string81.base, #t~string81.offset, 1);call write~init~int(112, #t~string81.base, 1 + #t~string81.offset, 1);call write~init~int(0, #t~string81.base, 2 + #t~string81.offset, 1);call #t~string83.base, #t~string83.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string83.base, #t~string83.offset, 1);call write~init~int(111, #t~string83.base, 1 + #t~string83.offset, 1);call write~init~int(119, #t~string83.base, 2 + #t~string83.offset, 1);call write~init~int(110, #t~string83.base, 3 + #t~string83.offset, 1);call write~init~int(0, #t~string83.base, 4 + #t~string83.offset, 1);call #t~string85.base, #t~string85.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string85.base, #t~string85.offset, 1);call write~init~int(73, #t~string85.base, 1 + #t~string85.offset, 1);call write~init~int(76, #t~string85.base, 2 + #t~string85.offset, 1);call write~init~int(95, #t~string85.base, 3 + #t~string85.offset, 1);call write~init~int(112, #t~string85.base, 4 + #t~string85.offset, 1);call write~init~int(58, #t~string85.base, 5 + #t~string85.offset, 1);call write~init~int(0, #t~string85.base, 6 + #t~string85.offset, 1);call #t~string87.base, #t~string87.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string87.base, #t~string87.offset, 1);call write~init~int(37, #t~string87.base, 1 + #t~string87.offset, 1);call write~init~int(105, #t~string87.base, 2 + #t~string87.offset, 1);call write~init~int(0, #t~string87.base, 3 + #t~string87.offset, 1);call #t~string89.base, #t~string89.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string89.base, #t~string89.offset, 1);call write~init~int(37, #t~string89.base, 1 + #t~string89.offset, 1);call write~init~int(105, #t~string89.base, 2 + #t~string89.offset, 1);call write~init~int(0, #t~string89.base, 3 + #t~string89.offset, 1);call #t~string91.base, #t~string91.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string91.base, #t~string91.offset, 1);call write~init~int(37, #t~string91.base, 1 + #t~string91.offset, 1);call write~init~int(105, #t~string91.base, 2 + #t~string91.offset, 1);call write~init~int(0, #t~string91.base, 3 + #t~string91.offset, 1);call #t~string93.base, #t~string93.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string93.base, #t~string93.offset, 1);call write~init~int(37, #t~string93.base, 1 + #t~string93.offset, 1);call write~init~int(105, #t~string93.base, 2 + #t~string93.offset, 1);call write~init~int(0, #t~string93.base, 3 + #t~string93.offset, 1);call #t~string95.base, #t~string95.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string95.base, #t~string95.offset, 1);call write~init~int(37, #t~string95.base, 1 + #t~string95.offset, 1);call write~init~int(105, #t~string95.base, 2 + #t~string95.offset, 1);call write~init~int(0, #t~string95.base, 3 + #t~string95.offset, 1);call #t~string97.base, #t~string97.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string97.base, #t~string97.offset, 1);call write~init~int(70, #t~string97.base, 1 + #t~string97.offset, 1);call write~init~int(95, #t~string97.base, 2 + #t~string97.offset, 1);call write~init~int(112, #t~string97.base, 3 + #t~string97.offset, 1);call write~init~int(58, #t~string97.base, 4 + #t~string97.offset, 1);call write~init~int(0, #t~string97.base, 5 + #t~string97.offset, 1);call #t~string100.base, #t~string100.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string100.base, #t~string100.offset, 1);call write~init~int(37, #t~string100.base, 1 + #t~string100.offset, 1);call write~init~int(105, #t~string100.base, 2 + #t~string100.offset, 1);call write~init~int(0, #t~string100.base, 3 + #t~string100.offset, 1);call #t~string103.base, #t~string103.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string103.base, #t~string103.offset, 1);call write~init~int(37, #t~string103.base, 1 + #t~string103.offset, 1);call write~init~int(105, #t~string103.base, 2 + #t~string103.offset, 1);call write~init~int(0, #t~string103.base, 3 + #t~string103.offset, 1);call #t~string106.base, #t~string106.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string106.base, #t~string106.offset, 1);call write~init~int(37, #t~string106.base, 1 + #t~string106.offset, 1);call write~init~int(105, #t~string106.base, 2 + #t~string106.offset, 1);call write~init~int(0, #t~string106.base, 3 + #t~string106.offset, 1);call #t~string109.base, #t~string109.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string109.base, #t~string109.offset, 1);call write~init~int(37, #t~string109.base, 1 + #t~string109.offset, 1);call write~init~int(105, #t~string109.base, 2 + #t~string109.offset, 1);call write~init~int(0, #t~string109.base, 3 + #t~string109.offset, 1);call #t~string112.base, #t~string112.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string112.base, #t~string112.offset, 1);call write~init~int(37, #t~string112.base, 1 + #t~string112.offset, 1);call write~init~int(105, #t~string112.base, 2 + #t~string112.offset, 1);call write~init~int(0, #t~string112.base, 3 + #t~string112.offset, 1);call #t~string114.base, #t~string114.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string114.base, #t~string114.offset, 1);call write~init~int(0, #t~string114.base, 1 + #t~string114.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string136.base, #t~string136.offset := #Ultimate.allocOnStack(30);call #t~string137.base, #t~string137.offset := #Ultimate.allocOnStack(9);call #t~string138.base, #t~string138.offset := #Ultimate.allocOnStack(21);call #t~string139.base, #t~string139.offset := #Ultimate.allocOnStack(30);call #t~string140.base, #t~string140.offset := #Ultimate.allocOnStack(9);call #t~string141.base, #t~string141.offset := #Ultimate.allocOnStack(21);call #t~string145.base, #t~string145.offset := #Ultimate.allocOnStack(30);call #t~string146.base, #t~string146.offset := #Ultimate.allocOnStack(9);call #t~string147.base, #t~string147.offset := #Ultimate.allocOnStack(25);call #t~string148.base, #t~string148.offset := #Ultimate.allocOnStack(30);call #t~string149.base, #t~string149.offset := #Ultimate.allocOnStack(9);call #t~string150.base, #t~string150.offset := #Ultimate.allocOnStack(25); 37728#L-1 havoc main_#res;havoc main_#t~ret166, main_~retValue_acc~31, main_~tmp~29;havoc main_~retValue_acc~31;havoc main_~tmp~29; 37708#L2753 havoc valid_product_#res;havoc valid_product_~retValue_acc~26;havoc valid_product_~retValue_acc~26;valid_product_~retValue_acc~26 := 1;valid_product_#res := valid_product_~retValue_acc~26; 37709#L2761 main_#t~ret166 := valid_product_#res;main_~tmp~29 := main_#t~ret166;havoc main_#t~ret166; 38332#L3468 assume 0 != main_~tmp~29; 38333#L3443 ~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 38602#L968 havoc bigMacCall_#t~ret159, bigMacCall_~tmp~26;havoc bigMacCall_~tmp~26;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~1;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~1; 38603#L85 assume 0 == getOrigin_~person;getOrigin_~retValue_acc~1 := 4;getOrigin_#res := getOrigin_~retValue_acc~1; 37735#L110 bigMacCall_#t~ret159 := getOrigin_#res;bigMacCall_~tmp~26 := bigMacCall_#t~ret159;havoc bigMacCall_#t~ret159;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~26;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 37064#L643 assume 0 == initPersonOnFloor_~floor; 37065#L644 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 34933#L751-1 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 35734#L435 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 35735#L447-2 havoc cleanup_#t~ret160, cleanup_#t~ret161, cleanup_~i~3, cleanup_~tmp~27, cleanup_~tmp___0~12, cleanup_~__cil_tmp4~3;havoc cleanup_~i~3;havoc cleanup_~tmp~27;havoc cleanup_~tmp___0~12;havoc cleanup_~__cil_tmp4~3;havoc timeShift_#t~ret58, timeShift_#t~ret59, timeShift_#t~ret60, timeShift_#t~ret61, timeShift_#t~ret62, timeShift_#t~ret63, timeShift_#t~ret64, timeShift_#t~ret65, timeShift_#t~ret66, timeShift_#t~ret67, timeShift_#t~ret68, timeShift_~tmp~16, timeShift_~tmp___0~10, timeShift_~tmp___1~6, timeShift_~tmp___2~3, 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~16;havoc timeShift_~tmp___0~10;havoc timeShift_~tmp___1~6;havoc timeShift_~tmp___2~3;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~ret42, stopRequestedAtCurrentFloor_#t~ret43, stopRequestedAtCurrentFloor_#t~ret44, stopRequestedAtCurrentFloor_#t~ret45, stopRequestedAtCurrentFloor_~retValue_acc~20, stopRequestedAtCurrentFloor_~tmp~14, stopRequestedAtCurrentFloor_~tmp___0~8;havoc stopRequestedAtCurrentFloor_~retValue_acc~20;havoc stopRequestedAtCurrentFloor_~tmp~14;havoc stopRequestedAtCurrentFloor_~tmp___0~8;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret116, isExecutiveFloorCalling_~retValue_acc~23;havoc isExecutiveFloorCalling_~retValue_acc~23;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~3;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~3; 37687#L372 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~3 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~3; 36445#L399 isExecutiveFloorCalling_#t~ret116 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~23 := isExecutiveFloorCalling_#t~ret116;havoc isExecutiveFloorCalling_#t~ret116;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~23; 36446#L2714 stopRequestedAtCurrentFloor_#t~ret42 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~14 := stopRequestedAtCurrentFloor_#t~ret42;havoc stopRequestedAtCurrentFloor_#t~ret42; 36015#L2099 assume 0 != stopRequestedAtCurrentFloor_~tmp~14;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~7;havoc getCurrentFloorID_~retValue_acc~7;getCurrentFloorID_~retValue_acc~7 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~7; 36017#L1362 stopRequestedAtCurrentFloor_#t~ret43 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~8 := stopRequestedAtCurrentFloor_#t~ret43;havoc stopRequestedAtCurrentFloor_#t~ret43; 35982#L2103 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~8);stopRequestedAtCurrentFloor_~retValue_acc~20 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~20; 35984#L2116 timeShift_#t~ret58 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret58;havoc timeShift_#t~ret58; 43823#L2251 assume !(0 != timeShift_~tmp___9~2); 43824#L2342 assume !(1 == ~doorState~0); 45005#L2342-2 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret33, stopRequestedInDirection_#t~ret34, stopRequestedInDirection_#t~ret35, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~16, stopRequestedInDirection_~tmp~10, stopRequestedInDirection_~tmp___0~5, stopRequestedInDirection_~__cil_tmp7~0, stopRequestedInDirection_~__cil_tmp8~1;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~16;havoc stopRequestedInDirection_~tmp~10;havoc stopRequestedInDirection_~tmp___0~5;havoc stopRequestedInDirection_~__cil_tmp7~0;havoc stopRequestedInDirection_~__cil_tmp8~1;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret116, isExecutiveFloorCalling_~retValue_acc~23;havoc isExecutiveFloorCalling_~retValue_acc~23;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~3;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~3; 45004#L372-3 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~3 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~3; 45003#L399-3 isExecutiveFloorCalling_#t~ret116 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~23 := isExecutiveFloorCalling_#t~ret116;havoc isExecutiveFloorCalling_#t~ret116;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~23; 45002#L2714-1 stopRequestedInDirection_#t~ret33 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~5 := stopRequestedInDirection_#t~ret33;havoc stopRequestedInDirection_#t~ret33; 45000#L1954 assume 0 != stopRequestedInDirection_~tmp___0~5;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~7;havoc getCurrentFloorID_~retValue_acc~7;getCurrentFloorID_~retValue_acc~7 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~7; 36694#L1362-3 stopRequestedInDirection_#t~ret34 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~10 := stopRequestedInDirection_#t~ret34;havoc stopRequestedInDirection_#t~ret34;stopRequestedInDirection_~__cil_tmp7~0 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~1 := (if stopRequestedInDirection_~tmp~10 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~16 := (if stopRequestedInDirection_~__cil_tmp8~1 == stopRequestedInDirection_~__cil_tmp7~0 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~16; 36695#L1967 timeShift_#t~ret65 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret65;havoc timeShift_#t~ret65; 36776#L2350 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret36, continueInDirection_~dir, continueInDirection_~tmp~11;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~11;~currentHeading~0 := continueInDirection_~dir; 36777#L2011 assume !(1 == ~currentHeading~0); 38621#L2021 assume !(0 == ~currentFloorID~0); 35987#L2021-2 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 38615#L2027-5 havoc __utac_acc__Specification9_spec__3_#t~ret6, __utac_acc__Specification9_spec__3_#t~ret7, __utac_acc__Specification9_spec__3_#t~ret8, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~2, __utac_acc__Specification9_spec__3_~tmp___0~2, __utac_acc__Specification9_spec__3_~tmp___1~2;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~2;havoc __utac_acc__Specification9_spec__3_~tmp___0~2;havoc __utac_acc__Specification9_spec__3_~tmp___1~2;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~7;havoc getCurrentFloorID_~retValue_acc~7;getCurrentFloorID_~retValue_acc~7 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~7; 43044#L1362-5 __utac_acc__Specification9_spec__3_#t~ret6 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~2 := __utac_acc__Specification9_spec__3_#t~ret6;havoc __utac_acc__Specification9_spec__3_#t~ret6;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~2;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~11;havoc isEmpty_~retValue_acc~11; 43042#L1422-6 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~11 := 0;isEmpty_#res := isEmpty_~retValue_acc~11; 43037#L1454-6 __utac_acc__Specification9_spec__3_#t~ret7 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~2 := __utac_acc__Specification9_spec__3_#t~ret7;havoc __utac_acc__Specification9_spec__3_#t~ret7; 43020#L1011 assume 0 != __utac_acc__Specification9_spec__3_~tmp___1~2;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 43014#L1021-1 cleanup_~i~3 := 0; 43013#L3275-2 [2019-11-15 22:48:09,681 INFO L793 eck$LassoCheckResult]: Loop: 43013#L3275-2 assume !false; 43012#L3276 cleanup_~__cil_tmp4~3 := ~cleanupTimeShifts~0 - 1; 43007#L3279 assume cleanup_~i~3 < cleanup_~__cil_tmp4~3;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~6;havoc isBlocked_~retValue_acc~6;isBlocked_~retValue_acc~6 := 0;isBlocked_#res := isBlocked_~retValue_acc~6; 43002#L1185 cleanup_#t~ret160 := isBlocked_#res;cleanup_~tmp___0~12 := cleanup_#t~ret160;havoc cleanup_#t~ret160; 42991#L3283 assume 1 != cleanup_~tmp___0~12; 42988#L3283-1 havoc isIdle_#res;havoc isIdle_#t~ret17, isIdle_~retValue_acc~13, isIdle_~tmp~7;havoc isIdle_~retValue_acc~13;havoc isIdle_~tmp~7;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret12, anyStopRequested_#t~ret13, anyStopRequested_#t~ret14, anyStopRequested_#t~ret15, anyStopRequested_#t~ret16, anyStopRequested_~retValue_acc~12, anyStopRequested_~tmp~6, anyStopRequested_~tmp___0~3, anyStopRequested_~tmp___1~3, anyStopRequested_~tmp___2~0, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~12;havoc anyStopRequested_~tmp~6;havoc anyStopRequested_~tmp___0~3;havoc anyStopRequested_~tmp___1~3;havoc anyStopRequested_~tmp___2~0;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~3;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~3; 37729#L372-65 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~3 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~3; 37730#L399-65 anyStopRequested_#t~ret12 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret12;havoc anyStopRequested_#t~ret12; 36753#L1470 assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~12 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~12; 34955#L1534 isIdle_#t~ret17 := anyStopRequested_#res;isIdle_~tmp~7 := isIdle_#t~ret17;havoc isIdle_#t~ret17;isIdle_~retValue_acc~13 := (if 0 == isIdle_~tmp~7 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~13; 36261#L1547 cleanup_#t~ret161 := isIdle_#res;cleanup_~tmp~27 := cleanup_#t~ret161;havoc cleanup_#t~ret161; 36262#L3295 assume !(0 != cleanup_~tmp~27);havoc timeShift_#t~ret58, timeShift_#t~ret59, timeShift_#t~ret60, timeShift_#t~ret61, timeShift_#t~ret62, timeShift_#t~ret63, timeShift_#t~ret64, timeShift_#t~ret65, timeShift_#t~ret66, timeShift_#t~ret67, timeShift_#t~ret68, timeShift_~tmp~16, timeShift_~tmp___0~10, timeShift_~tmp___1~6, timeShift_~tmp___2~3, 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~16;havoc timeShift_~tmp___0~10;havoc timeShift_~tmp___1~6;havoc timeShift_~tmp___2~3;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~ret42, stopRequestedAtCurrentFloor_#t~ret43, stopRequestedAtCurrentFloor_#t~ret44, stopRequestedAtCurrentFloor_#t~ret45, stopRequestedAtCurrentFloor_~retValue_acc~20, stopRequestedAtCurrentFloor_~tmp~14, stopRequestedAtCurrentFloor_~tmp___0~8;havoc stopRequestedAtCurrentFloor_~retValue_acc~20;havoc stopRequestedAtCurrentFloor_~tmp~14;havoc stopRequestedAtCurrentFloor_~tmp___0~8;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret116, isExecutiveFloorCalling_~retValue_acc~23;havoc isExecutiveFloorCalling_~retValue_acc~23;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~3;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~3; 38219#L372-70 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~3 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~3; 38846#L399-70 isExecutiveFloorCalling_#t~ret116 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~23 := isExecutiveFloorCalling_#t~ret116;havoc isExecutiveFloorCalling_#t~ret116;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~23; 39145#L2714-3 stopRequestedAtCurrentFloor_#t~ret42 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~14 := stopRequestedAtCurrentFloor_#t~ret42;havoc stopRequestedAtCurrentFloor_#t~ret42; 39130#L2099-1 assume 0 != stopRequestedAtCurrentFloor_~tmp~14;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~7;havoc getCurrentFloorID_~retValue_acc~7;getCurrentFloorID_~retValue_acc~7 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~7; 39129#L1362-6 stopRequestedAtCurrentFloor_#t~ret43 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~8 := stopRequestedAtCurrentFloor_#t~ret43;havoc stopRequestedAtCurrentFloor_#t~ret43; 39128#L2103-1 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~8);stopRequestedAtCurrentFloor_~retValue_acc~20 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~20; 35986#L2116-1 timeShift_#t~ret58 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret58;havoc timeShift_#t~ret58; 44521#L2251-1 assume !(0 != timeShift_~tmp___9~2); 44522#L2342-3 assume 1 == ~doorState~0;~doorState~0 := 0; 44848#L2342-5 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret33, stopRequestedInDirection_#t~ret34, stopRequestedInDirection_#t~ret35, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~16, stopRequestedInDirection_~tmp~10, stopRequestedInDirection_~tmp___0~5, stopRequestedInDirection_~__cil_tmp7~0, stopRequestedInDirection_~__cil_tmp8~1;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~16;havoc stopRequestedInDirection_~tmp~10;havoc stopRequestedInDirection_~tmp___0~5;havoc stopRequestedInDirection_~__cil_tmp7~0;havoc stopRequestedInDirection_~__cil_tmp8~1;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret116, isExecutiveFloorCalling_~retValue_acc~23;havoc isExecutiveFloorCalling_~retValue_acc~23;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~3;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~3; 44847#L372-73 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~3 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~3; 44846#L399-73 isExecutiveFloorCalling_#t~ret116 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~23 := isExecutiveFloorCalling_#t~ret116;havoc isExecutiveFloorCalling_#t~ret116;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~23; 44845#L2714-4 stopRequestedInDirection_#t~ret33 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~5 := stopRequestedInDirection_#t~ret33;havoc stopRequestedInDirection_#t~ret33; 44843#L1954-2 assume 0 != stopRequestedInDirection_~tmp___0~5;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~7;havoc getCurrentFloorID_~retValue_acc~7;getCurrentFloorID_~retValue_acc~7 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~7; 36663#L1362-9 stopRequestedInDirection_#t~ret34 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~10 := stopRequestedInDirection_#t~ret34;havoc stopRequestedInDirection_#t~ret34;stopRequestedInDirection_~__cil_tmp7~0 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~1 := (if stopRequestedInDirection_~tmp~10 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~16 := (if stopRequestedInDirection_~__cil_tmp8~1 == stopRequestedInDirection_~__cil_tmp7~0 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~16; 36664#L1967-2 timeShift_#t~ret65 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret65;havoc timeShift_#t~ret65; 36781#L2350-1 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret36, continueInDirection_~dir, continueInDirection_~tmp~11;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~11;~currentHeading~0 := continueInDirection_~dir; 36012#L2011-3 assume !(1 == ~currentHeading~0); 36013#L2021-9 assume !(0 == ~currentFloorID~0); 35980#L2021-11 assume 1 == ~currentHeading~0;~currentFloorID~0 := 1 + ~currentFloorID~0; 38606#L2027-11 havoc __utac_acc__Specification9_spec__3_#t~ret6, __utac_acc__Specification9_spec__3_#t~ret7, __utac_acc__Specification9_spec__3_#t~ret8, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~2, __utac_acc__Specification9_spec__3_~tmp___0~2, __utac_acc__Specification9_spec__3_~tmp___1~2;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~2;havoc __utac_acc__Specification9_spec__3_~tmp___0~2;havoc __utac_acc__Specification9_spec__3_~tmp___1~2;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~7;havoc getCurrentFloorID_~retValue_acc~7;getCurrentFloorID_~retValue_acc~7 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~7; 43052#L1362-11 __utac_acc__Specification9_spec__3_#t~ret6 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~2 := __utac_acc__Specification9_spec__3_#t~ret6;havoc __utac_acc__Specification9_spec__3_#t~ret6;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~2;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~11;havoc isEmpty_~retValue_acc~11; 43048#L1422-13 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~11 := 0;isEmpty_#res := isEmpty_~retValue_acc~11; 43045#L1454-13 __utac_acc__Specification9_spec__3_#t~ret7 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~2 := __utac_acc__Specification9_spec__3_#t~ret7;havoc __utac_acc__Specification9_spec__3_#t~ret7; 43025#L1011-2 assume 0 != __utac_acc__Specification9_spec__3_~tmp___1~2;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 43015#L1021-3 cleanup_~i~3 := 1 + cleanup_~i~3; 43013#L3275-2 [2019-11-15 22:48:09,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:48:09,682 INFO L82 PathProgramCache]: Analyzing trace with hash -2000350140, now seen corresponding path program 2 times [2019-11-15 22:48:09,683 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:48:09,683 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897175395] [2019-11-15 22:48:09,683 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:09,684 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:09,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:48:09,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:48:09,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:48:09,830 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897175395] [2019-11-15 22:48:09,830 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:48:09,830 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:48:09,831 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423015852] [2019-11-15 22:48:09,831 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:48:09,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:48:09,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1224448846, now seen corresponding path program 1 times [2019-11-15 22:48:09,832 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:48:09,832 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558535192] [2019-11-15 22:48:09,832 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:09,832 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:09,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:48:09,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:48:09,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:48:09,881 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558535192] [2019-11-15 22:48:09,881 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:48:09,882 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:48:09,882 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290904840] [2019-11-15 22:48:09,882 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 22:48:09,882 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:48:09,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:48:09,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:48:09,883 INFO L87 Difference]: Start difference. First operand 10466 states and 19644 transitions. cyclomatic complexity: 9180 Second operand 3 states. [2019-11-15 22:48:10,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:48:10,220 INFO L93 Difference]: Finished difference Result 15780 states and 29587 transitions. [2019-11-15 22:48:10,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:48:10,222 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15780 states and 29587 transitions. [2019-11-15 22:48:10,329 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10552 [2019-11-15 22:48:10,724 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15780 states to 15780 states and 29587 transitions. [2019-11-15 22:48:10,725 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15780 [2019-11-15 22:48:10,746 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15780 [2019-11-15 22:48:10,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15780 states and 29587 transitions. [2019-11-15 22:48:10,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:48:10,763 INFO L688 BuchiCegarLoop]: Abstraction has 15780 states and 29587 transitions. [2019-11-15 22:48:10,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15780 states and 29587 transitions. [2019-11-15 22:48:11,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15780 to 15772. [2019-11-15 22:48:11,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15772 states. [2019-11-15 22:48:11,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15772 states to 15772 states and 29575 transitions. [2019-11-15 22:48:11,061 INFO L711 BuchiCegarLoop]: Abstraction has 15772 states and 29575 transitions. [2019-11-15 22:48:11,061 INFO L591 BuchiCegarLoop]: Abstraction has 15772 states and 29575 transitions. [2019-11-15 22:48:11,062 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 22:48:11,062 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15772 states and 29575 transitions. [2019-11-15 22:48:11,138 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10544 [2019-11-15 22:48:11,138 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:48:11,139 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:48:11,148 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:48:11,149 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:48:11,149 INFO L791 eck$LassoCheckResult]: Stem: 63978#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~cleanupTimeShifts~0 := 12;~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0;~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~string69.base, #t~string69.offset := #Ultimate.allocOnStack(10);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string71.base, #t~string71.offset, 1);call write~init~int(95, #t~string71.base, 1 + #t~string71.offset, 1);call write~init~int(93, #t~string71.base, 2 + #t~string71.offset, 1);call write~init~int(0, #t~string71.base, 3 + #t~string71.offset, 1);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string73.base, #t~string73.offset, 1);call write~init~int(93, #t~string73.base, 1 + #t~string73.offset, 1);call write~init~int(32, #t~string73.base, 2 + #t~string73.offset, 1);call write~init~int(0, #t~string73.base, 3 + #t~string73.offset, 1);call #t~string75.base, #t~string75.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string75.base, #t~string75.offset, 1);call write~init~int(97, #t~string75.base, 1 + #t~string75.offset, 1);call write~init~int(116, #t~string75.base, 2 + #t~string75.offset, 1);call write~init~int(32, #t~string75.base, 3 + #t~string75.offset, 1);call write~init~int(0, #t~string75.base, 4 + #t~string75.offset, 1);call #t~string77.base, #t~string77.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string77.base, #t~string77.offset, 1);call write~init~int(105, #t~string77.base, 1 + #t~string77.offset, 1);call write~init~int(0, #t~string77.base, 2 + #t~string77.offset, 1);call #t~string79.base, #t~string79.offset := #Ultimate.allocOnStack(10);call #t~string81.base, #t~string81.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string81.base, #t~string81.offset, 1);call write~init~int(112, #t~string81.base, 1 + #t~string81.offset, 1);call write~init~int(0, #t~string81.base, 2 + #t~string81.offset, 1);call #t~string83.base, #t~string83.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string83.base, #t~string83.offset, 1);call write~init~int(111, #t~string83.base, 1 + #t~string83.offset, 1);call write~init~int(119, #t~string83.base, 2 + #t~string83.offset, 1);call write~init~int(110, #t~string83.base, 3 + #t~string83.offset, 1);call write~init~int(0, #t~string83.base, 4 + #t~string83.offset, 1);call #t~string85.base, #t~string85.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string85.base, #t~string85.offset, 1);call write~init~int(73, #t~string85.base, 1 + #t~string85.offset, 1);call write~init~int(76, #t~string85.base, 2 + #t~string85.offset, 1);call write~init~int(95, #t~string85.base, 3 + #t~string85.offset, 1);call write~init~int(112, #t~string85.base, 4 + #t~string85.offset, 1);call write~init~int(58, #t~string85.base, 5 + #t~string85.offset, 1);call write~init~int(0, #t~string85.base, 6 + #t~string85.offset, 1);call #t~string87.base, #t~string87.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string87.base, #t~string87.offset, 1);call write~init~int(37, #t~string87.base, 1 + #t~string87.offset, 1);call write~init~int(105, #t~string87.base, 2 + #t~string87.offset, 1);call write~init~int(0, #t~string87.base, 3 + #t~string87.offset, 1);call #t~string89.base, #t~string89.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string89.base, #t~string89.offset, 1);call write~init~int(37, #t~string89.base, 1 + #t~string89.offset, 1);call write~init~int(105, #t~string89.base, 2 + #t~string89.offset, 1);call write~init~int(0, #t~string89.base, 3 + #t~string89.offset, 1);call #t~string91.base, #t~string91.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string91.base, #t~string91.offset, 1);call write~init~int(37, #t~string91.base, 1 + #t~string91.offset, 1);call write~init~int(105, #t~string91.base, 2 + #t~string91.offset, 1);call write~init~int(0, #t~string91.base, 3 + #t~string91.offset, 1);call #t~string93.base, #t~string93.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string93.base, #t~string93.offset, 1);call write~init~int(37, #t~string93.base, 1 + #t~string93.offset, 1);call write~init~int(105, #t~string93.base, 2 + #t~string93.offset, 1);call write~init~int(0, #t~string93.base, 3 + #t~string93.offset, 1);call #t~string95.base, #t~string95.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string95.base, #t~string95.offset, 1);call write~init~int(37, #t~string95.base, 1 + #t~string95.offset, 1);call write~init~int(105, #t~string95.base, 2 + #t~string95.offset, 1);call write~init~int(0, #t~string95.base, 3 + #t~string95.offset, 1);call #t~string97.base, #t~string97.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string97.base, #t~string97.offset, 1);call write~init~int(70, #t~string97.base, 1 + #t~string97.offset, 1);call write~init~int(95, #t~string97.base, 2 + #t~string97.offset, 1);call write~init~int(112, #t~string97.base, 3 + #t~string97.offset, 1);call write~init~int(58, #t~string97.base, 4 + #t~string97.offset, 1);call write~init~int(0, #t~string97.base, 5 + #t~string97.offset, 1);call #t~string100.base, #t~string100.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string100.base, #t~string100.offset, 1);call write~init~int(37, #t~string100.base, 1 + #t~string100.offset, 1);call write~init~int(105, #t~string100.base, 2 + #t~string100.offset, 1);call write~init~int(0, #t~string100.base, 3 + #t~string100.offset, 1);call #t~string103.base, #t~string103.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string103.base, #t~string103.offset, 1);call write~init~int(37, #t~string103.base, 1 + #t~string103.offset, 1);call write~init~int(105, #t~string103.base, 2 + #t~string103.offset, 1);call write~init~int(0, #t~string103.base, 3 + #t~string103.offset, 1);call #t~string106.base, #t~string106.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string106.base, #t~string106.offset, 1);call write~init~int(37, #t~string106.base, 1 + #t~string106.offset, 1);call write~init~int(105, #t~string106.base, 2 + #t~string106.offset, 1);call write~init~int(0, #t~string106.base, 3 + #t~string106.offset, 1);call #t~string109.base, #t~string109.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string109.base, #t~string109.offset, 1);call write~init~int(37, #t~string109.base, 1 + #t~string109.offset, 1);call write~init~int(105, #t~string109.base, 2 + #t~string109.offset, 1);call write~init~int(0, #t~string109.base, 3 + #t~string109.offset, 1);call #t~string112.base, #t~string112.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string112.base, #t~string112.offset, 1);call write~init~int(37, #t~string112.base, 1 + #t~string112.offset, 1);call write~init~int(105, #t~string112.base, 2 + #t~string112.offset, 1);call write~init~int(0, #t~string112.base, 3 + #t~string112.offset, 1);call #t~string114.base, #t~string114.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string114.base, #t~string114.offset, 1);call write~init~int(0, #t~string114.base, 1 + #t~string114.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string136.base, #t~string136.offset := #Ultimate.allocOnStack(30);call #t~string137.base, #t~string137.offset := #Ultimate.allocOnStack(9);call #t~string138.base, #t~string138.offset := #Ultimate.allocOnStack(21);call #t~string139.base, #t~string139.offset := #Ultimate.allocOnStack(30);call #t~string140.base, #t~string140.offset := #Ultimate.allocOnStack(9);call #t~string141.base, #t~string141.offset := #Ultimate.allocOnStack(21);call #t~string145.base, #t~string145.offset := #Ultimate.allocOnStack(30);call #t~string146.base, #t~string146.offset := #Ultimate.allocOnStack(9);call #t~string147.base, #t~string147.offset := #Ultimate.allocOnStack(25);call #t~string148.base, #t~string148.offset := #Ultimate.allocOnStack(30);call #t~string149.base, #t~string149.offset := #Ultimate.allocOnStack(9);call #t~string150.base, #t~string150.offset := #Ultimate.allocOnStack(25); 63979#L-1 havoc main_#res;havoc main_#t~ret166, main_~retValue_acc~31, main_~tmp~29;havoc main_~retValue_acc~31;havoc main_~tmp~29; 63960#L2753 havoc valid_product_#res;havoc valid_product_~retValue_acc~26;havoc valid_product_~retValue_acc~26;valid_product_~retValue_acc~26 := 1;valid_product_#res := valid_product_~retValue_acc~26; 63961#L2761 main_#t~ret166 := valid_product_#res;main_~tmp~29 := main_#t~ret166;havoc main_#t~ret166; 64564#L3468 assume 0 != main_~tmp~29; 64565#L3443 ~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 64829#L968 havoc bigMacCall_#t~ret159, bigMacCall_~tmp~26;havoc bigMacCall_~tmp~26;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~1;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~1; 64830#L85 assume 0 == getOrigin_~person;getOrigin_~retValue_acc~1 := 4;getOrigin_#res := getOrigin_~retValue_acc~1; 63986#L110 bigMacCall_#t~ret159 := getOrigin_#res;bigMacCall_~tmp~26 := bigMacCall_#t~ret159;havoc bigMacCall_#t~ret159;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~26;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 63324#L643 assume 0 == initPersonOnFloor_~floor; 63325#L644 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 61186#L751-1 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 61989#L435 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 61990#L447-2 havoc cleanup_#t~ret160, cleanup_#t~ret161, cleanup_~i~3, cleanup_~tmp~27, cleanup_~tmp___0~12, cleanup_~__cil_tmp4~3;havoc cleanup_~i~3;havoc cleanup_~tmp~27;havoc cleanup_~tmp___0~12;havoc cleanup_~__cil_tmp4~3;havoc timeShift_#t~ret58, timeShift_#t~ret59, timeShift_#t~ret60, timeShift_#t~ret61, timeShift_#t~ret62, timeShift_#t~ret63, timeShift_#t~ret64, timeShift_#t~ret65, timeShift_#t~ret66, timeShift_#t~ret67, timeShift_#t~ret68, timeShift_~tmp~16, timeShift_~tmp___0~10, timeShift_~tmp___1~6, timeShift_~tmp___2~3, 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~16;havoc timeShift_~tmp___0~10;havoc timeShift_~tmp___1~6;havoc timeShift_~tmp___2~3;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~ret42, stopRequestedAtCurrentFloor_#t~ret43, stopRequestedAtCurrentFloor_#t~ret44, stopRequestedAtCurrentFloor_#t~ret45, stopRequestedAtCurrentFloor_~retValue_acc~20, stopRequestedAtCurrentFloor_~tmp~14, stopRequestedAtCurrentFloor_~tmp___0~8;havoc stopRequestedAtCurrentFloor_~retValue_acc~20;havoc stopRequestedAtCurrentFloor_~tmp~14;havoc stopRequestedAtCurrentFloor_~tmp___0~8;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret116, isExecutiveFloorCalling_~retValue_acc~23;havoc isExecutiveFloorCalling_~retValue_acc~23;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~3;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~3; 63938#L372 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~3 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~3; 63939#L399 isExecutiveFloorCalling_#t~ret116 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~23 := isExecutiveFloorCalling_#t~ret116;havoc isExecutiveFloorCalling_#t~ret116;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~23; 61312#L2714 stopRequestedAtCurrentFloor_#t~ret42 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~14 := stopRequestedAtCurrentFloor_#t~ret42;havoc stopRequestedAtCurrentFloor_#t~ret42; 61313#L2099 assume 0 != stopRequestedAtCurrentFloor_~tmp~14;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~7;havoc getCurrentFloorID_~retValue_acc~7;getCurrentFloorID_~retValue_acc~7 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~7; 62951#L1362 stopRequestedAtCurrentFloor_#t~ret43 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~8 := stopRequestedAtCurrentFloor_#t~ret43;havoc stopRequestedAtCurrentFloor_#t~ret43; 62952#L2103 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~8);stopRequestedAtCurrentFloor_~retValue_acc~20 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~20; 65181#L2116 timeShift_#t~ret58 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret58;havoc timeShift_#t~ret58; 67191#L2251 assume !(0 != timeShift_~tmp___9~2); 67190#L2342 assume !(1 == ~doorState~0); 67189#L2342-2 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret33, stopRequestedInDirection_#t~ret34, stopRequestedInDirection_#t~ret35, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~16, stopRequestedInDirection_~tmp~10, stopRequestedInDirection_~tmp___0~5, stopRequestedInDirection_~__cil_tmp7~0, stopRequestedInDirection_~__cil_tmp8~1;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~16;havoc stopRequestedInDirection_~tmp~10;havoc stopRequestedInDirection_~tmp___0~5;havoc stopRequestedInDirection_~__cil_tmp7~0;havoc stopRequestedInDirection_~__cil_tmp8~1;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret116, isExecutiveFloorCalling_~retValue_acc~23;havoc isExecutiveFloorCalling_~retValue_acc~23;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~3;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~3; 63947#L372-3 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~3 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~3; 62675#L399-3 isExecutiveFloorCalling_#t~ret116 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~23 := isExecutiveFloorCalling_#t~ret116;havoc isExecutiveFloorCalling_#t~ret116;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~23; 61240#L2714-1 stopRequestedInDirection_#t~ret33 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~5 := stopRequestedInDirection_#t~ret33;havoc stopRequestedInDirection_#t~ret33; 61241#L1954 assume 0 != stopRequestedInDirection_~tmp___0~5;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~7;havoc getCurrentFloorID_~retValue_acc~7;getCurrentFloorID_~retValue_acc~7 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~7; 62955#L1362-3 stopRequestedInDirection_#t~ret34 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~10 := stopRequestedInDirection_#t~ret34;havoc stopRequestedInDirection_#t~ret34;stopRequestedInDirection_~__cil_tmp7~0 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~1 := (if stopRequestedInDirection_~tmp~10 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~16 := (if stopRequestedInDirection_~__cil_tmp8~1 == stopRequestedInDirection_~__cil_tmp7~0 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~16; 62956#L1967 timeShift_#t~ret65 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret65;havoc timeShift_#t~ret65; 63034#L2350 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret36, continueInDirection_~dir, continueInDirection_~tmp~11;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~11;~currentHeading~0 := continueInDirection_~dir; 62281#L2011 assume !(1 == ~currentHeading~0); 62282#L2021 assume !(0 == ~currentFloorID~0); 62252#L2021-2 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 64850#L2027-5 havoc __utac_acc__Specification9_spec__3_#t~ret6, __utac_acc__Specification9_spec__3_#t~ret7, __utac_acc__Specification9_spec__3_#t~ret8, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~2, __utac_acc__Specification9_spec__3_~tmp___0~2, __utac_acc__Specification9_spec__3_~tmp___1~2;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~2;havoc __utac_acc__Specification9_spec__3_~tmp___0~2;havoc __utac_acc__Specification9_spec__3_~tmp___1~2;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~7;havoc getCurrentFloorID_~retValue_acc~7;getCurrentFloorID_~retValue_acc~7 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~7; 73142#L1362-5 __utac_acc__Specification9_spec__3_#t~ret6 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~2 := __utac_acc__Specification9_spec__3_#t~ret6;havoc __utac_acc__Specification9_spec__3_#t~ret6;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~2;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~11;havoc isEmpty_~retValue_acc~11; 73140#L1422-6 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~11 := 0;isEmpty_#res := isEmpty_~retValue_acc~11; 71572#L1454-6 __utac_acc__Specification9_spec__3_#t~ret7 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~2 := __utac_acc__Specification9_spec__3_#t~ret7;havoc __utac_acc__Specification9_spec__3_#t~ret7; 69651#L1011 assume 0 != __utac_acc__Specification9_spec__3_~tmp___1~2;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 69631#L1021-1 cleanup_~i~3 := 0; 69630#L3275-2 [2019-11-15 22:48:11,150 INFO L793 eck$LassoCheckResult]: Loop: 69630#L3275-2 assume !false; 69625#L3276 cleanup_~__cil_tmp4~3 := ~cleanupTimeShifts~0 - 1; 69623#L3279 assume cleanup_~i~3 < cleanup_~__cil_tmp4~3;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~6;havoc isBlocked_~retValue_acc~6;isBlocked_~retValue_acc~6 := 0;isBlocked_#res := isBlocked_~retValue_acc~6; 69622#L1185 cleanup_#t~ret160 := isBlocked_#res;cleanup_~tmp___0~12 := cleanup_#t~ret160;havoc cleanup_#t~ret160; 69621#L3283 assume 1 != cleanup_~tmp___0~12; 69620#L3283-1 havoc isIdle_#res;havoc isIdle_#t~ret17, isIdle_~retValue_acc~13, isIdle_~tmp~7;havoc isIdle_~retValue_acc~13;havoc isIdle_~tmp~7;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret12, anyStopRequested_#t~ret13, anyStopRequested_#t~ret14, anyStopRequested_#t~ret15, anyStopRequested_#t~ret16, anyStopRequested_~retValue_acc~12, anyStopRequested_~tmp~6, anyStopRequested_~tmp___0~3, anyStopRequested_~tmp___1~3, anyStopRequested_~tmp___2~0, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~12;havoc anyStopRequested_~tmp~6;havoc anyStopRequested_~tmp___0~3;havoc anyStopRequested_~tmp___1~3;havoc anyStopRequested_~tmp___2~0;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~3;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~3; 69615#L372-65 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~3 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~3; 69613#L399-65 anyStopRequested_#t~ret12 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret12;havoc anyStopRequested_#t~ret12; 69554#L1470 assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~12 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~12; 69545#L1534 isIdle_#t~ret17 := anyStopRequested_#res;isIdle_~tmp~7 := isIdle_#t~ret17;havoc isIdle_#t~ret17;isIdle_~retValue_acc~13 := (if 0 == isIdle_~tmp~7 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~13; 69544#L1547 cleanup_#t~ret161 := isIdle_#res;cleanup_~tmp~27 := cleanup_#t~ret161;havoc cleanup_#t~ret161; 69543#L3295 assume !(0 != cleanup_~tmp~27);havoc timeShift_#t~ret58, timeShift_#t~ret59, timeShift_#t~ret60, timeShift_#t~ret61, timeShift_#t~ret62, timeShift_#t~ret63, timeShift_#t~ret64, timeShift_#t~ret65, timeShift_#t~ret66, timeShift_#t~ret67, timeShift_#t~ret68, timeShift_~tmp~16, timeShift_~tmp___0~10, timeShift_~tmp___1~6, timeShift_~tmp___2~3, 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~16;havoc timeShift_~tmp___0~10;havoc timeShift_~tmp___1~6;havoc timeShift_~tmp___2~3;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~ret42, stopRequestedAtCurrentFloor_#t~ret43, stopRequestedAtCurrentFloor_#t~ret44, stopRequestedAtCurrentFloor_#t~ret45, stopRequestedAtCurrentFloor_~retValue_acc~20, stopRequestedAtCurrentFloor_~tmp~14, stopRequestedAtCurrentFloor_~tmp___0~8;havoc stopRequestedAtCurrentFloor_~retValue_acc~20;havoc stopRequestedAtCurrentFloor_~tmp~14;havoc stopRequestedAtCurrentFloor_~tmp___0~8;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret116, isExecutiveFloorCalling_~retValue_acc~23;havoc isExecutiveFloorCalling_~retValue_acc~23;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~3;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~3; 68331#L372-70 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~3 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~3; 68330#L399-70 isExecutiveFloorCalling_#t~ret116 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~23 := isExecutiveFloorCalling_#t~ret116;havoc isExecutiveFloorCalling_#t~ret116;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~23; 68329#L2714-3 stopRequestedAtCurrentFloor_#t~ret42 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~14 := stopRequestedAtCurrentFloor_#t~ret42;havoc stopRequestedAtCurrentFloor_#t~ret42; 68323#L2099-1 assume 0 != stopRequestedAtCurrentFloor_~tmp~14;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~7;havoc getCurrentFloorID_~retValue_acc~7;getCurrentFloorID_~retValue_acc~7 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~7; 68324#L1362-6 stopRequestedAtCurrentFloor_#t~ret43 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~8 := stopRequestedAtCurrentFloor_#t~ret43;havoc stopRequestedAtCurrentFloor_#t~ret43; 68690#L2103-1 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~8);stopRequestedAtCurrentFloor_~retValue_acc~20 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~20; 68691#L2116-1 timeShift_#t~ret58 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret58;havoc timeShift_#t~ret58; 69495#L2251-1 assume !(0 != timeShift_~tmp___9~2); 69454#L2342-3 assume 1 == ~doorState~0;~doorState~0 := 0; 69449#L2342-5 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret33, stopRequestedInDirection_#t~ret34, stopRequestedInDirection_#t~ret35, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~16, stopRequestedInDirection_~tmp~10, stopRequestedInDirection_~tmp___0~5, stopRequestedInDirection_~__cil_tmp7~0, stopRequestedInDirection_~__cil_tmp8~1;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~16;havoc stopRequestedInDirection_~tmp~10;havoc stopRequestedInDirection_~tmp___0~5;havoc stopRequestedInDirection_~__cil_tmp7~0;havoc stopRequestedInDirection_~__cil_tmp8~1;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret116, isExecutiveFloorCalling_~retValue_acc~23;havoc isExecutiveFloorCalling_~retValue_acc~23;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~3;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~3; 69447#L372-73 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~3 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~3; 69446#L399-73 isExecutiveFloorCalling_#t~ret116 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~23 := isExecutiveFloorCalling_#t~ret116;havoc isExecutiveFloorCalling_#t~ret116;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~23; 68015#L2714-4 stopRequestedInDirection_#t~ret33 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~5 := stopRequestedInDirection_#t~ret33;havoc stopRequestedInDirection_#t~ret33; 67724#L1954-2 assume 0 != stopRequestedInDirection_~tmp___0~5;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~7;havoc getCurrentFloorID_~retValue_acc~7;getCurrentFloorID_~retValue_acc~7 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~7; 67622#L1362-9 stopRequestedInDirection_#t~ret34 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~10 := stopRequestedInDirection_#t~ret34;havoc stopRequestedInDirection_#t~ret34;stopRequestedInDirection_~__cil_tmp7~0 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~1 := (if stopRequestedInDirection_~tmp~10 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~16 := (if stopRequestedInDirection_~__cil_tmp8~1 == stopRequestedInDirection_~__cil_tmp7~0 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~16; 67619#L1967-2 timeShift_#t~ret65 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret65;havoc timeShift_#t~ret65; 67616#L2350-1 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret36, continueInDirection_~dir, continueInDirection_~tmp~11;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~11;~currentHeading~0 := continueInDirection_~dir; 67613#L2011-3 assume !(1 == ~currentHeading~0); 65159#L2021-9 assume !(0 == ~currentFloorID~0); 67600#L2021-11 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 67597#L2027-11 havoc __utac_acc__Specification9_spec__3_#t~ret6, __utac_acc__Specification9_spec__3_#t~ret7, __utac_acc__Specification9_spec__3_#t~ret8, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~2, __utac_acc__Specification9_spec__3_~tmp___0~2, __utac_acc__Specification9_spec__3_~tmp___1~2;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~2;havoc __utac_acc__Specification9_spec__3_~tmp___0~2;havoc __utac_acc__Specification9_spec__3_~tmp___1~2;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~7;havoc getCurrentFloorID_~retValue_acc~7;getCurrentFloorID_~retValue_acc~7 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~7; 69710#L1362-11 __utac_acc__Specification9_spec__3_#t~ret6 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~2 := __utac_acc__Specification9_spec__3_#t~ret6;havoc __utac_acc__Specification9_spec__3_#t~ret6;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~2;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~11;havoc isEmpty_~retValue_acc~11; 69685#L1422-13 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~11 := 0;isEmpty_#res := isEmpty_~retValue_acc~11; 69682#L1454-13 __utac_acc__Specification9_spec__3_#t~ret7 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~2 := __utac_acc__Specification9_spec__3_#t~ret7;havoc __utac_acc__Specification9_spec__3_#t~ret7; 69634#L1011-2 assume 0 != __utac_acc__Specification9_spec__3_~tmp___1~2;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 69632#L1021-3 cleanup_~i~3 := 1 + cleanup_~i~3; 69630#L3275-2 [2019-11-15 22:48:11,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:48:11,151 INFO L82 PathProgramCache]: Analyzing trace with hash -2000350140, now seen corresponding path program 3 times [2019-11-15 22:48:11,152 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:48:11,152 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975832540] [2019-11-15 22:48:11,152 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:11,152 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:11,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:48:11,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:48:11,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:48:11,245 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975832540] [2019-11-15 22:48:11,246 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:48:11,246 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:48:11,246 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792047180] [2019-11-15 22:48:11,247 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:48:11,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:48:11,247 INFO L82 PathProgramCache]: Analyzing trace with hash 550558516, now seen corresponding path program 1 times [2019-11-15 22:48:11,247 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:48:11,247 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518687525] [2019-11-15 22:48:11,247 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:11,248 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:11,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:48:11,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:48:11,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:48:11,294 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518687525] [2019-11-15 22:48:11,295 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:48:11,295 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:48:11,295 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641638787] [2019-11-15 22:48:11,296 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 22:48:11,296 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:48:11,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:48:11,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:48:11,296 INFO L87 Difference]: Start difference. First operand 15772 states and 29575 transitions. cyclomatic complexity: 13805 Second operand 4 states. [2019-11-15 22:48:11,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:48:11,930 INFO L93 Difference]: Finished difference Result 43972 states and 82548 transitions. [2019-11-15 22:48:11,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:48:11,931 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43972 states and 82548 transitions. [2019-11-15 22:48:12,207 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 36192 [2019-11-15 22:48:12,453 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43972 states to 43972 states and 82548 transitions. [2019-11-15 22:48:12,454 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43972 [2019-11-15 22:48:12,520 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43972 [2019-11-15 22:48:12,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43972 states and 82548 transitions. [2019-11-15 22:48:12,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:48:12,572 INFO L688 BuchiCegarLoop]: Abstraction has 43972 states and 82548 transitions. [2019-11-15 22:48:12,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43972 states and 82548 transitions. [2019-11-15 22:48:12,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43972 to 15794. [2019-11-15 22:48:12,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15794 states. [2019-11-15 22:48:13,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15794 states to 15794 states and 29597 transitions. [2019-11-15 22:48:13,014 INFO L711 BuchiCegarLoop]: Abstraction has 15794 states and 29597 transitions. [2019-11-15 22:48:13,014 INFO L591 BuchiCegarLoop]: Abstraction has 15794 states and 29597 transitions. [2019-11-15 22:48:13,014 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 22:48:13,014 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15794 states and 29597 transitions. [2019-11-15 22:48:13,082 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10556 [2019-11-15 22:48:13,082 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:48:13,082 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:48:13,090 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:48:13,090 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:48:13,091 INFO L791 eck$LassoCheckResult]: Stem: 123901#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~cleanupTimeShifts~0 := 12;~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0;~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~string69.base, #t~string69.offset := #Ultimate.allocOnStack(10);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string71.base, #t~string71.offset, 1);call write~init~int(95, #t~string71.base, 1 + #t~string71.offset, 1);call write~init~int(93, #t~string71.base, 2 + #t~string71.offset, 1);call write~init~int(0, #t~string71.base, 3 + #t~string71.offset, 1);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string73.base, #t~string73.offset, 1);call write~init~int(93, #t~string73.base, 1 + #t~string73.offset, 1);call write~init~int(32, #t~string73.base, 2 + #t~string73.offset, 1);call write~init~int(0, #t~string73.base, 3 + #t~string73.offset, 1);call #t~string75.base, #t~string75.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string75.base, #t~string75.offset, 1);call write~init~int(97, #t~string75.base, 1 + #t~string75.offset, 1);call write~init~int(116, #t~string75.base, 2 + #t~string75.offset, 1);call write~init~int(32, #t~string75.base, 3 + #t~string75.offset, 1);call write~init~int(0, #t~string75.base, 4 + #t~string75.offset, 1);call #t~string77.base, #t~string77.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string77.base, #t~string77.offset, 1);call write~init~int(105, #t~string77.base, 1 + #t~string77.offset, 1);call write~init~int(0, #t~string77.base, 2 + #t~string77.offset, 1);call #t~string79.base, #t~string79.offset := #Ultimate.allocOnStack(10);call #t~string81.base, #t~string81.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string81.base, #t~string81.offset, 1);call write~init~int(112, #t~string81.base, 1 + #t~string81.offset, 1);call write~init~int(0, #t~string81.base, 2 + #t~string81.offset, 1);call #t~string83.base, #t~string83.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string83.base, #t~string83.offset, 1);call write~init~int(111, #t~string83.base, 1 + #t~string83.offset, 1);call write~init~int(119, #t~string83.base, 2 + #t~string83.offset, 1);call write~init~int(110, #t~string83.base, 3 + #t~string83.offset, 1);call write~init~int(0, #t~string83.base, 4 + #t~string83.offset, 1);call #t~string85.base, #t~string85.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string85.base, #t~string85.offset, 1);call write~init~int(73, #t~string85.base, 1 + #t~string85.offset, 1);call write~init~int(76, #t~string85.base, 2 + #t~string85.offset, 1);call write~init~int(95, #t~string85.base, 3 + #t~string85.offset, 1);call write~init~int(112, #t~string85.base, 4 + #t~string85.offset, 1);call write~init~int(58, #t~string85.base, 5 + #t~string85.offset, 1);call write~init~int(0, #t~string85.base, 6 + #t~string85.offset, 1);call #t~string87.base, #t~string87.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string87.base, #t~string87.offset, 1);call write~init~int(37, #t~string87.base, 1 + #t~string87.offset, 1);call write~init~int(105, #t~string87.base, 2 + #t~string87.offset, 1);call write~init~int(0, #t~string87.base, 3 + #t~string87.offset, 1);call #t~string89.base, #t~string89.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string89.base, #t~string89.offset, 1);call write~init~int(37, #t~string89.base, 1 + #t~string89.offset, 1);call write~init~int(105, #t~string89.base, 2 + #t~string89.offset, 1);call write~init~int(0, #t~string89.base, 3 + #t~string89.offset, 1);call #t~string91.base, #t~string91.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string91.base, #t~string91.offset, 1);call write~init~int(37, #t~string91.base, 1 + #t~string91.offset, 1);call write~init~int(105, #t~string91.base, 2 + #t~string91.offset, 1);call write~init~int(0, #t~string91.base, 3 + #t~string91.offset, 1);call #t~string93.base, #t~string93.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string93.base, #t~string93.offset, 1);call write~init~int(37, #t~string93.base, 1 + #t~string93.offset, 1);call write~init~int(105, #t~string93.base, 2 + #t~string93.offset, 1);call write~init~int(0, #t~string93.base, 3 + #t~string93.offset, 1);call #t~string95.base, #t~string95.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string95.base, #t~string95.offset, 1);call write~init~int(37, #t~string95.base, 1 + #t~string95.offset, 1);call write~init~int(105, #t~string95.base, 2 + #t~string95.offset, 1);call write~init~int(0, #t~string95.base, 3 + #t~string95.offset, 1);call #t~string97.base, #t~string97.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string97.base, #t~string97.offset, 1);call write~init~int(70, #t~string97.base, 1 + #t~string97.offset, 1);call write~init~int(95, #t~string97.base, 2 + #t~string97.offset, 1);call write~init~int(112, #t~string97.base, 3 + #t~string97.offset, 1);call write~init~int(58, #t~string97.base, 4 + #t~string97.offset, 1);call write~init~int(0, #t~string97.base, 5 + #t~string97.offset, 1);call #t~string100.base, #t~string100.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string100.base, #t~string100.offset, 1);call write~init~int(37, #t~string100.base, 1 + #t~string100.offset, 1);call write~init~int(105, #t~string100.base, 2 + #t~string100.offset, 1);call write~init~int(0, #t~string100.base, 3 + #t~string100.offset, 1);call #t~string103.base, #t~string103.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string103.base, #t~string103.offset, 1);call write~init~int(37, #t~string103.base, 1 + #t~string103.offset, 1);call write~init~int(105, #t~string103.base, 2 + #t~string103.offset, 1);call write~init~int(0, #t~string103.base, 3 + #t~string103.offset, 1);call #t~string106.base, #t~string106.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string106.base, #t~string106.offset, 1);call write~init~int(37, #t~string106.base, 1 + #t~string106.offset, 1);call write~init~int(105, #t~string106.base, 2 + #t~string106.offset, 1);call write~init~int(0, #t~string106.base, 3 + #t~string106.offset, 1);call #t~string109.base, #t~string109.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string109.base, #t~string109.offset, 1);call write~init~int(37, #t~string109.base, 1 + #t~string109.offset, 1);call write~init~int(105, #t~string109.base, 2 + #t~string109.offset, 1);call write~init~int(0, #t~string109.base, 3 + #t~string109.offset, 1);call #t~string112.base, #t~string112.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string112.base, #t~string112.offset, 1);call write~init~int(37, #t~string112.base, 1 + #t~string112.offset, 1);call write~init~int(105, #t~string112.base, 2 + #t~string112.offset, 1);call write~init~int(0, #t~string112.base, 3 + #t~string112.offset, 1);call #t~string114.base, #t~string114.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string114.base, #t~string114.offset, 1);call write~init~int(0, #t~string114.base, 1 + #t~string114.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string136.base, #t~string136.offset := #Ultimate.allocOnStack(30);call #t~string137.base, #t~string137.offset := #Ultimate.allocOnStack(9);call #t~string138.base, #t~string138.offset := #Ultimate.allocOnStack(21);call #t~string139.base, #t~string139.offset := #Ultimate.allocOnStack(30);call #t~string140.base, #t~string140.offset := #Ultimate.allocOnStack(9);call #t~string141.base, #t~string141.offset := #Ultimate.allocOnStack(21);call #t~string145.base, #t~string145.offset := #Ultimate.allocOnStack(30);call #t~string146.base, #t~string146.offset := #Ultimate.allocOnStack(9);call #t~string147.base, #t~string147.offset := #Ultimate.allocOnStack(25);call #t~string148.base, #t~string148.offset := #Ultimate.allocOnStack(30);call #t~string149.base, #t~string149.offset := #Ultimate.allocOnStack(9);call #t~string150.base, #t~string150.offset := #Ultimate.allocOnStack(25); 123902#L-1 havoc main_#res;havoc main_#t~ret166, main_~retValue_acc~31, main_~tmp~29;havoc main_~retValue_acc~31;havoc main_~tmp~29; 123885#L2753 havoc valid_product_#res;havoc valid_product_~retValue_acc~26;havoc valid_product_~retValue_acc~26;valid_product_~retValue_acc~26 := 1;valid_product_#res := valid_product_~retValue_acc~26; 123886#L2761 main_#t~ret166 := valid_product_#res;main_~tmp~29 := main_#t~ret166;havoc main_#t~ret166; 124545#L3468 assume 0 != main_~tmp~29; 124546#L3443 ~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 124841#L968 havoc bigMacCall_#t~ret159, bigMacCall_~tmp~26;havoc bigMacCall_~tmp~26;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~1;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~1; 124842#L85 assume 0 == getOrigin_~person;getOrigin_~retValue_acc~1 := 4;getOrigin_#res := getOrigin_~retValue_acc~1; 123908#L110 bigMacCall_#t~ret159 := getOrigin_#res;bigMacCall_~tmp~26 := bigMacCall_#t~ret159;havoc bigMacCall_#t~ret159;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~26;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 123196#L643 assume 0 == initPersonOnFloor_~floor; 123197#L644 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 120941#L751-1 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 121785#L435 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 121786#L447-2 havoc cleanup_#t~ret160, cleanup_#t~ret161, cleanup_~i~3, cleanup_~tmp~27, cleanup_~tmp___0~12, cleanup_~__cil_tmp4~3;havoc cleanup_~i~3;havoc cleanup_~tmp~27;havoc cleanup_~tmp___0~12;havoc cleanup_~__cil_tmp4~3;havoc timeShift_#t~ret58, timeShift_#t~ret59, timeShift_#t~ret60, timeShift_#t~ret61, timeShift_#t~ret62, timeShift_#t~ret63, timeShift_#t~ret64, timeShift_#t~ret65, timeShift_#t~ret66, timeShift_#t~ret67, timeShift_#t~ret68, timeShift_~tmp~16, timeShift_~tmp___0~10, timeShift_~tmp___1~6, timeShift_~tmp___2~3, 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~16;havoc timeShift_~tmp___0~10;havoc timeShift_~tmp___1~6;havoc timeShift_~tmp___2~3;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~ret42, stopRequestedAtCurrentFloor_#t~ret43, stopRequestedAtCurrentFloor_#t~ret44, stopRequestedAtCurrentFloor_#t~ret45, stopRequestedAtCurrentFloor_~retValue_acc~20, stopRequestedAtCurrentFloor_~tmp~14, stopRequestedAtCurrentFloor_~tmp___0~8;havoc stopRequestedAtCurrentFloor_~retValue_acc~20;havoc stopRequestedAtCurrentFloor_~tmp~14;havoc stopRequestedAtCurrentFloor_~tmp___0~8;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret116, isExecutiveFloorCalling_~retValue_acc~23;havoc isExecutiveFloorCalling_~retValue_acc~23;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~3;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~3; 123864#L372 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~3 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~3; 123865#L399 isExecutiveFloorCalling_#t~ret116 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~23 := isExecutiveFloorCalling_#t~ret116;havoc isExecutiveFloorCalling_#t~ret116;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~23; 125280#L2714 stopRequestedAtCurrentFloor_#t~ret42 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~14 := stopRequestedAtCurrentFloor_#t~ret42;havoc stopRequestedAtCurrentFloor_#t~ret42; 125278#L2099 assume 0 != stopRequestedAtCurrentFloor_~tmp~14;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~7;havoc getCurrentFloorID_~retValue_acc~7;getCurrentFloorID_~retValue_acc~7 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~7; 122782#L1362 stopRequestedAtCurrentFloor_#t~ret43 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~8 := stopRequestedAtCurrentFloor_#t~ret43;havoc stopRequestedAtCurrentFloor_#t~ret43; 122783#L2103 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~8);stopRequestedAtCurrentFloor_~retValue_acc~20 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~20; 125256#L2116 timeShift_#t~ret58 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret58;havoc timeShift_#t~ret58; 125248#L2251 assume !(0 != timeShift_~tmp___9~2); 125249#L2342 assume !(1 == ~doorState~0); 123183#L2342-2 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret33, stopRequestedInDirection_#t~ret34, stopRequestedInDirection_#t~ret35, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~16, stopRequestedInDirection_~tmp~10, stopRequestedInDirection_~tmp___0~5, stopRequestedInDirection_~__cil_tmp7~0, stopRequestedInDirection_~__cil_tmp8~1;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~16;havoc stopRequestedInDirection_~tmp~10;havoc stopRequestedInDirection_~tmp___0~5;havoc stopRequestedInDirection_~__cil_tmp7~0;havoc stopRequestedInDirection_~__cil_tmp8~1;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret116, isExecutiveFloorCalling_~retValue_acc~23;havoc isExecutiveFloorCalling_~retValue_acc~23;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~3;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~3; 123184#L372-3 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~3 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~3; 125308#L399-3 isExecutiveFloorCalling_#t~ret116 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~23 := isExecutiveFloorCalling_#t~ret116;havoc isExecutiveFloorCalling_#t~ret116;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~23; 125309#L2714-1 stopRequestedInDirection_#t~ret33 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~5 := stopRequestedInDirection_#t~ret33;havoc stopRequestedInDirection_#t~ret33; 125243#L1954 assume 0 != stopRequestedInDirection_~tmp___0~5;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~7;havoc getCurrentFloorID_~retValue_acc~7;getCurrentFloorID_~retValue_acc~7 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~7; 125244#L1362-3 stopRequestedInDirection_#t~ret34 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~10 := stopRequestedInDirection_#t~ret34;havoc stopRequestedInDirection_#t~ret34;stopRequestedInDirection_~__cil_tmp7~0 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~1 := (if stopRequestedInDirection_~tmp~10 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~16 := (if stopRequestedInDirection_~__cil_tmp8~1 == stopRequestedInDirection_~__cil_tmp7~0 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~16; 125333#L1967 timeShift_#t~ret65 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret65;havoc timeShift_#t~ret65; 125331#L2350 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret36, continueInDirection_~dir, continueInDirection_~tmp~11;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~11;~currentHeading~0 := continueInDirection_~dir; 125332#L2011 assume !(1 == ~currentHeading~0); 124878#L2021 assume !(0 == ~currentFloorID~0); 122053#L2021-2 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 124867#L2027-5 havoc __utac_acc__Specification9_spec__3_#t~ret6, __utac_acc__Specification9_spec__3_#t~ret7, __utac_acc__Specification9_spec__3_#t~ret8, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~2, __utac_acc__Specification9_spec__3_~tmp___0~2, __utac_acc__Specification9_spec__3_~tmp___1~2;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~2;havoc __utac_acc__Specification9_spec__3_~tmp___0~2;havoc __utac_acc__Specification9_spec__3_~tmp___1~2;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~7;havoc getCurrentFloorID_~retValue_acc~7;getCurrentFloorID_~retValue_acc~7 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~7; 122769#L1362-5 __utac_acc__Specification9_spec__3_#t~ret6 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~2 := __utac_acc__Specification9_spec__3_#t~ret6;havoc __utac_acc__Specification9_spec__3_#t~ret6;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~2;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~11;havoc isEmpty_~retValue_acc~11; 122770#L1422-6 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~11 := 0;isEmpty_#res := isEmpty_~retValue_acc~11; 123644#L1454-6 __utac_acc__Specification9_spec__3_#t~ret7 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~2 := __utac_acc__Specification9_spec__3_#t~ret7;havoc __utac_acc__Specification9_spec__3_#t~ret7; 122603#L1011 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~2);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~8;havoc areDoorsOpen_~retValue_acc~8;areDoorsOpen_~retValue_acc~8 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~8; 122604#L1371 __utac_acc__Specification9_spec__3_#t~ret8 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~2 := __utac_acc__Specification9_spec__3_#t~ret8;havoc __utac_acc__Specification9_spec__3_#t~ret8; 123176#L1021 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___0~2); 120920#L1021-1 cleanup_~i~3 := 0; 127537#L3275-2 [2019-11-15 22:48:13,092 INFO L793 eck$LassoCheckResult]: Loop: 127537#L3275-2 assume !false; 127533#L3276 cleanup_~__cil_tmp4~3 := ~cleanupTimeShifts~0 - 1; 127530#L3279 assume cleanup_~i~3 < cleanup_~__cil_tmp4~3;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~6;havoc isBlocked_~retValue_acc~6;isBlocked_~retValue_acc~6 := 0;isBlocked_#res := isBlocked_~retValue_acc~6; 127526#L1185 cleanup_#t~ret160 := isBlocked_#res;cleanup_~tmp___0~12 := cleanup_#t~ret160;havoc cleanup_#t~ret160; 127524#L3283 assume 1 != cleanup_~tmp___0~12; 127523#L3283-1 havoc isIdle_#res;havoc isIdle_#t~ret17, isIdle_~retValue_acc~13, isIdle_~tmp~7;havoc isIdle_~retValue_acc~13;havoc isIdle_~tmp~7;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret12, anyStopRequested_#t~ret13, anyStopRequested_#t~ret14, anyStopRequested_#t~ret15, anyStopRequested_#t~ret16, anyStopRequested_~retValue_acc~12, anyStopRequested_~tmp~6, anyStopRequested_~tmp___0~3, anyStopRequested_~tmp___1~3, anyStopRequested_~tmp___2~0, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~12;havoc anyStopRequested_~tmp~6;havoc anyStopRequested_~tmp___0~3;havoc anyStopRequested_~tmp___1~3;havoc anyStopRequested_~tmp___2~0;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~3;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~3; 127522#L372-65 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~3 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~3; 127512#L399-65 anyStopRequested_#t~ret12 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret12;havoc anyStopRequested_#t~ret12; 127504#L1470 assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~12 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~12; 127495#L1534 isIdle_#t~ret17 := anyStopRequested_#res;isIdle_~tmp~7 := isIdle_#t~ret17;havoc isIdle_#t~ret17;isIdle_~retValue_acc~13 := (if 0 == isIdle_~tmp~7 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~13; 127484#L1547 cleanup_#t~ret161 := isIdle_#res;cleanup_~tmp~27 := cleanup_#t~ret161;havoc cleanup_#t~ret161; 127478#L3295 assume !(0 != cleanup_~tmp~27);havoc timeShift_#t~ret58, timeShift_#t~ret59, timeShift_#t~ret60, timeShift_#t~ret61, timeShift_#t~ret62, timeShift_#t~ret63, timeShift_#t~ret64, timeShift_#t~ret65, timeShift_#t~ret66, timeShift_#t~ret67, timeShift_#t~ret68, timeShift_~tmp~16, timeShift_~tmp___0~10, timeShift_~tmp___1~6, timeShift_~tmp___2~3, 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~16;havoc timeShift_~tmp___0~10;havoc timeShift_~tmp___1~6;havoc timeShift_~tmp___2~3;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~ret42, stopRequestedAtCurrentFloor_#t~ret43, stopRequestedAtCurrentFloor_#t~ret44, stopRequestedAtCurrentFloor_#t~ret45, stopRequestedAtCurrentFloor_~retValue_acc~20, stopRequestedAtCurrentFloor_~tmp~14, stopRequestedAtCurrentFloor_~tmp___0~8;havoc stopRequestedAtCurrentFloor_~retValue_acc~20;havoc stopRequestedAtCurrentFloor_~tmp~14;havoc stopRequestedAtCurrentFloor_~tmp___0~8;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret116, isExecutiveFloorCalling_~retValue_acc~23;havoc isExecutiveFloorCalling_~retValue_acc~23;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~3;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~3; 127479#L372-70 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~3 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~3; 127415#L399-70 isExecutiveFloorCalling_#t~ret116 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~23 := isExecutiveFloorCalling_#t~ret116;havoc isExecutiveFloorCalling_#t~ret116;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~23; 127470#L2714-3 stopRequestedAtCurrentFloor_#t~ret42 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~14 := stopRequestedAtCurrentFloor_#t~ret42;havoc stopRequestedAtCurrentFloor_#t~ret42; 127457#L2099-1 assume 0 != stopRequestedAtCurrentFloor_~tmp~14;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~7;havoc getCurrentFloorID_~retValue_acc~7;getCurrentFloorID_~retValue_acc~7 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~7; 127453#L1362-6 stopRequestedAtCurrentFloor_#t~ret43 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~8 := stopRequestedAtCurrentFloor_#t~ret43;havoc stopRequestedAtCurrentFloor_#t~ret43; 127448#L2103-1 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~8);stopRequestedAtCurrentFloor_~retValue_acc~20 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~20; 122051#L2116-1 timeShift_#t~ret58 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret58;havoc timeShift_#t~ret58; 134225#L2251-1 assume !(0 != timeShift_~tmp___9~2); 123181#L2342-3 assume 1 == ~doorState~0;~doorState~0 := 0; 123182#L2342-5 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret33, stopRequestedInDirection_#t~ret34, stopRequestedInDirection_#t~ret35, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~16, stopRequestedInDirection_~tmp~10, stopRequestedInDirection_~tmp___0~5, stopRequestedInDirection_~__cil_tmp7~0, stopRequestedInDirection_~__cil_tmp8~1;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~16;havoc stopRequestedInDirection_~tmp~10;havoc stopRequestedInDirection_~tmp___0~5;havoc stopRequestedInDirection_~__cil_tmp7~0;havoc stopRequestedInDirection_~__cil_tmp8~1;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret116, isExecutiveFloorCalling_~retValue_acc~23;havoc isExecutiveFloorCalling_~retValue_acc~23;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~3;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~3; 123187#L372-73 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~3 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~3; 122370#L399-73 isExecutiveFloorCalling_#t~ret116 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~23 := isExecutiveFloorCalling_#t~ret116;havoc isExecutiveFloorCalling_#t~ret116;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~23; 121019#L2714-4 stopRequestedInDirection_#t~ret33 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~5 := stopRequestedInDirection_#t~ret33;havoc stopRequestedInDirection_#t~ret33; 121020#L1954-2 assume 0 != stopRequestedInDirection_~tmp___0~5;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~7;havoc getCurrentFloorID_~retValue_acc~7;getCurrentFloorID_~retValue_acc~7 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~7; 122752#L1362-9 stopRequestedInDirection_#t~ret34 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~10 := stopRequestedInDirection_#t~ret34;havoc stopRequestedInDirection_#t~ret34;stopRequestedInDirection_~__cil_tmp7~0 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~1 := (if stopRequestedInDirection_~tmp~10 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~16 := (if stopRequestedInDirection_~__cil_tmp8~1 == stopRequestedInDirection_~__cil_tmp7~0 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~16; 122753#L1967-2 timeShift_#t~ret65 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret65;havoc timeShift_#t~ret65; 122876#L2350-1 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret36, continueInDirection_~dir, continueInDirection_~tmp~11;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~11;~currentHeading~0 := continueInDirection_~dir; 122080#L2011-3 assume !(1 == ~currentHeading~0); 122081#L2021-9 assume !(0 == ~currentFloorID~0); 122042#L2021-11 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 124784#L2027-11 havoc __utac_acc__Specification9_spec__3_#t~ret6, __utac_acc__Specification9_spec__3_#t~ret7, __utac_acc__Specification9_spec__3_#t~ret8, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~2, __utac_acc__Specification9_spec__3_~tmp___0~2, __utac_acc__Specification9_spec__3_~tmp___1~2;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~2;havoc __utac_acc__Specification9_spec__3_~tmp___0~2;havoc __utac_acc__Specification9_spec__3_~tmp___1~2;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~7;havoc getCurrentFloorID_~retValue_acc~7;getCurrentFloorID_~retValue_acc~7 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~7; 124785#L1362-11 __utac_acc__Specification9_spec__3_#t~ret6 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~2 := __utac_acc__Specification9_spec__3_#t~ret6;havoc __utac_acc__Specification9_spec__3_#t~ret6;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~2;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~11;havoc isEmpty_~retValue_acc~11; 127571#L1422-13 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~11 := 0;isEmpty_#res := isEmpty_~retValue_acc~11; 127558#L1454-13 __utac_acc__Specification9_spec__3_#t~ret7 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~2 := __utac_acc__Specification9_spec__3_#t~ret7;havoc __utac_acc__Specification9_spec__3_#t~ret7; 128376#L1011-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~2);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~8;havoc areDoorsOpen_~retValue_acc~8;areDoorsOpen_~retValue_acc~8 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~8; 127547#L1371-1 __utac_acc__Specification9_spec__3_#t~ret8 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~2 := __utac_acc__Specification9_spec__3_#t~ret8;havoc __utac_acc__Specification9_spec__3_#t~ret8; 127550#L1021-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___0~2); 127544#L1021-3 cleanup_~i~3 := 1 + cleanup_~i~3; 127537#L3275-2 [2019-11-15 22:48:13,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:48:13,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1809138305, now seen corresponding path program 1 times [2019-11-15 22:48:13,093 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:48:13,093 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476136678] [2019-11-15 22:48:13,093 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:13,094 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:13,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:48:13,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:48:13,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:48:13,182 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476136678] [2019-11-15 22:48:13,182 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:48:13,182 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:48:13,183 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736404560] [2019-11-15 22:48:13,183 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:48:13,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:48:13,183 INFO L82 PathProgramCache]: Analyzing trace with hash 806310577, now seen corresponding path program 1 times [2019-11-15 22:48:13,184 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:48:13,184 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75915641] [2019-11-15 22:48:13,184 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:13,184 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:13,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:48:13,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:48:13,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:48:13,305 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:48:14,316 WARN L191 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 179 DAG size of output: 165 [2019-11-15 22:48:16,019 WARN L191 SmtUtils]: Spent 1.63 s on a formula simplification. DAG size of input: 157 DAG size of output: 129 [2019-11-15 22:48:16,038 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:48:16,039 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:48:16,039 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:48:16,040 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:48:16,040 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 22:48:16,040 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:48:16,041 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:48:16,045 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:48:16,046 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec9_product31.cil.c_Iteration4_Loop [2019-11-15 22:48:16,046 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:48:16,046 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:48:16,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:16,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-11-15 22:48:16,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-11-15 22:48:16,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:16,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:16,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:16,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:16,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:16,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:16,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:16,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:16,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:16,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:16,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:16,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:16,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:16,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:16,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:16,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:16,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:16,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:16,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:16,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:16,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:16,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:16,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:16,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:16,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:16,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:16,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:16,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:16,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:16,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:16,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:16,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:16,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:16,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:16,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:16,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:16,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:16,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:16,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:16,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:16,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:16,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:16,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:16,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:16,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:16,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:16,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:16,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:16,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:16,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:16,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:16,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:16,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:16,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:16,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:16,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:16,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:16,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:16,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:16,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:16,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:16,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:17,007 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2019-11-15 22:48:17,664 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:48:17,665 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0ec4fb2a-0484-45a7-afb1-498f8ffd02f9/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:48:17,682 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:48:17,683 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 22:48:17,693 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 22:48:17,693 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isIdle_~retValue_acc~13=0} Honda state: {ULTIMATE.start_isIdle_~retValue_acc~13=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0ec4fb2a-0484-45a7-afb1-498f8ffd02f9/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:48:17,715 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:48:17,715 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 22:48:17,720 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 22:48:17,720 INFO L440 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 /tmp/vcloud-vcloud-master/worker/run_dir_0ec4fb2a-0484-45a7-afb1-498f8ffd02f9/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 22:48:17,734 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:48:17,734 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:48:17,741 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 22:48:17,741 INFO L440 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 /tmp/vcloud-vcloud-master/worker/run_dir_0ec4fb2a-0484-45a7-afb1-498f8ffd02f9/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:48:17,770 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:48:17,770 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 22:48:17,794 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 22:48:17,794 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_continueInDirection_#t~ret36=0} Honda state: {ULTIMATE.start_continueInDirection_#t~ret36=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0ec4fb2a-0484-45a7-afb1-498f8ffd02f9/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 22:48:17,823 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:48:17,823 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:48:17,828 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 22:48:17,828 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isIdle_#t~ret17=0} Honda state: {ULTIMATE.start_isIdle_#t~ret17=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0ec4fb2a-0484-45a7-afb1-498f8ffd02f9/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 22:48:17,854 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:48:17,854 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 22:48:17,866 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 22:48:17,866 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_~tmp~16=0} Honda state: {ULTIMATE.start_timeShift_~tmp~16=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0ec4fb2a-0484-45a7-afb1-498f8ffd02f9/bin/uautomizer/z3 Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 22:48:17,931 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:48:17,931 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:48:17,938 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 22:48:17,939 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isExecutiveFloorCalling_#t~ret116=0} Honda state: {ULTIMATE.start_isExecutiveFloorCalling_#t~ret116=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0ec4fb2a-0484-45a7-afb1-498f8ffd02f9/bin/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 22:48:17,958 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:48:17,958 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:48:17,971 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 22:48:17,971 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_#res=1, ULTIMATE.start_anyStopRequested_~retValue_acc~12=1, ULTIMATE.start_isIdle_~tmp~7=1} Honda state: {ULTIMATE.start_anyStopRequested_#res=1, ULTIMATE.start_anyStopRequested_~retValue_acc~12=1, ULTIMATE.start_isIdle_~tmp~7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0ec4fb2a-0484-45a7-afb1-498f8ffd02f9/bin/uautomizer/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-11-15 22:48:17,986 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:48:17,986 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 22:48:17,990 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 22:48:17,990 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_#t~ret59=0} Honda state: {ULTIMATE.start_timeShift_#t~ret59=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0ec4fb2a-0484-45a7-afb1-498f8ffd02f9/bin/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:48:18,002 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:48:18,002 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 22:48:18,007 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 22:48:18,007 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification9_spec__3_~tmp___1~2=0} Honda state: {ULTIMATE.start___utac_acc__Specification9_spec__3_~tmp___1~2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0ec4fb2a-0484-45a7-afb1-498f8ffd02f9/bin/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:48:18,027 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:48:18,027 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 22:48:18,034 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 22:48:18,034 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_~tmp___1~6=0} Honda state: {ULTIMATE.start_timeShift_~tmp___1~6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0ec4fb2a-0484-45a7-afb1-498f8ffd02f9/bin/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 22:48:18,058 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:48:18,059 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:48:18,064 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 22:48:18,064 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_~tmp___2~0=0} Honda state: {ULTIMATE.start_anyStopRequested_~tmp___2~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0ec4fb2a-0484-45a7-afb1-498f8ffd02f9/bin/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:48:18,072 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:48:18,072 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0ec4fb2a-0484-45a7-afb1-498f8ffd02f9/bin/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:48:18,083 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 22:48:18,083 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 22:48:18,089 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 22:48:18,090 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:48:18,090 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:48:18,090 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:48:18,091 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:48:18,091 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:48:18,091 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:48:18,091 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:48:18,091 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:48:18,091 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec9_product31.cil.c_Iteration4_Loop [2019-11-15 22:48:18,091 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:48:18,091 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:48:18,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:18,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:18,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:18,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:18,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:18,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-11-15 22:48:18,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-11-15 22:48:18,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:18,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:18,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:18,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:18,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:18,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:18,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:18,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-11-15 22:48:18,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:18,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-11-15 22:48:18,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:18,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:18,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:18,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:18,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:18,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:18,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:18,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:18,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:18,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:18,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:18,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-11-15 22:48:18,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:18,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:18,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:18,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:18,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:18,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:18,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:18,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-11-15 22:48:18,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:18,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:18,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:18,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:18,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:18,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:18,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:18,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:18,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:18,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:18,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:18,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:18,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:18,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:18,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-11-15 22:48:18,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:18,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:18,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:18,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:18,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:18,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:18,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:18,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:18,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:18,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:18,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:18,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:18,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:18,925 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2019-11-15 22:48:19,304 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-11-15 22:48:19,737 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:48:19,744 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:48:19,746 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:48:19,748 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:48:19,748 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:48:19,749 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:48:19,749 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:48:19,749 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:48:19,751 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:48:19,752 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:48:19,754 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:48:19,754 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:48:19,755 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:48:19,755 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:48:19,755 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:48:19,755 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:48:19,755 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:48:19,755 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:48:19,756 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:48:19,756 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:48:19,757 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:48:19,757 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:48:19,757 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:48:19,758 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:48:19,758 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:48:19,758 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:48:19,759 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:48:19,759 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:48:19,760 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:48:19,760 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:48:19,761 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:48:19,762 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:48:19,762 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:48:19,762 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 22:48:19,762 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:48:19,766 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 22:48:19,766 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:48:19,777 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:48:19,778 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:48:19,779 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:48:19,779 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:48:19,779 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:48:19,779 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:48:19,779 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:48:19,780 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:48:19,780 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:48:19,781 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:48:19,782 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:48:19,782 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:48:19,783 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:48:19,783 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:48:19,783 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:48:19,783 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:48:19,784 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:48:19,784 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:48:19,787 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:48:19,788 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:48:19,789 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:48:19,789 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:48:19,789 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:48:19,789 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:48:19,790 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:48:19,790 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:48:19,790 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:48:19,791 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:48:19,792 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:48:19,792 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:48:19,793 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:48:19,793 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:48:19,794 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:48:19,794 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:48:19,795 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:48:19,795 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:48:19,796 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:48:19,797 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:48:19,798 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:48:19,799 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:48:19,800 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:48:19,800 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:48:19,800 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:48:19,801 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:48:19,801 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:48:19,802 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:48:19,803 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:48:19,804 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:48:19,804 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:48:19,805 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:48:19,805 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:48:19,805 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:48:19,805 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:48:19,806 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:48:19,806 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:48:19,808 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:48:19,808 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:48:19,809 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:48:19,809 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:48:19,809 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:48:19,809 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:48:19,811 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:48:19,811 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:48:19,815 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:48:19,816 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:48:19,817 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:48:19,817 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:48:19,818 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:48:19,818 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:48:19,819 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:48:19,819 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:48:19,819 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:48:19,820 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:48:19,821 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:48:19,822 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:48:19,822 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:48:19,822 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:48:19,823 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:48:19,823 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:48:19,823 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:48:19,824 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:48:19,824 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:48:19,825 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:48:19,826 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:48:19,826 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:48:19,827 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:48:19,827 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:48:19,827 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:48:19,827 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:48:19,828 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:48:19,829 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:48:19,829 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:48:19,830 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:48:19,830 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:48:19,830 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:48:19,830 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:48:19,830 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:48:19,831 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:48:19,831 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:48:19,832 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:48:19,832 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:48:19,833 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:48:19,833 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:48:19,834 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:48:19,834 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:48:19,834 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:48:19,837 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:48:19,837 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:48:19,846 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:48:19,862 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 22:48:19,862 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 22:48:19,864 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:48:19,867 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 22:48:19,867 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:48:19,868 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~doorState~0) = 1*~doorState~0 Supporting invariants [] [2019-11-15 22:48:19,870 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 22:48:19,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:48:20,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:48:20,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 654 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:48:20,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:48:20,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:48:20,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:48:20,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:48:20,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:48:20,229 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 22:48:20,230 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15794 states and 29597 transitions. cyclomatic complexity: 13805 Second operand 4 states. [2019-11-15 22:48:20,726 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15794 states and 29597 transitions. cyclomatic complexity: 13805. Second operand 4 states. Result 26091 states and 48597 transitions. Complement of second has 5 states. [2019-11-15 22:48:20,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 22:48:20,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 22:48:20,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5219 transitions. [2019-11-15 22:48:20,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5219 transitions. Stem has 42 letters. Loop has 40 letters. [2019-11-15 22:48:20,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:48:20,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5219 transitions. Stem has 82 letters. Loop has 40 letters. [2019-11-15 22:48:20,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:48:20,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5219 transitions. Stem has 42 letters. Loop has 80 letters. [2019-11-15 22:48:20,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:48:20,745 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26091 states and 48597 transitions. [2019-11-15 22:48:21,196 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 15620 [2019-11-15 22:48:21,309 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26091 states to 26091 states and 48597 transitions. [2019-11-15 22:48:21,309 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20936 [2019-11-15 22:48:21,337 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20947 [2019-11-15 22:48:21,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26091 states and 48597 transitions. [2019-11-15 22:48:21,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:48:21,339 INFO L688 BuchiCegarLoop]: Abstraction has 26091 states and 48597 transitions. [2019-11-15 22:48:21,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26091 states and 48597 transitions. [2019-11-15 22:48:21,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26091 to 26081. [2019-11-15 22:48:21,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26081 states. [2019-11-15 22:48:21,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26081 states to 26081 states and 48585 transitions. [2019-11-15 22:48:21,754 INFO L711 BuchiCegarLoop]: Abstraction has 26081 states and 48585 transitions. [2019-11-15 22:48:21,754 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:48:21,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:48:21,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:48:21,755 INFO L87 Difference]: Start difference. First operand 26081 states and 48585 transitions. Second operand 3 states. [2019-11-15 22:48:22,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:48:22,025 INFO L93 Difference]: Finished difference Result 26081 states and 48579 transitions. [2019-11-15 22:48:22,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:48:22,025 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26081 states and 48579 transitions. [2019-11-15 22:48:22,174 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 15620 [2019-11-15 22:48:22,310 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26081 states to 26081 states and 48579 transitions. [2019-11-15 22:48:22,310 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20937 [2019-11-15 22:48:22,338 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20937 [2019-11-15 22:48:22,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26081 states and 48579 transitions. [2019-11-15 22:48:22,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:48:22,365 INFO L688 BuchiCegarLoop]: Abstraction has 26081 states and 48579 transitions. [2019-11-15 22:48:22,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26081 states and 48579 transitions. [2019-11-15 22:48:22,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26081 to 26081. [2019-11-15 22:48:22,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26081 states. [2019-11-15 22:48:22,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26081 states to 26081 states and 48579 transitions. [2019-11-15 22:48:22,741 INFO L711 BuchiCegarLoop]: Abstraction has 26081 states and 48579 transitions. [2019-11-15 22:48:22,742 INFO L591 BuchiCegarLoop]: Abstraction has 26081 states and 48579 transitions. [2019-11-15 22:48:22,742 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 22:48:22,742 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26081 states and 48579 transitions. [2019-11-15 22:48:22,846 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 15620 [2019-11-15 22:48:22,847 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:48:22,847 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:48:22,853 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:48:22,853 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:48:22,855 INFO L791 eck$LassoCheckResult]: Stem: 218814#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~cleanupTimeShifts~0 := 12;~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0;~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~string69.base, #t~string69.offset := #Ultimate.allocOnStack(10);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string71.base, #t~string71.offset, 1);call write~init~int(95, #t~string71.base, 1 + #t~string71.offset, 1);call write~init~int(93, #t~string71.base, 2 + #t~string71.offset, 1);call write~init~int(0, #t~string71.base, 3 + #t~string71.offset, 1);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string73.base, #t~string73.offset, 1);call write~init~int(93, #t~string73.base, 1 + #t~string73.offset, 1);call write~init~int(32, #t~string73.base, 2 + #t~string73.offset, 1);call write~init~int(0, #t~string73.base, 3 + #t~string73.offset, 1);call #t~string75.base, #t~string75.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string75.base, #t~string75.offset, 1);call write~init~int(97, #t~string75.base, 1 + #t~string75.offset, 1);call write~init~int(116, #t~string75.base, 2 + #t~string75.offset, 1);call write~init~int(32, #t~string75.base, 3 + #t~string75.offset, 1);call write~init~int(0, #t~string75.base, 4 + #t~string75.offset, 1);call #t~string77.base, #t~string77.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string77.base, #t~string77.offset, 1);call write~init~int(105, #t~string77.base, 1 + #t~string77.offset, 1);call write~init~int(0, #t~string77.base, 2 + #t~string77.offset, 1);call #t~string79.base, #t~string79.offset := #Ultimate.allocOnStack(10);call #t~string81.base, #t~string81.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string81.base, #t~string81.offset, 1);call write~init~int(112, #t~string81.base, 1 + #t~string81.offset, 1);call write~init~int(0, #t~string81.base, 2 + #t~string81.offset, 1);call #t~string83.base, #t~string83.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string83.base, #t~string83.offset, 1);call write~init~int(111, #t~string83.base, 1 + #t~string83.offset, 1);call write~init~int(119, #t~string83.base, 2 + #t~string83.offset, 1);call write~init~int(110, #t~string83.base, 3 + #t~string83.offset, 1);call write~init~int(0, #t~string83.base, 4 + #t~string83.offset, 1);call #t~string85.base, #t~string85.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string85.base, #t~string85.offset, 1);call write~init~int(73, #t~string85.base, 1 + #t~string85.offset, 1);call write~init~int(76, #t~string85.base, 2 + #t~string85.offset, 1);call write~init~int(95, #t~string85.base, 3 + #t~string85.offset, 1);call write~init~int(112, #t~string85.base, 4 + #t~string85.offset, 1);call write~init~int(58, #t~string85.base, 5 + #t~string85.offset, 1);call write~init~int(0, #t~string85.base, 6 + #t~string85.offset, 1);call #t~string87.base, #t~string87.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string87.base, #t~string87.offset, 1);call write~init~int(37, #t~string87.base, 1 + #t~string87.offset, 1);call write~init~int(105, #t~string87.base, 2 + #t~string87.offset, 1);call write~init~int(0, #t~string87.base, 3 + #t~string87.offset, 1);call #t~string89.base, #t~string89.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string89.base, #t~string89.offset, 1);call write~init~int(37, #t~string89.base, 1 + #t~string89.offset, 1);call write~init~int(105, #t~string89.base, 2 + #t~string89.offset, 1);call write~init~int(0, #t~string89.base, 3 + #t~string89.offset, 1);call #t~string91.base, #t~string91.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string91.base, #t~string91.offset, 1);call write~init~int(37, #t~string91.base, 1 + #t~string91.offset, 1);call write~init~int(105, #t~string91.base, 2 + #t~string91.offset, 1);call write~init~int(0, #t~string91.base, 3 + #t~string91.offset, 1);call #t~string93.base, #t~string93.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string93.base, #t~string93.offset, 1);call write~init~int(37, #t~string93.base, 1 + #t~string93.offset, 1);call write~init~int(105, #t~string93.base, 2 + #t~string93.offset, 1);call write~init~int(0, #t~string93.base, 3 + #t~string93.offset, 1);call #t~string95.base, #t~string95.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string95.base, #t~string95.offset, 1);call write~init~int(37, #t~string95.base, 1 + #t~string95.offset, 1);call write~init~int(105, #t~string95.base, 2 + #t~string95.offset, 1);call write~init~int(0, #t~string95.base, 3 + #t~string95.offset, 1);call #t~string97.base, #t~string97.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string97.base, #t~string97.offset, 1);call write~init~int(70, #t~string97.base, 1 + #t~string97.offset, 1);call write~init~int(95, #t~string97.base, 2 + #t~string97.offset, 1);call write~init~int(112, #t~string97.base, 3 + #t~string97.offset, 1);call write~init~int(58, #t~string97.base, 4 + #t~string97.offset, 1);call write~init~int(0, #t~string97.base, 5 + #t~string97.offset, 1);call #t~string100.base, #t~string100.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string100.base, #t~string100.offset, 1);call write~init~int(37, #t~string100.base, 1 + #t~string100.offset, 1);call write~init~int(105, #t~string100.base, 2 + #t~string100.offset, 1);call write~init~int(0, #t~string100.base, 3 + #t~string100.offset, 1);call #t~string103.base, #t~string103.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string103.base, #t~string103.offset, 1);call write~init~int(37, #t~string103.base, 1 + #t~string103.offset, 1);call write~init~int(105, #t~string103.base, 2 + #t~string103.offset, 1);call write~init~int(0, #t~string103.base, 3 + #t~string103.offset, 1);call #t~string106.base, #t~string106.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string106.base, #t~string106.offset, 1);call write~init~int(37, #t~string106.base, 1 + #t~string106.offset, 1);call write~init~int(105, #t~string106.base, 2 + #t~string106.offset, 1);call write~init~int(0, #t~string106.base, 3 + #t~string106.offset, 1);call #t~string109.base, #t~string109.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string109.base, #t~string109.offset, 1);call write~init~int(37, #t~string109.base, 1 + #t~string109.offset, 1);call write~init~int(105, #t~string109.base, 2 + #t~string109.offset, 1);call write~init~int(0, #t~string109.base, 3 + #t~string109.offset, 1);call #t~string112.base, #t~string112.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string112.base, #t~string112.offset, 1);call write~init~int(37, #t~string112.base, 1 + #t~string112.offset, 1);call write~init~int(105, #t~string112.base, 2 + #t~string112.offset, 1);call write~init~int(0, #t~string112.base, 3 + #t~string112.offset, 1);call #t~string114.base, #t~string114.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string114.base, #t~string114.offset, 1);call write~init~int(0, #t~string114.base, 1 + #t~string114.offset, 1);~head~0.base, ~head~0.offset := 0, 0;call #t~string136.base, #t~string136.offset := #Ultimate.allocOnStack(30);call #t~string137.base, #t~string137.offset := #Ultimate.allocOnStack(9);call #t~string138.base, #t~string138.offset := #Ultimate.allocOnStack(21);call #t~string139.base, #t~string139.offset := #Ultimate.allocOnStack(30);call #t~string140.base, #t~string140.offset := #Ultimate.allocOnStack(9);call #t~string141.base, #t~string141.offset := #Ultimate.allocOnStack(21);call #t~string145.base, #t~string145.offset := #Ultimate.allocOnStack(30);call #t~string146.base, #t~string146.offset := #Ultimate.allocOnStack(9);call #t~string147.base, #t~string147.offset := #Ultimate.allocOnStack(25);call #t~string148.base, #t~string148.offset := #Ultimate.allocOnStack(30);call #t~string149.base, #t~string149.offset := #Ultimate.allocOnStack(9);call #t~string150.base, #t~string150.offset := #Ultimate.allocOnStack(25); 218815#L-1 havoc main_#res;havoc main_#t~ret166, main_~retValue_acc~31, main_~tmp~29;havoc main_~retValue_acc~31;havoc main_~tmp~29; 218791#L2753 havoc valid_product_#res;havoc valid_product_~retValue_acc~26;havoc valid_product_~retValue_acc~26;valid_product_~retValue_acc~26 := 1;valid_product_#res := valid_product_~retValue_acc~26; 218792#L2761 main_#t~ret166 := valid_product_#res;main_~tmp~29 := main_#t~ret166;havoc main_#t~ret166; 219566#L3468 assume 0 != main_~tmp~29; 219567#L3443 ~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 219854#L968 havoc bigMacCall_#t~ret159, bigMacCall_~tmp~26;havoc bigMacCall_~tmp~26;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~1;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~1; 219855#L85 assume !(0 == getOrigin_~person); 219814#L89 assume !(1 == getOrigin_~person); 219741#L93 assume !(2 == getOrigin_~person); 219742#L97 assume !(3 == getOrigin_~person); 220042#L101 assume !(4 == getOrigin_~person); 218912#L105 assume 5 == getOrigin_~person;getOrigin_~retValue_acc~1 := 1;getOrigin_#res := getOrigin_~retValue_acc~1; 218822#L110 bigMacCall_#t~ret159 := getOrigin_#res;bigMacCall_~tmp~26 := bigMacCall_#t~ret159;havoc bigMacCall_#t~ret159;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~26;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 217899#L643 assume 0 == initPersonOnFloor_~floor; 217900#L644 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 215275#L751-1 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 216228#L435 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 216229#L447-2 havoc cleanup_#t~ret160, cleanup_#t~ret161, cleanup_~i~3, cleanup_~tmp~27, cleanup_~tmp___0~12, cleanup_~__cil_tmp4~3;havoc cleanup_~i~3;havoc cleanup_~tmp~27;havoc cleanup_~tmp___0~12;havoc cleanup_~__cil_tmp4~3;havoc timeShift_#t~ret58, timeShift_#t~ret59, timeShift_#t~ret60, timeShift_#t~ret61, timeShift_#t~ret62, timeShift_#t~ret63, timeShift_#t~ret64, timeShift_#t~ret65, timeShift_#t~ret66, timeShift_#t~ret67, timeShift_#t~ret68, timeShift_~tmp~16, timeShift_~tmp___0~10, timeShift_~tmp___1~6, timeShift_~tmp___2~3, 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~16;havoc timeShift_~tmp___0~10;havoc timeShift_~tmp___1~6;havoc timeShift_~tmp___2~3;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~ret42, stopRequestedAtCurrentFloor_#t~ret43, stopRequestedAtCurrentFloor_#t~ret44, stopRequestedAtCurrentFloor_#t~ret45, stopRequestedAtCurrentFloor_~retValue_acc~20, stopRequestedAtCurrentFloor_~tmp~14, stopRequestedAtCurrentFloor_~tmp___0~8;havoc stopRequestedAtCurrentFloor_~retValue_acc~20;havoc stopRequestedAtCurrentFloor_~tmp~14;havoc stopRequestedAtCurrentFloor_~tmp___0~8;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret116, isExecutiveFloorCalling_~retValue_acc~23;havoc isExecutiveFloorCalling_~retValue_acc~23;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~3;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~3; 218767#L372 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~3 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~3; 217106#L399 isExecutiveFloorCalling_#t~ret116 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~23 := isExecutiveFloorCalling_#t~ret116;havoc isExecutiveFloorCalling_#t~ret116;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~23; 215429#L2714 stopRequestedAtCurrentFloor_#t~ret42 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~14 := stopRequestedAtCurrentFloor_#t~ret42;havoc stopRequestedAtCurrentFloor_#t~ret42; 215430#L2099 assume 0 != stopRequestedAtCurrentFloor_~tmp~14;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~7;havoc getCurrentFloorID_~retValue_acc~7;getCurrentFloorID_~retValue_acc~7 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~7; 216585#L1362 stopRequestedAtCurrentFloor_#t~ret43 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~8 := stopRequestedAtCurrentFloor_#t~ret43;havoc stopRequestedAtCurrentFloor_#t~ret43; 216544#L2103 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~8);stopRequestedAtCurrentFloor_~retValue_acc~20 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~20; 216546#L2116 timeShift_#t~ret58 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret58;havoc timeShift_#t~ret58; 223950#L2251 assume !(0 != timeShift_~tmp___9~2); 223947#L2342 assume !(1 == ~doorState~0); 223946#L2342-2 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret33, stopRequestedInDirection_#t~ret34, stopRequestedInDirection_#t~ret35, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~16, stopRequestedInDirection_~tmp~10, stopRequestedInDirection_~tmp___0~5, stopRequestedInDirection_~__cil_tmp7~0, stopRequestedInDirection_~__cil_tmp8~1;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~16;havoc stopRequestedInDirection_~tmp~10;havoc stopRequestedInDirection_~tmp___0~5;havoc stopRequestedInDirection_~__cil_tmp7~0;havoc stopRequestedInDirection_~__cil_tmp8~1;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret116, isExecutiveFloorCalling_~retValue_acc~23;havoc isExecutiveFloorCalling_~retValue_acc~23;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~3;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~3; 223944#L372-3 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~3 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~3; 223943#L399-3 isExecutiveFloorCalling_#t~ret116 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~23 := isExecutiveFloorCalling_#t~ret116;havoc isExecutiveFloorCalling_#t~ret116;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~23; 223940#L2714-1 stopRequestedInDirection_#t~ret33 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~5 := stopRequestedInDirection_#t~ret33;havoc stopRequestedInDirection_#t~ret33; 223939#L1954 assume 0 != stopRequestedInDirection_~tmp___0~5;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~7;havoc getCurrentFloorID_~retValue_acc~7;getCurrentFloorID_~retValue_acc~7 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~7; 223901#L1362-3 stopRequestedInDirection_#t~ret34 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~10 := stopRequestedInDirection_#t~ret34;havoc stopRequestedInDirection_#t~ret34;stopRequestedInDirection_~__cil_tmp7~0 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~1 := (if stopRequestedInDirection_~tmp~10 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~16 := (if stopRequestedInDirection_~__cil_tmp8~1 == stopRequestedInDirection_~__cil_tmp7~0 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~16; 223900#L1967 timeShift_#t~ret65 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret65;havoc timeShift_#t~ret65; 223899#L2350 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret36, continueInDirection_~dir, continueInDirection_~tmp~11;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~11;~currentHeading~0 := continueInDirection_~dir; 223145#L2011 assume !(1 == ~currentHeading~0); 219885#L2021 assume !(0 == ~currentFloorID~0); 219883#L2021-2 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 219808#L2027-5 havoc __utac_acc__Specification9_spec__3_#t~ret6, __utac_acc__Specification9_spec__3_#t~ret7, __utac_acc__Specification9_spec__3_#t~ret8, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~2, __utac_acc__Specification9_spec__3_~tmp___0~2, __utac_acc__Specification9_spec__3_~tmp___1~2;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~2;havoc __utac_acc__Specification9_spec__3_~tmp___0~2;havoc __utac_acc__Specification9_spec__3_~tmp___1~2;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~7;havoc getCurrentFloorID_~retValue_acc~7;getCurrentFloorID_~retValue_acc~7 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~7; 217432#L1362-5 __utac_acc__Specification9_spec__3_#t~ret6 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~2 := __utac_acc__Specification9_spec__3_#t~ret6;havoc __utac_acc__Specification9_spec__3_#t~ret6;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~2;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~11;havoc isEmpty_~retValue_acc~11; 217433#L1422-6 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~11 := 0;isEmpty_#res := isEmpty_~retValue_acc~11; 217002#L1454-6 __utac_acc__Specification9_spec__3_#t~ret7 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~2 := __utac_acc__Specification9_spec__3_#t~ret7;havoc __utac_acc__Specification9_spec__3_#t~ret7; 217003#L1011 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~2);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~8;havoc areDoorsOpen_~retValue_acc~8;areDoorsOpen_~retValue_acc~8 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~8; 216843#L1371 __utac_acc__Specification9_spec__3_#t~ret8 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~2 := __utac_acc__Specification9_spec__3_#t~ret8;havoc __utac_acc__Specification9_spec__3_#t~ret8; 216844#L1021 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___0~2); 215248#L1021-1 cleanup_~i~3 := 0; 217873#L3275-2 assume !false; 224114#L3276 [2019-11-15 22:48:22,857 INFO L793 eck$LassoCheckResult]: Loop: 224114#L3276 cleanup_~__cil_tmp4~3 := ~cleanupTimeShifts~0 - 1; 240289#L3279 assume cleanup_~i~3 < cleanup_~__cil_tmp4~3;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~6;havoc isBlocked_~retValue_acc~6;isBlocked_~retValue_acc~6 := 0;isBlocked_#res := isBlocked_~retValue_acc~6; 240288#L1185 cleanup_#t~ret160 := isBlocked_#res;cleanup_~tmp___0~12 := cleanup_#t~ret160;havoc cleanup_#t~ret160; 240287#L3283 assume 1 != cleanup_~tmp___0~12; 240286#L3283-1 havoc isIdle_#res;havoc isIdle_#t~ret17, isIdle_~retValue_acc~13, isIdle_~tmp~7;havoc isIdle_~retValue_acc~13;havoc isIdle_~tmp~7;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret12, anyStopRequested_#t~ret13, anyStopRequested_#t~ret14, anyStopRequested_#t~ret15, anyStopRequested_#t~ret16, anyStopRequested_~retValue_acc~12, anyStopRequested_~tmp~6, anyStopRequested_~tmp___0~3, anyStopRequested_~tmp___1~3, anyStopRequested_~tmp___2~0, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~12;havoc anyStopRequested_~tmp~6;havoc anyStopRequested_~tmp___0~3;havoc anyStopRequested_~tmp___1~3;havoc anyStopRequested_~tmp___2~0;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~3;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~3; 240285#L372-65 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~3 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~3; 240284#L399-65 anyStopRequested_#t~ret12 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret12;havoc anyStopRequested_#t~ret12; 240260#L1470 assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~12 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~12; 240253#L1534 isIdle_#t~ret17 := anyStopRequested_#res;isIdle_~tmp~7 := isIdle_#t~ret17;havoc isIdle_#t~ret17;isIdle_~retValue_acc~13 := (if 0 == isIdle_~tmp~7 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~13; 240252#L1547 cleanup_#t~ret161 := isIdle_#res;cleanup_~tmp~27 := cleanup_#t~ret161;havoc cleanup_#t~ret161; 240251#L3295 assume !(0 != cleanup_~tmp~27);havoc timeShift_#t~ret58, timeShift_#t~ret59, timeShift_#t~ret60, timeShift_#t~ret61, timeShift_#t~ret62, timeShift_#t~ret63, timeShift_#t~ret64, timeShift_#t~ret65, timeShift_#t~ret66, timeShift_#t~ret67, timeShift_#t~ret68, timeShift_~tmp~16, timeShift_~tmp___0~10, timeShift_~tmp___1~6, timeShift_~tmp___2~3, 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~16;havoc timeShift_~tmp___0~10;havoc timeShift_~tmp___1~6;havoc timeShift_~tmp___2~3;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~ret42, stopRequestedAtCurrentFloor_#t~ret43, stopRequestedAtCurrentFloor_#t~ret44, stopRequestedAtCurrentFloor_#t~ret45, stopRequestedAtCurrentFloor_~retValue_acc~20, stopRequestedAtCurrentFloor_~tmp~14, stopRequestedAtCurrentFloor_~tmp___0~8;havoc stopRequestedAtCurrentFloor_~retValue_acc~20;havoc stopRequestedAtCurrentFloor_~tmp~14;havoc stopRequestedAtCurrentFloor_~tmp___0~8;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret116, isExecutiveFloorCalling_~retValue_acc~23;havoc isExecutiveFloorCalling_~retValue_acc~23;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~3;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~3; 240250#L372-70 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~3 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~3; 228911#L399-70 isExecutiveFloorCalling_#t~ret116 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~23 := isExecutiveFloorCalling_#t~ret116;havoc isExecutiveFloorCalling_#t~ret116;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~23; 240249#L2714-3 stopRequestedAtCurrentFloor_#t~ret42 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~14 := stopRequestedAtCurrentFloor_#t~ret42;havoc stopRequestedAtCurrentFloor_#t~ret42; 240247#L2099-1 assume 0 != stopRequestedAtCurrentFloor_~tmp~14;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~7;havoc getCurrentFloorID_~retValue_acc~7;getCurrentFloorID_~retValue_acc~7 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~7; 235235#L1362-6 stopRequestedAtCurrentFloor_#t~ret43 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~8 := stopRequestedAtCurrentFloor_#t~ret43;havoc stopRequestedAtCurrentFloor_#t~ret43; 235236#L2103-1 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~8);stopRequestedAtCurrentFloor_~retValue_acc~20 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~20; 240219#L2116-1 timeShift_#t~ret58 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret58;havoc timeShift_#t~ret58; 240218#L2251-1 assume !(0 != timeShift_~tmp___9~2); 240216#L2342-3 assume !(1 == ~doorState~0); 240215#L2342-5 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret33, stopRequestedInDirection_#t~ret34, stopRequestedInDirection_#t~ret35, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~16, stopRequestedInDirection_~tmp~10, stopRequestedInDirection_~tmp___0~5, stopRequestedInDirection_~__cil_tmp7~0, stopRequestedInDirection_~__cil_tmp8~1;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~16;havoc stopRequestedInDirection_~tmp~10;havoc stopRequestedInDirection_~tmp___0~5;havoc stopRequestedInDirection_~__cil_tmp7~0;havoc stopRequestedInDirection_~__cil_tmp8~1;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret116, isExecutiveFloorCalling_~retValue_acc~23;havoc isExecutiveFloorCalling_~retValue_acc~23;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~3;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~3; 240210#L372-73 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~3 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~3; 240208#L399-73 isExecutiveFloorCalling_#t~ret116 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~23 := isExecutiveFloorCalling_#t~ret116;havoc isExecutiveFloorCalling_#t~ret116;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~23; 240207#L2714-4 stopRequestedInDirection_#t~ret33 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~5 := stopRequestedInDirection_#t~ret33;havoc stopRequestedInDirection_#t~ret33; 240180#L1954-2 assume 0 != stopRequestedInDirection_~tmp___0~5;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~7;havoc getCurrentFloorID_~retValue_acc~7;getCurrentFloorID_~retValue_acc~7 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~7; 240178#L1362-9 stopRequestedInDirection_#t~ret34 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~10 := stopRequestedInDirection_#t~ret34;havoc stopRequestedInDirection_#t~ret34;stopRequestedInDirection_~__cil_tmp7~0 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~1 := (if stopRequestedInDirection_~tmp~10 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~16 := (if stopRequestedInDirection_~__cil_tmp8~1 == stopRequestedInDirection_~__cil_tmp7~0 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~16; 240177#L1967-2 timeShift_#t~ret65 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret65;havoc timeShift_#t~ret65; 240175#L2350-1 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret36, continueInDirection_~dir, continueInDirection_~tmp~11;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~11;~currentHeading~0 := continueInDirection_~dir; 240176#L2011-3 assume !(1 == ~currentHeading~0); 240315#L2021-9 assume !(0 == ~currentFloorID~0); 238889#L2021-11 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 234536#L2027-11 havoc __utac_acc__Specification9_spec__3_#t~ret6, __utac_acc__Specification9_spec__3_#t~ret7, __utac_acc__Specification9_spec__3_#t~ret8, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~2, __utac_acc__Specification9_spec__3_~tmp___0~2, __utac_acc__Specification9_spec__3_~tmp___1~2;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~2;havoc __utac_acc__Specification9_spec__3_~tmp___0~2;havoc __utac_acc__Specification9_spec__3_~tmp___1~2;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~7;havoc getCurrentFloorID_~retValue_acc~7;getCurrentFloorID_~retValue_acc~7 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~7; 240314#L1362-11 __utac_acc__Specification9_spec__3_#t~ret6 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~2 := __utac_acc__Specification9_spec__3_#t~ret6;havoc __utac_acc__Specification9_spec__3_#t~ret6;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~2;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~11;havoc isEmpty_~retValue_acc~11; 240309#L1422-13 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~11 := 0;isEmpty_#res := isEmpty_~retValue_acc~11; 240306#L1454-13 __utac_acc__Specification9_spec__3_#t~ret7 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~2 := __utac_acc__Specification9_spec__3_#t~ret7;havoc __utac_acc__Specification9_spec__3_#t~ret7; 240305#L1011-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~2);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~8;havoc areDoorsOpen_~retValue_acc~8;areDoorsOpen_~retValue_acc~8 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~8; 240294#L1371-1 __utac_acc__Specification9_spec__3_#t~ret8 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~2 := __utac_acc__Specification9_spec__3_#t~ret8;havoc __utac_acc__Specification9_spec__3_#t~ret8; 240297#L1021-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___0~2); 240291#L1021-3 cleanup_~i~3 := 1 + cleanup_~i~3; 240290#L3275-2 assume !false; 224114#L3276 [2019-11-15 22:48:22,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:48:22,858 INFO L82 PathProgramCache]: Analyzing trace with hash -861478866, now seen corresponding path program 1 times [2019-11-15 22:48:22,859 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:48:22,859 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243363266] [2019-11-15 22:48:22,859 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:22,859 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:22,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:48:22,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:48:22,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:48:22,995 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243363266] [2019-11-15 22:48:22,995 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:48:22,995 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:48:22,995 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719992165] [2019-11-15 22:48:22,995 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:48:22,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:48:22,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1189278035, now seen corresponding path program 1 times [2019-11-15 22:48:22,996 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:48:22,996 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386327804] [2019-11-15 22:48:22,996 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:22,996 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:48:22,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:48:23,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:48:23,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:48:23,045 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:48:24,216 WARN L191 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 178 DAG size of output: 161 [2019-11-15 22:48:25,146 WARN L191 SmtUtils]: Spent 907.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 127 [2019-11-15 22:48:25,149 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:48:25,149 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:48:25,149 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:48:25,149 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:48:25,150 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 22:48:25,150 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:48:25,150 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:48:25,150 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:48:25,150 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec9_product31.cil.c_Iteration5_Loop [2019-11-15 22:48:25,150 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:48:25,150 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:48:25,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:25,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:25,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-11-15 22:48:25,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:25,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:25,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:25,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:25,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:25,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:25,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:25,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:25,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:25,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-11-15 22:48:25,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:25,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:25,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:25,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:25,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:25,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:25,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:25,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:25,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:25,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:25,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:25,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:25,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:25,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:25,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:25,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:25,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:25,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:25,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:25,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:25,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:25,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-11-15 22:48:25,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:25,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:25,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:25,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:25,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:25,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:25,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:25,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-11-15 22:48:25,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:25,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:25,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:25,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:25,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:25,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:25,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:25,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:25,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:25,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:25,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:25,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:25,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:25,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:25,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:25,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:25,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:25,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:25,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:25,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:25,721 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2019-11-15 22:48:26,072 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-11-15 22:48:26,376 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:48:26,376 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0ec4fb2a-0484-45a7-afb1-498f8ffd02f9/bin/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:48:26,390 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:48:26,391 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 22:48:26,395 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 22:48:26,395 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stopRequestedInDirection_#t~ret35=0} Honda state: {ULTIMATE.start_stopRequestedInDirection_#t~ret35=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0ec4fb2a-0484-45a7-afb1-498f8ffd02f9/bin/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 22:48:26,404 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 22:48:26,404 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0ec4fb2a-0484-45a7-afb1-498f8ffd02f9/bin/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:48:26,414 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 22:48:26,414 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 22:48:27,151 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 22:48:27,154 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:48:27,154 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:48:27,154 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:48:27,154 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:48:27,154 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:48:27,154 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:48:27,155 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:48:27,155 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:48:27,155 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec9_product31.cil.c_Iteration5_Loop [2019-11-15 22:48:27,155 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:48:27,155 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:48:27,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:27,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:27,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:27,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:27,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:27,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:27,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:27,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:27,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:27,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:27,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:27,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:27,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:27,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:27,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:27,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:27,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:27,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:27,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:27,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:27,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:27,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:27,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:27,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:27,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:27,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:27,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:27,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:27,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:27,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:27,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:27,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:27,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:27,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:27,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:27,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:27,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:27,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:27,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:27,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-11-15 22:48:27,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:27,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:27,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:27,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:27,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:27,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:27,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:27,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:27,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:27,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:27,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:27,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:27,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:27,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-11-15 22:48:27,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:27,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:27,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:27,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:27,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:27,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:27,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:27,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:27,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:48:28,061 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2019-11-15 22:48:28,523 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:48:28,524 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:48:28,524 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:48:28,525 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:48:28,525 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:48:28,526 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:48:28,526 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:48:28,526 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:48:28,527 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:48:28,527 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:48:28,527 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:48:28,528 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:48:28,528 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:48:28,529 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:48:28,529 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:48:28,529 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:48:28,529 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:48:28,530 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:48:28,530 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:48:28,531 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:48:28,531 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:48:28,532 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:48:28,532 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:48:28,532 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:48:28,532 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:48:28,533 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:48:28,533 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:48:28,533 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:48:28,534 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:48:28,534 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 22:48:28,535 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:48:28,535 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:48:28,536 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:48:28,536 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:48:28,536 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:48:28,537 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:48:28,537 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:48:28,540 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:48:28,544 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 22:48:28,544 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 22:48:28,545 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:48:28,545 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 22:48:28,546 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:48:28,546 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~cleanupTimeShifts~0, ULTIMATE.start_cleanup_~i~3) = 1*~cleanupTimeShifts~0 - 1*ULTIMATE.start_cleanup_~i~3 Supporting invariants [] [2019-11-15 22:48:28,546 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 22:48:28,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:48:28,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:48:28,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:48:28,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:48:28,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:48:28,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 22:48:28,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:48:28,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:48:28,904 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-11-15 22:48:28,904 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26081 states and 48579 transitions. cyclomatic complexity: 22504 Second operand 5 states. [2019-11-15 22:48:29,525 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26081 states and 48579 transitions. cyclomatic complexity: 22504. Second operand 5 states. Result 46921 states and 87339 transitions. Complement of second has 8 states. [2019-11-15 22:48:29,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 22:48:29,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 22:48:29,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 6892 transitions. [2019-11-15 22:48:29,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6892 transitions. Stem has 48 letters. Loop has 40 letters. [2019-11-15 22:48:29,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:48:29,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6892 transitions. Stem has 88 letters. Loop has 40 letters. [2019-11-15 22:48:29,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:48:29,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6892 transitions. Stem has 48 letters. Loop has 80 letters. [2019-11-15 22:48:29,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:48:29,538 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46921 states and 87339 transitions. [2019-11-15 22:48:29,803 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 22:48:29,803 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46921 states to 0 states and 0 transitions. [2019-11-15 22:48:29,803 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 22:48:29,803 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 22:48:29,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 22:48:29,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:48:29,804 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:48:29,804 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:48:29,804 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:48:29,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:48:29,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:48:29,805 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 6 states. [2019-11-15 22:48:29,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:48:29,805 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-11-15 22:48:29,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 22:48:29,806 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-11-15 22:48:29,806 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 22:48:29,807 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 22:48:29,807 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 22:48:29,807 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 22:48:29,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 22:48:29,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:48:29,808 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:48:29,808 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:48:29,808 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:48:29,808 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 22:48:29,808 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 22:48:29,809 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 22:48:29,809 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 22:48:29,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 10:48:29 BoogieIcfgContainer [2019-11-15 22:48:29,824 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 22:48:29,824 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:48:29,825 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:48:29,825 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:48:29,825 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:47:55" (3/4) ... [2019-11-15 22:48:29,829 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 22:48:29,829 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:48:29,831 INFO L168 Benchmark]: Toolchain (without parser) took 46606.77 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.2 GB). Free memory was 944.7 MB in the beginning and 1.5 GB in the end (delta: -541.4 MB). Peak memory consumption was 613.6 MB. Max. memory is 11.5 GB. [2019-11-15 22:48:29,832 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:48:29,833 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1269.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -144.7 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. [2019-11-15 22:48:29,834 INFO L168 Benchmark]: Boogie Procedure Inliner took 357.25 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: 34.1 MB). Peak memory consumption was 34.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:48:29,838 INFO L168 Benchmark]: Boogie Preprocessor took 378.83 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: 41.0 MB). Peak memory consumption was 41.0 MB. Max. memory is 11.5 GB. [2019-11-15 22:48:29,839 INFO L168 Benchmark]: RCFGBuilder took 10203.97 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 183.5 MB). Free memory was 1.0 GB in the beginning and 870.8 MB in the end (delta: 143.5 MB). Peak memory consumption was 378.3 MB. Max. memory is 11.5 GB. [2019-11-15 22:48:29,841 INFO L168 Benchmark]: BuchiAutomizer took 34385.03 ms. Allocated memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: 823.1 MB). Free memory was 870.8 MB in the beginning and 1.5 GB in the end (delta: -615.3 MB). Peak memory consumption was 207.9 MB. Max. memory is 11.5 GB. [2019-11-15 22:48:29,841 INFO L168 Benchmark]: Witness Printer took 5.19 ms. Allocated memory is still 2.2 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:48:29,851 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1269.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -144.7 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 357.25 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: 34.1 MB). Peak memory consumption was 34.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 378.83 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: 41.0 MB). Peak memory consumption was 41.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 10203.97 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 183.5 MB). Free memory was 1.0 GB in the beginning and 870.8 MB in the end (delta: 143.5 MB). Peak memory consumption was 378.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 34385.03 ms. Allocated memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: 823.1 MB). Free memory was 870.8 MB in the beginning and 1.5 GB in the end (delta: -615.3 MB). Peak memory consumption was 207.9 MB. Max. memory is 11.5 GB. * Witness Printer took 5.19 ms. Allocated memory is still 2.2 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (5 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function doorState and consists of 3 locations. One deterministic module has affine ranking function cleanupTimeShifts + -1 * i and consists of 5 locations. 5 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 34.3s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 13.4s. Construction of modules took 8.7s. Büchi inclusion checks took 6.2s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 2. Automata minimization 2.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 48766 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 2.7s Buchi closure took 0.1s. Biggest automaton had 26081 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 40873 SDtfs, 143314 SDslu, 74628 SDs, 0 SdLazy, 5706 SolverSat, 1566 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.7s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI3 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital187 mio100 ax100 hnf99 lsp20 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq210 hnf88 smp90 dnf150 smp100 tf102 neg97 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 16ms VariablesStem: 0 VariablesLoop: 8 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 13 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...