./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/product-lines/elevator_spec9_product32.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/product-lines/elevator_spec9_product32.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 ad37f41f9928d4c807c216cb8990b98ca950475b ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 03:21:59,024 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 03:21:59,027 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 03:21:59,044 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 03:21:59,045 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 03:21:59,047 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 03:21:59,049 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 03:21:59,059 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 03:21:59,064 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 03:21:59,068 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 03:21:59,069 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 03:21:59,071 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 03:21:59,071 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 03:21:59,075 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 03:21:59,076 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 03:21:59,078 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 03:21:59,079 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 03:21:59,080 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 03:21:59,083 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 03:21:59,086 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 03:21:59,091 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 03:21:59,095 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 03:21:59,097 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 03:21:59,099 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 03:21:59,103 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 03:21:59,103 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 03:21:59,103 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 03:21:59,105 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 03:21:59,106 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 03:21:59,107 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 03:21:59,107 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 03:21:59,108 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 03:21:59,109 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 03:21:59,110 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 03:21:59,111 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 03:21:59,111 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 03:21:59,112 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 03:21:59,112 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 03:21:59,112 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 03:21:59,113 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 03:21:59,114 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 03:21:59,115 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 03:21:59,133 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 03:21:59,133 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 03:21:59,134 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 03:21:59,135 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 03:21:59,135 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 03:21:59,135 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 03:21:59,136 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 03:21:59,136 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 03:21:59,136 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 03:21:59,137 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 03:21:59,137 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 03:21:59,137 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 03:21:59,137 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 03:21:59,138 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 03:21:59,138 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 03:21:59,138 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 03:21:59,138 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 03:21:59,139 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 03:21:59,139 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 03:21:59,139 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 03:21:59,140 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 03:21:59,140 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 03:21:59,140 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 03:21:59,140 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 03:21:59,141 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 03:21:59,141 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 03:21:59,141 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 03:21:59,142 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 03:21:59,142 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 03:21:59,142 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 03:21:59,142 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 03:21:59,144 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 03:21:59,144 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /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 -> ad37f41f9928d4c807c216cb8990b98ca950475b [2019-11-28 03:21:59,474 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 03:21:59,495 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 03:21:59,500 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 03:21:59,501 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 03:21:59,502 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 03:21:59,503 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec9_product32.cil.c [2019-11-28 03:21:59,575 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a19c2a67/8098b67ea96948a493a1f7cdb443663c/FLAG956247617 [2019-11-28 03:22:00,192 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 03:22:00,193 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product32.cil.c [2019-11-28 03:22:00,222 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a19c2a67/8098b67ea96948a493a1f7cdb443663c/FLAG956247617 [2019-11-28 03:22:00,403 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a19c2a67/8098b67ea96948a493a1f7cdb443663c [2019-11-28 03:22:00,408 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 03:22:00,409 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 03:22:00,414 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 03:22:00,414 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 03:22:00,418 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 03:22:00,419 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:22:00" (1/1) ... [2019-11-28 03:22:00,422 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f74f45b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:22:00, skipping insertion in model container [2019-11-28 03:22:00,422 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:22:00" (1/1) ... [2019-11-28 03:22:00,431 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 03:22:00,510 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 03:22:01,221 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:22:01,238 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 03:22:01,385 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:22:01,461 INFO L208 MainTranslator]: Completed translation [2019-11-28 03:22:01,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:22:01 WrapperNode [2019-11-28 03:22:01,462 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 03:22:01,465 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 03:22:01,465 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 03:22:01,465 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 03:22:01,474 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:22:01" (1/1) ... [2019-11-28 03:22:01,511 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:22:01" (1/1) ... [2019-11-28 03:22:01,878 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 03:22:01,878 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 03:22:01,879 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 03:22:01,879 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 03:22:01,891 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:22:01" (1/1) ... [2019-11-28 03:22:01,891 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:22:01" (1/1) ... [2019-11-28 03:22:01,951 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:22:01" (1/1) ... [2019-11-28 03:22:01,952 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:22:01" (1/1) ... [2019-11-28 03:22:02,164 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:22:01" (1/1) ... [2019-11-28 03:22:02,311 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:22:01" (1/1) ... [2019-11-28 03:22:02,348 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:22:01" (1/1) ... [2019-11-28 03:22:02,412 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 03:22:02,413 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 03:22:02,414 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 03:22:02,414 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 03:22:02,415 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:22:01" (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-11-28 03:22:02,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 03:22:02,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-28 03:22:02,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 03:22:02,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 03:22:15,095 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 03:22:15,096 INFO L297 CfgBuilder]: Removed 1697 assume(true) statements. [2019-11-28 03:22:15,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:22:15 BoogieIcfgContainer [2019-11-28 03:22:15,101 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 03:22:15,102 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 03:22:15,102 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 03:22:15,106 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 03:22:15,107 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:22:15,107 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:22:00" (1/3) ... [2019-11-28 03:22:15,108 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4f6eb3ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:22:15, skipping insertion in model container [2019-11-28 03:22:15,109 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:22:15,109 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:22:01" (2/3) ... [2019-11-28 03:22:15,110 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4f6eb3ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:22:15, skipping insertion in model container [2019-11-28 03:22:15,110 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:22:15,110 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:22:15" (3/3) ... [2019-11-28 03:22:15,112 INFO L371 chiAutomizerObserver]: Analyzing ICFG elevator_spec9_product32.cil.c [2019-11-28 03:22:15,156 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 03:22:15,156 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 03:22:15,156 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 03:22:15,157 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 03:22:15,157 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 03:22:15,157 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 03:22:15,157 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 03:22:15,157 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 03:22:15,256 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7183 states. [2019-11-28 03:22:15,446 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3581 [2019-11-28 03:22:15,447 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:22:15,447 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:22:15,476 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:22:15,477 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:22:15,477 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 03:22:15,477 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7183 states. [2019-11-28 03:22:15,570 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3581 [2019-11-28 03:22:15,571 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:22:15,571 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:22:15,578 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:22:15,579 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:22:15,586 INFO L794 eck$LassoCheckResult]: Stem: 1898#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(10);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string66.base, #t~string66.offset, 1);call write~init~int(95, #t~string66.base, 1 + #t~string66.offset, 1);call write~init~int(93, #t~string66.base, 2 + #t~string66.offset, 1);call write~init~int(0, #t~string66.base, 3 + #t~string66.offset, 1);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string68.base, #t~string68.offset, 1);call write~init~int(93, #t~string68.base, 1 + #t~string68.offset, 1);call write~init~int(32, #t~string68.base, 2 + #t~string68.offset, 1);call write~init~int(0, #t~string68.base, 3 + #t~string68.offset, 1);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string70.base, #t~string70.offset, 1);call write~init~int(97, #t~string70.base, 1 + #t~string70.offset, 1);call write~init~int(116, #t~string70.base, 2 + #t~string70.offset, 1);call write~init~int(32, #t~string70.base, 3 + #t~string70.offset, 1);call write~init~int(0, #t~string70.base, 4 + #t~string70.offset, 1);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string72.base, #t~string72.offset, 1);call write~init~int(105, #t~string72.base, 1 + #t~string72.offset, 1);call write~init~int(0, #t~string72.base, 2 + #t~string72.offset, 1);call #t~string74.base, #t~string74.offset := #Ultimate.allocOnStack(10);call #t~string76.base, #t~string76.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string76.base, #t~string76.offset, 1);call write~init~int(112, #t~string76.base, 1 + #t~string76.offset, 1);call write~init~int(0, #t~string76.base, 2 + #t~string76.offset, 1);call #t~string78.base, #t~string78.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string78.base, #t~string78.offset, 1);call write~init~int(111, #t~string78.base, 1 + #t~string78.offset, 1);call write~init~int(119, #t~string78.base, 2 + #t~string78.offset, 1);call write~init~int(110, #t~string78.base, 3 + #t~string78.offset, 1);call write~init~int(0, #t~string78.base, 4 + #t~string78.offset, 1);call #t~string80.base, #t~string80.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string80.base, #t~string80.offset, 1);call write~init~int(73, #t~string80.base, 1 + #t~string80.offset, 1);call write~init~int(76, #t~string80.base, 2 + #t~string80.offset, 1);call write~init~int(95, #t~string80.base, 3 + #t~string80.offset, 1);call write~init~int(112, #t~string80.base, 4 + #t~string80.offset, 1);call write~init~int(58, #t~string80.base, 5 + #t~string80.offset, 1);call write~init~int(0, #t~string80.base, 6 + #t~string80.offset, 1);call #t~string82.base, #t~string82.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string82.base, #t~string82.offset, 1);call write~init~int(37, #t~string82.base, 1 + #t~string82.offset, 1);call write~init~int(105, #t~string82.base, 2 + #t~string82.offset, 1);call write~init~int(0, #t~string82.base, 3 + #t~string82.offset, 1);call #t~string84.base, #t~string84.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string84.base, #t~string84.offset, 1);call write~init~int(37, #t~string84.base, 1 + #t~string84.offset, 1);call write~init~int(105, #t~string84.base, 2 + #t~string84.offset, 1);call write~init~int(0, #t~string84.base, 3 + #t~string84.offset, 1);call #t~string86.base, #t~string86.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string86.base, #t~string86.offset, 1);call write~init~int(37, #t~string86.base, 1 + #t~string86.offset, 1);call write~init~int(105, #t~string86.base, 2 + #t~string86.offset, 1);call write~init~int(0, #t~string86.base, 3 + #t~string86.offset, 1);call #t~string88.base, #t~string88.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string88.base, #t~string88.offset, 1);call write~init~int(37, #t~string88.base, 1 + #t~string88.offset, 1);call write~init~int(105, #t~string88.base, 2 + #t~string88.offset, 1);call write~init~int(0, #t~string88.base, 3 + #t~string88.offset, 1);call #t~string90.base, #t~string90.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string90.base, #t~string90.offset, 1);call write~init~int(37, #t~string90.base, 1 + #t~string90.offset, 1);call write~init~int(105, #t~string90.base, 2 + #t~string90.offset, 1);call write~init~int(0, #t~string90.base, 3 + #t~string90.offset, 1);call #t~string92.base, #t~string92.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string92.base, #t~string92.offset, 1);call write~init~int(70, #t~string92.base, 1 + #t~string92.offset, 1);call write~init~int(95, #t~string92.base, 2 + #t~string92.offset, 1);call write~init~int(112, #t~string92.base, 3 + #t~string92.offset, 1);call write~init~int(58, #t~string92.base, 4 + #t~string92.offset, 1);call write~init~int(0, #t~string92.base, 5 + #t~string92.offset, 1);call #t~string95.base, #t~string95.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string95.base, #t~string95.offset, 1);call write~init~int(37, #t~string95.base, 1 + #t~string95.offset, 1);call write~init~int(105, #t~string95.base, 2 + #t~string95.offset, 1);call write~init~int(0, #t~string95.base, 3 + #t~string95.offset, 1);call #t~string98.base, #t~string98.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string98.base, #t~string98.offset, 1);call write~init~int(37, #t~string98.base, 1 + #t~string98.offset, 1);call write~init~int(105, #t~string98.base, 2 + #t~string98.offset, 1);call write~init~int(0, #t~string98.base, 3 + #t~string98.offset, 1);call #t~string101.base, #t~string101.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string101.base, #t~string101.offset, 1);call write~init~int(37, #t~string101.base, 1 + #t~string101.offset, 1);call write~init~int(105, #t~string101.base, 2 + #t~string101.offset, 1);call write~init~int(0, #t~string101.base, 3 + #t~string101.offset, 1);call #t~string104.base, #t~string104.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string104.base, #t~string104.offset, 1);call write~init~int(37, #t~string104.base, 1 + #t~string104.offset, 1);call write~init~int(105, #t~string104.base, 2 + #t~string104.offset, 1);call write~init~int(0, #t~string104.base, 3 + #t~string104.offset, 1);call #t~string107.base, #t~string107.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string107.base, #t~string107.offset, 1);call write~init~int(37, #t~string107.base, 1 + #t~string107.offset, 1);call write~init~int(105, #t~string107.base, 2 + #t~string107.offset, 1);call write~init~int(0, #t~string107.base, 3 + #t~string107.offset, 1);call #t~string109.base, #t~string109.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string109.base, #t~string109.offset, 1);call write~init~int(0, #t~string109.base, 1 + #t~string109.offset, 1);call #t~string112.base, #t~string112.offset := #Ultimate.allocOnStack(9);call #t~string133.base, #t~string133.offset := #Ultimate.allocOnStack(30);call #t~string134.base, #t~string134.offset := #Ultimate.allocOnStack(9);call #t~string135.base, #t~string135.offset := #Ultimate.allocOnStack(21);call #t~string136.base, #t~string136.offset := #Ultimate.allocOnStack(30);call #t~string137.base, #t~string137.offset := #Ultimate.allocOnStack(9);call #t~string138.base, #t~string138.offset := #Ultimate.allocOnStack(21);call #t~string142.base, #t~string142.offset := #Ultimate.allocOnStack(30);call #t~string143.base, #t~string143.offset := #Ultimate.allocOnStack(9);call #t~string144.base, #t~string144.offset := #Ultimate.allocOnStack(25);call #t~string145.base, #t~string145.offset := #Ultimate.allocOnStack(30);call #t~string146.base, #t~string146.offset := #Ultimate.allocOnStack(9);call #t~string147.base, #t~string147.offset := #Ultimate.allocOnStack(25);~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;~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~0 := 0;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~cleanupTimeShifts~0 := 12; 6698#L-1true havoc main_#res;havoc main_#t~ret164, main_~retValue_acc~28, main_~tmp~29;havoc main_~retValue_acc~28;havoc main_~tmp~29; 4289#L2956true havoc valid_product_#res;havoc valid_product_~retValue_acc~26;havoc valid_product_~retValue_acc~26;valid_product_~retValue_acc~26 := 1;valid_product_#res := valid_product_~retValue_acc~26; 5361#L2964true main_#t~ret164 := valid_product_#res;main_~tmp~29 := main_#t~ret164;havoc main_#t~ret164; 4181#L3307true assume 0 != main_~tmp~29; 1780#L3282true ~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 1045#L751true havoc bigMacCall_#t~ret157, bigMacCall_~tmp~26;havoc bigMacCall_~tmp~26;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~30;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~30; 6969#L3364true assume 0 == getOrigin_~person;getOrigin_~retValue_acc~30 := 4;getOrigin_#res := getOrigin_~retValue_acc~30; 1074#L3389true bigMacCall_#t~ret157 := getOrigin_#res;bigMacCall_~tmp~26 := bigMacCall_#t~ret157;havoc bigMacCall_#t~ret157;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~26;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 1044#L399true assume 0 == initPersonOnFloor_~floor; 901#L400true assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 3118#L507-1true callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 6961#L191true assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 5945#L203-2true havoc cleanup_#t~ret158, cleanup_#t~ret159, cleanup_~i~1, cleanup_~tmp~27, cleanup_~tmp___0~10, cleanup_~__cil_tmp4~3;havoc cleanup_~i~1;havoc cleanup_~tmp~27;havoc cleanup_~tmp___0~10;havoc cleanup_~__cil_tmp4~3;havoc timeShift_#t~ret63, timeShift_~tmp~15;havoc timeShift_~tmp~15;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; 2683#L1161true timeShift_#t~ret63 := areDoorsOpen_#res;timeShift_~tmp~15 := timeShift_#t~ret63;havoc timeShift_#t~ret63; 1494#L2171true assume 0 != timeShift_~tmp~15; 1455#L2172true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 1447#L1817-11true havoc __utac_acc__Specification9_spec__3_#t~ret0, __utac_acc__Specification9_spec__3_#t~ret1, __utac_acc__Specification9_spec__3_#t~ret2, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~0, __utac_acc__Specification9_spec__3_~tmp___0~0, __utac_acc__Specification9_spec__3_~tmp___1~0;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~0;havoc __utac_acc__Specification9_spec__3_~tmp___0~0;havoc __utac_acc__Specification9_spec__3_~tmp___1~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; 2744#L1152-10true __utac_acc__Specification9_spec__3_#t~ret0 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~0 := __utac_acc__Specification9_spec__3_#t~ret0;havoc __utac_acc__Specification9_spec__3_#t~ret0;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~0;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~8;havoc isEmpty_~retValue_acc~8; 3062#L1212-12true assume 1 == ~persons_0~0;isEmpty_~retValue_acc~8 := 0;isEmpty_#res := isEmpty_~retValue_acc~8; 7109#L1244-12true __utac_acc__Specification9_spec__3_#t~ret1 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~0 := __utac_acc__Specification9_spec__3_#t~ret1;havoc __utac_acc__Specification9_spec__3_#t~ret1; 2443#L794true assume 0 != __utac_acc__Specification9_spec__3_~tmp___1~0;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 2738#L804-1true cleanup_~i~1 := 0; 2194#L3114-2true [2019-11-28 03:22:15,587 INFO L796 eck$LassoCheckResult]: Loop: 2194#L3114-2true assume !false; 2175#L3115true cleanup_~__cil_tmp4~3 := ~cleanupTimeShifts~0 - 1; 2146#L3118true assume cleanup_~i~1 < cleanup_~__cil_tmp4~3;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~3;havoc isBlocked_~retValue_acc~3;isBlocked_~retValue_acc~3 := ~blocked~0;isBlocked_#res := isBlocked_~retValue_acc~3; 2753#L975true cleanup_#t~ret158 := isBlocked_#res;cleanup_~tmp___0~10 := cleanup_#t~ret158;havoc cleanup_#t~ret158; 4869#L3122true assume 1 != cleanup_~tmp___0~10; 4877#L3122-1true havoc isIdle_#res;havoc isIdle_#t~ret11, isIdle_~retValue_acc~10, isIdle_~tmp~5;havoc isIdle_~retValue_acc~10;havoc isIdle_~tmp~5;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret6, anyStopRequested_#t~ret7, anyStopRequested_#t~ret8, anyStopRequested_#t~ret9, anyStopRequested_#t~ret10, anyStopRequested_~retValue_acc~9, anyStopRequested_~tmp~4, anyStopRequested_~tmp___0~1, anyStopRequested_~tmp___1~1, anyStopRequested_~tmp___2~0, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~9;havoc anyStopRequested_~tmp~4;havoc anyStopRequested_~tmp___0~1;havoc anyStopRequested_~tmp___1~1;havoc anyStopRequested_~tmp___2~0;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~0;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~0; 4749#L128-130true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~0 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~0; 2949#L155-130true anyStopRequested_#t~ret6 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret6;havoc anyStopRequested_#t~ret6; 5950#L1260true assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~9 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~9; 2482#L1324true isIdle_#t~ret11 := anyStopRequested_#res;isIdle_~tmp~5 := isIdle_#t~ret11;havoc isIdle_#t~ret11;isIdle_~retValue_acc~10 := (if 0 == isIdle_~tmp~5 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~10; 2689#L1337true cleanup_#t~ret159 := isIdle_#res;cleanup_~tmp~27 := cleanup_#t~ret159;havoc cleanup_#t~ret159; 5663#L3134true assume !(0 != cleanup_~tmp~27);havoc timeShift_#t~ret63, timeShift_~tmp~15;havoc timeShift_~tmp~15;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; 2686#L1161-2true timeShift_#t~ret63 := areDoorsOpen_#res;timeShift_~tmp~15 := timeShift_#t~ret63;havoc timeShift_#t~ret63; 1496#L2171-1true assume 0 != timeShift_~tmp~15; 1456#L2172-2true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 1422#L1817-23true havoc __utac_acc__Specification9_spec__3_#t~ret0, __utac_acc__Specification9_spec__3_#t~ret1, __utac_acc__Specification9_spec__3_#t~ret2, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~0, __utac_acc__Specification9_spec__3_~tmp___0~0, __utac_acc__Specification9_spec__3_~tmp___1~0;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~0;havoc __utac_acc__Specification9_spec__3_~tmp___0~0;havoc __utac_acc__Specification9_spec__3_~tmp___1~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; 2757#L1152-21true __utac_acc__Specification9_spec__3_#t~ret0 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~0 := __utac_acc__Specification9_spec__3_#t~ret0;havoc __utac_acc__Specification9_spec__3_#t~ret0;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~0;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~8;havoc isEmpty_~retValue_acc~8; 2991#L1212-25true assume 1 == ~persons_0~0;isEmpty_~retValue_acc~8 := 0;isEmpty_#res := isEmpty_~retValue_acc~8; 7056#L1244-25true __utac_acc__Specification9_spec__3_#t~ret1 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~0 := __utac_acc__Specification9_spec__3_#t~ret1;havoc __utac_acc__Specification9_spec__3_#t~ret1; 2430#L794-2true assume 0 != __utac_acc__Specification9_spec__3_~tmp___1~0;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 2740#L804-3true cleanup_~i~1 := 1 + cleanup_~i~1; 2194#L3114-2true [2019-11-28 03:22:15,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:22:15,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1851464233, now seen corresponding path program 1 times [2019-11-28 03:22:15,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:22:15,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388012520] [2019-11-28 03:22:15,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:22:15,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:22:15,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:22:15,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388012520] [2019-11-28 03:22:15,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:22:15,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:22:15,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423569787] [2019-11-28 03:22:16,005 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:22:16,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:22:16,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1010745214, now seen corresponding path program 1 times [2019-11-28 03:22:16,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:22:16,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476209699] [2019-11-28 03:22:16,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:22:16,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:22:16,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:22:16,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476209699] [2019-11-28 03:22:16,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:22:16,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 03:22:16,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81196124] [2019-11-28 03:22:16,092 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:22:16,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:22:16,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 03:22:16,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 03:22:16,115 INFO L87 Difference]: Start difference. First operand 7183 states. Second operand 4 states. [2019-11-28 03:22:17,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:22:17,339 INFO L93 Difference]: Finished difference Result 17581 states and 33181 transitions. [2019-11-28 03:22:17,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 03:22:17,342 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17581 states and 33181 transitions. [2019-11-28 03:22:17,623 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12289 [2019-11-28 03:22:17,859 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17581 states to 17539 states and 33132 transitions. [2019-11-28 03:22:17,861 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17539 [2019-11-28 03:22:17,895 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17539 [2019-11-28 03:22:17,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17539 states and 33132 transitions. [2019-11-28 03:22:17,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:22:17,944 INFO L688 BuchiCegarLoop]: Abstraction has 17539 states and 33132 transitions. [2019-11-28 03:22:17,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17539 states and 33132 transitions. [2019-11-28 03:22:18,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17539 to 7173. [2019-11-28 03:22:18,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7173 states. [2019-11-28 03:22:18,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7173 states to 7173 states and 13538 transitions. [2019-11-28 03:22:18,613 INFO L711 BuchiCegarLoop]: Abstraction has 7173 states and 13538 transitions. [2019-11-28 03:22:18,614 INFO L591 BuchiCegarLoop]: Abstraction has 7173 states and 13538 transitions. [2019-11-28 03:22:18,614 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 03:22:18,614 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7173 states and 13538 transitions. [2019-11-28 03:22:18,697 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3583 [2019-11-28 03:22:18,697 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:22:18,697 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:22:18,707 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:22:18,707 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:22:18,708 INFO L794 eck$LassoCheckResult]: Stem: 27198#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(10);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string66.base, #t~string66.offset, 1);call write~init~int(95, #t~string66.base, 1 + #t~string66.offset, 1);call write~init~int(93, #t~string66.base, 2 + #t~string66.offset, 1);call write~init~int(0, #t~string66.base, 3 + #t~string66.offset, 1);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string68.base, #t~string68.offset, 1);call write~init~int(93, #t~string68.base, 1 + #t~string68.offset, 1);call write~init~int(32, #t~string68.base, 2 + #t~string68.offset, 1);call write~init~int(0, #t~string68.base, 3 + #t~string68.offset, 1);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string70.base, #t~string70.offset, 1);call write~init~int(97, #t~string70.base, 1 + #t~string70.offset, 1);call write~init~int(116, #t~string70.base, 2 + #t~string70.offset, 1);call write~init~int(32, #t~string70.base, 3 + #t~string70.offset, 1);call write~init~int(0, #t~string70.base, 4 + #t~string70.offset, 1);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string72.base, #t~string72.offset, 1);call write~init~int(105, #t~string72.base, 1 + #t~string72.offset, 1);call write~init~int(0, #t~string72.base, 2 + #t~string72.offset, 1);call #t~string74.base, #t~string74.offset := #Ultimate.allocOnStack(10);call #t~string76.base, #t~string76.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string76.base, #t~string76.offset, 1);call write~init~int(112, #t~string76.base, 1 + #t~string76.offset, 1);call write~init~int(0, #t~string76.base, 2 + #t~string76.offset, 1);call #t~string78.base, #t~string78.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string78.base, #t~string78.offset, 1);call write~init~int(111, #t~string78.base, 1 + #t~string78.offset, 1);call write~init~int(119, #t~string78.base, 2 + #t~string78.offset, 1);call write~init~int(110, #t~string78.base, 3 + #t~string78.offset, 1);call write~init~int(0, #t~string78.base, 4 + #t~string78.offset, 1);call #t~string80.base, #t~string80.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string80.base, #t~string80.offset, 1);call write~init~int(73, #t~string80.base, 1 + #t~string80.offset, 1);call write~init~int(76, #t~string80.base, 2 + #t~string80.offset, 1);call write~init~int(95, #t~string80.base, 3 + #t~string80.offset, 1);call write~init~int(112, #t~string80.base, 4 + #t~string80.offset, 1);call write~init~int(58, #t~string80.base, 5 + #t~string80.offset, 1);call write~init~int(0, #t~string80.base, 6 + #t~string80.offset, 1);call #t~string82.base, #t~string82.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string82.base, #t~string82.offset, 1);call write~init~int(37, #t~string82.base, 1 + #t~string82.offset, 1);call write~init~int(105, #t~string82.base, 2 + #t~string82.offset, 1);call write~init~int(0, #t~string82.base, 3 + #t~string82.offset, 1);call #t~string84.base, #t~string84.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string84.base, #t~string84.offset, 1);call write~init~int(37, #t~string84.base, 1 + #t~string84.offset, 1);call write~init~int(105, #t~string84.base, 2 + #t~string84.offset, 1);call write~init~int(0, #t~string84.base, 3 + #t~string84.offset, 1);call #t~string86.base, #t~string86.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string86.base, #t~string86.offset, 1);call write~init~int(37, #t~string86.base, 1 + #t~string86.offset, 1);call write~init~int(105, #t~string86.base, 2 + #t~string86.offset, 1);call write~init~int(0, #t~string86.base, 3 + #t~string86.offset, 1);call #t~string88.base, #t~string88.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string88.base, #t~string88.offset, 1);call write~init~int(37, #t~string88.base, 1 + #t~string88.offset, 1);call write~init~int(105, #t~string88.base, 2 + #t~string88.offset, 1);call write~init~int(0, #t~string88.base, 3 + #t~string88.offset, 1);call #t~string90.base, #t~string90.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string90.base, #t~string90.offset, 1);call write~init~int(37, #t~string90.base, 1 + #t~string90.offset, 1);call write~init~int(105, #t~string90.base, 2 + #t~string90.offset, 1);call write~init~int(0, #t~string90.base, 3 + #t~string90.offset, 1);call #t~string92.base, #t~string92.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string92.base, #t~string92.offset, 1);call write~init~int(70, #t~string92.base, 1 + #t~string92.offset, 1);call write~init~int(95, #t~string92.base, 2 + #t~string92.offset, 1);call write~init~int(112, #t~string92.base, 3 + #t~string92.offset, 1);call write~init~int(58, #t~string92.base, 4 + #t~string92.offset, 1);call write~init~int(0, #t~string92.base, 5 + #t~string92.offset, 1);call #t~string95.base, #t~string95.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string95.base, #t~string95.offset, 1);call write~init~int(37, #t~string95.base, 1 + #t~string95.offset, 1);call write~init~int(105, #t~string95.base, 2 + #t~string95.offset, 1);call write~init~int(0, #t~string95.base, 3 + #t~string95.offset, 1);call #t~string98.base, #t~string98.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string98.base, #t~string98.offset, 1);call write~init~int(37, #t~string98.base, 1 + #t~string98.offset, 1);call write~init~int(105, #t~string98.base, 2 + #t~string98.offset, 1);call write~init~int(0, #t~string98.base, 3 + #t~string98.offset, 1);call #t~string101.base, #t~string101.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string101.base, #t~string101.offset, 1);call write~init~int(37, #t~string101.base, 1 + #t~string101.offset, 1);call write~init~int(105, #t~string101.base, 2 + #t~string101.offset, 1);call write~init~int(0, #t~string101.base, 3 + #t~string101.offset, 1);call #t~string104.base, #t~string104.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string104.base, #t~string104.offset, 1);call write~init~int(37, #t~string104.base, 1 + #t~string104.offset, 1);call write~init~int(105, #t~string104.base, 2 + #t~string104.offset, 1);call write~init~int(0, #t~string104.base, 3 + #t~string104.offset, 1);call #t~string107.base, #t~string107.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string107.base, #t~string107.offset, 1);call write~init~int(37, #t~string107.base, 1 + #t~string107.offset, 1);call write~init~int(105, #t~string107.base, 2 + #t~string107.offset, 1);call write~init~int(0, #t~string107.base, 3 + #t~string107.offset, 1);call #t~string109.base, #t~string109.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string109.base, #t~string109.offset, 1);call write~init~int(0, #t~string109.base, 1 + #t~string109.offset, 1);call #t~string112.base, #t~string112.offset := #Ultimate.allocOnStack(9);call #t~string133.base, #t~string133.offset := #Ultimate.allocOnStack(30);call #t~string134.base, #t~string134.offset := #Ultimate.allocOnStack(9);call #t~string135.base, #t~string135.offset := #Ultimate.allocOnStack(21);call #t~string136.base, #t~string136.offset := #Ultimate.allocOnStack(30);call #t~string137.base, #t~string137.offset := #Ultimate.allocOnStack(9);call #t~string138.base, #t~string138.offset := #Ultimate.allocOnStack(21);call #t~string142.base, #t~string142.offset := #Ultimate.allocOnStack(30);call #t~string143.base, #t~string143.offset := #Ultimate.allocOnStack(9);call #t~string144.base, #t~string144.offset := #Ultimate.allocOnStack(25);call #t~string145.base, #t~string145.offset := #Ultimate.allocOnStack(30);call #t~string146.base, #t~string146.offset := #Ultimate.allocOnStack(9);call #t~string147.base, #t~string147.offset := #Ultimate.allocOnStack(25);~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;~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~0 := 0;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~cleanupTimeShifts~0 := 12; 27199#L-1 havoc main_#res;havoc main_#t~ret164, main_~retValue_acc~28, main_~tmp~29;havoc main_~retValue_acc~28;havoc main_~tmp~29; 30055#L2956 havoc valid_product_#res;havoc valid_product_~retValue_acc~26;havoc valid_product_~retValue_acc~26;valid_product_~retValue_acc~26 := 1;valid_product_#res := valid_product_~retValue_acc~26; 30056#L2964 main_#t~ret164 := valid_product_#res;main_~tmp~29 := main_#t~ret164;havoc main_#t~ret164; 29863#L3307 assume 0 != main_~tmp~29; 27049#L3282 ~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 26371#L751 havoc bigMacCall_#t~ret157, bigMacCall_~tmp~26;havoc bigMacCall_~tmp~26;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~30;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~30; 26372#L3364 assume 0 == getOrigin_~person;getOrigin_~retValue_acc~30 := 4;getOrigin_#res := getOrigin_~retValue_acc~30; 26395#L3389 bigMacCall_#t~ret157 := getOrigin_#res;bigMacCall_~tmp~26 := bigMacCall_#t~ret157;havoc bigMacCall_#t~ret157;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~26;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 26370#L399 assume 0 == initPersonOnFloor_~floor; 26137#L400 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 25488#L507-1 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 28630#L191 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 31198#L203-2 havoc cleanup_#t~ret158, cleanup_#t~ret159, cleanup_~i~1, cleanup_~tmp~27, cleanup_~tmp___0~10, cleanup_~__cil_tmp4~3;havoc cleanup_~i~1;havoc cleanup_~tmp~27;havoc cleanup_~tmp___0~10;havoc cleanup_~__cil_tmp4~3;havoc timeShift_#t~ret63, timeShift_~tmp~15;havoc timeShift_~tmp~15;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; 27938#L1161 timeShift_#t~ret63 := areDoorsOpen_#res;timeShift_~tmp~15 := timeShift_#t~ret63;havoc timeShift_#t~ret63; 26781#L2171 assume 0 != timeShift_~tmp~15; 26739#L2172 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 24987#L1817-11 havoc __utac_acc__Specification9_spec__3_#t~ret0, __utac_acc__Specification9_spec__3_#t~ret1, __utac_acc__Specification9_spec__3_#t~ret2, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~0, __utac_acc__Specification9_spec__3_~tmp___0~0, __utac_acc__Specification9_spec__3_~tmp___1~0;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~0;havoc __utac_acc__Specification9_spec__3_~tmp___0~0;havoc __utac_acc__Specification9_spec__3_~tmp___1~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; 26731#L1152-10 __utac_acc__Specification9_spec__3_#t~ret0 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~0 := __utac_acc__Specification9_spec__3_#t~ret0;havoc __utac_acc__Specification9_spec__3_#t~ret0;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~0;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~8;havoc isEmpty_~retValue_acc~8; 27977#L1212-12 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~8 := 0;isEmpty_#res := isEmpty_~retValue_acc~8; 28253#L1244-12 __utac_acc__Specification9_spec__3_#t~ret1 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~0 := __utac_acc__Specification9_spec__3_#t~ret1;havoc __utac_acc__Specification9_spec__3_#t~ret1; 27782#L794 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~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; 27783#L1161-1 __utac_acc__Specification9_spec__3_#t~ret2 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~0 := __utac_acc__Specification9_spec__3_#t~ret2;havoc __utac_acc__Specification9_spec__3_#t~ret2; 27939#L804 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___0~0); 27225#L804-1 cleanup_~i~1 := 0; 27616#L3114-2 [2019-11-28 03:22:18,708 INFO L796 eck$LassoCheckResult]: Loop: 27616#L3114-2 assume !false; 27600#L3115 cleanup_~__cil_tmp4~3 := ~cleanupTimeShifts~0 - 1; 27569#L3118 assume cleanup_~i~1 < cleanup_~__cil_tmp4~3;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~3;havoc isBlocked_~retValue_acc~3;isBlocked_~retValue_acc~3 := ~blocked~0;isBlocked_#res := isBlocked_~retValue_acc~3; 27570#L975 cleanup_#t~ret158 := isBlocked_#res;cleanup_~tmp___0~10 := cleanup_#t~ret158;havoc cleanup_#t~ret158; 27988#L3122 assume 1 != cleanup_~tmp___0~10; 30549#L3122-1 havoc isIdle_#res;havoc isIdle_#t~ret11, isIdle_~retValue_acc~10, isIdle_~tmp~5;havoc isIdle_~retValue_acc~10;havoc isIdle_~tmp~5;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret6, anyStopRequested_#t~ret7, anyStopRequested_#t~ret8, anyStopRequested_#t~ret9, anyStopRequested_#t~ret10, anyStopRequested_~retValue_acc~9, anyStopRequested_~tmp~4, anyStopRequested_~tmp___0~1, anyStopRequested_~tmp___1~1, anyStopRequested_~tmp___2~0, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~9;havoc anyStopRequested_~tmp~4;havoc anyStopRequested_~tmp___0~1;havoc anyStopRequested_~tmp___1~1;havoc anyStopRequested_~tmp___2~0;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~0;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~0; 30508#L128-130 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~0 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~0; 28404#L155-130 anyStopRequested_#t~ret6 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret6;havoc anyStopRequested_#t~ret6; 28405#L1260 assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~9 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~9; 24855#L1324 isIdle_#t~ret11 := anyStopRequested_#res;isIdle_~tmp~5 := isIdle_#t~ret11;havoc isIdle_#t~ret11;isIdle_~retValue_acc~10 := (if 0 == isIdle_~tmp~5 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~10; 27819#L1337 cleanup_#t~ret159 := isIdle_#res;cleanup_~tmp~27 := cleanup_#t~ret159;havoc cleanup_#t~ret159; 27942#L3134 assume !(0 != cleanup_~tmp~27);havoc timeShift_#t~ret63, timeShift_~tmp~15;havoc timeShift_~tmp~15;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; 27940#L1161-2 timeShift_#t~ret63 := areDoorsOpen_#res;timeShift_~tmp~15 := timeShift_#t~ret63;havoc timeShift_#t~ret63; 26784#L2171-1 assume 0 != timeShift_~tmp~15; 26741#L2172-2 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 24996#L1817-23 havoc __utac_acc__Specification9_spec__3_#t~ret0, __utac_acc__Specification9_spec__3_#t~ret1, __utac_acc__Specification9_spec__3_#t~ret2, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~0, __utac_acc__Specification9_spec__3_~tmp___0~0, __utac_acc__Specification9_spec__3_~tmp___1~0;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~0;havoc __utac_acc__Specification9_spec__3_~tmp___0~0;havoc __utac_acc__Specification9_spec__3_~tmp___1~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; 26706#L1152-21 __utac_acc__Specification9_spec__3_#t~ret0 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~0 := __utac_acc__Specification9_spec__3_#t~ret0;havoc __utac_acc__Specification9_spec__3_#t~ret0;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~0;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~8;havoc isEmpty_~retValue_acc~8; 27993#L1212-25 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~8 := 0;isEmpty_#res := isEmpty_~retValue_acc~8; 28208#L1244-25 __utac_acc__Specification9_spec__3_#t~ret1 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~0 := __utac_acc__Specification9_spec__3_#t~ret1;havoc __utac_acc__Specification9_spec__3_#t~ret1; 27768#L794-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~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; 27769#L1161-3 __utac_acc__Specification9_spec__3_#t~ret2 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~0 := __utac_acc__Specification9_spec__3_#t~ret2;havoc __utac_acc__Specification9_spec__3_#t~ret2; 27941#L804-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___0~0); 27231#L804-3 cleanup_~i~1 := 1 + cleanup_~i~1; 27616#L3114-2 [2019-11-28 03:22:18,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:22:18,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1140123340, now seen corresponding path program 1 times [2019-11-28 03:22:18,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:22:18,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358534265] [2019-11-28 03:22:18,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:22:18,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:22:18,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:22:18,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358534265] [2019-11-28 03:22:18,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:22:18,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:22:18,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103003534] [2019-11-28 03:22:18,899 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:22:18,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:22:18,899 INFO L82 PathProgramCache]: Analyzing trace with hash -662448065, now seen corresponding path program 1 times [2019-11-28 03:22:18,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:22:18,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970787594] [2019-11-28 03:22:18,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:22:18,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:22:18,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:22:18,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970787594] [2019-11-28 03:22:18,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:22:18,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 03:22:18,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724674843] [2019-11-28 03:22:18,967 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:22:18,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:22:18,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 03:22:18,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 03:22:18,969 INFO L87 Difference]: Start difference. First operand 7173 states and 13538 transitions. cyclomatic complexity: 6366 Second operand 7 states. [2019-11-28 03:22:20,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:22:20,118 INFO L93 Difference]: Finished difference Result 13576 states and 25511 transitions. [2019-11-28 03:22:20,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-28 03:22:20,120 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13576 states and 25511 transitions. [2019-11-28 03:22:20,254 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10875 [2019-11-28 03:22:20,352 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13576 states to 13576 states and 25511 transitions. [2019-11-28 03:22:20,353 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13576 [2019-11-28 03:22:20,378 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13576 [2019-11-28 03:22:20,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13576 states and 25511 transitions. [2019-11-28 03:22:20,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:22:20,416 INFO L688 BuchiCegarLoop]: Abstraction has 13576 states and 25511 transitions. [2019-11-28 03:22:20,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13576 states and 25511 transitions. [2019-11-28 03:22:20,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13576 to 7141. [2019-11-28 03:22:20,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7141 states. [2019-11-28 03:22:20,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7141 states to 7141 states and 13453 transitions. [2019-11-28 03:22:20,672 INFO L711 BuchiCegarLoop]: Abstraction has 7141 states and 13453 transitions. [2019-11-28 03:22:20,672 INFO L591 BuchiCegarLoop]: Abstraction has 7141 states and 13453 transitions. [2019-11-28 03:22:20,672 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 03:22:20,673 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7141 states and 13453 transitions. [2019-11-28 03:22:20,716 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4469 [2019-11-28 03:22:20,716 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:22:20,716 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:22:20,722 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:22:20,723 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:22:20,724 INFO L794 eck$LassoCheckResult]: Stem: 50321#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string64.base, #t~string64.offset := #Ultimate.allocOnStack(10);call #t~string66.base, #t~string66.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string66.base, #t~string66.offset, 1);call write~init~int(95, #t~string66.base, 1 + #t~string66.offset, 1);call write~init~int(93, #t~string66.base, 2 + #t~string66.offset, 1);call write~init~int(0, #t~string66.base, 3 + #t~string66.offset, 1);call #t~string68.base, #t~string68.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string68.base, #t~string68.offset, 1);call write~init~int(93, #t~string68.base, 1 + #t~string68.offset, 1);call write~init~int(32, #t~string68.base, 2 + #t~string68.offset, 1);call write~init~int(0, #t~string68.base, 3 + #t~string68.offset, 1);call #t~string70.base, #t~string70.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string70.base, #t~string70.offset, 1);call write~init~int(97, #t~string70.base, 1 + #t~string70.offset, 1);call write~init~int(116, #t~string70.base, 2 + #t~string70.offset, 1);call write~init~int(32, #t~string70.base, 3 + #t~string70.offset, 1);call write~init~int(0, #t~string70.base, 4 + #t~string70.offset, 1);call #t~string72.base, #t~string72.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string72.base, #t~string72.offset, 1);call write~init~int(105, #t~string72.base, 1 + #t~string72.offset, 1);call write~init~int(0, #t~string72.base, 2 + #t~string72.offset, 1);call #t~string74.base, #t~string74.offset := #Ultimate.allocOnStack(10);call #t~string76.base, #t~string76.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string76.base, #t~string76.offset, 1);call write~init~int(112, #t~string76.base, 1 + #t~string76.offset, 1);call write~init~int(0, #t~string76.base, 2 + #t~string76.offset, 1);call #t~string78.base, #t~string78.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string78.base, #t~string78.offset, 1);call write~init~int(111, #t~string78.base, 1 + #t~string78.offset, 1);call write~init~int(119, #t~string78.base, 2 + #t~string78.offset, 1);call write~init~int(110, #t~string78.base, 3 + #t~string78.offset, 1);call write~init~int(0, #t~string78.base, 4 + #t~string78.offset, 1);call #t~string80.base, #t~string80.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string80.base, #t~string80.offset, 1);call write~init~int(73, #t~string80.base, 1 + #t~string80.offset, 1);call write~init~int(76, #t~string80.base, 2 + #t~string80.offset, 1);call write~init~int(95, #t~string80.base, 3 + #t~string80.offset, 1);call write~init~int(112, #t~string80.base, 4 + #t~string80.offset, 1);call write~init~int(58, #t~string80.base, 5 + #t~string80.offset, 1);call write~init~int(0, #t~string80.base, 6 + #t~string80.offset, 1);call #t~string82.base, #t~string82.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string82.base, #t~string82.offset, 1);call write~init~int(37, #t~string82.base, 1 + #t~string82.offset, 1);call write~init~int(105, #t~string82.base, 2 + #t~string82.offset, 1);call write~init~int(0, #t~string82.base, 3 + #t~string82.offset, 1);call #t~string84.base, #t~string84.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string84.base, #t~string84.offset, 1);call write~init~int(37, #t~string84.base, 1 + #t~string84.offset, 1);call write~init~int(105, #t~string84.base, 2 + #t~string84.offset, 1);call write~init~int(0, #t~string84.base, 3 + #t~string84.offset, 1);call #t~string86.base, #t~string86.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string86.base, #t~string86.offset, 1);call write~init~int(37, #t~string86.base, 1 + #t~string86.offset, 1);call write~init~int(105, #t~string86.base, 2 + #t~string86.offset, 1);call write~init~int(0, #t~string86.base, 3 + #t~string86.offset, 1);call #t~string88.base, #t~string88.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string88.base, #t~string88.offset, 1);call write~init~int(37, #t~string88.base, 1 + #t~string88.offset, 1);call write~init~int(105, #t~string88.base, 2 + #t~string88.offset, 1);call write~init~int(0, #t~string88.base, 3 + #t~string88.offset, 1);call #t~string90.base, #t~string90.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string90.base, #t~string90.offset, 1);call write~init~int(37, #t~string90.base, 1 + #t~string90.offset, 1);call write~init~int(105, #t~string90.base, 2 + #t~string90.offset, 1);call write~init~int(0, #t~string90.base, 3 + #t~string90.offset, 1);call #t~string92.base, #t~string92.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string92.base, #t~string92.offset, 1);call write~init~int(70, #t~string92.base, 1 + #t~string92.offset, 1);call write~init~int(95, #t~string92.base, 2 + #t~string92.offset, 1);call write~init~int(112, #t~string92.base, 3 + #t~string92.offset, 1);call write~init~int(58, #t~string92.base, 4 + #t~string92.offset, 1);call write~init~int(0, #t~string92.base, 5 + #t~string92.offset, 1);call #t~string95.base, #t~string95.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string95.base, #t~string95.offset, 1);call write~init~int(37, #t~string95.base, 1 + #t~string95.offset, 1);call write~init~int(105, #t~string95.base, 2 + #t~string95.offset, 1);call write~init~int(0, #t~string95.base, 3 + #t~string95.offset, 1);call #t~string98.base, #t~string98.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string98.base, #t~string98.offset, 1);call write~init~int(37, #t~string98.base, 1 + #t~string98.offset, 1);call write~init~int(105, #t~string98.base, 2 + #t~string98.offset, 1);call write~init~int(0, #t~string98.base, 3 + #t~string98.offset, 1);call #t~string101.base, #t~string101.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string101.base, #t~string101.offset, 1);call write~init~int(37, #t~string101.base, 1 + #t~string101.offset, 1);call write~init~int(105, #t~string101.base, 2 + #t~string101.offset, 1);call write~init~int(0, #t~string101.base, 3 + #t~string101.offset, 1);call #t~string104.base, #t~string104.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string104.base, #t~string104.offset, 1);call write~init~int(37, #t~string104.base, 1 + #t~string104.offset, 1);call write~init~int(105, #t~string104.base, 2 + #t~string104.offset, 1);call write~init~int(0, #t~string104.base, 3 + #t~string104.offset, 1);call #t~string107.base, #t~string107.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string107.base, #t~string107.offset, 1);call write~init~int(37, #t~string107.base, 1 + #t~string107.offset, 1);call write~init~int(105, #t~string107.base, 2 + #t~string107.offset, 1);call write~init~int(0, #t~string107.base, 3 + #t~string107.offset, 1);call #t~string109.base, #t~string109.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string109.base, #t~string109.offset, 1);call write~init~int(0, #t~string109.base, 1 + #t~string109.offset, 1);call #t~string112.base, #t~string112.offset := #Ultimate.allocOnStack(9);call #t~string133.base, #t~string133.offset := #Ultimate.allocOnStack(30);call #t~string134.base, #t~string134.offset := #Ultimate.allocOnStack(9);call #t~string135.base, #t~string135.offset := #Ultimate.allocOnStack(21);call #t~string136.base, #t~string136.offset := #Ultimate.allocOnStack(30);call #t~string137.base, #t~string137.offset := #Ultimate.allocOnStack(9);call #t~string138.base, #t~string138.offset := #Ultimate.allocOnStack(21);call #t~string142.base, #t~string142.offset := #Ultimate.allocOnStack(30);call #t~string143.base, #t~string143.offset := #Ultimate.allocOnStack(9);call #t~string144.base, #t~string144.offset := #Ultimate.allocOnStack(25);call #t~string145.base, #t~string145.offset := #Ultimate.allocOnStack(30);call #t~string146.base, #t~string146.offset := #Ultimate.allocOnStack(9);call #t~string147.base, #t~string147.offset := #Ultimate.allocOnStack(25);~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;~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~0 := 0;~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0;~head~0.base, ~head~0.offset := 0, 0;~cleanupTimeShifts~0 := 12; 50322#L-1 havoc main_#res;havoc main_#t~ret164, main_~retValue_acc~28, main_~tmp~29;havoc main_~retValue_acc~28;havoc main_~tmp~29; 48426#L2956 havoc valid_product_#res;havoc valid_product_~retValue_acc~26;havoc valid_product_~retValue_acc~26;valid_product_~retValue_acc~26 := 1;valid_product_#res := valid_product_~retValue_acc~26; 48427#L2964 main_#t~ret164 := valid_product_#res;main_~tmp~29 := main_#t~ret164;havoc main_#t~ret164; 48173#L3307 assume 0 != main_~tmp~29; 48174#L3282 ~floorButtons_spc9_0~0 := 0;~floorButtons_spc9_1~0 := 0;~floorButtons_spc9_2~0 := 0;~floorButtons_spc9_3~0 := 0;~floorButtons_spc9_4~0 := 0; 48863#L751 havoc bigMacCall_#t~ret157, bigMacCall_~tmp~26;havoc bigMacCall_~tmp~26;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~30;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~30; 48864#L3364 assume 0 == getOrigin_~person;getOrigin_~retValue_acc~30 := 4;getOrigin_#res := getOrigin_~retValue_acc~30; 48953#L3389 bigMacCall_#t~ret157 := getOrigin_#res;bigMacCall_~tmp~26 := bigMacCall_#t~ret157;havoc bigMacCall_#t~ret157;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~26;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 48838#L399 assume 0 == initPersonOnFloor_~floor; 48194#L400 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 45579#L507-1 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 46237#L191 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 50068#L203-2 havoc cleanup_#t~ret158, cleanup_#t~ret159, cleanup_~i~1, cleanup_~tmp~27, cleanup_~tmp___0~10, cleanup_~__cil_tmp4~3;havoc cleanup_~i~1;havoc cleanup_~tmp~27;havoc cleanup_~tmp___0~10;havoc cleanup_~__cil_tmp4~3;havoc timeShift_#t~ret63, timeShift_~tmp~15;havoc timeShift_~tmp~15;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; 50069#L1161 timeShift_#t~ret63 := areDoorsOpen_#res;timeShift_~tmp~15 := timeShift_#t~ret63;havoc timeShift_#t~ret63; 49681#L2171 assume 0 != timeShift_~tmp~15; 49582#L2172 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 46279#L1817-11 havoc __utac_acc__Specification9_spec__3_#t~ret0, __utac_acc__Specification9_spec__3_#t~ret1, __utac_acc__Specification9_spec__3_#t~ret2, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~0, __utac_acc__Specification9_spec__3_~tmp___0~0, __utac_acc__Specification9_spec__3_~tmp___1~0;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~0;havoc __utac_acc__Specification9_spec__3_~tmp___0~0;havoc __utac_acc__Specification9_spec__3_~tmp___1~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; 49539#L1152-10 __utac_acc__Specification9_spec__3_#t~ret0 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~0 := __utac_acc__Specification9_spec__3_#t~ret0;havoc __utac_acc__Specification9_spec__3_#t~ret0;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~0;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~8;havoc isEmpty_~retValue_acc~8; 46114#L1212-12 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~8 := 0;isEmpty_#res := isEmpty_~retValue_acc~8; 45784#L1244-12 __utac_acc__Specification9_spec__3_#t~ret1 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~0 := __utac_acc__Specification9_spec__3_#t~ret1;havoc __utac_acc__Specification9_spec__3_#t~ret1; 51015#L794 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~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; 51016#L1161-1 __utac_acc__Specification9_spec__3_#t~ret2 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~0 := __utac_acc__Specification9_spec__3_#t~ret2;havoc __utac_acc__Specification9_spec__3_#t~ret2; 51221#L804 assume 0 != __utac_acc__Specification9_spec__3_~tmp___0~0; 51260#L805 assume 0 == __utac_acc__Specification9_spec__3_~floor~0; 51261#L806 assume 0 != ~floorButtons_spc9_0~0;~floorButtons_spc9_0~0 := 0; 48679#L804-1 cleanup_~i~1 := 0; 50714#L3114-2 [2019-11-28 03:22:20,726 INFO L796 eck$LassoCheckResult]: Loop: 50714#L3114-2 assume !false; 50686#L3115 cleanup_~__cil_tmp4~3 := ~cleanupTimeShifts~0 - 1; 50665#L3118 assume cleanup_~i~1 < cleanup_~__cil_tmp4~3;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~3;havoc isBlocked_~retValue_acc~3;isBlocked_~retValue_acc~3 := ~blocked~0;isBlocked_#res := isBlocked_~retValue_acc~3; 50666#L975 cleanup_#t~ret158 := isBlocked_#res;cleanup_~tmp___0~10 := cleanup_#t~ret158;havoc cleanup_#t~ret158; 49145#L3122 assume 1 != cleanup_~tmp___0~10; 49146#L3122-1 havoc isIdle_#res;havoc isIdle_#t~ret11, isIdle_~retValue_acc~10, isIdle_~tmp~5;havoc isIdle_~retValue_acc~10;havoc isIdle_~tmp~5;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret6, anyStopRequested_#t~ret7, anyStopRequested_#t~ret8, anyStopRequested_#t~ret9, anyStopRequested_#t~ret10, anyStopRequested_~retValue_acc~9, anyStopRequested_~tmp~4, anyStopRequested_~tmp___0~1, anyStopRequested_~tmp___1~1, anyStopRequested_~tmp___2~0, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~9;havoc anyStopRequested_~tmp~4;havoc anyStopRequested_~tmp___0~1;havoc anyStopRequested_~tmp___1~1;havoc anyStopRequested_~tmp___2~0;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~0;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~0; 48987#L128-130 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~0 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~0; 45913#L155-130 anyStopRequested_#t~ret6 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret6;havoc anyStopRequested_#t~ret6; 45914#L1260 assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~9 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~9; 51298#L1324 isIdle_#t~ret11 := anyStopRequested_#res;isIdle_~tmp~5 := isIdle_#t~ret11;havoc isIdle_#t~ret11;isIdle_~retValue_acc~10 := (if 0 == isIdle_~tmp~5 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~10; 51297#L1337 cleanup_#t~ret159 := isIdle_#res;cleanup_~tmp~27 := cleanup_#t~ret159;havoc cleanup_#t~ret159; 51296#L3134 assume !(0 != cleanup_~tmp~27);havoc timeShift_#t~ret63, timeShift_~tmp~15;havoc timeShift_~tmp~15;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; 51295#L1161-2 timeShift_#t~ret63 := areDoorsOpen_#res;timeShift_~tmp~15 := timeShift_#t~ret63;havoc timeShift_#t~ret63; 49684#L2171-1 assume 0 != timeShift_~tmp~15; 49583#L2172-2 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 46250#L1817-23 havoc __utac_acc__Specification9_spec__3_#t~ret0, __utac_acc__Specification9_spec__3_#t~ret1, __utac_acc__Specification9_spec__3_#t~ret2, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~0, __utac_acc__Specification9_spec__3_~tmp___0~0, __utac_acc__Specification9_spec__3_~tmp___1~0;havoc __utac_acc__Specification9_spec__3_~floor~0;havoc __utac_acc__Specification9_spec__3_~tmp~0;havoc __utac_acc__Specification9_spec__3_~tmp___0~0;havoc __utac_acc__Specification9_spec__3_~tmp___1~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; 49508#L1152-21 __utac_acc__Specification9_spec__3_#t~ret0 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~0 := __utac_acc__Specification9_spec__3_#t~ret0;havoc __utac_acc__Specification9_spec__3_#t~ret0;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~0;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~8;havoc isEmpty_~retValue_acc~8; 45994#L1212-25 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~8 := 0;isEmpty_#res := isEmpty_~retValue_acc~8; 45714#L1244-25 __utac_acc__Specification9_spec__3_#t~ret1 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~0 := __utac_acc__Specification9_spec__3_#t~ret1;havoc __utac_acc__Specification9_spec__3_#t~ret1; 51268#L794-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~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; 51980#L1161-3 __utac_acc__Specification9_spec__3_#t~ret2 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~0 := __utac_acc__Specification9_spec__3_#t~ret2;havoc __utac_acc__Specification9_spec__3_#t~ret2; 51282#L804-2 assume 0 != __utac_acc__Specification9_spec__3_~tmp___0~0; 51283#L805-1 assume 0 == __utac_acc__Specification9_spec__3_~floor~0; 51272#L806-2 assume 0 != ~floorButtons_spc9_0~0;~floorButtons_spc9_0~0 := 0; 48621#L804-3 cleanup_~i~1 := 1 + cleanup_~i~1; 50714#L3114-2 [2019-11-28 03:22:20,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:22:20,726 INFO L82 PathProgramCache]: Analyzing trace with hash -443227825, now seen corresponding path program 1 times [2019-11-28 03:22:20,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:22:20,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186405735] [2019-11-28 03:22:20,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:22:20,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:22:20,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:22:20,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186405735] [2019-11-28 03:22:20,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:22:20,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:22:20,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397729873] [2019-11-28 03:22:20,818 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:22:20,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:22:20,818 INFO L82 PathProgramCache]: Analyzing trace with hash -958239558, now seen corresponding path program 1 times [2019-11-28 03:22:20,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:22:20,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547435268] [2019-11-28 03:22:20,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:22:20,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:22:20,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:22:20,895 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:22:21,162 WARN L192 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 90 [2019-11-28 03:22:21,287 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-11-28 03:22:21,300 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:22:21,301 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:22:21,302 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:22:21,302 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:22:21,302 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 03:22:21,302 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:22:21,302 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:22:21,303 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:22:21,303 INFO L133 ssoRankerPreferences]: Filename of dumped script: elevator_spec9_product32.cil.c_Iteration3_Loop [2019-11-28 03:22:21,303 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:22:21,303 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:22:21,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:22:21,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:22:21,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:22:21,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:22:21,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:22:21,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:22:21,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:22:21,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:22:21,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:22:21,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:22:21,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:22:21,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:22:21,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:22:21,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-11-28 03:22:21,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-11-28 03:22:21,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:22:21,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:22:21,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:22:21,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:22:21,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:22:21,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:22:21,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:22:21,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:22:21,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:22:21,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:22:21,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:22:21,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:22:21,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:22:21,937 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:22:21,938 INFO L404 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) [2019-11-28 03:22:21,956 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:22:21,956 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:22:21,970 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:22:21,970 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_cleanup_#t~ret158=0} Honda state: {ULTIMATE.start_cleanup_#t~ret158=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-11-28 03:22:21,990 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:22:21,990 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 03:22:22,002 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:22:22,002 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~persons_0~0=1} Honda state: {~persons_0~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:22:22,057 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:22:22,057 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 03:22:22,069 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:22:22,069 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_cleanup_#t~ret159=0} Honda state: {ULTIMATE.start_cleanup_#t~ret159=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-11-28 03:22:22,123 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:22:22,123 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 03:22:22,138 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:22:22,138 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isIdle_#res=0, ULTIMATE.start_isIdle_~retValue_acc~10=0, ULTIMATE.start_cleanup_~tmp~27=0} Honda state: {ULTIMATE.start_isIdle_#res=0, ULTIMATE.start_isIdle_~retValue_acc~10=0, ULTIMATE.start_cleanup_~tmp~27=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) [2019-11-28 03:22:22,164 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:22:22,164 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:22:22,171 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:22:22,171 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_~tmp___1~1=0} Honda state: {ULTIMATE.start_anyStopRequested_~tmp___1~1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:22:22,192 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:22:22,192 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:22:22,204 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:22:22,204 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_#res=1, ULTIMATE.start_anyStopRequested_~retValue_acc~9=1, ULTIMATE.start_isIdle_~tmp~5=1} Honda state: {ULTIMATE.start_anyStopRequested_#res=1, ULTIMATE.start_anyStopRequested_~retValue_acc~9=1, ULTIMATE.start_isIdle_~tmp~5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:22:22,223 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:22:22,223 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:22:22,236 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:22:22,236 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_getCurrentFloorID_#res=0, ULTIMATE.start_getCurrentFloorID_~retValue_acc~4=0, ~currentFloorID~0=0, ULTIMATE.start___utac_acc__Specification9_spec__3_~tmp~0=0, ULTIMATE.start___utac_acc__Specification9_spec__3_~floor~0=0} Honda state: {ULTIMATE.start_getCurrentFloorID_#res=0, ULTIMATE.start_getCurrentFloorID_~retValue_acc~4=0, ~currentFloorID~0=0, ULTIMATE.start___utac_acc__Specification9_spec__3_~tmp~0=0, ULTIMATE.start___utac_acc__Specification9_spec__3_~floor~0=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) [2019-11-28 03:22:22,255 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:22:22,256 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:22:22,261 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:22:22,261 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~weight~0=1, ~maximumWeight~0=0} Honda state: {~weight~0=1, ~maximumWeight~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /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) [2019-11-28 03:22:22,279 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:22:22,279 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:22:22,294 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:22:22,294 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_areDoorsOpen_#res=4, ULTIMATE.start_areDoorsOpen_~retValue_acc~5=4, ULTIMATE.start___utac_acc__Specification9_spec__3_~tmp___0~0=4, ~doorState~0=4, ULTIMATE.start_timeShift_~tmp~15=4} Honda state: {ULTIMATE.start_areDoorsOpen_#res=4, ULTIMATE.start_areDoorsOpen_~retValue_acc~5=4, ULTIMATE.start___utac_acc__Specification9_spec__3_~tmp___0~0=4, ~doorState~0=4, ULTIMATE.start_timeShift_~tmp~15=4} 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-11-28 03:22:22,312 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:22:22,312 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:22:22,320 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 03:22:22,320 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isIdle_#t~ret11=0} Honda state: {ULTIMATE.start_isIdle_#t~ret11=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-11-28 03:22:22,335 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 03:22:22,335 INFO L160 nArgumentSynthesizer]: Using integer mode. 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-11-28 03:22:22,355 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 03:22:22,355 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 03:22:22,370 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 03:22:22,373 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:22:22,373 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:22:22,373 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:22:22,373 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:22:22,374 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:22:22,374 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:22:22,374 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:22:22,374 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:22:22,374 INFO L133 ssoRankerPreferences]: Filename of dumped script: elevator_spec9_product32.cil.c_Iteration3_Loop [2019-11-28 03:22:22,375 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:22:22,375 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:22:22,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:22:22,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:22:22,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:22:22,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:22:22,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:22:22,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:22:22,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:22:22,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:22:22,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:22:22,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:22:22,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:22:22,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:22:22,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:22:22,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:22:22,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:22:22,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:22:22,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:22:22,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:22:22,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:22:22,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:22:22,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:22:22,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:22:22,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:22:22,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:22:22,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:22:22,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:22:22,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:22:22,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:22:22,941 WARN L192 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-11-28 03:22:23,366 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:22:23,373 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2019-11-28 03:22:23,390 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:22:23,392 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:22:23,393 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:22:23,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:22:23,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:22:23,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:22:23,397 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:22:23,397 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:22:23,400 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. 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) [2019-11-28 03:22:23,416 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:22:23,419 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:22:23,419 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:22:23,419 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:22:23,419 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:22:23,420 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:22:23,422 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:22:23,423 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:22:23,426 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. 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) [2019-11-28 03:22:23,443 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:22:23,445 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:22:23,445 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:22:23,445 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:22:23,445 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:22:23,445 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:22:23,446 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:22:23,446 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:22:23,449 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:22:23,465 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:22:23,468 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:22:23,468 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:22:23,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:22:23,468 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:22:23,468 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:22:23,469 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:22:23,469 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:22:23,475 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. 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-11-28 03:22:23,492 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:22:23,494 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:22:23,494 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:22:23,494 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:22:23,495 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 03:22:23,495 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:22:23,498 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-28 03:22:23,498 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:22:23,503 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:22:23,523 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:22:23,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:22:23,525 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:22:23,526 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:22:23,526 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:22:23,526 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:22:23,527 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:22:23,528 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:22:23,533 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. 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) [2019-11-28 03:22:23,545 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:22:23,546 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:22:23,546 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:22:23,547 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:22:23,547 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:22:23,547 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:22:23,548 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:22:23,548 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:22:23,551 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:22:23,563 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:22:23,564 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:22:23,564 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:22:23,564 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:22:23,565 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:22:23,565 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:22:23,565 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:22:23,565 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:22:23,568 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:22:23,580 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:22:23,581 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:22:23,581 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:22:23,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:22:23,582 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:22:23,582 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:22:23,582 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:22:23,582 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:22:23,585 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:22:23,596 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:22:23,598 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:22:23,598 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:22:23,598 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:22:23,599 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 03:22:23,599 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:22:23,605 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-28 03:22:23,606 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:22:23,616 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:22:23,624 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:22:23,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:22:23,630 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:22:23,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:22:23,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:22:23,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:22:23,632 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:22:23,632 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:22:23,637 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:22:23,646 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:22:23,648 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:22:23,648 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:22:23,648 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:22:23,649 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:22:23,649 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:22:23,650 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:22:23,650 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:22:23,652 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:22:23,658 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:22:23,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:22:23,660 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:22:23,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:22:23,660 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 03:22:23,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:22:23,662 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-28 03:22:23,662 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:22:23,665 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:22:23,672 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:22:23,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:22:23,674 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:22:23,675 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:22:23,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:22:23,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:22:23,676 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:22:23,676 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:22:23,678 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:22:23,685 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:22:23,687 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:22:23,687 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:22:23,687 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:22:23,687 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:22:23,687 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:22:23,688 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:22:23,688 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:22:23,690 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:22:23,697 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:22:23,699 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:22:23,700 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:22:23,700 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:22:23,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:22:23,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:22:23,701 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:22:23,701 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:22:23,703 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:22:23,709 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:22:23,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:22:23,712 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:22:23,712 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:22:23,712 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:22:23,712 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:22:23,713 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:22:23,713 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:22:23,715 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:22:23,722 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:22:23,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:22:23,724 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:22:23,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:22:23,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:22:23,724 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:22:23,725 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:22:23,725 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:22:23,727 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:22:23,734 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:22:23,736 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:22:23,736 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:22:23,736 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:22:23,736 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:22:23,737 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:22:23,737 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:22:23,737 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:22:23,740 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:22:23,746 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:22:23,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:22:23,749 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:22:23,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:22:23,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:22:23,750 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:22:23,751 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:22:23,751 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:22:23,754 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:22:23,762 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:22:23,764 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:22:23,764 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:22:23,764 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:22:23,764 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:22:23,764 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:22:23,765 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:22:23,765 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:22:23,767 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:22:23,774 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:22:23,776 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:22:23,776 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:22:23,777 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:22:23,777 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:22:23,777 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:22:23,778 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:22:23,778 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:22:23,780 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:22:23,789 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:22:23,791 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:22:23,791 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:22:23,792 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:22:23,792 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:22:23,792 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:22:23,795 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:22:23,795 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:22:23,803 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:22:23,825 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 03:22:23,826 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:22:23,834 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:22:23,834 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 03:22:23,834 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:22:23,835 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~cleanupTimeShifts~0, ULTIMATE.start_cleanup_~i~1) = 1*~cleanupTimeShifts~0 - 1*ULTIMATE.start_cleanup_~i~1 Supporting invariants [] [2019-11-28 03:22:23,839 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 03:22:23,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:22:24,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:22:24,011 INFO L255 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:22:24,017 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:22:24,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:22:24,061 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 03:22:24,067 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:22:24,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:22:24,127 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-11-28 03:22:24,128 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7141 states and 13453 transitions. cyclomatic complexity: 6313 Second operand 5 states. [2019-11-28 03:22:24,742 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7141 states and 13453 transitions. cyclomatic complexity: 6313. Second operand 5 states. Result 11610 states and 21873 transitions. Complement of second has 8 states. [2019-11-28 03:22:24,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-28 03:22:24,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 03:22:24,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10219 transitions. [2019-11-28 03:22:24,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10219 transitions. Stem has 27 letters. Loop has 25 letters. [2019-11-28 03:22:24,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:22:24,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10219 transitions. Stem has 52 letters. Loop has 25 letters. [2019-11-28 03:22:24,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:22:24,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10219 transitions. Stem has 27 letters. Loop has 50 letters. [2019-11-28 03:22:24,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:22:24,763 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11610 states and 21873 transitions. [2019-11-28 03:22:24,898 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 03:22:24,898 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11610 states to 0 states and 0 transitions. [2019-11-28 03:22:24,898 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 03:22:24,898 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 03:22:24,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 03:22:24,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:22:24,899 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:22:24,899 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:22:24,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:22:24,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:22:24,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:22:24,900 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2019-11-28 03:22:24,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:22:24,901 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-11-28 03:22:24,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 03:22:24,901 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-11-28 03:22:24,902 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 03:22:24,902 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 03:22:24,902 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 03:22:24,903 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 03:22:24,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 03:22:24,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:22:24,903 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:22:24,903 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:22:24,904 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:22:24,904 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 03:22:24,904 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 03:22:24,904 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 03:22:24,905 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 03:22:24,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 03:22:24 BoogieIcfgContainer [2019-11-28 03:22:24,914 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 03:22:24,915 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 03:22:24,915 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 03:22:24,915 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 03:22:24,916 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:22:15" (3/4) ... [2019-11-28 03:22:24,921 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 03:22:24,922 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 03:22:24,924 INFO L168 Benchmark]: Toolchain (without parser) took 24514.33 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.2 GB). Free memory was 952.2 MB in the beginning and 1.0 GB in the end (delta: -72.8 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-11-28 03:22:24,925 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:22:24,926 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1050.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 952.2 MB in the beginning and 1.1 GB in the end (delta: -139.8 MB). Peak memory consumption was 37.5 MB. Max. memory is 11.5 GB. [2019-11-28 03:22:24,926 INFO L168 Benchmark]: Boogie Procedure Inliner took 413.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 79.1 MB). Peak memory consumption was 79.1 MB. Max. memory is 11.5 GB. [2019-11-28 03:22:24,927 INFO L168 Benchmark]: Boogie Preprocessor took 534.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 940.4 MB in the end (delta: 72.5 MB). Peak memory consumption was 72.5 MB. Max. memory is 11.5 GB. [2019-11-28 03:22:24,928 INFO L168 Benchmark]: RCFGBuilder took 12687.85 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 511.7 MB). Free memory was 940.4 MB in the beginning and 1.2 GB in the end (delta: -234.9 MB). Peak memory consumption was 397.5 MB. Max. memory is 11.5 GB. [2019-11-28 03:22:24,929 INFO L168 Benchmark]: BuchiAutomizer took 9812.69 ms. Allocated memory was 1.7 GB in the beginning and 2.2 GB in the end (delta: 490.7 MB). Free memory was 1.2 GB in the beginning and 1.0 GB in the end (delta: 150.3 MB). Peak memory consumption was 641.0 MB. Max. memory is 11.5 GB. [2019-11-28 03:22:24,929 INFO L168 Benchmark]: Witness Printer took 6.72 ms. Allocated memory is still 2.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:22:24,934 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1050.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 952.2 MB in the beginning and 1.1 GB in the end (delta: -139.8 MB). Peak memory consumption was 37.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 413.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 79.1 MB). Peak memory consumption was 79.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 534.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 940.4 MB in the end (delta: 72.5 MB). Peak memory consumption was 72.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 12687.85 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 511.7 MB). Free memory was 940.4 MB in the beginning and 1.2 GB in the end (delta: -234.9 MB). Peak memory consumption was 397.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9812.69 ms. Allocated memory was 1.7 GB in the beginning and 2.2 GB in the end (delta: 490.7 MB). Free memory was 1.2 GB in the beginning and 1.0 GB in the end (delta: 150.3 MB). Peak memory consumption was 641.0 MB. Max. memory is 11.5 GB. * Witness Printer took 6.72 ms. Allocated memory is still 2.2 GB. Free memory is still 1.0 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 9.7s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 3.8s. Construction of modules took 0.8s. Büchi inclusion checks took 2.4s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.9s AutomataMinimizationTime, 2 MinimizatonAttempts, 16801 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.8s Buchi closure took 0.0s. Biggest automaton had 7173 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 46465 SDtfs, 89722 SDslu, 104771 SDs, 0 SdLazy, 267 SolverSat, 284 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI2 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital121 mio100 ax100 hnf100 lsp14 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq211 hnf89 smp100 dnf176 smp100 tf103 neg96 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 25ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 10 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...