./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/elevator_spec9_product30_false-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/product-lines/elevator_spec9_product30_false-unreach-call_true-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8b0793fae3a16c39df4e1ecce9d338c866ff1e9f ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 04:06:34,080 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:06:34,081 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:06:34,097 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:06:34,098 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:06:34,100 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:06:34,101 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:06:34,104 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:06:34,107 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:06:34,110 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:06:34,112 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:06:34,113 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:06:34,114 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:06:34,116 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:06:34,117 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:06:34,117 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:06:34,121 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:06:34,130 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:06:34,134 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:06:34,136 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:06:34,137 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:06:34,138 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:06:34,143 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:06:34,145 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:06:34,145 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:06:34,146 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:06:34,147 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:06:34,147 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:06:34,148 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:06:34,152 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:06:34,152 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:06:34,153 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:06:34,153 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:06:34,153 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:06:34,154 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:06:34,155 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:06:34,155 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 04:06:34,170 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:06:34,171 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:06:34,172 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:06:34,172 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:06:34,172 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:06:34,172 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:06:34,172 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:06:34,173 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:06:34,173 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:06:34,173 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:06:34,173 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:06:34,173 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:06:34,173 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:06:34,174 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:06:34,174 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:06:34,174 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:06:34,174 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:06:34,174 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:06:34,174 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:06:34,175 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:06:34,175 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:06:34,175 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:06:34,175 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:06:34,175 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:06:34,175 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:06:34,176 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:06:34,176 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:06:34,176 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:06:34,176 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:06:34,176 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:06:34,177 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:06:34,177 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:06:34,178 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8b0793fae3a16c39df4e1ecce9d338c866ff1e9f [2019-01-14 04:06:34,219 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:06:34,232 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:06:34,236 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:06:34,238 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:06:34,238 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:06:34,239 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/elevator_spec9_product30_false-unreach-call_true-termination.cil.c [2019-01-14 04:06:34,296 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/586213ea6/d6ec681829c748beb768582300a59770/FLAGee2363997 [2019-01-14 04:06:34,969 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:06:34,970 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/elevator_spec9_product30_false-unreach-call_true-termination.cil.c [2019-01-14 04:06:34,988 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/586213ea6/d6ec681829c748beb768582300a59770/FLAGee2363997 [2019-01-14 04:06:35,149 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/586213ea6/d6ec681829c748beb768582300a59770 [2019-01-14 04:06:35,153 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:06:35,154 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:06:35,155 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:06:35,155 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:06:35,162 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:06:35,163 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:06:35" (1/1) ... [2019-01-14 04:06:35,166 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f9a09c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:06:35, skipping insertion in model container [2019-01-14 04:06:35,166 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:06:35" (1/1) ... [2019-01-14 04:06:35,174 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:06:35,259 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:06:35,879 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:06:35,991 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:06:36,129 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:06:36,200 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:06:36,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:06:36 WrapperNode [2019-01-14 04:06:36,200 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:06:36,201 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:06:36,201 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:06:36,201 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:06:36,210 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:06:36" (1/1) ... [2019-01-14 04:06:36,245 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:06:36" (1/1) ... [2019-01-14 04:06:36,587 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:06:36,590 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:06:36,590 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:06:36,590 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:06:36,601 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:06:36" (1/1) ... [2019-01-14 04:06:36,602 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:06:36" (1/1) ... [2019-01-14 04:06:36,664 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:06:36" (1/1) ... [2019-01-14 04:06:36,666 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:06:36" (1/1) ... [2019-01-14 04:06:36,811 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:06:36" (1/1) ... [2019-01-14 04:06:36,973 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:06:36" (1/1) ... [2019-01-14 04:06:37,015 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:06:36" (1/1) ... [2019-01-14 04:06:37,085 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:06:37,085 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:06:37,086 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:06:37,086 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:06:37,087 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:06:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:06:37,140 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 04:06:37,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-14 04:06:37,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:06:37,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:06:52,307 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:06:52,308 INFO L286 CfgBuilder]: Removed 1553 assue(true) statements. [2019-01-14 04:06:52,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:06:52 BoogieIcfgContainer [2019-01-14 04:06:52,312 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:06:52,313 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:06:52,313 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:06:52,317 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:06:52,318 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:06:52,318 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:06:35" (1/3) ... [2019-01-14 04:06:52,319 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@63e55cb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:06:52, skipping insertion in model container [2019-01-14 04:06:52,319 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:06:52,319 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:06:36" (2/3) ... [2019-01-14 04:06:52,320 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@63e55cb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:06:52, skipping insertion in model container [2019-01-14 04:06:52,320 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:06:52,320 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:06:52" (3/3) ... [2019-01-14 04:06:52,322 INFO L375 chiAutomizerObserver]: Analyzing ICFG elevator_spec9_product30_false-unreach-call_true-termination.cil.c [2019-01-14 04:06:52,371 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:06:52,371 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:06:52,372 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:06:52,372 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:06:52,372 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:06:52,372 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:06:52,372 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:06:52,372 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:06:52,372 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:06:52,470 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6963 states. [2019-01-14 04:06:52,652 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3471 [2019-01-14 04:06:52,653 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:06:52,653 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:06:52,683 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:06:52,683 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:06:52,683 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:06:52,684 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6963 states. [2019-01-14 04:06:52,773 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3471 [2019-01-14 04:06:52,773 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:06:52,774 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:06:52,780 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:06:52,780 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:06:52,788 INFO L794 eck$LassoCheckResult]: Stem: 2960#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(30);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(9);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(21);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(30);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(9);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(21);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(30);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(9);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(25);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(25);~weight~0 := 0;~maximumWeight~0 := 100;~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;~cleanupTimeShifts~0 := 12;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0;call #t~string99.base, #t~string99.offset := #Ultimate.allocOnStack(10);call #t~string101.base, #t~string101.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string101.base, #t~string101.offset, 1);call write~init~int(95, #t~string101.base, 1 + #t~string101.offset, 1);call write~init~int(93, #t~string101.base, 2 + #t~string101.offset, 1);call write~init~int(0, #t~string101.base, 3 + #t~string101.offset, 1);call #t~string103.base, #t~string103.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string103.base, #t~string103.offset, 1);call write~init~int(93, #t~string103.base, 1 + #t~string103.offset, 1);call write~init~int(32, #t~string103.base, 2 + #t~string103.offset, 1);call write~init~int(0, #t~string103.base, 3 + #t~string103.offset, 1);call #t~string105.base, #t~string105.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string105.base, #t~string105.offset, 1);call write~init~int(97, #t~string105.base, 1 + #t~string105.offset, 1);call write~init~int(116, #t~string105.base, 2 + #t~string105.offset, 1);call write~init~int(32, #t~string105.base, 3 + #t~string105.offset, 1);call write~init~int(0, #t~string105.base, 4 + #t~string105.offset, 1);call #t~string107.base, #t~string107.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string107.base, #t~string107.offset, 1);call write~init~int(105, #t~string107.base, 1 + #t~string107.offset, 1);call write~init~int(0, #t~string107.base, 2 + #t~string107.offset, 1);call #t~string109.base, #t~string109.offset := #Ultimate.allocOnStack(10);call #t~string111.base, #t~string111.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string111.base, #t~string111.offset, 1);call write~init~int(112, #t~string111.base, 1 + #t~string111.offset, 1);call write~init~int(0, #t~string111.base, 2 + #t~string111.offset, 1);call #t~string113.base, #t~string113.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string113.base, #t~string113.offset, 1);call write~init~int(111, #t~string113.base, 1 + #t~string113.offset, 1);call write~init~int(119, #t~string113.base, 2 + #t~string113.offset, 1);call write~init~int(110, #t~string113.base, 3 + #t~string113.offset, 1);call write~init~int(0, #t~string113.base, 4 + #t~string113.offset, 1);call #t~string115.base, #t~string115.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string115.base, #t~string115.offset, 1);call write~init~int(73, #t~string115.base, 1 + #t~string115.offset, 1);call write~init~int(76, #t~string115.base, 2 + #t~string115.offset, 1);call write~init~int(95, #t~string115.base, 3 + #t~string115.offset, 1);call write~init~int(112, #t~string115.base, 4 + #t~string115.offset, 1);call write~init~int(58, #t~string115.base, 5 + #t~string115.offset, 1);call write~init~int(0, #t~string115.base, 6 + #t~string115.offset, 1);call #t~string117.base, #t~string117.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string117.base, #t~string117.offset, 1);call write~init~int(37, #t~string117.base, 1 + #t~string117.offset, 1);call write~init~int(105, #t~string117.base, 2 + #t~string117.offset, 1);call write~init~int(0, #t~string117.base, 3 + #t~string117.offset, 1);call #t~string119.base, #t~string119.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string119.base, #t~string119.offset, 1);call write~init~int(37, #t~string119.base, 1 + #t~string119.offset, 1);call write~init~int(105, #t~string119.base, 2 + #t~string119.offset, 1);call write~init~int(0, #t~string119.base, 3 + #t~string119.offset, 1);call #t~string121.base, #t~string121.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string121.base, #t~string121.offset, 1);call write~init~int(37, #t~string121.base, 1 + #t~string121.offset, 1);call write~init~int(105, #t~string121.base, 2 + #t~string121.offset, 1);call write~init~int(0, #t~string121.base, 3 + #t~string121.offset, 1);call #t~string123.base, #t~string123.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string123.base, #t~string123.offset, 1);call write~init~int(37, #t~string123.base, 1 + #t~string123.offset, 1);call write~init~int(105, #t~string123.base, 2 + #t~string123.offset, 1);call write~init~int(0, #t~string123.base, 3 + #t~string123.offset, 1);call #t~string125.base, #t~string125.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string125.base, #t~string125.offset, 1);call write~init~int(37, #t~string125.base, 1 + #t~string125.offset, 1);call write~init~int(105, #t~string125.base, 2 + #t~string125.offset, 1);call write~init~int(0, #t~string125.base, 3 + #t~string125.offset, 1);call #t~string127.base, #t~string127.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string127.base, #t~string127.offset, 1);call write~init~int(70, #t~string127.base, 1 + #t~string127.offset, 1);call write~init~int(95, #t~string127.base, 2 + #t~string127.offset, 1);call write~init~int(112, #t~string127.base, 3 + #t~string127.offset, 1);call write~init~int(58, #t~string127.base, 4 + #t~string127.offset, 1);call write~init~int(0, #t~string127.base, 5 + #t~string127.offset, 1);call #t~string130.base, #t~string130.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string130.base, #t~string130.offset, 1);call write~init~int(37, #t~string130.base, 1 + #t~string130.offset, 1);call write~init~int(105, #t~string130.base, 2 + #t~string130.offset, 1);call write~init~int(0, #t~string130.base, 3 + #t~string130.offset, 1);call #t~string133.base, #t~string133.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string133.base, #t~string133.offset, 1);call write~init~int(37, #t~string133.base, 1 + #t~string133.offset, 1);call write~init~int(105, #t~string133.base, 2 + #t~string133.offset, 1);call write~init~int(0, #t~string133.base, 3 + #t~string133.offset, 1);call #t~string136.base, #t~string136.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string136.base, #t~string136.offset, 1);call write~init~int(37, #t~string136.base, 1 + #t~string136.offset, 1);call write~init~int(105, #t~string136.base, 2 + #t~string136.offset, 1);call write~init~int(0, #t~string136.base, 3 + #t~string136.offset, 1);call #t~string139.base, #t~string139.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string139.base, #t~string139.offset, 1);call write~init~int(37, #t~string139.base, 1 + #t~string139.offset, 1);call write~init~int(105, #t~string139.base, 2 + #t~string139.offset, 1);call write~init~int(0, #t~string139.base, 3 + #t~string139.offset, 1);call #t~string142.base, #t~string142.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string142.base, #t~string142.offset, 1);call write~init~int(37, #t~string142.base, 1 + #t~string142.offset, 1);call write~init~int(105, #t~string142.base, 2 + #t~string142.offset, 1);call write~init~int(0, #t~string142.base, 3 + #t~string142.offset, 1);call #t~string144.base, #t~string144.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string144.base, #t~string144.offset, 1);call write~init~int(0, #t~string144.base, 1 + #t~string144.offset, 1);call #t~string147.base, #t~string147.offset := #Ultimate.allocOnStack(9);~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; 6442#L-1true havoc main_#res;havoc main_#t~ret162, main_~retValue_acc~27, main_~tmp~29;havoc main_~retValue_acc~27;havoc main_~tmp~29; 1159#L430true havoc valid_product_#res;havoc valid_product_~retValue_acc~4;havoc valid_product_~retValue_acc~4;valid_product_~retValue_acc~4 := 1;valid_product_#res := valid_product_~retValue_acc~4; 3857#L438true main_#t~ret162 := valid_product_#res;main_~tmp~29 := main_#t~ret162;havoc main_#t~ret162; 3908#L3432true assume 0 != main_~tmp~29; 2024#L3407true ~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; 3336#L472true havoc bigMacCall_#t~ret155, bigMacCall_~tmp~26;havoc bigMacCall_~tmp~26;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~6;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~6; 23#L775true assume 0 == getOrigin_~person;getOrigin_~retValue_acc~6 := 4;getOrigin_#res := getOrigin_~retValue_acc~6; 4326#L800true bigMacCall_#t~ret155 := getOrigin_#res;bigMacCall_~tmp~26 := bigMacCall_#t~ret155;havoc bigMacCall_#t~ret155;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; 5508#L2788true assume 0 == initPersonOnFloor_~floor; 5417#L2789true assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 1254#L2896-1true callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 2756#L2580true assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 3207#L2592-2true havoc cleanup_#t~ret156, cleanup_#t~ret157, cleanup_~i~3, cleanup_~tmp~27, cleanup_~tmp___0~10, cleanup_~__cil_tmp4~3;havoc cleanup_~i~3;havoc cleanup_~tmp~27;havoc cleanup_~tmp___0~10;havoc cleanup_~__cil_tmp4~3;havoc timeShift_#t~ret98, timeShift_~tmp~18;havoc timeShift_~tmp~18;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~10;havoc areDoorsOpen_~retValue_acc~10;areDoorsOpen_~retValue_acc~10 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~10; 2450#L1112true timeShift_#t~ret98 := areDoorsOpen_#res;timeShift_~tmp~18 := timeShift_#t~ret98;havoc timeShift_#t~ret98; 3322#L2061true assume 0 != timeShift_~tmp~18; 3311#L2062true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 4555#L1738-11true havoc __utac_acc__Specification9_spec__3_#t~ret36, __utac_acc__Specification9_spec__3_#t~ret37, __utac_acc__Specification9_spec__3_#t~ret38, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~3, __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~3;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~9;havoc getCurrentFloorID_~retValue_acc~9;getCurrentFloorID_~retValue_acc~9 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~9; 1563#L1103-2true __utac_acc__Specification9_spec__3_#t~ret36 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~3 := __utac_acc__Specification9_spec__3_#t~ret36;havoc __utac_acc__Specification9_spec__3_#t~ret36;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~3;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~13;havoc isEmpty_~retValue_acc~13; 3011#L1163-12true assume 1 == ~persons_0~0;isEmpty_~retValue_acc~13 := 0;isEmpty_#res := isEmpty_~retValue_acc~13; 5656#L1195-12true __utac_acc__Specification9_spec__3_#t~ret37 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~0 := __utac_acc__Specification9_spec__3_#t~ret37;havoc __utac_acc__Specification9_spec__3_#t~ret37; 4816#L515true 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; 6662#L525-1true cleanup_~i~3 := 0; 457#L3239-2true [2019-01-14 04:06:52,789 INFO L796 eck$LassoCheckResult]: Loop: 457#L3239-2true assume !false; 356#L3240true cleanup_~__cil_tmp4~3 := ~cleanupTimeShifts~0 - 1; 159#L3243true assume cleanup_~i~3 < cleanup_~__cil_tmp4~3;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~8;havoc isBlocked_~retValue_acc~8;isBlocked_~retValue_acc~8 := ~blocked~0;isBlocked_#res := isBlocked_~retValue_acc~8; 1525#L926true cleanup_#t~ret156 := isBlocked_#res;cleanup_~tmp___0~10 := cleanup_#t~ret156;havoc cleanup_#t~ret156; 1235#L3247true assume 1 != cleanup_~tmp___0~10; 1234#L3247-1true havoc isIdle_#res;havoc isIdle_#t~ret53, isIdle_~retValue_acc~15, isIdle_~tmp~10;havoc isIdle_~retValue_acc~15;havoc isIdle_~tmp~10;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret48, anyStopRequested_#t~ret49, anyStopRequested_#t~ret50, anyStopRequested_#t~ret51, anyStopRequested_#t~ret52, anyStopRequested_~retValue_acc~14, anyStopRequested_~tmp~9, anyStopRequested_~tmp___0~3, anyStopRequested_~tmp___1~3, anyStopRequested_~tmp___2~0, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~14;havoc anyStopRequested_~tmp~9;havoc anyStopRequested_~tmp___0~3;havoc anyStopRequested_~tmp___1~3;havoc anyStopRequested_~tmp___2~0;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~23;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~23; 2490#L2517-122true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~23 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~23; 966#L2544-122true anyStopRequested_#t~ret48 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret48;havoc anyStopRequested_#t~ret48; 4575#L1211true assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~14 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~14; 1602#L1275true isIdle_#t~ret53 := anyStopRequested_#res;isIdle_~tmp~10 := isIdle_#t~ret53;havoc isIdle_#t~ret53;isIdle_~retValue_acc~15 := (if 0 == isIdle_~tmp~10 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~15; 2466#L1288true cleanup_#t~ret157 := isIdle_#res;cleanup_~tmp~27 := cleanup_#t~ret157;havoc cleanup_#t~ret157; 3763#L3259true assume !(0 != cleanup_~tmp~27);havoc timeShift_#t~ret98, timeShift_~tmp~18;havoc timeShift_~tmp~18;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~10;havoc areDoorsOpen_~retValue_acc~10;areDoorsOpen_~retValue_acc~10 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~10; 2456#L1112-2true timeShift_#t~ret98 := areDoorsOpen_#res;timeShift_~tmp~18 := timeShift_#t~ret98;havoc timeShift_#t~ret98; 3323#L2061-1true assume 0 != timeShift_~tmp~18; 3312#L2062-2true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 4576#L1738-23true havoc __utac_acc__Specification9_spec__3_#t~ret36, __utac_acc__Specification9_spec__3_#t~ret37, __utac_acc__Specification9_spec__3_#t~ret38, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~3, __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~3;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~9;havoc getCurrentFloorID_~retValue_acc~9;getCurrentFloorID_~retValue_acc~9 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~9; 1566#L1103-5true __utac_acc__Specification9_spec__3_#t~ret36 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~3 := __utac_acc__Specification9_spec__3_#t~ret36;havoc __utac_acc__Specification9_spec__3_#t~ret36;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~3;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~13;havoc isEmpty_~retValue_acc~13; 3075#L1163-25true assume 1 == ~persons_0~0;isEmpty_~retValue_acc~13 := 0;isEmpty_#res := isEmpty_~retValue_acc~13; 5634#L1195-25true __utac_acc__Specification9_spec__3_#t~ret37 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~0 := __utac_acc__Specification9_spec__3_#t~ret37;havoc __utac_acc__Specification9_spec__3_#t~ret37; 4819#L515-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; 6664#L525-3true cleanup_~i~3 := 1 + cleanup_~i~3; 457#L3239-2true [2019-01-14 04:06:52,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:06:52,803 INFO L82 PathProgramCache]: Analyzing trace with hash -2042449897, now seen corresponding path program 1 times [2019-01-14 04:06:52,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:06:52,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:06:52,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:06:52,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:06:52,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:06:53,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:06:53,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:06:53,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:06:53,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:06:53,249 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:06:53,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:06:53,250 INFO L82 PathProgramCache]: Analyzing trace with hash 192516488, now seen corresponding path program 1 times [2019-01-14 04:06:53,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:06:53,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:06:53,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:06:53,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:06:53,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:06:53,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:06:53,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:06:53,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:06:53,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 04:06:53,399 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:06:53,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 04:06:53,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 04:06:53,421 INFO L87 Difference]: Start difference. First operand 6963 states. Second operand 4 states. [2019-01-14 04:06:57,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:06:57,090 INFO L93 Difference]: Finished difference Result 17141 states and 32445 transitions. [2019-01-14 04:06:57,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 04:06:57,092 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17141 states and 32445 transitions. [2019-01-14 04:06:57,272 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11959 [2019-01-14 04:06:57,422 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17141 states to 17099 states and 32396 transitions. [2019-01-14 04:06:57,423 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17099 [2019-01-14 04:06:57,451 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17099 [2019-01-14 04:06:57,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17099 states and 32396 transitions. [2019-01-14 04:06:57,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:06:57,505 INFO L706 BuchiCegarLoop]: Abstraction has 17099 states and 32396 transitions. [2019-01-14 04:06:57,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17099 states and 32396 transitions. [2019-01-14 04:06:57,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17099 to 6953. [2019-01-14 04:06:57,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6953 states. [2019-01-14 04:06:57,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6953 states to 6953 states and 13170 transitions. [2019-01-14 04:06:57,824 INFO L729 BuchiCegarLoop]: Abstraction has 6953 states and 13170 transitions. [2019-01-14 04:06:57,824 INFO L609 BuchiCegarLoop]: Abstraction has 6953 states and 13170 transitions. [2019-01-14 04:06:57,824 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:06:57,824 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6953 states and 13170 transitions. [2019-01-14 04:06:57,866 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3473 [2019-01-14 04:06:57,866 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:06:57,866 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:06:57,872 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:06:57,872 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:06:57,873 INFO L794 eck$LassoCheckResult]: Stem: 27870#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(30);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(9);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(21);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(30);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(9);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(21);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(30);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(9);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(25);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(25);~weight~0 := 0;~maximumWeight~0 := 100;~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;~cleanupTimeShifts~0 := 12;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0;call #t~string99.base, #t~string99.offset := #Ultimate.allocOnStack(10);call #t~string101.base, #t~string101.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string101.base, #t~string101.offset, 1);call write~init~int(95, #t~string101.base, 1 + #t~string101.offset, 1);call write~init~int(93, #t~string101.base, 2 + #t~string101.offset, 1);call write~init~int(0, #t~string101.base, 3 + #t~string101.offset, 1);call #t~string103.base, #t~string103.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string103.base, #t~string103.offset, 1);call write~init~int(93, #t~string103.base, 1 + #t~string103.offset, 1);call write~init~int(32, #t~string103.base, 2 + #t~string103.offset, 1);call write~init~int(0, #t~string103.base, 3 + #t~string103.offset, 1);call #t~string105.base, #t~string105.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string105.base, #t~string105.offset, 1);call write~init~int(97, #t~string105.base, 1 + #t~string105.offset, 1);call write~init~int(116, #t~string105.base, 2 + #t~string105.offset, 1);call write~init~int(32, #t~string105.base, 3 + #t~string105.offset, 1);call write~init~int(0, #t~string105.base, 4 + #t~string105.offset, 1);call #t~string107.base, #t~string107.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string107.base, #t~string107.offset, 1);call write~init~int(105, #t~string107.base, 1 + #t~string107.offset, 1);call write~init~int(0, #t~string107.base, 2 + #t~string107.offset, 1);call #t~string109.base, #t~string109.offset := #Ultimate.allocOnStack(10);call #t~string111.base, #t~string111.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string111.base, #t~string111.offset, 1);call write~init~int(112, #t~string111.base, 1 + #t~string111.offset, 1);call write~init~int(0, #t~string111.base, 2 + #t~string111.offset, 1);call #t~string113.base, #t~string113.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string113.base, #t~string113.offset, 1);call write~init~int(111, #t~string113.base, 1 + #t~string113.offset, 1);call write~init~int(119, #t~string113.base, 2 + #t~string113.offset, 1);call write~init~int(110, #t~string113.base, 3 + #t~string113.offset, 1);call write~init~int(0, #t~string113.base, 4 + #t~string113.offset, 1);call #t~string115.base, #t~string115.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string115.base, #t~string115.offset, 1);call write~init~int(73, #t~string115.base, 1 + #t~string115.offset, 1);call write~init~int(76, #t~string115.base, 2 + #t~string115.offset, 1);call write~init~int(95, #t~string115.base, 3 + #t~string115.offset, 1);call write~init~int(112, #t~string115.base, 4 + #t~string115.offset, 1);call write~init~int(58, #t~string115.base, 5 + #t~string115.offset, 1);call write~init~int(0, #t~string115.base, 6 + #t~string115.offset, 1);call #t~string117.base, #t~string117.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string117.base, #t~string117.offset, 1);call write~init~int(37, #t~string117.base, 1 + #t~string117.offset, 1);call write~init~int(105, #t~string117.base, 2 + #t~string117.offset, 1);call write~init~int(0, #t~string117.base, 3 + #t~string117.offset, 1);call #t~string119.base, #t~string119.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string119.base, #t~string119.offset, 1);call write~init~int(37, #t~string119.base, 1 + #t~string119.offset, 1);call write~init~int(105, #t~string119.base, 2 + #t~string119.offset, 1);call write~init~int(0, #t~string119.base, 3 + #t~string119.offset, 1);call #t~string121.base, #t~string121.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string121.base, #t~string121.offset, 1);call write~init~int(37, #t~string121.base, 1 + #t~string121.offset, 1);call write~init~int(105, #t~string121.base, 2 + #t~string121.offset, 1);call write~init~int(0, #t~string121.base, 3 + #t~string121.offset, 1);call #t~string123.base, #t~string123.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string123.base, #t~string123.offset, 1);call write~init~int(37, #t~string123.base, 1 + #t~string123.offset, 1);call write~init~int(105, #t~string123.base, 2 + #t~string123.offset, 1);call write~init~int(0, #t~string123.base, 3 + #t~string123.offset, 1);call #t~string125.base, #t~string125.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string125.base, #t~string125.offset, 1);call write~init~int(37, #t~string125.base, 1 + #t~string125.offset, 1);call write~init~int(105, #t~string125.base, 2 + #t~string125.offset, 1);call write~init~int(0, #t~string125.base, 3 + #t~string125.offset, 1);call #t~string127.base, #t~string127.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string127.base, #t~string127.offset, 1);call write~init~int(70, #t~string127.base, 1 + #t~string127.offset, 1);call write~init~int(95, #t~string127.base, 2 + #t~string127.offset, 1);call write~init~int(112, #t~string127.base, 3 + #t~string127.offset, 1);call write~init~int(58, #t~string127.base, 4 + #t~string127.offset, 1);call write~init~int(0, #t~string127.base, 5 + #t~string127.offset, 1);call #t~string130.base, #t~string130.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string130.base, #t~string130.offset, 1);call write~init~int(37, #t~string130.base, 1 + #t~string130.offset, 1);call write~init~int(105, #t~string130.base, 2 + #t~string130.offset, 1);call write~init~int(0, #t~string130.base, 3 + #t~string130.offset, 1);call #t~string133.base, #t~string133.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string133.base, #t~string133.offset, 1);call write~init~int(37, #t~string133.base, 1 + #t~string133.offset, 1);call write~init~int(105, #t~string133.base, 2 + #t~string133.offset, 1);call write~init~int(0, #t~string133.base, 3 + #t~string133.offset, 1);call #t~string136.base, #t~string136.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string136.base, #t~string136.offset, 1);call write~init~int(37, #t~string136.base, 1 + #t~string136.offset, 1);call write~init~int(105, #t~string136.base, 2 + #t~string136.offset, 1);call write~init~int(0, #t~string136.base, 3 + #t~string136.offset, 1);call #t~string139.base, #t~string139.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string139.base, #t~string139.offset, 1);call write~init~int(37, #t~string139.base, 1 + #t~string139.offset, 1);call write~init~int(105, #t~string139.base, 2 + #t~string139.offset, 1);call write~init~int(0, #t~string139.base, 3 + #t~string139.offset, 1);call #t~string142.base, #t~string142.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string142.base, #t~string142.offset, 1);call write~init~int(37, #t~string142.base, 1 + #t~string142.offset, 1);call write~init~int(105, #t~string142.base, 2 + #t~string142.offset, 1);call write~init~int(0, #t~string142.base, 3 + #t~string142.offset, 1);call #t~string144.base, #t~string144.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string144.base, #t~string144.offset, 1);call write~init~int(0, #t~string144.base, 1 + #t~string144.offset, 1);call #t~string147.base, #t~string147.offset := #Ultimate.allocOnStack(9);~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; 27871#L-1 havoc main_#res;havoc main_#t~ret162, main_~retValue_acc~27, main_~tmp~29;havoc main_~retValue_acc~27;havoc main_~tmp~29; 25865#L430 havoc valid_product_#res;havoc valid_product_~retValue_acc~4;havoc valid_product_~retValue_acc~4;valid_product_~retValue_acc~4 := 1;valid_product_#res := valid_product_~retValue_acc~4; 25866#L438 main_#t~ret162 := valid_product_#res;main_~tmp~29 := main_#t~ret162;havoc main_#t~ret162; 28750#L3432 assume 0 != main_~tmp~29; 26758#L3407 ~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; 26759#L472 havoc bigMacCall_#t~ret155, bigMacCall_~tmp~26;havoc bigMacCall_~tmp~26;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~6;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~6; 24166#L775 assume 0 == getOrigin_~person;getOrigin_~retValue_acc~6 := 4;getOrigin_#res := getOrigin_~retValue_acc~6; 24167#L800 bigMacCall_#t~ret155 := getOrigin_#res;bigMacCall_~tmp~26 := bigMacCall_#t~ret155;havoc bigMacCall_#t~ret155;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; 29026#L2788 assume 0 == initPersonOnFloor_~floor; 30019#L2789 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 25237#L2896-1 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 25969#L2580 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 27564#L2592-2 havoc cleanup_#t~ret156, cleanup_#t~ret157, cleanup_~i~3, cleanup_~tmp~27, cleanup_~tmp___0~10, cleanup_~__cil_tmp4~3;havoc cleanup_~i~3;havoc cleanup_~tmp~27;havoc cleanup_~tmp___0~10;havoc cleanup_~__cil_tmp4~3;havoc timeShift_#t~ret98, timeShift_~tmp~18;havoc timeShift_~tmp~18;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~10;havoc areDoorsOpen_~retValue_acc~10;areDoorsOpen_~retValue_acc~10 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~10; 27177#L1112 timeShift_#t~ret98 := areDoorsOpen_#res;timeShift_~tmp~18 := timeShift_#t~ret98;havoc timeShift_#t~ret98; 27178#L2061 assume 0 != timeShift_~tmp~18; 28302#L2062 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 28303#L1738-11 havoc __utac_acc__Specification9_spec__3_#t~ret36, __utac_acc__Specification9_spec__3_#t~ret37, __utac_acc__Specification9_spec__3_#t~ret38, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~3, __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~3;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~9;havoc getCurrentFloorID_~retValue_acc~9;getCurrentFloorID_~retValue_acc~9 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~9; 26304#L1103-2 __utac_acc__Specification9_spec__3_#t~ret36 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~3 := __utac_acc__Specification9_spec__3_#t~ret36;havoc __utac_acc__Specification9_spec__3_#t~ret36;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~3;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~13;havoc isEmpty_~retValue_acc~13; 26305#L1163-12 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~13 := 0;isEmpty_#res := isEmpty_~retValue_acc~13; 27402#L1195-12 __utac_acc__Specification9_spec__3_#t~ret37 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~0 := __utac_acc__Specification9_spec__3_#t~ret37;havoc __utac_acc__Specification9_spec__3_#t~ret37; 29584#L515 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~0);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~10;havoc areDoorsOpen_~retValue_acc~10;areDoorsOpen_~retValue_acc~10 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~10; 27179#L1112-1 __utac_acc__Specification9_spec__3_#t~ret38 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~0 := __utac_acc__Specification9_spec__3_#t~ret38;havoc __utac_acc__Specification9_spec__3_#t~ret38; 27180#L525 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___0~0); 30329#L525-1 cleanup_~i~3 := 0; 25077#L3239-2 [2019-01-14 04:06:57,873 INFO L796 eck$LassoCheckResult]: Loop: 25077#L3239-2 assume !false; 24859#L3240 cleanup_~__cil_tmp4~3 := ~cleanupTimeShifts~0 - 1; 24487#L3243 assume cleanup_~i~3 < cleanup_~__cil_tmp4~3;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~8;havoc isBlocked_~retValue_acc~8;isBlocked_~retValue_acc~8 := ~blocked~0;isBlocked_#res := isBlocked_~retValue_acc~8; 24488#L926 cleanup_#t~ret156 := isBlocked_#res;cleanup_~tmp___0~10 := cleanup_#t~ret156;havoc cleanup_#t~ret156; 25942#L3247 assume 1 != cleanup_~tmp___0~10; 25940#L3247-1 havoc isIdle_#res;havoc isIdle_#t~ret53, isIdle_~retValue_acc~15, isIdle_~tmp~10;havoc isIdle_~retValue_acc~15;havoc isIdle_~tmp~10;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret48, anyStopRequested_#t~ret49, anyStopRequested_#t~ret50, anyStopRequested_#t~ret51, anyStopRequested_#t~ret52, anyStopRequested_~retValue_acc~14, anyStopRequested_~tmp~9, anyStopRequested_~tmp___0~3, anyStopRequested_~tmp___1~3, anyStopRequested_~tmp___2~0, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~14;havoc anyStopRequested_~tmp~9;havoc anyStopRequested_~tmp___0~3;havoc anyStopRequested_~tmp___1~3;havoc anyStopRequested_~tmp___2~0;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~23;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~23; 25941#L2517-122 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~23 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~23; 24131#L2544-122 anyStopRequested_#t~ret48 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret48;havoc anyStopRequested_#t~ret48; 25616#L1211 assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~14 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~14; 26345#L1275 isIdle_#t~ret53 := anyStopRequested_#res;isIdle_~tmp~10 := isIdle_#t~ret53;havoc isIdle_#t~ret53;isIdle_~retValue_acc~15 := (if 0 == isIdle_~tmp~10 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~15; 26346#L1288 cleanup_#t~ret157 := isIdle_#res;cleanup_~tmp~27 := cleanup_#t~ret157;havoc cleanup_#t~ret157; 27197#L3259 assume !(0 != cleanup_~tmp~27);havoc timeShift_#t~ret98, timeShift_~tmp~18;havoc timeShift_~tmp~18;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~10;havoc areDoorsOpen_~retValue_acc~10;areDoorsOpen_~retValue_acc~10 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~10; 27185#L1112-2 timeShift_#t~ret98 := areDoorsOpen_#res;timeShift_~tmp~18 := timeShift_#t~ret98;havoc timeShift_#t~ret98; 27186#L2061-1 assume 0 != timeShift_~tmp~18; 28305#L2062-2 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 28306#L1738-23 havoc __utac_acc__Specification9_spec__3_#t~ret36, __utac_acc__Specification9_spec__3_#t~ret37, __utac_acc__Specification9_spec__3_#t~ret38, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~3, __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~3;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~9;havoc getCurrentFloorID_~retValue_acc~9;getCurrentFloorID_~retValue_acc~9 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~9; 26308#L1103-5 __utac_acc__Specification9_spec__3_#t~ret36 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~3 := __utac_acc__Specification9_spec__3_#t~ret36;havoc __utac_acc__Specification9_spec__3_#t~ret36;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~3;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~13;havoc isEmpty_~retValue_acc~13; 26309#L1163-25 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~13 := 0;isEmpty_#res := isEmpty_~retValue_acc~13; 27712#L1195-25 __utac_acc__Specification9_spec__3_#t~ret37 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~0 := __utac_acc__Specification9_spec__3_#t~ret37;havoc __utac_acc__Specification9_spec__3_#t~ret37; 29585#L515-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~0);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~10;havoc areDoorsOpen_~retValue_acc~10;areDoorsOpen_~retValue_acc~10 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~10; 27189#L1112-3 __utac_acc__Specification9_spec__3_#t~ret38 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~0 := __utac_acc__Specification9_spec__3_#t~ret38;havoc __utac_acc__Specification9_spec__3_#t~ret38; 27190#L525-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___0~0); 30332#L525-3 cleanup_~i~3 := 1 + cleanup_~i~3; 25077#L3239-2 [2019-01-14 04:06:57,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:06:57,874 INFO L82 PathProgramCache]: Analyzing trace with hash 6233140, now seen corresponding path program 1 times [2019-01-14 04:06:57,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:06:57,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:06:57,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:06:57,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:06:57,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:06:57,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:06:57,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:06:57,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:06:57,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:06:58,000 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:06:58,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:06:58,000 INFO L82 PathProgramCache]: Analyzing trace with hash 325816645, now seen corresponding path program 1 times [2019-01-14 04:06:58,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:06:58,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:06:58,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:06:58,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:06:58,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:06:58,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:06:58,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:06:58,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:06:58,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 04:06:58,135 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 04:06:58,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 04:06:58,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-14 04:06:58,137 INFO L87 Difference]: Start difference. First operand 6953 states and 13170 transitions. cyclomatic complexity: 6218 Second operand 7 states. [2019-01-14 04:06:58,517 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2019-01-14 04:06:58,819 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2019-01-14 04:06:59,227 WARN L181 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2019-01-14 04:06:59,902 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2019-01-14 04:07:00,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:07:00,921 INFO L93 Difference]: Finished difference Result 13201 states and 24891 transitions. [2019-01-14 04:07:00,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-14 04:07:00,926 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13201 states and 24891 transitions. [2019-01-14 04:07:01,009 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10575 [2019-01-14 04:07:01,080 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13201 states to 13201 states and 24891 transitions. [2019-01-14 04:07:01,080 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13201 [2019-01-14 04:07:01,099 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13201 [2019-01-14 04:07:01,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13201 states and 24891 transitions. [2019-01-14 04:07:01,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:07:01,124 INFO L706 BuchiCegarLoop]: Abstraction has 13201 states and 24891 transitions. [2019-01-14 04:07:01,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13201 states and 24891 transitions. [2019-01-14 04:07:01,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13201 to 6936. [2019-01-14 04:07:01,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6936 states. [2019-01-14 04:07:01,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6936 states to 6936 states and 13113 transitions. [2019-01-14 04:07:01,586 INFO L729 BuchiCegarLoop]: Abstraction has 6936 states and 13113 transitions. [2019-01-14 04:07:01,586 INFO L609 BuchiCegarLoop]: Abstraction has 6936 states and 13113 transitions. [2019-01-14 04:07:01,586 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:07:01,586 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6936 states and 13113 transitions. [2019-01-14 04:07:01,614 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4339 [2019-01-14 04:07:01,615 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:07:01,615 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:07:01,618 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:07:01,619 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:07:01,619 INFO L794 eck$LassoCheckResult]: Stem: 48514#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(30);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(9);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(21);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(30);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(9);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(21);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(30);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(9);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(25);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(25);~weight~0 := 0;~maximumWeight~0 := 100;~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;~cleanupTimeShifts~0 := 12;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0;call #t~string99.base, #t~string99.offset := #Ultimate.allocOnStack(10);call #t~string101.base, #t~string101.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string101.base, #t~string101.offset, 1);call write~init~int(95, #t~string101.base, 1 + #t~string101.offset, 1);call write~init~int(93, #t~string101.base, 2 + #t~string101.offset, 1);call write~init~int(0, #t~string101.base, 3 + #t~string101.offset, 1);call #t~string103.base, #t~string103.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string103.base, #t~string103.offset, 1);call write~init~int(93, #t~string103.base, 1 + #t~string103.offset, 1);call write~init~int(32, #t~string103.base, 2 + #t~string103.offset, 1);call write~init~int(0, #t~string103.base, 3 + #t~string103.offset, 1);call #t~string105.base, #t~string105.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string105.base, #t~string105.offset, 1);call write~init~int(97, #t~string105.base, 1 + #t~string105.offset, 1);call write~init~int(116, #t~string105.base, 2 + #t~string105.offset, 1);call write~init~int(32, #t~string105.base, 3 + #t~string105.offset, 1);call write~init~int(0, #t~string105.base, 4 + #t~string105.offset, 1);call #t~string107.base, #t~string107.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string107.base, #t~string107.offset, 1);call write~init~int(105, #t~string107.base, 1 + #t~string107.offset, 1);call write~init~int(0, #t~string107.base, 2 + #t~string107.offset, 1);call #t~string109.base, #t~string109.offset := #Ultimate.allocOnStack(10);call #t~string111.base, #t~string111.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string111.base, #t~string111.offset, 1);call write~init~int(112, #t~string111.base, 1 + #t~string111.offset, 1);call write~init~int(0, #t~string111.base, 2 + #t~string111.offset, 1);call #t~string113.base, #t~string113.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string113.base, #t~string113.offset, 1);call write~init~int(111, #t~string113.base, 1 + #t~string113.offset, 1);call write~init~int(119, #t~string113.base, 2 + #t~string113.offset, 1);call write~init~int(110, #t~string113.base, 3 + #t~string113.offset, 1);call write~init~int(0, #t~string113.base, 4 + #t~string113.offset, 1);call #t~string115.base, #t~string115.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string115.base, #t~string115.offset, 1);call write~init~int(73, #t~string115.base, 1 + #t~string115.offset, 1);call write~init~int(76, #t~string115.base, 2 + #t~string115.offset, 1);call write~init~int(95, #t~string115.base, 3 + #t~string115.offset, 1);call write~init~int(112, #t~string115.base, 4 + #t~string115.offset, 1);call write~init~int(58, #t~string115.base, 5 + #t~string115.offset, 1);call write~init~int(0, #t~string115.base, 6 + #t~string115.offset, 1);call #t~string117.base, #t~string117.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string117.base, #t~string117.offset, 1);call write~init~int(37, #t~string117.base, 1 + #t~string117.offset, 1);call write~init~int(105, #t~string117.base, 2 + #t~string117.offset, 1);call write~init~int(0, #t~string117.base, 3 + #t~string117.offset, 1);call #t~string119.base, #t~string119.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string119.base, #t~string119.offset, 1);call write~init~int(37, #t~string119.base, 1 + #t~string119.offset, 1);call write~init~int(105, #t~string119.base, 2 + #t~string119.offset, 1);call write~init~int(0, #t~string119.base, 3 + #t~string119.offset, 1);call #t~string121.base, #t~string121.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string121.base, #t~string121.offset, 1);call write~init~int(37, #t~string121.base, 1 + #t~string121.offset, 1);call write~init~int(105, #t~string121.base, 2 + #t~string121.offset, 1);call write~init~int(0, #t~string121.base, 3 + #t~string121.offset, 1);call #t~string123.base, #t~string123.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string123.base, #t~string123.offset, 1);call write~init~int(37, #t~string123.base, 1 + #t~string123.offset, 1);call write~init~int(105, #t~string123.base, 2 + #t~string123.offset, 1);call write~init~int(0, #t~string123.base, 3 + #t~string123.offset, 1);call #t~string125.base, #t~string125.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string125.base, #t~string125.offset, 1);call write~init~int(37, #t~string125.base, 1 + #t~string125.offset, 1);call write~init~int(105, #t~string125.base, 2 + #t~string125.offset, 1);call write~init~int(0, #t~string125.base, 3 + #t~string125.offset, 1);call #t~string127.base, #t~string127.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string127.base, #t~string127.offset, 1);call write~init~int(70, #t~string127.base, 1 + #t~string127.offset, 1);call write~init~int(95, #t~string127.base, 2 + #t~string127.offset, 1);call write~init~int(112, #t~string127.base, 3 + #t~string127.offset, 1);call write~init~int(58, #t~string127.base, 4 + #t~string127.offset, 1);call write~init~int(0, #t~string127.base, 5 + #t~string127.offset, 1);call #t~string130.base, #t~string130.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string130.base, #t~string130.offset, 1);call write~init~int(37, #t~string130.base, 1 + #t~string130.offset, 1);call write~init~int(105, #t~string130.base, 2 + #t~string130.offset, 1);call write~init~int(0, #t~string130.base, 3 + #t~string130.offset, 1);call #t~string133.base, #t~string133.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string133.base, #t~string133.offset, 1);call write~init~int(37, #t~string133.base, 1 + #t~string133.offset, 1);call write~init~int(105, #t~string133.base, 2 + #t~string133.offset, 1);call write~init~int(0, #t~string133.base, 3 + #t~string133.offset, 1);call #t~string136.base, #t~string136.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string136.base, #t~string136.offset, 1);call write~init~int(37, #t~string136.base, 1 + #t~string136.offset, 1);call write~init~int(105, #t~string136.base, 2 + #t~string136.offset, 1);call write~init~int(0, #t~string136.base, 3 + #t~string136.offset, 1);call #t~string139.base, #t~string139.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string139.base, #t~string139.offset, 1);call write~init~int(37, #t~string139.base, 1 + #t~string139.offset, 1);call write~init~int(105, #t~string139.base, 2 + #t~string139.offset, 1);call write~init~int(0, #t~string139.base, 3 + #t~string139.offset, 1);call #t~string142.base, #t~string142.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string142.base, #t~string142.offset, 1);call write~init~int(37, #t~string142.base, 1 + #t~string142.offset, 1);call write~init~int(105, #t~string142.base, 2 + #t~string142.offset, 1);call write~init~int(0, #t~string142.base, 3 + #t~string142.offset, 1);call #t~string144.base, #t~string144.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string144.base, #t~string144.offset, 1);call write~init~int(0, #t~string144.base, 1 + #t~string144.offset, 1);call #t~string147.base, #t~string147.offset := #Ultimate.allocOnStack(9);~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; 48515#L-1 havoc main_#res;havoc main_#t~ret162, main_~retValue_acc~27, main_~tmp~29;havoc main_~retValue_acc~27;havoc main_~tmp~29; 46061#L430 havoc valid_product_#res;havoc valid_product_~retValue_acc~4;havoc valid_product_~retValue_acc~4;valid_product_~retValue_acc~4 := 1;valid_product_#res := valid_product_~retValue_acc~4; 46062#L438 main_#t~ret162 := valid_product_#res;main_~tmp~29 := main_#t~ret162;havoc main_#t~ret162; 49575#L3432 assume 0 != main_~tmp~29; 47553#L3407 ~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; 47554#L472 havoc bigMacCall_#t~ret155, bigMacCall_~tmp~26;havoc bigMacCall_~tmp~26;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~6;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~6; 44372#L775 assume 0 == getOrigin_~person;getOrigin_~retValue_acc~6 := 4;getOrigin_#res := getOrigin_~retValue_acc~6; 44373#L800 bigMacCall_#t~ret155 := getOrigin_#res;bigMacCall_~tmp~26 := bigMacCall_#t~ret155;havoc bigMacCall_#t~ret155;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; 47677#L2788 assume 0 == initPersonOnFloor_~floor; 47406#L2789 assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 44380#L2896-1 callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 46178#L2580 assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 48168#L2592-2 havoc cleanup_#t~ret156, cleanup_#t~ret157, cleanup_~i~3, cleanup_~tmp~27, cleanup_~tmp___0~10, cleanup_~__cil_tmp4~3;havoc cleanup_~i~3;havoc cleanup_~tmp~27;havoc cleanup_~tmp___0~10;havoc cleanup_~__cil_tmp4~3;havoc timeShift_#t~ret98, timeShift_~tmp~18;havoc timeShift_~tmp~18;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~10;havoc areDoorsOpen_~retValue_acc~10;areDoorsOpen_~retValue_acc~10 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~10; 47853#L1112 timeShift_#t~ret98 := areDoorsOpen_#res;timeShift_~tmp~18 := timeShift_#t~ret98;havoc timeShift_#t~ret98; 47854#L2061 assume 0 != timeShift_~tmp~18; 48849#L2062 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 45341#L1738-11 havoc __utac_acc__Specification9_spec__3_#t~ret36, __utac_acc__Specification9_spec__3_#t~ret37, __utac_acc__Specification9_spec__3_#t~ret38, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~3, __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~3;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~9;havoc getCurrentFloorID_~retValue_acc~9;getCurrentFloorID_~retValue_acc~9 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~9; 45342#L1103-2 __utac_acc__Specification9_spec__3_#t~ret36 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~3 := __utac_acc__Specification9_spec__3_#t~ret36;havoc __utac_acc__Specification9_spec__3_#t~ret36;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~3;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~13;havoc isEmpty_~retValue_acc~13; 46786#L1163-12 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~13 := 0;isEmpty_#res := isEmpty_~retValue_acc~13; 47958#L1195-12 __utac_acc__Specification9_spec__3_#t~ret37 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~0 := __utac_acc__Specification9_spec__3_#t~ret37;havoc __utac_acc__Specification9_spec__3_#t~ret37; 46256#L515 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~0);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~10;havoc areDoorsOpen_~retValue_acc~10;areDoorsOpen_~retValue_acc~10 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~10; 46257#L1112-1 __utac_acc__Specification9_spec__3_#t~ret38 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~0 := __utac_acc__Specification9_spec__3_#t~ret38;havoc __utac_acc__Specification9_spec__3_#t~ret38; 47855#L525 assume 0 != __utac_acc__Specification9_spec__3_~tmp___0~0; 49571#L526 assume 0 == __utac_acc__Specification9_spec__3_~floor~0; 49572#L527 assume 0 != ~floorButtons_spc9_0~0;~floorButtons_spc9_0~0 := 0; 50013#L525-1 cleanup_~i~3 := 0; 50011#L3239-2 [2019-01-14 04:07:01,619 INFO L796 eck$LassoCheckResult]: Loop: 50011#L3239-2 assume !false; 50010#L3240 cleanup_~__cil_tmp4~3 := ~cleanupTimeShifts~0 - 1; 50009#L3243 assume cleanup_~i~3 < cleanup_~__cil_tmp4~3;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~8;havoc isBlocked_~retValue_acc~8;isBlocked_~retValue_acc~8 := ~blocked~0;isBlocked_#res := isBlocked_~retValue_acc~8; 50008#L926 cleanup_#t~ret156 := isBlocked_#res;cleanup_~tmp___0~10 := cleanup_#t~ret156;havoc cleanup_#t~ret156; 50007#L3247 assume 1 != cleanup_~tmp___0~10; 50006#L3247-1 havoc isIdle_#res;havoc isIdle_#t~ret53, isIdle_~retValue_acc~15, isIdle_~tmp~10;havoc isIdle_~retValue_acc~15;havoc isIdle_~tmp~10;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret48, anyStopRequested_#t~ret49, anyStopRequested_#t~ret50, anyStopRequested_#t~ret51, anyStopRequested_#t~ret52, anyStopRequested_~retValue_acc~14, anyStopRequested_~tmp~9, anyStopRequested_~tmp___0~3, anyStopRequested_~tmp___1~3, anyStopRequested_~tmp___2~0, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~14;havoc anyStopRequested_~tmp~9;havoc anyStopRequested_~tmp___0~3;havoc anyStopRequested_~tmp___1~3;havoc anyStopRequested_~tmp___2~0;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~23;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~23; 50003#L2517-122 assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~23 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~23; 45768#L2544-122 anyStopRequested_#t~ret48 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret48;havoc anyStopRequested_#t~ret48; 45472#L1211 assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~14 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~14; 44513#L1275 isIdle_#t~ret53 := anyStopRequested_#res;isIdle_~tmp~10 := isIdle_#t~ret53;havoc isIdle_#t~ret53;isIdle_~retValue_acc~15 := (if 0 == isIdle_~tmp~10 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~15; 49966#L1288 cleanup_#t~ret157 := isIdle_#res;cleanup_~tmp~27 := cleanup_#t~ret157;havoc cleanup_#t~ret157; 49515#L3259 assume !(0 != cleanup_~tmp~27);havoc timeShift_#t~ret98, timeShift_~tmp~18;havoc timeShift_~tmp~18;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~10;havoc areDoorsOpen_~retValue_acc~10;areDoorsOpen_~retValue_acc~10 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~10; 47860#L1112-2 timeShift_#t~ret98 := areDoorsOpen_#res;timeShift_~tmp~18 := timeShift_#t~ret98;havoc timeShift_#t~ret98; 47861#L2061-1 assume 0 != timeShift_~tmp~18; 48853#L2062-2 assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 45521#L1738-23 havoc __utac_acc__Specification9_spec__3_#t~ret36, __utac_acc__Specification9_spec__3_#t~ret37, __utac_acc__Specification9_spec__3_#t~ret38, __utac_acc__Specification9_spec__3_~floor~0, __utac_acc__Specification9_spec__3_~tmp~3, __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~3;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~9;havoc getCurrentFloorID_~retValue_acc~9;getCurrentFloorID_~retValue_acc~9 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~9; 45522#L1103-5 __utac_acc__Specification9_spec__3_#t~ret36 := getCurrentFloorID_#res;__utac_acc__Specification9_spec__3_~tmp~3 := __utac_acc__Specification9_spec__3_#t~ret36;havoc __utac_acc__Specification9_spec__3_#t~ret36;__utac_acc__Specification9_spec__3_~floor~0 := __utac_acc__Specification9_spec__3_~tmp~3;havoc isEmpty_#res;havoc isEmpty_~retValue_acc~13;havoc isEmpty_~retValue_acc~13; 46798#L1163-25 assume 1 == ~persons_0~0;isEmpty_~retValue_acc~13 := 0;isEmpty_#res := isEmpty_~retValue_acc~13; 47944#L1195-25 __utac_acc__Specification9_spec__3_#t~ret37 := isEmpty_#res;__utac_acc__Specification9_spec__3_~tmp___1~0 := __utac_acc__Specification9_spec__3_#t~ret37;havoc __utac_acc__Specification9_spec__3_#t~ret37; 46264#L515-2 assume !(0 != __utac_acc__Specification9_spec__3_~tmp___1~0);havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~10;havoc areDoorsOpen_~retValue_acc~10;areDoorsOpen_~retValue_acc~10 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~10; 46265#L1112-3 __utac_acc__Specification9_spec__3_#t~ret38 := areDoorsOpen_#res;__utac_acc__Specification9_spec__3_~tmp___0~0 := __utac_acc__Specification9_spec__3_#t~ret38;havoc __utac_acc__Specification9_spec__3_#t~ret38; 47864#L525-2 assume 0 != __utac_acc__Specification9_spec__3_~tmp___0~0; 49573#L526-1 assume 0 == __utac_acc__Specification9_spec__3_~floor~0; 49574#L527-2 assume 0 != ~floorButtons_spc9_0~0;~floorButtons_spc9_0~0 := 0; 50012#L525-3 cleanup_~i~3 := 1 + cleanup_~i~3; 50011#L3239-2 [2019-01-14 04:07:01,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:07:01,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1693707535, now seen corresponding path program 1 times [2019-01-14 04:07:01,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:07:01,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:07:01,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:07:01,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:07:01,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:07:01,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:07:01,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:07:01,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:07:01,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:07:01,729 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:07:01,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:07:01,730 INFO L82 PathProgramCache]: Analyzing trace with hash -423653952, now seen corresponding path program 1 times [2019-01-14 04:07:01,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:07:01,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:07:01,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:07:01,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:07:01,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:07:01,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:07:01,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:07:02,112 WARN L181 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 90 [2019-01-14 04:07:02,237 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-01-14 04:07:02,249 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:07:02,250 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:07:02,250 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:07:02,250 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:07:02,250 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 04:07:02,251 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:07:02,251 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:07:02,251 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:07:02,251 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec9_product30_false-unreach-call_true-termination.cil.c_Iteration3_Loop [2019-01-14 04:07:02,251 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:07:02,251 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:07:02,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:02,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:02,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:02,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:02,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:02,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:02,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:02,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:02,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:02,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:02,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:02,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:02,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:02,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-01-14 04:07:02,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:02,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:02,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:02,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-01-14 04:07:02,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-01-14 04:07:02,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:02,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-01-14 04:07:02,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:02,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:02,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-01-14 04:07:02,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:02,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:02,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:02,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:02,830 WARN L181 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-14 04:07:03,342 WARN L181 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-14 04:07:03,737 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:07:03,738 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:07:03,750 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:07:03,750 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:07:03,761 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:07:03,761 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_cleanup_#t~ret157=0} Honda state: {ULTIMATE.start_cleanup_#t~ret157=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:07:03,785 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:07:03,785 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:07:03,802 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:07:03,802 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_~tmp___1~3=0} Honda state: {ULTIMATE.start_anyStopRequested_~tmp___1~3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 04:07:03,858 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:07:03,859 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:07:03,871 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:07:03,872 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_cleanup_#t~ret156=0} Honda state: {ULTIMATE.start_cleanup_#t~ret156=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 04:07:03,906 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:07:03,907 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:07:03,923 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:07:03,924 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_getCurrentFloorID_#res=0, ULTIMATE.start___utac_acc__Specification9_spec__3_~tmp~3=0, ~currentFloorID~0=0, ULTIMATE.start_getCurrentFloorID_~retValue_acc~9=0, ULTIMATE.start___utac_acc__Specification9_spec__3_~floor~0=0} Honda state: {ULTIMATE.start_getCurrentFloorID_#res=0, ULTIMATE.start___utac_acc__Specification9_spec__3_~tmp~3=0, ~currentFloorID~0=0, ULTIMATE.start_getCurrentFloorID_~retValue_acc~9=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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:07:03,962 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:07:03,962 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:07:03,979 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:07:03,980 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~persons_0~0=1} Honda state: {~persons_0~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 04:07:04,022 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:07:04,022 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:07:04,035 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:07:04,036 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isIdle_#res=0, ULTIMATE.start_isIdle_~retValue_acc~15=0, ULTIMATE.start_cleanup_~tmp~27=0} Honda state: {ULTIMATE.start_isIdle_#res=0, ULTIMATE.start_isIdle_~retValue_acc~15=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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:07:04,065 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:07:04,066 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:07:04,071 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 04:07:04,071 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isIdle_#t~ret53=0} Honda state: {ULTIMATE.start_isIdle_#t~ret53=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:07:04,093 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 04:07:04,093 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:07:04,153 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 04:07:04,153 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 04:07:16,208 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-01-14 04:07:16,211 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:07:16,211 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:07:16,212 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:07:16,212 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:07:16,212 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:07:16,212 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:07:16,212 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:07:16,212 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:07:16,212 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec9_product30_false-unreach-call_true-termination.cil.c_Iteration3_Loop [2019-01-14 04:07:16,212 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:07:16,213 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:07:16,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:16,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:16,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:16,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:16,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:16,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:16,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:16,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:16,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:16,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:16,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:16,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:16,905 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-14 04:07:16,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:16,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:16,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:16,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:16,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:16,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:16,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:16,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:16,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:16,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:16,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:16,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:16,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:16,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:17,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:17,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:07:17,579 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-14 04:07:17,777 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-14 04:07:18,033 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-14 04:07:18,278 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-14 04:07:18,283 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:07:18,295 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:07:18,300 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:07:18,306 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:07:18,307 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:07:18,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:07:18,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:07:18,308 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:07:18,312 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:07:18,313 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:07:18,315 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:07:18,316 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:07:18,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:07:18,320 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:07:18,320 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:07:18,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:07:18,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:07:18,323 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:07:18,323 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:07:18,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:07:18,325 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:07:18,328 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:07:18,328 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:07:18,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:07:18,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:07:18,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:07:18,332 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:07:18,333 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:07:18,333 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:07:18,336 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:07:18,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:07:18,340 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:07:18,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:07:18,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:07:18,340 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:07:18,342 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:07:18,343 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:07:18,343 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:07:18,346 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:07:18,347 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:07:18,347 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:07:18,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:07:18,348 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:07:18,348 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:07:18,348 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:07:18,348 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:07:18,355 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:07:18,355 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:07:18,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:07:18,359 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:07:18,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:07:18,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:07:18,360 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:07:18,362 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:07:18,363 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:07:18,367 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:07:18,368 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:07:18,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:07:18,372 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:07:18,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:07:18,373 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:07:18,373 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:07:18,373 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:07:18,374 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:07:18,383 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:07:18,391 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 04:07:18,397 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 04:07:18,401 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:07:18,401 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 04:07:18,401 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:07:18,402 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~cleanupTimeShifts~0, ULTIMATE.start_cleanup_~i~3) = 1*~cleanupTimeShifts~0 - 1*ULTIMATE.start_cleanup_~i~3 Supporting invariants [] [2019-01-14 04:07:18,403 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 04:07:18,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:07:18,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:07:18,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:07:18,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:07:18,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:07:19,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:07:19,015 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-14 04:07:19,016 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6936 states and 13113 transitions. cyclomatic complexity: 6178 Second operand 5 states. [2019-01-14 04:07:19,437 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-14 04:07:20,011 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6936 states and 13113 transitions. cyclomatic complexity: 6178. Second operand 5 states. Result 11275 states and 21317 transitions. Complement of second has 8 states. [2019-01-14 04:07:20,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 04:07:20,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 04:07:20,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 9943 transitions. [2019-01-14 04:07:20,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 9943 transitions. Stem has 27 letters. Loop has 25 letters. [2019-01-14 04:07:20,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:07:20,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 9943 transitions. Stem has 52 letters. Loop has 25 letters. [2019-01-14 04:07:20,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:07:20,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 9943 transitions. Stem has 27 letters. Loop has 50 letters. [2019-01-14 04:07:20,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:07:20,037 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11275 states and 21317 transitions. [2019-01-14 04:07:20,102 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:07:20,102 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11275 states to 0 states and 0 transitions. [2019-01-14 04:07:20,102 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:07:20,103 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:07:20,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:07:20,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:07:20,104 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:07:20,104 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:07:20,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:07:20,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:07:20,109 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2019-01-14 04:07:20,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:07:20,109 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-14 04:07:20,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 04:07:20,109 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-14 04:07:20,109 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:07:20,110 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 04:07:20,110 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:07:20,110 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:07:20,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:07:20,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:07:20,110 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:07:20,110 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:07:20,110 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:07:20,110 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 04:07:20,111 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 04:07:20,114 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:07:20,115 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 04:07:20,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:07:20 BoogieIcfgContainer [2019-01-14 04:07:20,124 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:07:20,124 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:07:20,124 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:07:20,124 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:07:20,125 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:06:52" (3/4) ... [2019-01-14 04:07:20,131 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 04:07:20,132 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:07:20,133 INFO L168 Benchmark]: Toolchain (without parser) took 44979.77 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 621.3 MB). Free memory was 946.0 MB in the beginning and 696.8 MB in the end (delta: 249.2 MB). Peak memory consumption was 870.5 MB. Max. memory is 11.5 GB. [2019-01-14 04:07:20,136 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:07:20,136 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1045.39 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -132.5 MB). Peak memory consumption was 56.4 MB. Max. memory is 11.5 GB. [2019-01-14 04:07:20,137 INFO L168 Benchmark]: Boogie Procedure Inliner took 388.36 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 69.3 MB). Peak memory consumption was 69.3 MB. Max. memory is 11.5 GB. [2019-01-14 04:07:20,138 INFO L168 Benchmark]: Boogie Preprocessor took 495.11 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 947.3 MB in the end (delta: 61.9 MB). Peak memory consumption was 61.9 MB. Max. memory is 11.5 GB. [2019-01-14 04:07:20,142 INFO L168 Benchmark]: RCFGBuilder took 15227.05 ms. Allocated memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: 509.1 MB). Free memory was 940.4 MB in the beginning and 1.3 GB in the end (delta: -404.0 MB). Peak memory consumption was 456.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:07:20,145 INFO L168 Benchmark]: BuchiAutomizer took 27810.74 ms. Allocated memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: -1.6 MB). Free memory was 1.3 GB in the beginning and 696.8 MB in the end (delta: 647.6 MB). Peak memory consumption was 646.0 MB. Max. memory is 11.5 GB. [2019-01-14 04:07:20,147 INFO L168 Benchmark]: Witness Printer took 8.07 ms. Allocated memory is still 1.7 GB. Free memory is still 696.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:07:20,154 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1045.39 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -132.5 MB). Peak memory consumption was 56.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 388.36 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 69.3 MB). Peak memory consumption was 69.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 495.11 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 947.3 MB in the end (delta: 61.9 MB). Peak memory consumption was 61.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 15227.05 ms. Allocated memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: 509.1 MB). Free memory was 940.4 MB in the beginning and 1.3 GB in the end (delta: -404.0 MB). Peak memory consumption was 456.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 27810.74 ms. Allocated memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: -1.6 MB). Free memory was 1.3 GB in the beginning and 696.8 MB in the end (delta: 647.6 MB). Peak memory consumption was 646.0 MB. Max. memory is 11.5 GB. * Witness Printer took 8.07 ms. Allocated memory is still 1.7 GB. Free memory is still 696.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function cleanupTimeShifts + -1 * i and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 27.7s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 17.6s. Construction of modules took 4.2s. Büchi inclusion checks took 3.8s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.7s AutomataMinimizationTime, 2 MinimizatonAttempts, 16411 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.5s Buchi closure took 0.0s. Biggest automaton had 6953 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 45325 SDtfs, 87174 SDslu, 102543 SDs, 0 SdLazy, 267 SolverSat, 284 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.2s 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: 16ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 7 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 1 LassoNonterminationAnalysisTime: 12.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...