./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/elevator_spec2_product27_true-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/product-lines/elevator_spec2_product27_true-unreach-call_true-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 503e73100124c47cebafda9ab2786b53dae16478 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 04:01:44,291 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:01:44,292 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:01:44,310 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:01:44,310 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:01:44,311 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:01:44,312 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:01:44,314 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:01:44,316 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:01:44,316 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:01:44,317 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:01:44,318 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:01:44,318 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:01:44,320 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:01:44,321 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:01:44,321 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:01:44,323 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:01:44,327 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:01:44,329 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:01:44,334 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:01:44,335 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:01:44,341 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:01:44,345 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:01:44,346 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:01:44,346 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:01:44,347 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:01:44,348 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:01:44,349 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:01:44,354 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:01:44,357 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:01:44,359 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:01:44,360 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:01:44,362 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:01:44,362 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:01:44,363 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:01:44,365 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:01:44,367 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 04:01:44,400 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:01:44,400 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:01:44,403 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:01:44,404 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:01:44,404 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:01:44,404 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:01:44,404 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:01:44,405 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:01:44,405 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:01:44,406 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:01:44,406 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:01:44,406 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:01:44,406 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:01:44,406 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:01:44,407 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:01:44,407 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:01:44,408 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:01:44,408 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:01:44,408 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:01:44,408 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:01:44,408 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:01:44,408 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:01:44,411 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:01:44,411 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:01:44,411 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:01:44,411 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:01:44,411 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:01:44,412 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:01:44,412 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:01:44,413 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:01:44,413 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:01:44,414 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:01:44,415 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 503e73100124c47cebafda9ab2786b53dae16478 [2019-01-14 04:01:44,468 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:01:44,484 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:01:44,490 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:01:44,491 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:01:44,492 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:01:44,493 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/elevator_spec2_product27_true-unreach-call_true-termination.cil.c [2019-01-14 04:01:44,542 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21d32255d/71d92dc8a7f847668bfc129962ce1b5f/FLAGb600da69e [2019-01-14 04:01:45,155 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:01:45,156 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/elevator_spec2_product27_true-unreach-call_true-termination.cil.c [2019-01-14 04:01:45,176 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21d32255d/71d92dc8a7f847668bfc129962ce1b5f/FLAGb600da69e [2019-01-14 04:01:45,342 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21d32255d/71d92dc8a7f847668bfc129962ce1b5f [2019-01-14 04:01:45,345 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:01:45,346 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:01:45,347 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:01:45,348 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:01:45,351 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:01:45,352 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:01:45" (1/1) ... [2019-01-14 04:01:45,355 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3185eb4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:01:45, skipping insertion in model container [2019-01-14 04:01:45,356 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:01:45" (1/1) ... [2019-01-14 04:01:45,364 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:01:45,452 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:01:46,301 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:01:46,418 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:01:46,541 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:01:46,631 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:01:46,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:01:46 WrapperNode [2019-01-14 04:01:46,632 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:01:46,633 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:01:46,633 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:01:46,634 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:01:46,644 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:01:46" (1/1) ... [2019-01-14 04:01:46,712 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:01:46" (1/1) ... [2019-01-14 04:01:46,931 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:01:46,932 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:01:46,933 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:01:46,933 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:01:46,944 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:01:46" (1/1) ... [2019-01-14 04:01:46,944 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:01:46" (1/1) ... [2019-01-14 04:01:46,977 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:01:46" (1/1) ... [2019-01-14 04:01:46,977 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:01:46" (1/1) ... [2019-01-14 04:01:47,076 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:01:46" (1/1) ... [2019-01-14 04:01:47,142 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:01:46" (1/1) ... [2019-01-14 04:01:47,166 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:01:46" (1/1) ... [2019-01-14 04:01:47,216 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:01:47,217 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:01:47,217 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:01:47,217 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:01:47,218 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:01:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:01:47,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 04:01:47,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-14 04:01:47,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:01:47,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:01:57,913 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:01:57,915 INFO L286 CfgBuilder]: Removed 661 assue(true) statements. [2019-01-14 04:01:57,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:01:57 BoogieIcfgContainer [2019-01-14 04:01:57,918 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:01:57,919 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:01:57,919 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:01:57,922 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:01:57,923 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:01:57,923 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:01:45" (1/3) ... [2019-01-14 04:01:57,924 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@486ead40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:01:57, skipping insertion in model container [2019-01-14 04:01:57,925 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:01:57,925 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:01:46" (2/3) ... [2019-01-14 04:01:57,926 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@486ead40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:01:57, skipping insertion in model container [2019-01-14 04:01:57,926 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:01:57,926 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:01:57" (3/3) ... [2019-01-14 04:01:57,928 INFO L375 chiAutomizerObserver]: Analyzing ICFG elevator_spec2_product27_true-unreach-call_true-termination.cil.c [2019-01-14 04:01:57,985 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:01:57,986 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:01:57,986 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:01:57,986 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:01:57,986 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:01:57,986 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:01:57,986 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:01:57,986 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:01:57,986 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:01:58,057 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2599 states. [2019-01-14 04:01:58,177 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1289 [2019-01-14 04:01:58,178 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:01:58,178 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:01:58,196 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:01:58,196 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:01:58,196 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:01:58,196 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2599 states. [2019-01-14 04:01:58,230 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1289 [2019-01-14 04:01:58,231 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:01:58,231 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:01:58,235 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:01:58,235 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:01:58,243 INFO L794 eck$LassoCheckResult]: Stem: 562#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(30);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(9);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(21);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(30);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(9);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(21);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(30);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(9);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(25);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(25);~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~floorButtons_spc2_0~0 := 0;~floorButtons_spc2_1~0 := 0;~floorButtons_spc2_2~0 := 0;~floorButtons_spc2_3~0 := 0;~floorButtons_spc2_4~0 := 0;~cleanupTimeShifts~0 := 12;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0;call #t~string100.base, #t~string100.offset := #Ultimate.allocOnStack(10);call #t~string102.base, #t~string102.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string102.base, #t~string102.offset, 1);call write~init~int(95, #t~string102.base, 1 + #t~string102.offset, 1);call write~init~int(93, #t~string102.base, 2 + #t~string102.offset, 1);call write~init~int(0, #t~string102.base, 3 + #t~string102.offset, 1);call #t~string104.base, #t~string104.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string104.base, #t~string104.offset, 1);call write~init~int(93, #t~string104.base, 1 + #t~string104.offset, 1);call write~init~int(32, #t~string104.base, 2 + #t~string104.offset, 1);call write~init~int(0, #t~string104.base, 3 + #t~string104.offset, 1);call #t~string106.base, #t~string106.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string106.base, #t~string106.offset, 1);call write~init~int(97, #t~string106.base, 1 + #t~string106.offset, 1);call write~init~int(116, #t~string106.base, 2 + #t~string106.offset, 1);call write~init~int(32, #t~string106.base, 3 + #t~string106.offset, 1);call write~init~int(0, #t~string106.base, 4 + #t~string106.offset, 1);call #t~string108.base, #t~string108.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string108.base, #t~string108.offset, 1);call write~init~int(105, #t~string108.base, 1 + #t~string108.offset, 1);call write~init~int(0, #t~string108.base, 2 + #t~string108.offset, 1);call #t~string110.base, #t~string110.offset := #Ultimate.allocOnStack(10);call #t~string112.base, #t~string112.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string112.base, #t~string112.offset, 1);call write~init~int(112, #t~string112.base, 1 + #t~string112.offset, 1);call write~init~int(0, #t~string112.base, 2 + #t~string112.offset, 1);call #t~string114.base, #t~string114.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string114.base, #t~string114.offset, 1);call write~init~int(111, #t~string114.base, 1 + #t~string114.offset, 1);call write~init~int(119, #t~string114.base, 2 + #t~string114.offset, 1);call write~init~int(110, #t~string114.base, 3 + #t~string114.offset, 1);call write~init~int(0, #t~string114.base, 4 + #t~string114.offset, 1);call #t~string116.base, #t~string116.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string116.base, #t~string116.offset, 1);call write~init~int(73, #t~string116.base, 1 + #t~string116.offset, 1);call write~init~int(76, #t~string116.base, 2 + #t~string116.offset, 1);call write~init~int(95, #t~string116.base, 3 + #t~string116.offset, 1);call write~init~int(112, #t~string116.base, 4 + #t~string116.offset, 1);call write~init~int(58, #t~string116.base, 5 + #t~string116.offset, 1);call write~init~int(0, #t~string116.base, 6 + #t~string116.offset, 1);call #t~string118.base, #t~string118.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string118.base, #t~string118.offset, 1);call write~init~int(37, #t~string118.base, 1 + #t~string118.offset, 1);call write~init~int(105, #t~string118.base, 2 + #t~string118.offset, 1);call write~init~int(0, #t~string118.base, 3 + #t~string118.offset, 1);call #t~string120.base, #t~string120.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string120.base, #t~string120.offset, 1);call write~init~int(37, #t~string120.base, 1 + #t~string120.offset, 1);call write~init~int(105, #t~string120.base, 2 + #t~string120.offset, 1);call write~init~int(0, #t~string120.base, 3 + #t~string120.offset, 1);call #t~string122.base, #t~string122.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string122.base, #t~string122.offset, 1);call write~init~int(37, #t~string122.base, 1 + #t~string122.offset, 1);call write~init~int(105, #t~string122.base, 2 + #t~string122.offset, 1);call write~init~int(0, #t~string122.base, 3 + #t~string122.offset, 1);call #t~string124.base, #t~string124.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string124.base, #t~string124.offset, 1);call write~init~int(37, #t~string124.base, 1 + #t~string124.offset, 1);call write~init~int(105, #t~string124.base, 2 + #t~string124.offset, 1);call write~init~int(0, #t~string124.base, 3 + #t~string124.offset, 1);call #t~string126.base, #t~string126.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string126.base, #t~string126.offset, 1);call write~init~int(37, #t~string126.base, 1 + #t~string126.offset, 1);call write~init~int(105, #t~string126.base, 2 + #t~string126.offset, 1);call write~init~int(0, #t~string126.base, 3 + #t~string126.offset, 1);call #t~string128.base, #t~string128.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string128.base, #t~string128.offset, 1);call write~init~int(70, #t~string128.base, 1 + #t~string128.offset, 1);call write~init~int(95, #t~string128.base, 2 + #t~string128.offset, 1);call write~init~int(112, #t~string128.base, 3 + #t~string128.offset, 1);call write~init~int(58, #t~string128.base, 4 + #t~string128.offset, 1);call write~init~int(0, #t~string128.base, 5 + #t~string128.offset, 1);call #t~string131.base, #t~string131.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string131.base, #t~string131.offset, 1);call write~init~int(37, #t~string131.base, 1 + #t~string131.offset, 1);call write~init~int(105, #t~string131.base, 2 + #t~string131.offset, 1);call write~init~int(0, #t~string131.base, 3 + #t~string131.offset, 1);call #t~string134.base, #t~string134.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string134.base, #t~string134.offset, 1);call write~init~int(37, #t~string134.base, 1 + #t~string134.offset, 1);call write~init~int(105, #t~string134.base, 2 + #t~string134.offset, 1);call write~init~int(0, #t~string134.base, 3 + #t~string134.offset, 1);call #t~string137.base, #t~string137.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string137.base, #t~string137.offset, 1);call write~init~int(37, #t~string137.base, 1 + #t~string137.offset, 1);call write~init~int(105, #t~string137.base, 2 + #t~string137.offset, 1);call write~init~int(0, #t~string137.base, 3 + #t~string137.offset, 1);call #t~string140.base, #t~string140.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string140.base, #t~string140.offset, 1);call write~init~int(37, #t~string140.base, 1 + #t~string140.offset, 1);call write~init~int(105, #t~string140.base, 2 + #t~string140.offset, 1);call write~init~int(0, #t~string140.base, 3 + #t~string140.offset, 1);call #t~string143.base, #t~string143.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string143.base, #t~string143.offset, 1);call write~init~int(37, #t~string143.base, 1 + #t~string143.offset, 1);call write~init~int(105, #t~string143.base, 2 + #t~string143.offset, 1);call write~init~int(0, #t~string143.base, 3 + #t~string143.offset, 1);call #t~string145.base, #t~string145.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string145.base, #t~string145.offset, 1);call write~init~int(0, #t~string145.base, 1 + #t~string145.offset, 1);~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; 1819#L-1true havoc main_#res;havoc main_#t~ret161, main_~retValue_acc~21, main_~tmp~27;havoc main_~retValue_acc~21;havoc main_~tmp~27; 1299#L3424true havoc valid_product_#res;havoc valid_product_~retValue_acc~29;havoc valid_product_~retValue_acc~29;valid_product_~retValue_acc~29 := 1;valid_product_#res := valid_product_~retValue_acc~29; 2116#L3432true main_#t~ret161 := valid_product_#res;main_~tmp~27 := main_#t~ret161;havoc main_#t~ret161; 2498#L2609true assume 0 != main_~tmp~27; 18#L2581true ~floorButtons_spc2_0~0 := 0;~floorButtons_spc2_1~0 := 0;~floorButtons_spc2_2~0 := 0;~floorButtons_spc2_3~0 := 0;~floorButtons_spc2_4~0 := 0; 1339#L425true havoc bigMacCall_#t~ret154, bigMacCall_~tmp~24;havoc bigMacCall_~tmp~24;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~26;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~26; 243#L3327true assume 0 == getOrigin_~person;getOrigin_~retValue_acc~26 := 4;getOrigin_#res := getOrigin_~retValue_acc~26; 1592#L3352true bigMacCall_#t~ret154 := getOrigin_#res;bigMacCall_~tmp~24 := bigMacCall_#t~ret154;havoc bigMacCall_#t~ret154;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~24;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 383#L2976true assume 0 == initPersonOnFloor_~floor; 45#L2977true assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 1679#L3084-1true callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 821#L2768true assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 1573#L2780-2true havoc cleanup_#t~ret155, cleanup_#t~ret156, cleanup_~i~3, cleanup_~tmp~25, cleanup_~tmp___0~11, cleanup_~__cil_tmp4~2;havoc cleanup_~i~3;havoc cleanup_~tmp~25;havoc cleanup_~tmp___0~11;havoc cleanup_~__cil_tmp4~2;havoc timeShift_#t~ret89, timeShift_#t~ret90, timeShift_#t~ret91, timeShift_#t~ret92, timeShift_#t~ret93, timeShift_#t~ret94, timeShift_#t~ret95, timeShift_#t~ret96, timeShift_#t~ret97, timeShift_#t~ret98, timeShift_#t~ret99, timeShift_~tmp~17, timeShift_~tmp___0~9, timeShift_~tmp___1~6, timeShift_~tmp___2~4, timeShift_~tmp___3~4, timeShift_~tmp___4~3, timeShift_~tmp___5~2, timeShift_~tmp___6~2, timeShift_~tmp___7~2, timeShift_~tmp___8~2, timeShift_~tmp___9~2;havoc timeShift_~tmp~17;havoc timeShift_~tmp___0~9;havoc timeShift_~tmp___1~6;havoc timeShift_~tmp___2~4;havoc timeShift_~tmp___3~4;havoc timeShift_~tmp___4~3;havoc timeShift_~tmp___5~2;havoc timeShift_~tmp___6~2;havoc timeShift_~tmp___7~2;havoc timeShift_~tmp___8~2;havoc timeShift_~tmp___9~2;havoc stopRequestedAtCurrentFloor_#res;havoc stopRequestedAtCurrentFloor_#t~ret73, stopRequestedAtCurrentFloor_#t~ret74, stopRequestedAtCurrentFloor_#t~ret75, stopRequestedAtCurrentFloor_#t~ret76, stopRequestedAtCurrentFloor_~retValue_acc~15, stopRequestedAtCurrentFloor_~tmp~15, stopRequestedAtCurrentFloor_~tmp___0~7;havoc stopRequestedAtCurrentFloor_~retValue_acc~15;havoc stopRequestedAtCurrentFloor_~tmp~15;havoc stopRequestedAtCurrentFloor_~tmp___0~7;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret147, isExecutiveFloorCalling_~retValue_acc~18;havoc isExecutiveFloorCalling_~retValue_acc~18;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 778#L2705true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 1652#L2732true isExecutiveFloorCalling_#t~ret147 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~18 := isExecutiveFloorCalling_#t~ret147;havoc isExecutiveFloorCalling_#t~ret147;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~18; 2419#L2256true stopRequestedAtCurrentFloor_#t~ret73 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~15 := stopRequestedAtCurrentFloor_#t~ret73;havoc stopRequestedAtCurrentFloor_#t~ret73; 2315#L1641true assume 0 != stopRequestedAtCurrentFloor_~tmp~15;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~4;havoc getCurrentFloorID_~retValue_acc~4;getCurrentFloorID_~retValue_acc~4 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~4; 1732#L972true stopRequestedAtCurrentFloor_#t~ret74 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~7 := stopRequestedAtCurrentFloor_#t~ret74;havoc stopRequestedAtCurrentFloor_#t~ret74; 2138#L1645true assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~7);stopRequestedAtCurrentFloor_~retValue_acc~15 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~15; 1355#L1658true timeShift_#t~ret89 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret89;havoc timeShift_#t~ret89; 1190#L1793true assume !(0 != timeShift_~tmp___9~2); 982#L1884true assume !(1 == ~doorState~0); 985#L1884-2true stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret67, stopRequestedInDirection_#t~ret68, stopRequestedInDirection_#t~ret69, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~12, stopRequestedInDirection_~tmp~12, stopRequestedInDirection_~tmp___0~5, stopRequestedInDirection_~__cil_tmp7~5, stopRequestedInDirection_~__cil_tmp8~5;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~12;havoc stopRequestedInDirection_~tmp~12;havoc stopRequestedInDirection_~tmp___0~5;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret147, isExecutiveFloorCalling_~retValue_acc~18;havoc isExecutiveFloorCalling_~retValue_acc~18;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 766#L2705-3true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 1622#L2732-3true isExecutiveFloorCalling_#t~ret147 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~18 := isExecutiveFloorCalling_#t~ret147;havoc isExecutiveFloorCalling_#t~ret147;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~18; 2417#L2256-1true stopRequestedInDirection_#t~ret67 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~5 := stopRequestedInDirection_#t~ret67;havoc stopRequestedInDirection_#t~ret67; 224#L1524true assume 0 != stopRequestedInDirection_~tmp___0~5;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~4;havoc getCurrentFloorID_~retValue_acc~4;getCurrentFloorID_~retValue_acc~4 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~4; 1736#L972-1true stopRequestedInDirection_#t~ret68 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~12 := stopRequestedInDirection_#t~ret68;havoc stopRequestedInDirection_#t~ret68;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~12 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~12 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~12; 2008#L1537true timeShift_#t~ret96 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret96;havoc timeShift_#t~ret96; 1855#L1892true assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret70, continueInDirection_~dir, continueInDirection_~tmp~13;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~13;~currentHeading~0 := continueInDirection_~dir; 2005#L1581true assume !(1 == ~currentHeading~0); 1555#L1591true assume !(0 == ~currentFloorID~0); 1559#L1591-2true assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 2314#L1597-5true havoc __utac_acc__Specification2_spec__3_#t~ret35, __utac_acc__Specification2_spec__3_#t~ret36, __utac_acc__Specification2_spec__3_#t~ret37, __utac_acc__Specification2_spec__3_#t~ret38, __utac_acc__Specification2_spec__3_#t~ret39, __utac_acc__Specification2_spec__3_#t~ret40, __utac_acc__Specification2_spec__3_~floor~0, __utac_acc__Specification2_spec__3_~tmp~3, __utac_acc__Specification2_spec__3_~tmp___0~0, __utac_acc__Specification2_spec__3_~tmp___1~0, __utac_acc__Specification2_spec__3_~tmp___2~0, __utac_acc__Specification2_spec__3_~tmp___3~0, __utac_acc__Specification2_spec__3_~tmp___4~0;havoc __utac_acc__Specification2_spec__3_~floor~0;havoc __utac_acc__Specification2_spec__3_~tmp~3;havoc __utac_acc__Specification2_spec__3_~tmp___0~0;havoc __utac_acc__Specification2_spec__3_~tmp___1~0;havoc __utac_acc__Specification2_spec__3_~tmp___2~0;havoc __utac_acc__Specification2_spec__3_~tmp___3~0;havoc __utac_acc__Specification2_spec__3_~tmp___4~0;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~4;havoc getCurrentFloorID_~retValue_acc~4;getCurrentFloorID_~retValue_acc~4 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~4; 1526#L972-3true __utac_acc__Specification2_spec__3_#t~ret35 := getCurrentFloorID_#res;__utac_acc__Specification2_spec__3_~tmp~3 := __utac_acc__Specification2_spec__3_#t~ret35;havoc __utac_acc__Specification2_spec__3_#t~ret35;__utac_acc__Specification2_spec__3_~floor~0 := __utac_acc__Specification2_spec__3_~tmp~3; 1446#L470true assume 0 == __utac_acc__Specification2_spec__3_~floor~0; 1380#L471true assume 0 != ~floorButtons_spc2_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~5;havoc areDoorsOpen_~retValue_acc~5;areDoorsOpen_~retValue_acc~5 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~5; 2301#L981true __utac_acc__Specification2_spec__3_#t~ret36 := areDoorsOpen_#res;__utac_acc__Specification2_spec__3_~tmp___4~0 := __utac_acc__Specification2_spec__3_#t~ret36;havoc __utac_acc__Specification2_spec__3_#t~ret36; 954#L475true assume 0 != __utac_acc__Specification2_spec__3_~tmp___4~0;~floorButtons_spc2_0~0 := 0; 1628#L530true cleanup_~i~3 := 0; 935#L2413-2true [2019-01-14 04:01:58,244 INFO L796 eck$LassoCheckResult]: Loop: 935#L2413-2true assume !false; 1035#L2414true cleanup_~__cil_tmp4~2 := ~cleanupTimeShifts~0 - 1; 880#L2417true assume cleanup_~i~3 < cleanup_~__cil_tmp4~2;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~3;havoc isBlocked_~retValue_acc~3;isBlocked_~retValue_acc~3 := 0;isBlocked_#res := isBlocked_~retValue_acc~3; 1794#L795true cleanup_#t~ret155 := isBlocked_#res;cleanup_~tmp___0~11 := cleanup_#t~ret155;havoc cleanup_#t~ret155; 1835#L2421true assume 1 != cleanup_~tmp___0~11; 1820#L2421-1true havoc isIdle_#res;havoc isIdle_#t~ret55, isIdle_~retValue_acc~10, isIdle_~tmp~10;havoc isIdle_~retValue_acc~10;havoc isIdle_~tmp~10;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret50, anyStopRequested_#t~ret51, anyStopRequested_#t~ret52, anyStopRequested_#t~ret53, anyStopRequested_#t~ret54, anyStopRequested_~retValue_acc~9, anyStopRequested_~tmp~9, anyStopRequested_~tmp___0~3, anyStopRequested_~tmp___1~3, anyStopRequested_~tmp___2~1, anyStopRequested_~tmp___3~1;havoc anyStopRequested_~retValue_acc~9;havoc anyStopRequested_~tmp~9;havoc anyStopRequested_~tmp___0~3;havoc anyStopRequested_~tmp___1~3;havoc anyStopRequested_~tmp___2~1;havoc anyStopRequested_~tmp___3~1;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 707#L2705-25true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 1788#L2732-25true anyStopRequested_#t~ret50 := isFloorCalling_#res;anyStopRequested_~tmp___3~1 := anyStopRequested_#t~ret50;havoc anyStopRequested_#t~ret50; 313#L1080true assume 0 != anyStopRequested_~tmp___3~1;anyStopRequested_~retValue_acc~9 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~9; 1817#L1144true isIdle_#t~ret55 := anyStopRequested_#res;isIdle_~tmp~10 := isIdle_#t~ret55;havoc isIdle_#t~ret55;isIdle_~retValue_acc~10 := (if 0 == isIdle_~tmp~10 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~10; 2307#L1157true cleanup_#t~ret156 := isIdle_#res;cleanup_~tmp~25 := cleanup_#t~ret156;havoc cleanup_#t~ret156; 2484#L2433true assume !(0 != cleanup_~tmp~25);havoc timeShift_#t~ret89, timeShift_#t~ret90, timeShift_#t~ret91, timeShift_#t~ret92, timeShift_#t~ret93, timeShift_#t~ret94, timeShift_#t~ret95, timeShift_#t~ret96, timeShift_#t~ret97, timeShift_#t~ret98, timeShift_#t~ret99, timeShift_~tmp~17, timeShift_~tmp___0~9, timeShift_~tmp___1~6, timeShift_~tmp___2~4, timeShift_~tmp___3~4, timeShift_~tmp___4~3, timeShift_~tmp___5~2, timeShift_~tmp___6~2, timeShift_~tmp___7~2, timeShift_~tmp___8~2, timeShift_~tmp___9~2;havoc timeShift_~tmp~17;havoc timeShift_~tmp___0~9;havoc timeShift_~tmp___1~6;havoc timeShift_~tmp___2~4;havoc timeShift_~tmp___3~4;havoc timeShift_~tmp___4~3;havoc timeShift_~tmp___5~2;havoc timeShift_~tmp___6~2;havoc timeShift_~tmp___7~2;havoc timeShift_~tmp___8~2;havoc timeShift_~tmp___9~2;havoc stopRequestedAtCurrentFloor_#res;havoc stopRequestedAtCurrentFloor_#t~ret73, stopRequestedAtCurrentFloor_#t~ret74, stopRequestedAtCurrentFloor_#t~ret75, stopRequestedAtCurrentFloor_#t~ret76, stopRequestedAtCurrentFloor_~retValue_acc~15, stopRequestedAtCurrentFloor_~tmp~15, stopRequestedAtCurrentFloor_~tmp___0~7;havoc stopRequestedAtCurrentFloor_~retValue_acc~15;havoc stopRequestedAtCurrentFloor_~tmp~15;havoc stopRequestedAtCurrentFloor_~tmp___0~7;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret147, isExecutiveFloorCalling_~retValue_acc~18;havoc isExecutiveFloorCalling_~retValue_acc~18;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 672#L2705-30true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 1779#L2732-30true isExecutiveFloorCalling_#t~ret147 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~18 := isExecutiveFloorCalling_#t~ret147;havoc isExecutiveFloorCalling_#t~ret147;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~18; 2398#L2256-3true stopRequestedAtCurrentFloor_#t~ret73 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~15 := stopRequestedAtCurrentFloor_#t~ret73;havoc stopRequestedAtCurrentFloor_#t~ret73; 2318#L1641-1true assume 0 != stopRequestedAtCurrentFloor_~tmp~15;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~4;havoc getCurrentFloorID_~retValue_acc~4;getCurrentFloorID_~retValue_acc~4 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~4; 1529#L972-4true stopRequestedAtCurrentFloor_#t~ret74 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~7 := stopRequestedAtCurrentFloor_#t~ret74;havoc stopRequestedAtCurrentFloor_#t~ret74; 2143#L1645-1true assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~7);stopRequestedAtCurrentFloor_~retValue_acc~15 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~15; 1343#L1658-1true timeShift_#t~ret89 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret89;havoc timeShift_#t~ret89; 1196#L1793-1true assume !(0 != timeShift_~tmp___9~2); 962#L1884-3true assume 1 == ~doorState~0;~doorState~0 := 0; 965#L1884-5true stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret67, stopRequestedInDirection_#t~ret68, stopRequestedInDirection_#t~ret69, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~12, stopRequestedInDirection_~tmp~12, stopRequestedInDirection_~tmp___0~5, stopRequestedInDirection_~__cil_tmp7~5, stopRequestedInDirection_~__cil_tmp8~5;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~12;havoc stopRequestedInDirection_~tmp~12;havoc stopRequestedInDirection_~tmp___0~5;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret147, isExecutiveFloorCalling_~retValue_acc~18;havoc isExecutiveFloorCalling_~retValue_acc~18;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 695#L2705-33true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 1784#L2732-33true isExecutiveFloorCalling_#t~ret147 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~18 := isExecutiveFloorCalling_#t~ret147;havoc isExecutiveFloorCalling_#t~ret147;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~18; 2402#L2256-4true stopRequestedInDirection_#t~ret67 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~5 := stopRequestedInDirection_#t~ret67;havoc stopRequestedInDirection_#t~ret67; 230#L1524-2true assume 0 != stopRequestedInDirection_~tmp___0~5;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~4;havoc getCurrentFloorID_~retValue_acc~4;getCurrentFloorID_~retValue_acc~4 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~4; 1531#L972-5true stopRequestedInDirection_#t~ret68 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~12 := stopRequestedInDirection_#t~ret68;havoc stopRequestedInDirection_#t~ret68;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~12 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~12 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~12; 2012#L1537-2true timeShift_#t~ret96 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret96;havoc timeShift_#t~ret96; 1854#L1892-1true assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret70, continueInDirection_~dir, continueInDirection_~tmp~13;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~13;~currentHeading~0 := continueInDirection_~dir; 2013#L1581-3true assume !(1 == ~currentHeading~0); 1541#L1591-9true assume 0 == ~currentFloorID~0;~currentHeading~0 := 1; 1543#L1591-11true assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 2303#L1597-11true havoc __utac_acc__Specification2_spec__3_#t~ret35, __utac_acc__Specification2_spec__3_#t~ret36, __utac_acc__Specification2_spec__3_#t~ret37, __utac_acc__Specification2_spec__3_#t~ret38, __utac_acc__Specification2_spec__3_#t~ret39, __utac_acc__Specification2_spec__3_#t~ret40, __utac_acc__Specification2_spec__3_~floor~0, __utac_acc__Specification2_spec__3_~tmp~3, __utac_acc__Specification2_spec__3_~tmp___0~0, __utac_acc__Specification2_spec__3_~tmp___1~0, __utac_acc__Specification2_spec__3_~tmp___2~0, __utac_acc__Specification2_spec__3_~tmp___3~0, __utac_acc__Specification2_spec__3_~tmp___4~0;havoc __utac_acc__Specification2_spec__3_~floor~0;havoc __utac_acc__Specification2_spec__3_~tmp~3;havoc __utac_acc__Specification2_spec__3_~tmp___0~0;havoc __utac_acc__Specification2_spec__3_~tmp___1~0;havoc __utac_acc__Specification2_spec__3_~tmp___2~0;havoc __utac_acc__Specification2_spec__3_~tmp___3~0;havoc __utac_acc__Specification2_spec__3_~tmp___4~0;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~4;havoc getCurrentFloorID_~retValue_acc~4;getCurrentFloorID_~retValue_acc~4 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~4; 1537#L972-7true __utac_acc__Specification2_spec__3_#t~ret35 := getCurrentFloorID_#res;__utac_acc__Specification2_spec__3_~tmp~3 := __utac_acc__Specification2_spec__3_#t~ret35;havoc __utac_acc__Specification2_spec__3_#t~ret35;__utac_acc__Specification2_spec__3_~floor~0 := __utac_acc__Specification2_spec__3_~tmp~3; 1447#L470-1true assume 0 == __utac_acc__Specification2_spec__3_~floor~0; 1386#L471-1true assume 0 != ~floorButtons_spc2_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~5;havoc areDoorsOpen_~retValue_acc~5;areDoorsOpen_~retValue_acc~5 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~5; 2295#L981-5true __utac_acc__Specification2_spec__3_#t~ret36 := areDoorsOpen_#res;__utac_acc__Specification2_spec__3_~tmp___4~0 := __utac_acc__Specification2_spec__3_#t~ret36;havoc __utac_acc__Specification2_spec__3_#t~ret36; 926#L475-2true assume 0 != __utac_acc__Specification2_spec__3_~tmp___4~0;~floorButtons_spc2_0~0 := 0; 1632#L530-1true cleanup_~i~3 := 1 + cleanup_~i~3; 935#L2413-2true [2019-01-14 04:01:58,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:01:58,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1955280990, now seen corresponding path program 1 times [2019-01-14 04:01:58,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:01:58,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:01:58,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:01:58,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:01:58,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:01:58,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:01:58,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:01:58,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:01:58,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:01:58,636 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:01:58,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:01:58,637 INFO L82 PathProgramCache]: Analyzing trace with hash 897008671, now seen corresponding path program 1 times [2019-01-14 04:01:58,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:01:58,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:01:58,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:01:58,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:01:58,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:01:58,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:01:58,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:01:58,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:01:58,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 04:01:58,838 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:01:58,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 04:01:58,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-14 04:01:58,854 INFO L87 Difference]: Start difference. First operand 2599 states. Second operand 7 states. [2019-01-14 04:02:01,862 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-14 04:02:08,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:02:08,335 INFO L93 Difference]: Finished difference Result 19811 states and 36972 transitions. [2019-01-14 04:02:08,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-14 04:02:08,338 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19811 states and 36972 transitions. [2019-01-14 04:02:08,618 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9532 [2019-01-14 04:02:08,816 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19811 states to 19671 states and 36816 transitions. [2019-01-14 04:02:08,817 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19671 [2019-01-14 04:02:08,856 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19671 [2019-01-14 04:02:08,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19671 states and 36816 transitions. [2019-01-14 04:02:08,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:02:08,917 INFO L706 BuchiCegarLoop]: Abstraction has 19671 states and 36816 transitions. [2019-01-14 04:02:08,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19671 states and 36816 transitions. [2019-01-14 04:02:09,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19671 to 7453. [2019-01-14 04:02:09,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7453 states. [2019-01-14 04:02:09,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7453 states to 7453 states and 13967 transitions. [2019-01-14 04:02:09,248 INFO L729 BuchiCegarLoop]: Abstraction has 7453 states and 13967 transitions. [2019-01-14 04:02:09,248 INFO L609 BuchiCegarLoop]: Abstraction has 7453 states and 13967 transitions. [2019-01-14 04:02:09,248 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:02:09,249 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7453 states and 13967 transitions. [2019-01-14 04:02:09,284 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3779 [2019-01-14 04:02:09,284 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:02:09,284 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:02:09,288 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:02:09,288 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:02:09,288 INFO L794 eck$LassoCheckResult]: Stem: 23440#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(30);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(9);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(21);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(30);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(9);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(21);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(30);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(9);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(25);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(25);~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~floorButtons_spc2_0~0 := 0;~floorButtons_spc2_1~0 := 0;~floorButtons_spc2_2~0 := 0;~floorButtons_spc2_3~0 := 0;~floorButtons_spc2_4~0 := 0;~cleanupTimeShifts~0 := 12;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0;call #t~string100.base, #t~string100.offset := #Ultimate.allocOnStack(10);call #t~string102.base, #t~string102.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string102.base, #t~string102.offset, 1);call write~init~int(95, #t~string102.base, 1 + #t~string102.offset, 1);call write~init~int(93, #t~string102.base, 2 + #t~string102.offset, 1);call write~init~int(0, #t~string102.base, 3 + #t~string102.offset, 1);call #t~string104.base, #t~string104.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string104.base, #t~string104.offset, 1);call write~init~int(93, #t~string104.base, 1 + #t~string104.offset, 1);call write~init~int(32, #t~string104.base, 2 + #t~string104.offset, 1);call write~init~int(0, #t~string104.base, 3 + #t~string104.offset, 1);call #t~string106.base, #t~string106.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string106.base, #t~string106.offset, 1);call write~init~int(97, #t~string106.base, 1 + #t~string106.offset, 1);call write~init~int(116, #t~string106.base, 2 + #t~string106.offset, 1);call write~init~int(32, #t~string106.base, 3 + #t~string106.offset, 1);call write~init~int(0, #t~string106.base, 4 + #t~string106.offset, 1);call #t~string108.base, #t~string108.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string108.base, #t~string108.offset, 1);call write~init~int(105, #t~string108.base, 1 + #t~string108.offset, 1);call write~init~int(0, #t~string108.base, 2 + #t~string108.offset, 1);call #t~string110.base, #t~string110.offset := #Ultimate.allocOnStack(10);call #t~string112.base, #t~string112.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string112.base, #t~string112.offset, 1);call write~init~int(112, #t~string112.base, 1 + #t~string112.offset, 1);call write~init~int(0, #t~string112.base, 2 + #t~string112.offset, 1);call #t~string114.base, #t~string114.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string114.base, #t~string114.offset, 1);call write~init~int(111, #t~string114.base, 1 + #t~string114.offset, 1);call write~init~int(119, #t~string114.base, 2 + #t~string114.offset, 1);call write~init~int(110, #t~string114.base, 3 + #t~string114.offset, 1);call write~init~int(0, #t~string114.base, 4 + #t~string114.offset, 1);call #t~string116.base, #t~string116.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string116.base, #t~string116.offset, 1);call write~init~int(73, #t~string116.base, 1 + #t~string116.offset, 1);call write~init~int(76, #t~string116.base, 2 + #t~string116.offset, 1);call write~init~int(95, #t~string116.base, 3 + #t~string116.offset, 1);call write~init~int(112, #t~string116.base, 4 + #t~string116.offset, 1);call write~init~int(58, #t~string116.base, 5 + #t~string116.offset, 1);call write~init~int(0, #t~string116.base, 6 + #t~string116.offset, 1);call #t~string118.base, #t~string118.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string118.base, #t~string118.offset, 1);call write~init~int(37, #t~string118.base, 1 + #t~string118.offset, 1);call write~init~int(105, #t~string118.base, 2 + #t~string118.offset, 1);call write~init~int(0, #t~string118.base, 3 + #t~string118.offset, 1);call #t~string120.base, #t~string120.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string120.base, #t~string120.offset, 1);call write~init~int(37, #t~string120.base, 1 + #t~string120.offset, 1);call write~init~int(105, #t~string120.base, 2 + #t~string120.offset, 1);call write~init~int(0, #t~string120.base, 3 + #t~string120.offset, 1);call #t~string122.base, #t~string122.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string122.base, #t~string122.offset, 1);call write~init~int(37, #t~string122.base, 1 + #t~string122.offset, 1);call write~init~int(105, #t~string122.base, 2 + #t~string122.offset, 1);call write~init~int(0, #t~string122.base, 3 + #t~string122.offset, 1);call #t~string124.base, #t~string124.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string124.base, #t~string124.offset, 1);call write~init~int(37, #t~string124.base, 1 + #t~string124.offset, 1);call write~init~int(105, #t~string124.base, 2 + #t~string124.offset, 1);call write~init~int(0, #t~string124.base, 3 + #t~string124.offset, 1);call #t~string126.base, #t~string126.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string126.base, #t~string126.offset, 1);call write~init~int(37, #t~string126.base, 1 + #t~string126.offset, 1);call write~init~int(105, #t~string126.base, 2 + #t~string126.offset, 1);call write~init~int(0, #t~string126.base, 3 + #t~string126.offset, 1);call #t~string128.base, #t~string128.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string128.base, #t~string128.offset, 1);call write~init~int(70, #t~string128.base, 1 + #t~string128.offset, 1);call write~init~int(95, #t~string128.base, 2 + #t~string128.offset, 1);call write~init~int(112, #t~string128.base, 3 + #t~string128.offset, 1);call write~init~int(58, #t~string128.base, 4 + #t~string128.offset, 1);call write~init~int(0, #t~string128.base, 5 + #t~string128.offset, 1);call #t~string131.base, #t~string131.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string131.base, #t~string131.offset, 1);call write~init~int(37, #t~string131.base, 1 + #t~string131.offset, 1);call write~init~int(105, #t~string131.base, 2 + #t~string131.offset, 1);call write~init~int(0, #t~string131.base, 3 + #t~string131.offset, 1);call #t~string134.base, #t~string134.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string134.base, #t~string134.offset, 1);call write~init~int(37, #t~string134.base, 1 + #t~string134.offset, 1);call write~init~int(105, #t~string134.base, 2 + #t~string134.offset, 1);call write~init~int(0, #t~string134.base, 3 + #t~string134.offset, 1);call #t~string137.base, #t~string137.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string137.base, #t~string137.offset, 1);call write~init~int(37, #t~string137.base, 1 + #t~string137.offset, 1);call write~init~int(105, #t~string137.base, 2 + #t~string137.offset, 1);call write~init~int(0, #t~string137.base, 3 + #t~string137.offset, 1);call #t~string140.base, #t~string140.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string140.base, #t~string140.offset, 1);call write~init~int(37, #t~string140.base, 1 + #t~string140.offset, 1);call write~init~int(105, #t~string140.base, 2 + #t~string140.offset, 1);call write~init~int(0, #t~string140.base, 3 + #t~string140.offset, 1);call #t~string143.base, #t~string143.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string143.base, #t~string143.offset, 1);call write~init~int(37, #t~string143.base, 1 + #t~string143.offset, 1);call write~init~int(105, #t~string143.base, 2 + #t~string143.offset, 1);call write~init~int(0, #t~string143.base, 3 + #t~string143.offset, 1);call #t~string145.base, #t~string145.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string145.base, #t~string145.offset, 1);call write~init~int(0, #t~string145.base, 1 + #t~string145.offset, 1);~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; 23441#L-1 havoc main_#res;havoc main_#t~ret161, main_~retValue_acc~21, main_~tmp~27;havoc main_~retValue_acc~21;havoc main_~tmp~27; 24327#L3424 havoc valid_product_#res;havoc valid_product_~retValue_acc~29;havoc valid_product_~retValue_acc~29;valid_product_~retValue_acc~29 := 1;valid_product_#res := valid_product_~retValue_acc~29; 24328#L3432 main_#t~ret161 := valid_product_#res;main_~tmp~27 := main_#t~ret161;havoc main_#t~ret161; 24866#L2609 assume 0 != main_~tmp~27; 22496#L2581 ~floorButtons_spc2_0~0 := 0;~floorButtons_spc2_1~0 := 0;~floorButtons_spc2_2~0 := 0;~floorButtons_spc2_3~0 := 0;~floorButtons_spc2_4~0 := 0; 22497#L425 havoc bigMacCall_#t~ret154, bigMacCall_~tmp~24;havoc bigMacCall_~tmp~24;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~26;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~26; 23037#L3327 assume 0 == getOrigin_~person;getOrigin_~retValue_acc~26 := 4;getOrigin_#res := getOrigin_~retValue_acc~26; 22644#L3352 bigMacCall_#t~ret154 := getOrigin_#res;bigMacCall_~tmp~24 := bigMacCall_#t~ret154;havoc bigMacCall_#t~ret154;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~24;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 23184#L2976 assume 0 == initPersonOnFloor_~floor; 22550#L2977 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 22551#L3084-1 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 23765#L2768 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 23766#L2780-2 havoc cleanup_#t~ret155, cleanup_#t~ret156, cleanup_~i~3, cleanup_~tmp~25, cleanup_~tmp___0~11, cleanup_~__cil_tmp4~2;havoc cleanup_~i~3;havoc cleanup_~tmp~25;havoc cleanup_~tmp___0~11;havoc cleanup_~__cil_tmp4~2;havoc timeShift_#t~ret89, timeShift_#t~ret90, timeShift_#t~ret91, timeShift_#t~ret92, timeShift_#t~ret93, timeShift_#t~ret94, timeShift_#t~ret95, timeShift_#t~ret96, timeShift_#t~ret97, timeShift_#t~ret98, timeShift_#t~ret99, timeShift_~tmp~17, timeShift_~tmp___0~9, timeShift_~tmp___1~6, timeShift_~tmp___2~4, timeShift_~tmp___3~4, timeShift_~tmp___4~3, timeShift_~tmp___5~2, timeShift_~tmp___6~2, timeShift_~tmp___7~2, timeShift_~tmp___8~2, timeShift_~tmp___9~2;havoc timeShift_~tmp~17;havoc timeShift_~tmp___0~9;havoc timeShift_~tmp___1~6;havoc timeShift_~tmp___2~4;havoc timeShift_~tmp___3~4;havoc timeShift_~tmp___4~3;havoc timeShift_~tmp___5~2;havoc timeShift_~tmp___6~2;havoc timeShift_~tmp___7~2;havoc timeShift_~tmp___8~2;havoc timeShift_~tmp___9~2;havoc stopRequestedAtCurrentFloor_#res;havoc stopRequestedAtCurrentFloor_#t~ret73, stopRequestedAtCurrentFloor_#t~ret74, stopRequestedAtCurrentFloor_#t~ret75, stopRequestedAtCurrentFloor_#t~ret76, stopRequestedAtCurrentFloor_~retValue_acc~15, stopRequestedAtCurrentFloor_~tmp~15, stopRequestedAtCurrentFloor_~tmp___0~7;havoc stopRequestedAtCurrentFloor_~retValue_acc~15;havoc stopRequestedAtCurrentFloor_~tmp~15;havoc stopRequestedAtCurrentFloor_~tmp___0~7;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret147, isExecutiveFloorCalling_~retValue_acc~18;havoc isExecutiveFloorCalling_~retValue_acc~18;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 23662#L2705 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 23663#L2732 isExecutiveFloorCalling_#t~ret147 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~18 := isExecutiveFloorCalling_#t~ret147;havoc isExecutiveFloorCalling_#t~ret147;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~18; 24609#L2256 stopRequestedAtCurrentFloor_#t~ret73 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~15 := stopRequestedAtCurrentFloor_#t~ret73;havoc stopRequestedAtCurrentFloor_#t~ret73; 25116#L1641 assume 0 != stopRequestedAtCurrentFloor_~tmp~15;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~4;havoc getCurrentFloorID_~retValue_acc~4;getCurrentFloorID_~retValue_acc~4 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~4; 25225#L972 stopRequestedAtCurrentFloor_#t~ret74 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~7 := stopRequestedAtCurrentFloor_#t~ret74;havoc stopRequestedAtCurrentFloor_#t~ret74; 24871#L1645 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~7);stopRequestedAtCurrentFloor_~retValue_acc~15 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~15; 24872#L1658 timeShift_#t~ret89 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret89;havoc timeShift_#t~ret89; 28678#L1793 assume !(0 != timeShift_~tmp___9~2); 28679#L1884 assume !(1 == ~doorState~0); 29729#L1884-2 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret67, stopRequestedInDirection_#t~ret68, stopRequestedInDirection_#t~ret69, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~12, stopRequestedInDirection_~tmp~12, stopRequestedInDirection_~tmp___0~5, stopRequestedInDirection_~__cil_tmp7~5, stopRequestedInDirection_~__cil_tmp8~5;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~12;havoc stopRequestedInDirection_~tmp~12;havoc stopRequestedInDirection_~tmp___0~5;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret147, isExecutiveFloorCalling_~retValue_acc~18;havoc isExecutiveFloorCalling_~retValue_acc~18;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 29728#L2705-3 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 29727#L2732-3 isExecutiveFloorCalling_#t~ret147 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~18 := isExecutiveFloorCalling_#t~ret147;havoc isExecutiveFloorCalling_#t~ret147;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~18; 29726#L2256-1 stopRequestedInDirection_#t~ret67 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~5 := stopRequestedInDirection_#t~ret67;havoc stopRequestedInDirection_#t~ret67; 29724#L1524 assume 0 != stopRequestedInDirection_~tmp___0~5;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~4;havoc getCurrentFloorID_~retValue_acc~4;getCurrentFloorID_~retValue_acc~4 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~4; 29725#L972-1 stopRequestedInDirection_#t~ret68 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~12 := stopRequestedInDirection_#t~ret68;havoc stopRequestedInDirection_#t~ret68;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~12 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~12 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~12; 29733#L1537 timeShift_#t~ret96 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret96;havoc timeShift_#t~ret96; 29731#L1892 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret70, continueInDirection_~dir, continueInDirection_~tmp~13;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~13;~currentHeading~0 := continueInDirection_~dir; 29730#L1581 assume !(1 == ~currentHeading~0); 24488#L1591 assume !(0 == ~currentFloorID~0); 24489#L1591-2 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 22836#L1597-5 havoc __utac_acc__Specification2_spec__3_#t~ret35, __utac_acc__Specification2_spec__3_#t~ret36, __utac_acc__Specification2_spec__3_#t~ret37, __utac_acc__Specification2_spec__3_#t~ret38, __utac_acc__Specification2_spec__3_#t~ret39, __utac_acc__Specification2_spec__3_#t~ret40, __utac_acc__Specification2_spec__3_~floor~0, __utac_acc__Specification2_spec__3_~tmp~3, __utac_acc__Specification2_spec__3_~tmp___0~0, __utac_acc__Specification2_spec__3_~tmp___1~0, __utac_acc__Specification2_spec__3_~tmp___2~0, __utac_acc__Specification2_spec__3_~tmp___3~0, __utac_acc__Specification2_spec__3_~tmp___4~0;havoc __utac_acc__Specification2_spec__3_~floor~0;havoc __utac_acc__Specification2_spec__3_~tmp~3;havoc __utac_acc__Specification2_spec__3_~tmp___0~0;havoc __utac_acc__Specification2_spec__3_~tmp___1~0;havoc __utac_acc__Specification2_spec__3_~tmp___2~0;havoc __utac_acc__Specification2_spec__3_~tmp___3~0;havoc __utac_acc__Specification2_spec__3_~tmp___4~0;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~4;havoc getCurrentFloorID_~retValue_acc~4;getCurrentFloorID_~retValue_acc~4 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~4; 24452#L972-3 __utac_acc__Specification2_spec__3_#t~ret35 := getCurrentFloorID_#res;__utac_acc__Specification2_spec__3_~tmp~3 := __utac_acc__Specification2_spec__3_#t~ret35;havoc __utac_acc__Specification2_spec__3_#t~ret35;__utac_acc__Specification2_spec__3_~floor~0 := __utac_acc__Specification2_spec__3_~tmp~3; 24365#L470 assume 0 == __utac_acc__Specification2_spec__3_~floor~0; 24356#L471 assume 0 != ~floorButtons_spc2_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~5;havoc areDoorsOpen_~retValue_acc~5;areDoorsOpen_~retValue_acc~5 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~5; 24357#L981 __utac_acc__Specification2_spec__3_#t~ret36 := areDoorsOpen_#res;__utac_acc__Specification2_spec__3_~tmp___4~0 := __utac_acc__Specification2_spec__3_#t~ret36;havoc __utac_acc__Specification2_spec__3_#t~ret36; 24009#L475 assume 0 != __utac_acc__Specification2_spec__3_~tmp___4~0;~floorButtons_spc2_0~0 := 0; 23257#L530 cleanup_~i~3 := 0; 23986#L2413-2 [2019-01-14 04:02:09,289 INFO L796 eck$LassoCheckResult]: Loop: 23986#L2413-2 assume !false; 23987#L2414 cleanup_~__cil_tmp4~2 := ~cleanupTimeShifts~0 - 1; 23890#L2417 assume cleanup_~i~3 < cleanup_~__cil_tmp4~2;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~3;havoc isBlocked_~retValue_acc~3;isBlocked_~retValue_acc~3 := 0;isBlocked_#res := isBlocked_~retValue_acc~3; 23891#L795 cleanup_#t~ret155 := isBlocked_#res;cleanup_~tmp___0~11 := cleanup_#t~ret155;havoc cleanup_#t~ret155; 24723#L2421 assume 1 != cleanup_~tmp___0~11; 24743#L2421-1 havoc isIdle_#res;havoc isIdle_#t~ret55, isIdle_~retValue_acc~10, isIdle_~tmp~10;havoc isIdle_~retValue_acc~10;havoc isIdle_~tmp~10;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret50, anyStopRequested_#t~ret51, anyStopRequested_#t~ret52, anyStopRequested_#t~ret53, anyStopRequested_#t~ret54, anyStopRequested_~retValue_acc~9, anyStopRequested_~tmp~9, anyStopRequested_~tmp___0~3, anyStopRequested_~tmp___1~3, anyStopRequested_~tmp___2~1, anyStopRequested_~tmp___3~1;havoc anyStopRequested_~retValue_acc~9;havoc anyStopRequested_~tmp~9;havoc anyStopRequested_~tmp___0~3;havoc anyStopRequested_~tmp___1~3;havoc anyStopRequested_~tmp___2~1;havoc anyStopRequested_~tmp___3~1;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 23587#L2705-25 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 23588#L2732-25 anyStopRequested_#t~ret50 := isFloorCalling_#res;anyStopRequested_~tmp___3~1 := anyStopRequested_#t~ret50;havoc anyStopRequested_#t~ret50; 23110#L1080 assume 0 != anyStopRequested_~tmp___3~1;anyStopRequested_~retValue_acc~9 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~9; 22915#L1144 isIdle_#t~ret55 := anyStopRequested_#res;isIdle_~tmp~10 := isIdle_#t~ret55;havoc isIdle_#t~ret55;isIdle_~retValue_acc~10 := (if 0 == isIdle_~tmp~10 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~10; 24741#L1157 cleanup_#t~ret156 := isIdle_#res;cleanup_~tmp~25 := cleanup_#t~ret156;havoc cleanup_#t~ret156; 25026#L2433 assume !(0 != cleanup_~tmp~25);havoc timeShift_#t~ret89, timeShift_#t~ret90, timeShift_#t~ret91, timeShift_#t~ret92, timeShift_#t~ret93, timeShift_#t~ret94, timeShift_#t~ret95, timeShift_#t~ret96, timeShift_#t~ret97, timeShift_#t~ret98, timeShift_#t~ret99, timeShift_~tmp~17, timeShift_~tmp___0~9, timeShift_~tmp___1~6, timeShift_~tmp___2~4, timeShift_~tmp___3~4, timeShift_~tmp___4~3, timeShift_~tmp___5~2, timeShift_~tmp___6~2, timeShift_~tmp___7~2, timeShift_~tmp___8~2, timeShift_~tmp___9~2;havoc timeShift_~tmp~17;havoc timeShift_~tmp___0~9;havoc timeShift_~tmp___1~6;havoc timeShift_~tmp___2~4;havoc timeShift_~tmp___3~4;havoc timeShift_~tmp___4~3;havoc timeShift_~tmp___5~2;havoc timeShift_~tmp___6~2;havoc timeShift_~tmp___7~2;havoc timeShift_~tmp___8~2;havoc timeShift_~tmp___9~2;havoc stopRequestedAtCurrentFloor_#res;havoc stopRequestedAtCurrentFloor_#t~ret73, stopRequestedAtCurrentFloor_#t~ret74, stopRequestedAtCurrentFloor_#t~ret75, stopRequestedAtCurrentFloor_#t~ret76, stopRequestedAtCurrentFloor_~retValue_acc~15, stopRequestedAtCurrentFloor_~tmp~15, stopRequestedAtCurrentFloor_~tmp___0~7;havoc stopRequestedAtCurrentFloor_~retValue_acc~15;havoc stopRequestedAtCurrentFloor_~tmp~15;havoc stopRequestedAtCurrentFloor_~tmp___0~7;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret147, isExecutiveFloorCalling_~retValue_acc~18;havoc isExecutiveFloorCalling_~retValue_acc~18;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 25282#L2705-30 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 25151#L2732-30 isExecutiveFloorCalling_#t~ret147 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~18 := isExecutiveFloorCalling_#t~ret147;havoc isExecutiveFloorCalling_#t~ret147;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~18; 25268#L2256-3 stopRequestedAtCurrentFloor_#t~ret73 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~15 := stopRequestedAtCurrentFloor_#t~ret73;havoc stopRequestedAtCurrentFloor_#t~ret73; 25209#L1641-1 assume 0 != stopRequestedAtCurrentFloor_~tmp~15;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~4;havoc getCurrentFloorID_~retValue_acc~4;getCurrentFloorID_~retValue_acc~4 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~4; 25208#L972-4 stopRequestedAtCurrentFloor_#t~ret74 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~7 := stopRequestedAtCurrentFloor_#t~ret74;havoc stopRequestedAtCurrentFloor_#t~ret74; 25207#L1645-1 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~7);stopRequestedAtCurrentFloor_~retValue_acc~15 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~15; 24877#L1658-1 timeShift_#t~ret89 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret89;havoc timeShift_#t~ret89; 29245#L1793-1 assume !(0 != timeShift_~tmp___9~2); 29246#L1884-3 assume 1 == ~doorState~0;~doorState~0 := 0; 29820#L1884-5 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret67, stopRequestedInDirection_#t~ret68, stopRequestedInDirection_#t~ret69, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~12, stopRequestedInDirection_~tmp~12, stopRequestedInDirection_~tmp___0~5, stopRequestedInDirection_~__cil_tmp7~5, stopRequestedInDirection_~__cil_tmp8~5;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~12;havoc stopRequestedInDirection_~tmp~12;havoc stopRequestedInDirection_~tmp___0~5;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret147, isExecutiveFloorCalling_~retValue_acc~18;havoc isExecutiveFloorCalling_~retValue_acc~18;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 29819#L2705-33 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 29818#L2732-33 isExecutiveFloorCalling_#t~ret147 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~18 := isExecutiveFloorCalling_#t~ret147;havoc isExecutiveFloorCalling_#t~ret147;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~18; 29817#L2256-4 stopRequestedInDirection_#t~ret67 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~5 := stopRequestedInDirection_#t~ret67;havoc stopRequestedInDirection_#t~ret67; 23011#L1524-2 assume 0 != stopRequestedInDirection_~tmp___0~5;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~4;havoc getCurrentFloorID_~retValue_acc~4;getCurrentFloorID_~retValue_acc~4 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~4; 23012#L972-5 stopRequestedInDirection_#t~ret68 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~12 := stopRequestedInDirection_#t~ret68;havoc stopRequestedInDirection_#t~ret68;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~12 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~12 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~12; 24851#L1537-2 timeShift_#t~ret96 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret96;havoc timeShift_#t~ret96; 24852#L1892-1 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret70, continueInDirection_~dir, continueInDirection_~tmp~13;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~13;~currentHeading~0 := continueInDirection_~dir; 29815#L1581-3 assume !(1 == ~currentHeading~0); 24469#L1591-9 assume !(0 == ~currentFloorID~0); 24470#L1591-11 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 22866#L1597-11 havoc __utac_acc__Specification2_spec__3_#t~ret35, __utac_acc__Specification2_spec__3_#t~ret36, __utac_acc__Specification2_spec__3_#t~ret37, __utac_acc__Specification2_spec__3_#t~ret38, __utac_acc__Specification2_spec__3_#t~ret39, __utac_acc__Specification2_spec__3_#t~ret40, __utac_acc__Specification2_spec__3_~floor~0, __utac_acc__Specification2_spec__3_~tmp~3, __utac_acc__Specification2_spec__3_~tmp___0~0, __utac_acc__Specification2_spec__3_~tmp___1~0, __utac_acc__Specification2_spec__3_~tmp___2~0, __utac_acc__Specification2_spec__3_~tmp___3~0, __utac_acc__Specification2_spec__3_~tmp___4~0;havoc __utac_acc__Specification2_spec__3_~floor~0;havoc __utac_acc__Specification2_spec__3_~tmp~3;havoc __utac_acc__Specification2_spec__3_~tmp___0~0;havoc __utac_acc__Specification2_spec__3_~tmp___1~0;havoc __utac_acc__Specification2_spec__3_~tmp___2~0;havoc __utac_acc__Specification2_spec__3_~tmp___3~0;havoc __utac_acc__Specification2_spec__3_~tmp___4~0;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~4;havoc getCurrentFloorID_~retValue_acc~4;getCurrentFloorID_~retValue_acc~4 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~4; 24465#L972-7 __utac_acc__Specification2_spec__3_#t~ret35 := getCurrentFloorID_#res;__utac_acc__Specification2_spec__3_~tmp~3 := __utac_acc__Specification2_spec__3_#t~ret35;havoc __utac_acc__Specification2_spec__3_#t~ret35;__utac_acc__Specification2_spec__3_~floor~0 := __utac_acc__Specification2_spec__3_~tmp~3; 24366#L470-1 assume 0 == __utac_acc__Specification2_spec__3_~floor~0; 24358#L471-1 assume 0 != ~floorButtons_spc2_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~5;havoc areDoorsOpen_~retValue_acc~5;areDoorsOpen_~retValue_acc~5 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~5; 24359#L981-5 __utac_acc__Specification2_spec__3_#t~ret36 := areDoorsOpen_#res;__utac_acc__Specification2_spec__3_~tmp___4~0 := __utac_acc__Specification2_spec__3_#t~ret36;havoc __utac_acc__Specification2_spec__3_#t~ret36; 23975#L475-2 assume 0 != __utac_acc__Specification2_spec__3_~tmp___4~0;~floorButtons_spc2_0~0 := 0; 23265#L530-1 cleanup_~i~3 := 1 + cleanup_~i~3; 23986#L2413-2 [2019-01-14 04:02:09,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:02:09,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1955280990, now seen corresponding path program 2 times [2019-01-14 04:02:09,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:02:09,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:02:09,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:02:09,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:02:09,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:02:09,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:02:09,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:02:09,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:02:09,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:02:09,410 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:02:09,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:02:09,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1577067041, now seen corresponding path program 1 times [2019-01-14 04:02:09,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:02:09,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:02:09,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:02:09,412 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:02:09,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:02:09,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:02:09,675 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 3 [2019-01-14 04:02:09,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:02:09,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:02:09,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 04:02:09,686 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:02:09,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:02:09,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:02:09,688 INFO L87 Difference]: Start difference. First operand 7453 states and 13967 transitions. cyclomatic complexity: 6516 Second operand 5 states. [2019-01-14 04:02:10,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:02:10,455 INFO L93 Difference]: Finished difference Result 22510 states and 41941 transitions. [2019-01-14 04:02:10,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 04:02:10,457 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22510 states and 41941 transitions. [2019-01-14 04:02:10,584 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17868 [2019-01-14 04:02:10,702 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22510 states to 22510 states and 41941 transitions. [2019-01-14 04:02:10,702 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22510 [2019-01-14 04:02:10,729 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22510 [2019-01-14 04:02:10,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22510 states and 41941 transitions. [2019-01-14 04:02:10,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:02:10,764 INFO L706 BuchiCegarLoop]: Abstraction has 22510 states and 41941 transitions. [2019-01-14 04:02:10,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22510 states and 41941 transitions. [2019-01-14 04:02:11,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22510 to 9366. [2019-01-14 04:02:11,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9366 states. [2019-01-14 04:02:11,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9366 states to 9366 states and 17434 transitions. [2019-01-14 04:02:11,047 INFO L729 BuchiCegarLoop]: Abstraction has 9366 states and 17434 transitions. [2019-01-14 04:02:11,047 INFO L609 BuchiCegarLoop]: Abstraction has 9366 states and 17434 transitions. [2019-01-14 04:02:11,047 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:02:11,048 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9366 states and 17434 transitions. [2019-01-14 04:02:11,092 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4823 [2019-01-14 04:02:11,093 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:02:11,093 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:02:11,097 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:02:11,097 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:02:11,098 INFO L794 eck$LassoCheckResult]: Stem: 53425#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(30);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(9);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(21);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(30);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(9);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(21);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(30);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(9);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(25);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(25);~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~floorButtons_spc2_0~0 := 0;~floorButtons_spc2_1~0 := 0;~floorButtons_spc2_2~0 := 0;~floorButtons_spc2_3~0 := 0;~floorButtons_spc2_4~0 := 0;~cleanupTimeShifts~0 := 12;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0;call #t~string100.base, #t~string100.offset := #Ultimate.allocOnStack(10);call #t~string102.base, #t~string102.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string102.base, #t~string102.offset, 1);call write~init~int(95, #t~string102.base, 1 + #t~string102.offset, 1);call write~init~int(93, #t~string102.base, 2 + #t~string102.offset, 1);call write~init~int(0, #t~string102.base, 3 + #t~string102.offset, 1);call #t~string104.base, #t~string104.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string104.base, #t~string104.offset, 1);call write~init~int(93, #t~string104.base, 1 + #t~string104.offset, 1);call write~init~int(32, #t~string104.base, 2 + #t~string104.offset, 1);call write~init~int(0, #t~string104.base, 3 + #t~string104.offset, 1);call #t~string106.base, #t~string106.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string106.base, #t~string106.offset, 1);call write~init~int(97, #t~string106.base, 1 + #t~string106.offset, 1);call write~init~int(116, #t~string106.base, 2 + #t~string106.offset, 1);call write~init~int(32, #t~string106.base, 3 + #t~string106.offset, 1);call write~init~int(0, #t~string106.base, 4 + #t~string106.offset, 1);call #t~string108.base, #t~string108.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string108.base, #t~string108.offset, 1);call write~init~int(105, #t~string108.base, 1 + #t~string108.offset, 1);call write~init~int(0, #t~string108.base, 2 + #t~string108.offset, 1);call #t~string110.base, #t~string110.offset := #Ultimate.allocOnStack(10);call #t~string112.base, #t~string112.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string112.base, #t~string112.offset, 1);call write~init~int(112, #t~string112.base, 1 + #t~string112.offset, 1);call write~init~int(0, #t~string112.base, 2 + #t~string112.offset, 1);call #t~string114.base, #t~string114.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string114.base, #t~string114.offset, 1);call write~init~int(111, #t~string114.base, 1 + #t~string114.offset, 1);call write~init~int(119, #t~string114.base, 2 + #t~string114.offset, 1);call write~init~int(110, #t~string114.base, 3 + #t~string114.offset, 1);call write~init~int(0, #t~string114.base, 4 + #t~string114.offset, 1);call #t~string116.base, #t~string116.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string116.base, #t~string116.offset, 1);call write~init~int(73, #t~string116.base, 1 + #t~string116.offset, 1);call write~init~int(76, #t~string116.base, 2 + #t~string116.offset, 1);call write~init~int(95, #t~string116.base, 3 + #t~string116.offset, 1);call write~init~int(112, #t~string116.base, 4 + #t~string116.offset, 1);call write~init~int(58, #t~string116.base, 5 + #t~string116.offset, 1);call write~init~int(0, #t~string116.base, 6 + #t~string116.offset, 1);call #t~string118.base, #t~string118.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string118.base, #t~string118.offset, 1);call write~init~int(37, #t~string118.base, 1 + #t~string118.offset, 1);call write~init~int(105, #t~string118.base, 2 + #t~string118.offset, 1);call write~init~int(0, #t~string118.base, 3 + #t~string118.offset, 1);call #t~string120.base, #t~string120.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string120.base, #t~string120.offset, 1);call write~init~int(37, #t~string120.base, 1 + #t~string120.offset, 1);call write~init~int(105, #t~string120.base, 2 + #t~string120.offset, 1);call write~init~int(0, #t~string120.base, 3 + #t~string120.offset, 1);call #t~string122.base, #t~string122.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string122.base, #t~string122.offset, 1);call write~init~int(37, #t~string122.base, 1 + #t~string122.offset, 1);call write~init~int(105, #t~string122.base, 2 + #t~string122.offset, 1);call write~init~int(0, #t~string122.base, 3 + #t~string122.offset, 1);call #t~string124.base, #t~string124.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string124.base, #t~string124.offset, 1);call write~init~int(37, #t~string124.base, 1 + #t~string124.offset, 1);call write~init~int(105, #t~string124.base, 2 + #t~string124.offset, 1);call write~init~int(0, #t~string124.base, 3 + #t~string124.offset, 1);call #t~string126.base, #t~string126.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string126.base, #t~string126.offset, 1);call write~init~int(37, #t~string126.base, 1 + #t~string126.offset, 1);call write~init~int(105, #t~string126.base, 2 + #t~string126.offset, 1);call write~init~int(0, #t~string126.base, 3 + #t~string126.offset, 1);call #t~string128.base, #t~string128.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string128.base, #t~string128.offset, 1);call write~init~int(70, #t~string128.base, 1 + #t~string128.offset, 1);call write~init~int(95, #t~string128.base, 2 + #t~string128.offset, 1);call write~init~int(112, #t~string128.base, 3 + #t~string128.offset, 1);call write~init~int(58, #t~string128.base, 4 + #t~string128.offset, 1);call write~init~int(0, #t~string128.base, 5 + #t~string128.offset, 1);call #t~string131.base, #t~string131.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string131.base, #t~string131.offset, 1);call write~init~int(37, #t~string131.base, 1 + #t~string131.offset, 1);call write~init~int(105, #t~string131.base, 2 + #t~string131.offset, 1);call write~init~int(0, #t~string131.base, 3 + #t~string131.offset, 1);call #t~string134.base, #t~string134.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string134.base, #t~string134.offset, 1);call write~init~int(37, #t~string134.base, 1 + #t~string134.offset, 1);call write~init~int(105, #t~string134.base, 2 + #t~string134.offset, 1);call write~init~int(0, #t~string134.base, 3 + #t~string134.offset, 1);call #t~string137.base, #t~string137.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string137.base, #t~string137.offset, 1);call write~init~int(37, #t~string137.base, 1 + #t~string137.offset, 1);call write~init~int(105, #t~string137.base, 2 + #t~string137.offset, 1);call write~init~int(0, #t~string137.base, 3 + #t~string137.offset, 1);call #t~string140.base, #t~string140.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string140.base, #t~string140.offset, 1);call write~init~int(37, #t~string140.base, 1 + #t~string140.offset, 1);call write~init~int(105, #t~string140.base, 2 + #t~string140.offset, 1);call write~init~int(0, #t~string140.base, 3 + #t~string140.offset, 1);call #t~string143.base, #t~string143.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string143.base, #t~string143.offset, 1);call write~init~int(37, #t~string143.base, 1 + #t~string143.offset, 1);call write~init~int(105, #t~string143.base, 2 + #t~string143.offset, 1);call write~init~int(0, #t~string143.base, 3 + #t~string143.offset, 1);call #t~string145.base, #t~string145.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string145.base, #t~string145.offset, 1);call write~init~int(0, #t~string145.base, 1 + #t~string145.offset, 1);~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; 53426#L-1 havoc main_#res;havoc main_#t~ret161, main_~retValue_acc~21, main_~tmp~27;havoc main_~retValue_acc~21;havoc main_~tmp~27; 54340#L3424 havoc valid_product_#res;havoc valid_product_~retValue_acc~29;havoc valid_product_~retValue_acc~29;valid_product_~retValue_acc~29 := 1;valid_product_#res := valid_product_~retValue_acc~29; 54341#L3432 main_#t~ret161 := valid_product_#res;main_~tmp~27 := main_#t~ret161;havoc main_#t~ret161; 54977#L2609 assume 0 != main_~tmp~27; 52478#L2581 ~floorButtons_spc2_0~0 := 0;~floorButtons_spc2_1~0 := 0;~floorButtons_spc2_2~0 := 0;~floorButtons_spc2_3~0 := 0;~floorButtons_spc2_4~0 := 0; 52479#L425 havoc bigMacCall_#t~ret154, bigMacCall_~tmp~24;havoc bigMacCall_~tmp~24;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~26;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~26; 53020#L3327 assume 0 == getOrigin_~person;getOrigin_~retValue_acc~26 := 4;getOrigin_#res := getOrigin_~retValue_acc~26; 52629#L3352 bigMacCall_#t~ret154 := getOrigin_#res;bigMacCall_~tmp~24 := bigMacCall_#t~ret154;havoc bigMacCall_#t~ret154;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~24;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 53167#L2976 assume 0 == initPersonOnFloor_~floor; 52532#L2977 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 52533#L3084-1 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 53767#L2768 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 53768#L2780-2 havoc cleanup_#t~ret155, cleanup_#t~ret156, cleanup_~i~3, cleanup_~tmp~25, cleanup_~tmp___0~11, cleanup_~__cil_tmp4~2;havoc cleanup_~i~3;havoc cleanup_~tmp~25;havoc cleanup_~tmp___0~11;havoc cleanup_~__cil_tmp4~2;havoc timeShift_#t~ret89, timeShift_#t~ret90, timeShift_#t~ret91, timeShift_#t~ret92, timeShift_#t~ret93, timeShift_#t~ret94, timeShift_#t~ret95, timeShift_#t~ret96, timeShift_#t~ret97, timeShift_#t~ret98, timeShift_#t~ret99, timeShift_~tmp~17, timeShift_~tmp___0~9, timeShift_~tmp___1~6, timeShift_~tmp___2~4, timeShift_~tmp___3~4, timeShift_~tmp___4~3, timeShift_~tmp___5~2, timeShift_~tmp___6~2, timeShift_~tmp___7~2, timeShift_~tmp___8~2, timeShift_~tmp___9~2;havoc timeShift_~tmp~17;havoc timeShift_~tmp___0~9;havoc timeShift_~tmp___1~6;havoc timeShift_~tmp___2~4;havoc timeShift_~tmp___3~4;havoc timeShift_~tmp___4~3;havoc timeShift_~tmp___5~2;havoc timeShift_~tmp___6~2;havoc timeShift_~tmp___7~2;havoc timeShift_~tmp___8~2;havoc timeShift_~tmp___9~2;havoc stopRequestedAtCurrentFloor_#res;havoc stopRequestedAtCurrentFloor_#t~ret73, stopRequestedAtCurrentFloor_#t~ret74, stopRequestedAtCurrentFloor_#t~ret75, stopRequestedAtCurrentFloor_#t~ret76, stopRequestedAtCurrentFloor_~retValue_acc~15, stopRequestedAtCurrentFloor_~tmp~15, stopRequestedAtCurrentFloor_~tmp___0~7;havoc stopRequestedAtCurrentFloor_~retValue_acc~15;havoc stopRequestedAtCurrentFloor_~tmp~15;havoc stopRequestedAtCurrentFloor_~tmp___0~7;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret147, isExecutiveFloorCalling_~retValue_acc~18;havoc isExecutiveFloorCalling_~retValue_acc~18;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 53659#L2705 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 53660#L2732 isExecutiveFloorCalling_#t~ret147 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~18 := isExecutiveFloorCalling_#t~ret147;havoc isExecutiveFloorCalling_#t~ret147;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~18; 54669#L2256 stopRequestedAtCurrentFloor_#t~ret73 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~15 := stopRequestedAtCurrentFloor_#t~ret73;havoc stopRequestedAtCurrentFloor_#t~ret73; 55183#L1641 assume 0 != stopRequestedAtCurrentFloor_~tmp~15;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~4;havoc getCurrentFloorID_~retValue_acc~4;getCurrentFloorID_~retValue_acc~4 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~4; 54750#L972 stopRequestedAtCurrentFloor_#t~ret74 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~7 := stopRequestedAtCurrentFloor_#t~ret74;havoc stopRequestedAtCurrentFloor_#t~ret74; 54751#L1645 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~7);stopRequestedAtCurrentFloor_~retValue_acc~15 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~15; 54985#L1658 timeShift_#t~ret89 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret89;havoc timeShift_#t~ret89; 54267#L1793 assume !(0 != timeShift_~tmp___9~2); 54269#L1884 assume !(1 == ~doorState~0); 55501#L1884-2 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret67, stopRequestedInDirection_#t~ret68, stopRequestedInDirection_#t~ret69, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~12, stopRequestedInDirection_~tmp~12, stopRequestedInDirection_~tmp___0~5, stopRequestedInDirection_~__cil_tmp7~5, stopRequestedInDirection_~__cil_tmp8~5;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~12;havoc stopRequestedInDirection_~tmp~12;havoc stopRequestedInDirection_~tmp___0~5;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret147, isExecutiveFloorCalling_~retValue_acc~18;havoc isExecutiveFloorCalling_~retValue_acc~18;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 59279#L2705-3 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 59278#L2732-3 isExecutiveFloorCalling_#t~ret147 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~18 := isExecutiveFloorCalling_#t~ret147;havoc isExecutiveFloorCalling_#t~ret147;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~18; 59277#L2256-1 stopRequestedInDirection_#t~ret67 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~5 := stopRequestedInDirection_#t~ret67;havoc stopRequestedInDirection_#t~ret67; 59276#L1524 assume 0 != stopRequestedInDirection_~tmp___0~5;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~4;havoc getCurrentFloorID_~retValue_acc~4;getCurrentFloorID_~retValue_acc~4 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~4; 59164#L972-1 stopRequestedInDirection_#t~ret68 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~12 := stopRequestedInDirection_#t~ret68;havoc stopRequestedInDirection_#t~ret68;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~12 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~12 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~12; 59163#L1537 timeShift_#t~ret96 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret96;havoc timeShift_#t~ret96; 59162#L1892 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret70, continueInDirection_~dir, continueInDirection_~tmp~13;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~13;~currentHeading~0 := continueInDirection_~dir; 54961#L1581 assume !(1 == ~currentHeading~0); 54962#L1591 assume !(0 == ~currentFloorID~0); 54541#L1591-2 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 52815#L1597-5 havoc __utac_acc__Specification2_spec__3_#t~ret35, __utac_acc__Specification2_spec__3_#t~ret36, __utac_acc__Specification2_spec__3_#t~ret37, __utac_acc__Specification2_spec__3_#t~ret38, __utac_acc__Specification2_spec__3_#t~ret39, __utac_acc__Specification2_spec__3_#t~ret40, __utac_acc__Specification2_spec__3_~floor~0, __utac_acc__Specification2_spec__3_~tmp~3, __utac_acc__Specification2_spec__3_~tmp___0~0, __utac_acc__Specification2_spec__3_~tmp___1~0, __utac_acc__Specification2_spec__3_~tmp___2~0, __utac_acc__Specification2_spec__3_~tmp___3~0, __utac_acc__Specification2_spec__3_~tmp___4~0;havoc __utac_acc__Specification2_spec__3_~floor~0;havoc __utac_acc__Specification2_spec__3_~tmp~3;havoc __utac_acc__Specification2_spec__3_~tmp___0~0;havoc __utac_acc__Specification2_spec__3_~tmp___1~0;havoc __utac_acc__Specification2_spec__3_~tmp___2~0;havoc __utac_acc__Specification2_spec__3_~tmp___3~0;havoc __utac_acc__Specification2_spec__3_~tmp___4~0;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~4;havoc getCurrentFloorID_~retValue_acc~4;getCurrentFloorID_~retValue_acc~4 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~4; 54495#L972-3 __utac_acc__Specification2_spec__3_#t~ret35 := getCurrentFloorID_#res;__utac_acc__Specification2_spec__3_~tmp~3 := __utac_acc__Specification2_spec__3_#t~ret35;havoc __utac_acc__Specification2_spec__3_#t~ret35;__utac_acc__Specification2_spec__3_~floor~0 := __utac_acc__Specification2_spec__3_~tmp~3; 54496#L470 assume 0 == __utac_acc__Specification2_spec__3_~floor~0; 54383#L471 assume 0 != ~floorButtons_spc2_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~5;havoc areDoorsOpen_~retValue_acc~5;areDoorsOpen_~retValue_acc~5 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~5; 54385#L981 __utac_acc__Specification2_spec__3_#t~ret36 := areDoorsOpen_#res;__utac_acc__Specification2_spec__3_~tmp___4~0 := __utac_acc__Specification2_spec__3_#t~ret36;havoc __utac_acc__Specification2_spec__3_#t~ret36; 59117#L475 assume 0 != __utac_acc__Specification2_spec__3_~tmp___4~0;~floorButtons_spc2_0~0 := 0; 54638#L530 cleanup_~i~3 := 0; 53984#L2413-2 [2019-01-14 04:02:11,098 INFO L796 eck$LassoCheckResult]: Loop: 53984#L2413-2 assume !false; 53985#L2414 cleanup_~__cil_tmp4~2 := ~cleanupTimeShifts~0 - 1; 60903#L2417 assume cleanup_~i~3 < cleanup_~__cil_tmp4~2;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~3;havoc isBlocked_~retValue_acc~3;isBlocked_~retValue_acc~3 := 0;isBlocked_#res := isBlocked_~retValue_acc~3; 60902#L795 cleanup_#t~ret155 := isBlocked_#res;cleanup_~tmp___0~11 := cleanup_#t~ret155;havoc cleanup_#t~ret155; 60901#L2421 assume 1 != cleanup_~tmp___0~11; 54832#L2421-1 havoc isIdle_#res;havoc isIdle_#t~ret55, isIdle_~retValue_acc~10, isIdle_~tmp~10;havoc isIdle_~retValue_acc~10;havoc isIdle_~tmp~10;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret50, anyStopRequested_#t~ret51, anyStopRequested_#t~ret52, anyStopRequested_#t~ret53, anyStopRequested_#t~ret54, anyStopRequested_~retValue_acc~9, anyStopRequested_~tmp~9, anyStopRequested_~tmp___0~3, anyStopRequested_~tmp___1~3, anyStopRequested_~tmp___2~1, anyStopRequested_~tmp___3~1;havoc anyStopRequested_~retValue_acc~9;havoc anyStopRequested_~tmp~9;havoc anyStopRequested_~tmp___0~3;havoc anyStopRequested_~tmp___1~3;havoc anyStopRequested_~tmp___2~1;havoc anyStopRequested_~tmp___3~1;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 53579#L2705-25 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 53580#L2732-25 anyStopRequested_#t~ret50 := isFloorCalling_#res;anyStopRequested_~tmp___3~1 := anyStopRequested_#t~ret50;havoc anyStopRequested_#t~ret50; 53093#L1080 assume 0 != anyStopRequested_~tmp___3~1;anyStopRequested_~retValue_acc~9 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~9; 52894#L1144 isIdle_#t~ret55 := anyStopRequested_#res;isIdle_~tmp~10 := isIdle_#t~ret55;havoc isIdle_#t~ret55;isIdle_~retValue_acc~10 := (if 0 == isIdle_~tmp~10 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~10; 54830#L1157 cleanup_#t~ret156 := isIdle_#res;cleanup_~tmp~25 := cleanup_#t~ret156;havoc cleanup_#t~ret156; 55174#L2433 assume !(0 != cleanup_~tmp~25);havoc timeShift_#t~ret89, timeShift_#t~ret90, timeShift_#t~ret91, timeShift_#t~ret92, timeShift_#t~ret93, timeShift_#t~ret94, timeShift_#t~ret95, timeShift_#t~ret96, timeShift_#t~ret97, timeShift_#t~ret98, timeShift_#t~ret99, timeShift_~tmp~17, timeShift_~tmp___0~9, timeShift_~tmp___1~6, timeShift_~tmp___2~4, timeShift_~tmp___3~4, timeShift_~tmp___4~3, timeShift_~tmp___5~2, timeShift_~tmp___6~2, timeShift_~tmp___7~2, timeShift_~tmp___8~2, timeShift_~tmp___9~2;havoc timeShift_~tmp~17;havoc timeShift_~tmp___0~9;havoc timeShift_~tmp___1~6;havoc timeShift_~tmp___2~4;havoc timeShift_~tmp___3~4;havoc timeShift_~tmp___4~3;havoc timeShift_~tmp___5~2;havoc timeShift_~tmp___6~2;havoc timeShift_~tmp___7~2;havoc timeShift_~tmp___8~2;havoc timeShift_~tmp___9~2;havoc stopRequestedAtCurrentFloor_#res;havoc stopRequestedAtCurrentFloor_#t~ret73, stopRequestedAtCurrentFloor_#t~ret74, stopRequestedAtCurrentFloor_#t~ret75, stopRequestedAtCurrentFloor_#t~ret76, stopRequestedAtCurrentFloor_~retValue_acc~15, stopRequestedAtCurrentFloor_~tmp~15, stopRequestedAtCurrentFloor_~tmp___0~7;havoc stopRequestedAtCurrentFloor_~retValue_acc~15;havoc stopRequestedAtCurrentFloor_~tmp~15;havoc stopRequestedAtCurrentFloor_~tmp___0~7;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret147, isExecutiveFloorCalling_~retValue_acc~18;havoc isExecutiveFloorCalling_~retValue_acc~18;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 55299#L2705-30 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 57745#L2732-30 isExecutiveFloorCalling_#t~ret147 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~18 := isExecutiveFloorCalling_#t~ret147;havoc isExecutiveFloorCalling_#t~ret147;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~18; 59114#L2256-3 stopRequestedAtCurrentFloor_#t~ret73 := isExecutiveFloorCalling_#res;stopRequestedAtCurrentFloor_~tmp~15 := stopRequestedAtCurrentFloor_#t~ret73;havoc stopRequestedAtCurrentFloor_#t~ret73; 59115#L1641-1 assume 0 != stopRequestedAtCurrentFloor_~tmp~15;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~4;havoc getCurrentFloorID_~retValue_acc~4;getCurrentFloorID_~retValue_acc~4 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~4; 60825#L972-4 stopRequestedAtCurrentFloor_#t~ret74 := getCurrentFloorID_#res;stopRequestedAtCurrentFloor_~tmp___0~7 := stopRequestedAtCurrentFloor_#t~ret74;havoc stopRequestedAtCurrentFloor_#t~ret74; 60821#L1645-1 assume !(~executiveFloor~0 == stopRequestedAtCurrentFloor_~tmp___0~7);stopRequestedAtCurrentFloor_~retValue_acc~15 := 0;stopRequestedAtCurrentFloor_#res := stopRequestedAtCurrentFloor_~retValue_acc~15; 54990#L1658-1 timeShift_#t~ret89 := stopRequestedAtCurrentFloor_#res;timeShift_~tmp___9~2 := timeShift_#t~ret89;havoc timeShift_#t~ret89; 60818#L1793-1 assume !(0 != timeShift_~tmp___9~2); 60816#L1884-3 assume !(1 == ~doorState~0); 60814#L1884-5 stopRequestedInDirection_#in~dir, stopRequestedInDirection_#in~respectFloorCalls, stopRequestedInDirection_#in~respectInLiftCalls := ~currentHeading~0, 1, 1;havoc stopRequestedInDirection_#res;havoc stopRequestedInDirection_#t~ret67, stopRequestedInDirection_#t~ret68, stopRequestedInDirection_#t~ret69, stopRequestedInDirection_~dir, stopRequestedInDirection_~respectFloorCalls, stopRequestedInDirection_~respectInLiftCalls, stopRequestedInDirection_~retValue_acc~12, stopRequestedInDirection_~tmp~12, stopRequestedInDirection_~tmp___0~5, stopRequestedInDirection_~__cil_tmp7~5, stopRequestedInDirection_~__cil_tmp8~5;stopRequestedInDirection_~dir := stopRequestedInDirection_#in~dir;stopRequestedInDirection_~respectFloorCalls := stopRequestedInDirection_#in~respectFloorCalls;stopRequestedInDirection_~respectInLiftCalls := stopRequestedInDirection_#in~respectInLiftCalls;havoc stopRequestedInDirection_~retValue_acc~12;havoc stopRequestedInDirection_~tmp~12;havoc stopRequestedInDirection_~tmp___0~5;havoc stopRequestedInDirection_~__cil_tmp7~5;havoc stopRequestedInDirection_~__cil_tmp8~5;havoc isExecutiveFloorCalling_#res;havoc isExecutiveFloorCalling_#t~ret147, isExecutiveFloorCalling_~retValue_acc~18;havoc isExecutiveFloorCalling_~retValue_acc~18;isFloorCalling_#in~floorID := ~executiveFloor~0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~22;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~22; 60811#L2705-33 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~22 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~22; 60801#L2732-33 isExecutiveFloorCalling_#t~ret147 := isFloorCalling_#res;isExecutiveFloorCalling_~retValue_acc~18 := isExecutiveFloorCalling_#t~ret147;havoc isExecutiveFloorCalling_#t~ret147;isExecutiveFloorCalling_#res := isExecutiveFloorCalling_~retValue_acc~18; 60705#L2256-4 stopRequestedInDirection_#t~ret67 := isExecutiveFloorCalling_#res;stopRequestedInDirection_~tmp___0~5 := stopRequestedInDirection_#t~ret67;havoc stopRequestedInDirection_#t~ret67; 60661#L1524-2 assume 0 != stopRequestedInDirection_~tmp___0~5;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~4;havoc getCurrentFloorID_~retValue_acc~4;getCurrentFloorID_~retValue_acc~4 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~4; 60637#L972-5 stopRequestedInDirection_#t~ret68 := getCurrentFloorID_#res;stopRequestedInDirection_~tmp~12 := stopRequestedInDirection_#t~ret68;havoc stopRequestedInDirection_#t~ret68;stopRequestedInDirection_~__cil_tmp7~5 := (if 1 == stopRequestedInDirection_~dir then 1 else 0);stopRequestedInDirection_~__cil_tmp8~5 := (if stopRequestedInDirection_~tmp~12 < ~executiveFloor~0 then 1 else 0);stopRequestedInDirection_~retValue_acc~12 := (if stopRequestedInDirection_~__cil_tmp8~5 == stopRequestedInDirection_~__cil_tmp7~5 then 1 else 0);stopRequestedInDirection_#res := stopRequestedInDirection_~retValue_acc~12; 60634#L1537-2 timeShift_#t~ret96 := stopRequestedInDirection_#res;timeShift_~tmp___8~2 := timeShift_#t~ret96;havoc timeShift_#t~ret96; 60632#L1892-1 assume 0 != timeShift_~tmp___8~2;continueInDirection_#in~dir := ~currentHeading~0;havoc continueInDirection_#t~ret70, continueInDirection_~dir, continueInDirection_~tmp~13;continueInDirection_~dir := continueInDirection_#in~dir;havoc continueInDirection_~tmp~13;~currentHeading~0 := continueInDirection_~dir; 60629#L1581-3 assume !(1 == ~currentHeading~0); 60626#L1591-9 assume !(0 == ~currentFloorID~0); 54514#L1591-11 assume !(1 == ~currentHeading~0);~currentFloorID~0 := ~currentFloorID~0 - 1; 52845#L1597-11 havoc __utac_acc__Specification2_spec__3_#t~ret35, __utac_acc__Specification2_spec__3_#t~ret36, __utac_acc__Specification2_spec__3_#t~ret37, __utac_acc__Specification2_spec__3_#t~ret38, __utac_acc__Specification2_spec__3_#t~ret39, __utac_acc__Specification2_spec__3_#t~ret40, __utac_acc__Specification2_spec__3_~floor~0, __utac_acc__Specification2_spec__3_~tmp~3, __utac_acc__Specification2_spec__3_~tmp___0~0, __utac_acc__Specification2_spec__3_~tmp___1~0, __utac_acc__Specification2_spec__3_~tmp___2~0, __utac_acc__Specification2_spec__3_~tmp___3~0, __utac_acc__Specification2_spec__3_~tmp___4~0;havoc __utac_acc__Specification2_spec__3_~floor~0;havoc __utac_acc__Specification2_spec__3_~tmp~3;havoc __utac_acc__Specification2_spec__3_~tmp___0~0;havoc __utac_acc__Specification2_spec__3_~tmp___1~0;havoc __utac_acc__Specification2_spec__3_~tmp___2~0;havoc __utac_acc__Specification2_spec__3_~tmp___3~0;havoc __utac_acc__Specification2_spec__3_~tmp___4~0;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~4;havoc getCurrentFloorID_~retValue_acc~4;getCurrentFloorID_~retValue_acc~4 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~4; 55167#L972-7 __utac_acc__Specification2_spec__3_#t~ret35 := getCurrentFloorID_#res;__utac_acc__Specification2_spec__3_~tmp~3 := __utac_acc__Specification2_spec__3_#t~ret35;havoc __utac_acc__Specification2_spec__3_#t~ret35;__utac_acc__Specification2_spec__3_~floor~0 := __utac_acc__Specification2_spec__3_~tmp~3; 54400#L470-1 assume 0 == __utac_acc__Specification2_spec__3_~floor~0; 54401#L471-1 assume 0 != ~floorButtons_spc2_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~5;havoc areDoorsOpen_~retValue_acc~5;areDoorsOpen_~retValue_acc~5 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~5; 55153#L981-5 __utac_acc__Specification2_spec__3_#t~ret36 := areDoorsOpen_#res;__utac_acc__Specification2_spec__3_~tmp___4~0 := __utac_acc__Specification2_spec__3_#t~ret36;havoc __utac_acc__Specification2_spec__3_#t~ret36; 55154#L475-2 assume 0 != __utac_acc__Specification2_spec__3_~tmp___4~0;~floorButtons_spc2_0~0 := 0; 54642#L530-1 cleanup_~i~3 := 1 + cleanup_~i~3; 53984#L2413-2 [2019-01-14 04:02:11,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:02:11,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1955280990, now seen corresponding path program 3 times [2019-01-14 04:02:11,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:02:11,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:02:11,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:02:11,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:02:11,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:02:11,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:02:11,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:02:11,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:02:11,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:02:11,246 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:02:11,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:02:11,247 INFO L82 PathProgramCache]: Analyzing trace with hash -111876701, now seen corresponding path program 1 times [2019-01-14 04:02:11,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:02:11,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:02:11,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:02:11,250 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:02:11,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:02:11,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:02:11,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:02:12,110 WARN L181 SmtUtils]: Spent 753.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 160 [2019-01-14 04:02:13,190 WARN L181 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 152 DAG size of output: 124 [2019-01-14 04:02:13,201 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:02:13,203 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:02:13,204 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:02:13,205 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:02:13,205 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:02:13,205 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:02:13,205 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:02:13,205 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:02:13,205 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec2_product27_true-unreach-call_true-termination.cil.c_Iteration3_Loop [2019-01-14 04:02:13,205 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:02:13,206 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:02:13,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-01-14 04:02:13,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:13,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-01-14 04:02:13,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:13,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-01-14 04:02:13,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:13,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:13,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-01-14 04:02:13,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-01-14 04:02:13,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-01-14 04:02:13,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-01-14 04:02:13,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:13,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:13,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:13,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:13,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:13,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:13,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:13,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:13,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:13,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:13,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:13,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:13,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:13,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:13,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:13,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:13,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:13,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:13,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:13,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:13,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:13,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:13,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:13,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:13,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:13,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:13,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:13,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:13,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:13,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:13,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:13,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:13,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:13,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:13,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:13,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:13,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:13,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:13,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:14,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:14,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:14,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:14,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:14,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:14,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:14,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:14,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:14,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:14,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:14,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:14,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:14,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:14,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:14,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:14,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:14,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:14,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:14,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:14,437 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-14 04:02:15,064 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:02:15,066 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:02:15,078 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:02:15,079 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:02:15,090 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:02:15,090 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_~tmp___7~2=0} Honda state: {ULTIMATE.start_timeShift_~tmp___7~2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 04:02:15,133 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:02:15,133 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:02:15,150 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:02:15,150 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_cleanup_#t~ret155=0} Honda state: {ULTIMATE.start_cleanup_#t~ret155=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 04:02:15,197 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:02:15,197 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:02:15,208 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:02:15,209 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification2_spec__3_#t~ret36=0} Honda state: {ULTIMATE.start___utac_acc__Specification2_spec__3_#t~ret36=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:02:15,248 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:02:15,248 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:02:15,258 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:02:15,259 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isIdle_#t~ret55=0} Honda state: {ULTIMATE.start_isIdle_#t~ret55=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:02:15,282 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:02:15,282 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:02:15,285 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:02:15,285 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification2_spec__3_#t~ret38=0} Honda state: {ULTIMATE.start___utac_acc__Specification2_spec__3_#t~ret38=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:02:15,307 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:02:15,307 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:02:15,310 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:02:15,310 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_continueInDirection_#t~ret70=0} Honda state: {ULTIMATE.start_continueInDirection_#t~ret70=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:02:15,334 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:02:15,335 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:02:15,341 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:02:15,341 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stopRequestedInDirection_#t~ret68=0} Honda state: {ULTIMATE.start_stopRequestedInDirection_#t~ret68=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:02:15,364 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:02:15,364 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:02:15,374 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:02:15,375 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isExecutiveFloorCalling_#t~ret147=0} Honda state: {ULTIMATE.start_isExecutiveFloorCalling_#t~ret147=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:02:15,413 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:02:15,413 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:02:15,424 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:02:15,425 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_#t~ret97=0} Honda state: {ULTIMATE.start_timeShift_#t~ret97=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 04:02:15,462 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:02:15,463 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:02:15,476 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:02:15,476 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stopRequestedAtCurrentFloor_#res=0, ULTIMATE.start_stopRequestedAtCurrentFloor_~retValue_acc~15=0} Honda state: {ULTIMATE.start_stopRequestedAtCurrentFloor_#res=0, ULTIMATE.start_stopRequestedAtCurrentFloor_~retValue_acc~15=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:02:15,504 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:02:15,510 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:02:15,513 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:02:15,513 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_#t~ret95=0} Honda state: {ULTIMATE.start_timeShift_#t~ret95=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:02:15,535 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:02:15,535 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:02:15,542 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:02:15,542 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isIdle_#res=0, ULTIMATE.start_isIdle_~retValue_acc~10=0} Honda state: {ULTIMATE.start_isIdle_#res=0, ULTIMATE.start_isIdle_~retValue_acc~10=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:02:15,564 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:02:15,564 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:02:15,567 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:02:15,567 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_#t~ret93=0} Honda state: {ULTIMATE.start_timeShift_#t~ret93=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:02:15,591 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:02:15,591 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:02:15,599 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:02:15,600 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification2_spec__3_~tmp___0~0=0} Honda state: {ULTIMATE.start___utac_acc__Specification2_spec__3_~tmp___0~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:02:15,622 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:02:15,622 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:02:15,624 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:02:15,625 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stopRequestedAtCurrentFloor_#t~ret76=0} Honda state: {ULTIMATE.start_stopRequestedAtCurrentFloor_#t~ret76=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:02:15,648 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:02:15,648 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:02:15,651 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:02:15,651 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_~tmp___1~6=0} Honda state: {ULTIMATE.start_timeShift_~tmp___1~6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 04:02:15,673 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:02:15,674 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:02:15,680 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:02:15,680 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stopRequestedAtCurrentFloor_#t~ret74=0} Honda state: {ULTIMATE.start_stopRequestedAtCurrentFloor_#t~ret74=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:02:15,702 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:02:15,702 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:02:15,731 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:02:15,732 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:02:16,363 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 04:02:16,366 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:02:16,366 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:02:16,366 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:02:16,366 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:02:16,366 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:02:16,366 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:02:16,367 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:02:16,367 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:02:16,367 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec2_product27_true-unreach-call_true-termination.cil.c_Iteration3_Loop [2019-01-14 04:02:16,367 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:02:16,367 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:02:16,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02: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-01-14 04:02:16,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:16,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:16,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:16,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:16,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:16,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-01-14 04:02:16,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:16,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-01-14 04:02:16,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:16,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:16,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:16,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:16,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:16,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:16,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:16,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:16,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:16,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:16,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:16,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:16,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:16,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:16,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:16,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:16,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:16,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:16,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:16,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:16,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:16,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:16,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:16,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:16,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:16,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:16,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:16,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:16,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:16,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:16,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:16,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:16,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:16,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:16,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:16,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:16,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:16,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:16,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:16,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:16,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:16,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:16,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:16,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:16,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:16,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:16,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:16,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:17,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:17,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:17,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:17,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:17,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:17,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:17,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:17,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:17,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-01-14 04:02:17,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:02:17,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-01-14 04:02:18,185 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:02:18,191 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:02:18,193 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:02:18,198 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:02:18,198 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:02:18,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:02:18,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:02:18,199 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:02:18,200 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:02:18,200 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:02:18,202 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:02:18,203 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:02:18,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:02:18,203 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:02:18,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:02:18,205 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:02:18,205 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:02:18,205 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:02:18,205 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:02:18,206 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:02:18,206 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:02:18,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:02:18,213 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:02:18,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:02:18,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:02:18,213 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:02:18,214 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:02:18,214 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:02:18,215 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:02:18,215 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:02:18,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:02:18,216 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:02:18,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:02:18,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:02:18,221 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:02:18,222 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:02:18,222 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:02:18,363 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:02:18,364 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:02:18,365 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:02:18,365 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:02:18,365 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:02:18,365 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:02:18,365 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:02:18,369 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:02:18,369 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:02:18,369 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:02:18,370 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:02:18,370 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:02:18,370 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:02:18,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:02:18,371 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:02:18,379 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:02:18,379 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:02:18,379 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:02:18,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:02:18,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:02:18,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:02:18,382 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:02:18,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:02:18,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:02:18,382 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:02:18,383 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:02:18,383 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:02:18,383 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:02:18,386 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:02:18,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:02:18,386 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:02:18,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:02:18,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:02:18,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:02:18,387 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:02:18,387 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:02:18,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:02:18,394 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:02:18,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:02:18,394 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:02:18,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:02:18,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:02:18,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:02:18,395 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:02:18,395 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:02:18,399 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:02:18,399 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:02:18,400 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:02:18,400 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:02:18,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:02:18,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:02:18,400 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:02:18,401 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:02:18,401 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:02:18,402 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:02:18,402 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:02:18,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:02:18,403 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:02:18,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:02:18,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:02:18,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:02:18,403 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:02:18,404 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:02:18,404 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:02:18,405 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:02:18,405 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:02:18,405 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:02:18,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:02:18,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:02:18,405 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:02:18,406 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:02:18,406 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:02:18,406 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:02:18,407 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:02:18,407 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:02:18,407 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:02:18,407 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:02:18,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:02:18,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:02:18,408 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:02:18,408 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:02:18,409 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:02:18,409 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:02:18,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:02:18,409 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:02:18,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:02:18,410 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:02:18,410 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:02:18,410 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:02:18,410 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:02:18,413 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:02:18,413 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:02:18,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:02:18,414 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:02:18,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:02:18,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:02:18,414 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:02:18,414 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:02:18,415 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:02:18,415 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:02:18,416 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:02:18,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:02:18,416 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:02:18,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:02:18,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:02:18,417 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:02:18,417 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:02:18,417 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:02:18,418 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:02:18,418 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:02:18,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:02:18,418 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:02:18,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:02:18,419 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:02:18,419 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:02:18,419 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:02:18,419 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:02:18,420 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:02:18,420 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:02:18,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:02:18,420 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:02:18,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:02:18,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:02:18,421 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:02:18,421 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:02:18,421 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:02:18,422 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:02:18,422 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:02:18,422 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:02:18,423 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:02:18,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:02:18,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:02:18,423 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:02:18,424 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:02:18,424 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:02:18,427 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:02:18,432 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 04:02:18,432 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:02:18,434 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:02:18,435 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:02:18,435 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:02:18,435 INFO L520 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-01-14 04:02:18,437 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:02:18,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:02:18,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:02:18,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:02:18,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:02:18,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:02:18,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:02:18,914 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-14 04:02:18,915 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9366 states and 17434 transitions. cyclomatic complexity: 8070 Second operand 5 states. [2019-01-14 04:02:19,431 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9366 states and 17434 transitions. cyclomatic complexity: 8070. Second operand 5 states. Result 14189 states and 26387 transitions. Complement of second has 8 states. [2019-01-14 04:02:19,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 04:02:19,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 04:02:19,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 4862 transitions. [2019-01-14 04:02:19,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 4862 transitions. Stem has 41 letters. Loop has 39 letters. [2019-01-14 04:02:19,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:02:19,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 4862 transitions. Stem has 80 letters. Loop has 39 letters. [2019-01-14 04:02:19,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:02:19,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 4862 transitions. Stem has 41 letters. Loop has 78 letters. [2019-01-14 04:02:19,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:02:19,450 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14189 states and 26387 transitions. [2019-01-14 04:02:19,576 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:02:19,576 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14189 states to 0 states and 0 transitions. [2019-01-14 04:02:19,576 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:02:19,576 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:02:19,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:02:19,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:02:19,577 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:02:19,577 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:02:19,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:02:19,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:02:19,577 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2019-01-14 04:02:19,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:02:19,578 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-14 04:02:19,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 04:02:19,583 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-14 04:02:19,583 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:02:19,584 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 04:02:19,584 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:02:19,584 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:02:19,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:02:19,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:02:19,584 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:02:19,584 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:02:19,584 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:02:19,584 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 04:02:19,584 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 04:02:19,585 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:02:19,588 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 04:02:19,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:02:19 BoogieIcfgContainer [2019-01-14 04:02:19,600 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:02:19,600 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:02:19,601 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:02:19,603 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:02:19,603 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:01:57" (3/4) ... [2019-01-14 04:02:19,608 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 04:02:19,608 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:02:19,610 INFO L168 Benchmark]: Toolchain (without parser) took 34262.97 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 722.5 MB). Free memory was 946.0 MB in the beginning and 1.4 GB in the end (delta: -467.9 MB). Peak memory consumption was 254.5 MB. Max. memory is 11.5 GB. [2019-01-14 04:02:19,611 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:02:19,611 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1285.27 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -127.6 MB). Peak memory consumption was 56.4 MB. Max. memory is 11.5 GB. [2019-01-14 04:02:19,613 INFO L168 Benchmark]: Boogie Procedure Inliner took 298.00 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 11.5 GB. [2019-01-14 04:02:19,614 INFO L168 Benchmark]: Boogie Preprocessor took 284.57 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 11.5 GB. [2019-01-14 04:02:19,615 INFO L168 Benchmark]: RCFGBuilder took 10701.73 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 186.1 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -170.6 MB). Peak memory consumption was 381.6 MB. Max. memory is 11.5 GB. [2019-01-14 04:02:19,618 INFO L168 Benchmark]: BuchiAutomizer took 21681.29 ms. Allocated memory was 1.3 GB in the beginning and 1.8 GB in the end (delta: 428.3 MB). Free memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: -223.6 MB). Peak memory consumption was 204.8 MB. Max. memory is 11.5 GB. [2019-01-14 04:02:19,619 INFO L168 Benchmark]: Witness Printer took 7.39 ms. Allocated memory is still 1.8 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:02:19,626 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1285.27 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -127.6 MB). Peak memory consumption was 56.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 298.00 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 284.57 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 10701.73 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 186.1 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -170.6 MB). Peak memory consumption was 381.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 21681.29 ms. Allocated memory was 1.3 GB in the beginning and 1.8 GB in the end (delta: 428.3 MB). Free memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: -223.6 MB). Peak memory consumption was 204.8 MB. Max. memory is 11.5 GB. * Witness Printer took 7.39 ms. Allocated memory is still 1.8 GB. Free memory is still 1.4 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 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function cleanupTimeShifts + -1 * i and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 21.6s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 8.3s. Construction of modules took 7.6s. Büchi inclusion checks took 3.5s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.5s AutomataMinimizationTime, 2 MinimizatonAttempts, 25362 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.8s Buchi closure took 0.0s. Biggest automaton had 9366 states and ocurred in iteration 2. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 19272 SDtfs, 83169 SDslu, 57594 SDs, 0 SdLazy, 2577 SolverSat, 691 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.6s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI2 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital181 mio100 ax100 hnf100 lsp15 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq221 hnf87 smp100 dnf203 smp87 tf102 neg97 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 17 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.8s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...