./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/elevator_spec2_product20_false-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/product-lines/elevator_spec2_product20_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 269b1dcd66966187dec0c4d9b8b9f0d4a847c7a1 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 23:19:11,354 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:19:11,356 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:19:11,370 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:19:11,371 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:19:11,372 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:19:11,374 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:19:11,377 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:19:11,379 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:19:11,386 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:19:11,387 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:19:11,387 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:19:11,388 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:19:11,389 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:19:11,390 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:19:11,391 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:19:11,392 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:19:11,394 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:19:11,396 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:19:11,397 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:19:11,398 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:19:11,400 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:19:11,407 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:19:11,407 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:19:11,408 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:19:11,409 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:19:11,412 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:19:11,413 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:19:11,414 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:19:11,416 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:19:11,417 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:19:11,417 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:19:11,418 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:19:11,418 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:19:11,419 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:19:11,420 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:19:11,420 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-01 23:19:11,437 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:19:11,438 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:19:11,439 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:19:11,440 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:19:11,440 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:19:11,440 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:19:11,440 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:19:11,440 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:19:11,440 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:19:11,441 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:19:11,441 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:19:11,441 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:19:11,441 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:19:11,441 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:19:11,443 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:19:11,443 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:19:11,443 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:19:11,443 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:19:11,443 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:19:11,444 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:19:11,444 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:19:11,445 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:19:11,445 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:19:11,445 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:19:11,445 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:19:11,445 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:19:11,445 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:19:11,446 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:19:11,446 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:19:11,446 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:19:11,446 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:19:11,449 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:19:11,449 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 -> 269b1dcd66966187dec0c4d9b8b9f0d4a847c7a1 [2019-01-01 23:19:11,488 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:19:11,502 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:19:11,510 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:19:11,511 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:19:11,512 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:19:11,513 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/elevator_spec2_product20_false-unreach-call_true-termination.cil.c [2019-01-01 23:19:11,593 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11643c930/f4a74addef904b478f025c9fe0e2c1c6/FLAG0259b8c89 [2019-01-01 23:19:12,315 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:19:12,316 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/elevator_spec2_product20_false-unreach-call_true-termination.cil.c [2019-01-01 23:19:12,351 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11643c930/f4a74addef904b478f025c9fe0e2c1c6/FLAG0259b8c89 [2019-01-01 23:19:12,416 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11643c930/f4a74addef904b478f025c9fe0e2c1c6 [2019-01-01 23:19:12,420 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:19:12,421 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:19:12,422 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:19:12,422 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:19:12,426 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:19:12,427 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:19:12" (1/1) ... [2019-01-01 23:19:12,430 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1441fe2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:19:12, skipping insertion in model container [2019-01-01 23:19:12,430 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:19:12" (1/1) ... [2019-01-01 23:19:12,439 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:19:12,536 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:19:13,234 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:19:13,266 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:19:13,497 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:19:13,583 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:19:13,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:19:13 WrapperNode [2019-01-01 23:19:13,584 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:19:13,585 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:19:13,585 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:19:13,585 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:19:13,595 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:19:13" (1/1) ... [2019-01-01 23:19:13,629 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:19:13" (1/1) ... [2019-01-01 23:19:13,933 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:19:13,933 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:19:13,933 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:19:13,934 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:19:13,945 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:19:13" (1/1) ... [2019-01-01 23:19:13,946 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:19:13" (1/1) ... [2019-01-01 23:19:13,996 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:19:13" (1/1) ... [2019-01-01 23:19:13,997 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:19:13" (1/1) ... [2019-01-01 23:19:14,104 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:19:13" (1/1) ... [2019-01-01 23:19:14,199 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:19:13" (1/1) ... [2019-01-01 23:19:14,225 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:19:13" (1/1) ... [2019-01-01 23:19:14,264 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:19:14,265 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:19:14,265 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:19:14,265 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:19:14,267 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:19:13" (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-01 23:19:14,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 23:19:14,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-01 23:19:14,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:19:14,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:19:29,396 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:19:29,397 INFO L280 CfgBuilder]: Removed 1149 assue(true) statements. [2019-01-01 23:19:29,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:19:29 BoogieIcfgContainer [2019-01-01 23:19:29,397 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:19:29,398 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:19:29,398 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:19:29,402 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:19:29,403 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:19:29,403 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:19:12" (1/3) ... [2019-01-01 23:19:29,404 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6d4a5913 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:19:29, skipping insertion in model container [2019-01-01 23:19:29,404 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:19:29,406 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:19:13" (2/3) ... [2019-01-01 23:19:29,406 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6d4a5913 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:19:29, skipping insertion in model container [2019-01-01 23:19:29,406 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:19:29,407 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:19:29" (3/3) ... [2019-01-01 23:19:29,409 INFO L375 chiAutomizerObserver]: Analyzing ICFG elevator_spec2_product20_false-unreach-call_true-termination.cil.c [2019-01-01 23:19:29,472 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:19:29,473 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:19:29,473 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:19:29,473 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:19:29,473 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:19:29,473 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:19:29,473 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:19:29,473 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:19:29,474 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:19:29,578 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4823 states. [2019-01-01 23:19:29,732 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2401 [2019-01-01 23:19:29,732 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:19:29,732 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:19:29,757 INFO L866 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] [2019-01-01 23:19:29,757 INFO L867 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] [2019-01-01 23:19:29,757 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:19:29,757 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4823 states. [2019-01-01 23:19:29,823 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2401 [2019-01-01 23:19:29,823 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:19:29,823 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:19:29,827 INFO L866 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] [2019-01-01 23:19:29,828 INFO L867 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] [2019-01-01 23:19:29,842 INFO L794 eck$LassoCheckResult]: Stem: 2667#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~0 := 0;~floorButtons_spc2_0~0 := 0;~floorButtons_spc2_1~0 := 0;~floorButtons_spc2_2~0 := 0;~floorButtons_spc2_3~0 := 0;~floorButtons_spc2_4~0 := 0;~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~string59.base, #t~string59.offset := #Ultimate.allocOnStack(10);call #t~string61.base, #t~string61.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string61.base, #t~string61.offset, 1);call write~init~int(95, #t~string61.base, 1 + #t~string61.offset, 1);call write~init~int(93, #t~string61.base, 2 + #t~string61.offset, 1);call write~init~int(0, #t~string61.base, 3 + #t~string61.offset, 1);call #t~string63.base, #t~string63.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string63.base, #t~string63.offset, 1);call write~init~int(93, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(32, #t~string63.base, 2 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 3 + #t~string63.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string65.base, #t~string65.offset, 1);call write~init~int(97, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(116, #t~string65.base, 2 + #t~string65.offset, 1);call write~init~int(32, #t~string65.base, 3 + #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 4 + #t~string65.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string67.base, #t~string67.offset, 1);call write~init~int(105, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 2 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.allocOnStack(10);call #t~string71.base, #t~string71.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string71.base, #t~string71.offset, 1);call write~init~int(112, #t~string71.base, 1 + #t~string71.offset, 1);call write~init~int(0, #t~string71.base, 2 + #t~string71.offset, 1);call #t~string73.base, #t~string73.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string73.base, #t~string73.offset, 1);call write~init~int(111, #t~string73.base, 1 + #t~string73.offset, 1);call write~init~int(119, #t~string73.base, 2 + #t~string73.offset, 1);call write~init~int(110, #t~string73.base, 3 + #t~string73.offset, 1);call write~init~int(0, #t~string73.base, 4 + #t~string73.offset, 1);call #t~string75.base, #t~string75.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string75.base, #t~string75.offset, 1);call write~init~int(73, #t~string75.base, 1 + #t~string75.offset, 1);call write~init~int(76, #t~string75.base, 2 + #t~string75.offset, 1);call write~init~int(95, #t~string75.base, 3 + #t~string75.offset, 1);call write~init~int(112, #t~string75.base, 4 + #t~string75.offset, 1);call write~init~int(58, #t~string75.base, 5 + #t~string75.offset, 1);call write~init~int(0, #t~string75.base, 6 + #t~string75.offset, 1);call #t~string77.base, #t~string77.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string77.base, #t~string77.offset, 1);call write~init~int(37, #t~string77.base, 1 + #t~string77.offset, 1);call write~init~int(105, #t~string77.base, 2 + #t~string77.offset, 1);call write~init~int(0, #t~string77.base, 3 + #t~string77.offset, 1);call #t~string79.base, #t~string79.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string79.base, #t~string79.offset, 1);call write~init~int(37, #t~string79.base, 1 + #t~string79.offset, 1);call write~init~int(105, #t~string79.base, 2 + #t~string79.offset, 1);call write~init~int(0, #t~string79.base, 3 + #t~string79.offset, 1);call #t~string81.base, #t~string81.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string81.base, #t~string81.offset, 1);call write~init~int(37, #t~string81.base, 1 + #t~string81.offset, 1);call write~init~int(105, #t~string81.base, 2 + #t~string81.offset, 1);call write~init~int(0, #t~string81.base, 3 + #t~string81.offset, 1);call #t~string83.base, #t~string83.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string83.base, #t~string83.offset, 1);call write~init~int(37, #t~string83.base, 1 + #t~string83.offset, 1);call write~init~int(105, #t~string83.base, 2 + #t~string83.offset, 1);call write~init~int(0, #t~string83.base, 3 + #t~string83.offset, 1);call #t~string85.base, #t~string85.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string85.base, #t~string85.offset, 1);call write~init~int(37, #t~string85.base, 1 + #t~string85.offset, 1);call write~init~int(105, #t~string85.base, 2 + #t~string85.offset, 1);call write~init~int(0, #t~string85.base, 3 + #t~string85.offset, 1);call #t~string87.base, #t~string87.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string87.base, #t~string87.offset, 1);call write~init~int(70, #t~string87.base, 1 + #t~string87.offset, 1);call write~init~int(95, #t~string87.base, 2 + #t~string87.offset, 1);call write~init~int(112, #t~string87.base, 3 + #t~string87.offset, 1);call write~init~int(58, #t~string87.base, 4 + #t~string87.offset, 1);call write~init~int(0, #t~string87.base, 5 + #t~string87.offset, 1);call #t~string90.base, #t~string90.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string90.base, #t~string90.offset, 1);call write~init~int(37, #t~string90.base, 1 + #t~string90.offset, 1);call write~init~int(105, #t~string90.base, 2 + #t~string90.offset, 1);call write~init~int(0, #t~string90.base, 3 + #t~string90.offset, 1);call #t~string93.base, #t~string93.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string93.base, #t~string93.offset, 1);call write~init~int(37, #t~string93.base, 1 + #t~string93.offset, 1);call write~init~int(105, #t~string93.base, 2 + #t~string93.offset, 1);call write~init~int(0, #t~string93.base, 3 + #t~string93.offset, 1);call #t~string96.base, #t~string96.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string96.base, #t~string96.offset, 1);call write~init~int(37, #t~string96.base, 1 + #t~string96.offset, 1);call write~init~int(105, #t~string96.base, 2 + #t~string96.offset, 1);call write~init~int(0, #t~string96.base, 3 + #t~string96.offset, 1);call #t~string99.base, #t~string99.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string99.base, #t~string99.offset, 1);call write~init~int(37, #t~string99.base, 1 + #t~string99.offset, 1);call write~init~int(105, #t~string99.base, 2 + #t~string99.offset, 1);call write~init~int(0, #t~string99.base, 3 + #t~string99.offset, 1);call #t~string102.base, #t~string102.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string102.base, #t~string102.offset, 1);call write~init~int(37, #t~string102.base, 1 + #t~string102.offset, 1);call write~init~int(105, #t~string102.base, 2 + #t~string102.offset, 1);call write~init~int(0, #t~string102.base, 3 + #t~string102.offset, 1);call #t~string104.base, #t~string104.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string104.base, #t~string104.offset, 1);call write~init~int(0, #t~string104.base, 1 + #t~string104.offset, 1);call #t~string107.base, #t~string107.offset := #Ultimate.allocOnStack(9);~head~0.base, ~head~0.offset := 0, 0;call #t~string128.base, #t~string128.offset := #Ultimate.allocOnStack(30);call #t~string129.base, #t~string129.offset := #Ultimate.allocOnStack(9);call #t~string130.base, #t~string130.offset := #Ultimate.allocOnStack(21);call #t~string131.base, #t~string131.offset := #Ultimate.allocOnStack(30);call #t~string132.base, #t~string132.offset := #Ultimate.allocOnStack(9);call #t~string133.base, #t~string133.offset := #Ultimate.allocOnStack(21);call #t~string137.base, #t~string137.offset := #Ultimate.allocOnStack(30);call #t~string138.base, #t~string138.offset := #Ultimate.allocOnStack(9);call #t~string139.base, #t~string139.offset := #Ultimate.allocOnStack(25);call #t~string140.base, #t~string140.offset := #Ultimate.allocOnStack(30);call #t~string141.base, #t~string141.offset := #Ultimate.allocOnStack(9);call #t~string142.base, #t~string142.offset := #Ultimate.allocOnStack(25);~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~cleanupTimeShifts~0 := 12; 3715#L-1true havoc main_#res;havoc main_#t~ret165, main_~retValue_acc~26, main_~tmp~28;havoc main_~retValue_acc~26;havoc main_~tmp~28; 1269#L2891true havoc valid_product_#res;havoc valid_product_~retValue_acc~24;havoc valid_product_~retValue_acc~24;valid_product_~retValue_acc~24 := 1;valid_product_#res := valid_product_~retValue_acc~24; 658#L2899true main_#t~ret165 := valid_product_#res;main_~tmp~28 := main_#t~ret165;havoc main_#t~ret165; 1391#L3333true assume 0 != main_~tmp~28; 1500#L3308true ~floorButtons_spc2_0~0 := 0;~floorButtons_spc2_1~0 := 0;~floorButtons_spc2_2~0 := 0;~floorButtons_spc2_3~0 := 0;~floorButtons_spc2_4~0 := 0; 1767#L60true havoc bigMacCall_#t~ret158, bigMacCall_~tmp~25;havoc bigMacCall_~tmp~25;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~28;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~28; 1583#L3390true assume 0 == getOrigin_~person;getOrigin_~retValue_acc~28 := 4;getOrigin_#res := getOrigin_~retValue_acc~28; 182#L3415true bigMacCall_#t~ret158 := getOrigin_#res;bigMacCall_~tmp~25 := bigMacCall_#t~ret158;havoc bigMacCall_#t~ret158;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~25;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 819#L2544true assume 0 == initPersonOnFloor_~floor; 776#L2545true assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 4543#L2652-1true callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 1508#L2336true assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 1871#L2348-2true havoc cleanup_#t~ret159, cleanup_#t~ret160, cleanup_~i~3, cleanup_~tmp~26, cleanup_~tmp___0~11, cleanup_~__cil_tmp4~2;havoc cleanup_~i~3;havoc cleanup_~tmp~26;havoc cleanup_~tmp___0~11;havoc cleanup_~__cil_tmp4~2;havoc timeShift_#t~ret58, timeShift_~tmp~12;havoc timeShift_~tmp~12;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~2;havoc areDoorsOpen_~retValue_acc~2;areDoorsOpen_~retValue_acc~2 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~2; 2913#L479true timeShift_#t~ret58 := areDoorsOpen_#res;timeShift_~tmp~12 := timeShift_#t~ret58;havoc timeShift_#t~ret58; 4377#L1421true assume 0 != timeShift_~tmp~12; 4283#L1422true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 2915#L1095-11true havoc __utac_acc__Specification2_spec__3_#t~ret0, __utac_acc__Specification2_spec__3_#t~ret1, __utac_acc__Specification2_spec__3_#t~ret2, __utac_acc__Specification2_spec__3_#t~ret3, __utac_acc__Specification2_spec__3_#t~ret4, __utac_acc__Specification2_spec__3_#t~ret5, __utac_acc__Specification2_spec__3_~floor~0, __utac_acc__Specification2_spec__3_~tmp~0, __utac_acc__Specification2_spec__3_~tmp___0~0, __utac_acc__Specification2_spec__3_~tmp___1~0, __utac_acc__Specification2_spec__3_~tmp___2~0, __utac_acc__Specification2_spec__3_~tmp___3~0, __utac_acc__Specification2_spec__3_~tmp___4~0;havoc __utac_acc__Specification2_spec__3_~floor~0;havoc __utac_acc__Specification2_spec__3_~tmp~0;havoc __utac_acc__Specification2_spec__3_~tmp___0~0;havoc __utac_acc__Specification2_spec__3_~tmp___1~0;havoc __utac_acc__Specification2_spec__3_~tmp___2~0;havoc __utac_acc__Specification2_spec__3_~tmp___3~0;havoc __utac_acc__Specification2_spec__3_~tmp___4~0;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~1;havoc getCurrentFloorID_~retValue_acc~1;getCurrentFloorID_~retValue_acc~1 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~1; 3340#L470-6true __utac_acc__Specification2_spec__3_#t~ret0 := getCurrentFloorID_#res;__utac_acc__Specification2_spec__3_~tmp~0 := __utac_acc__Specification2_spec__3_#t~ret0;havoc __utac_acc__Specification2_spec__3_#t~ret0;__utac_acc__Specification2_spec__3_~floor~0 := __utac_acc__Specification2_spec__3_~tmp~0; 2738#L105true assume 0 == __utac_acc__Specification2_spec__3_~floor~0; 2722#L106true assume 0 != ~floorButtons_spc2_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~2;havoc areDoorsOpen_~retValue_acc~2;areDoorsOpen_~retValue_acc~2 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~2; 2897#L479-1true __utac_acc__Specification2_spec__3_#t~ret1 := areDoorsOpen_#res;__utac_acc__Specification2_spec__3_~tmp___4~0 := __utac_acc__Specification2_spec__3_#t~ret1;havoc __utac_acc__Specification2_spec__3_#t~ret1; 2673#L110true assume 0 != __utac_acc__Specification2_spec__3_~tmp___4~0;~floorButtons_spc2_0~0 := 0; 1054#L165true cleanup_~i~3 := 0; 1922#L3140-2true [2019-01-01 23:19:29,843 INFO L796 eck$LassoCheckResult]: Loop: 1922#L3140-2true assume !false; 1863#L3141true cleanup_~__cil_tmp4~2 := ~cleanupTimeShifts~0 - 1; 488#L3144true assume cleanup_~i~3 < cleanup_~__cil_tmp4~2;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~0;havoc isBlocked_~retValue_acc~0;isBlocked_~retValue_acc~0 := ~blocked~0;isBlocked_#res := isBlocked_~retValue_acc~0; 1499#L313true cleanup_#t~ret159 := isBlocked_#res;cleanup_~tmp___0~11 := cleanup_#t~ret159;havoc cleanup_#t~ret159; 336#L3148true assume 1 != cleanup_~tmp___0~11; 338#L3148-1true havoc isIdle_#res;havoc isIdle_#t~ret13, isIdle_~retValue_acc~7, isIdle_~tmp~4;havoc isIdle_~retValue_acc~7;havoc isIdle_~tmp~4;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret8, anyStopRequested_#t~ret9, anyStopRequested_#t~ret10, anyStopRequested_#t~ret11, anyStopRequested_#t~ret12, anyStopRequested_~retValue_acc~6, anyStopRequested_~tmp~3, anyStopRequested_~tmp___0~1, anyStopRequested_~tmp___1~1, anyStopRequested_~tmp___2~1, anyStopRequested_~tmp___3~1;havoc anyStopRequested_~retValue_acc~6;havoc anyStopRequested_~tmp~3;havoc anyStopRequested_~tmp___0~1;havoc anyStopRequested_~tmp___1~1;havoc anyStopRequested_~tmp___2~1;havoc anyStopRequested_~tmp___3~1;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~20;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~20; 1257#L2273-50true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~20 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~20; 4581#L2300-50true anyStopRequested_#t~ret8 := isFloorCalling_#res;anyStopRequested_~tmp___3~1 := anyStopRequested_#t~ret8;havoc anyStopRequested_#t~ret8; 1493#L578true assume 0 != anyStopRequested_~tmp___3~1;anyStopRequested_~retValue_acc~6 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~6; 2233#L642true isIdle_#t~ret13 := anyStopRequested_#res;isIdle_~tmp~4 := isIdle_#t~ret13;havoc isIdle_#t~ret13;isIdle_~retValue_acc~7 := (if 0 == isIdle_~tmp~4 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~7; 2918#L655true cleanup_#t~ret160 := isIdle_#res;cleanup_~tmp~26 := cleanup_#t~ret160;havoc cleanup_#t~ret160; 1051#L3160true assume !(0 != cleanup_~tmp~26);havoc timeShift_#t~ret58, timeShift_~tmp~12;havoc timeShift_~tmp~12;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~2;havoc areDoorsOpen_~retValue_acc~2;areDoorsOpen_~retValue_acc~2 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~2; 2887#L479-6true timeShift_#t~ret58 := areDoorsOpen_#res;timeShift_~tmp~12 := timeShift_#t~ret58;havoc timeShift_#t~ret58; 4379#L1421-1true assume 0 != timeShift_~tmp~12; 4290#L1422-2true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 2905#L1095-23true havoc __utac_acc__Specification2_spec__3_#t~ret0, __utac_acc__Specification2_spec__3_#t~ret1, __utac_acc__Specification2_spec__3_#t~ret2, __utac_acc__Specification2_spec__3_#t~ret3, __utac_acc__Specification2_spec__3_#t~ret4, __utac_acc__Specification2_spec__3_#t~ret5, __utac_acc__Specification2_spec__3_~floor~0, __utac_acc__Specification2_spec__3_~tmp~0, __utac_acc__Specification2_spec__3_~tmp___0~0, __utac_acc__Specification2_spec__3_~tmp___1~0, __utac_acc__Specification2_spec__3_~tmp___2~0, __utac_acc__Specification2_spec__3_~tmp___3~0, __utac_acc__Specification2_spec__3_~tmp___4~0;havoc __utac_acc__Specification2_spec__3_~floor~0;havoc __utac_acc__Specification2_spec__3_~tmp~0;havoc __utac_acc__Specification2_spec__3_~tmp___0~0;havoc __utac_acc__Specification2_spec__3_~tmp___1~0;havoc __utac_acc__Specification2_spec__3_~tmp___2~0;havoc __utac_acc__Specification2_spec__3_~tmp___3~0;havoc __utac_acc__Specification2_spec__3_~tmp___4~0;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~1;havoc getCurrentFloorID_~retValue_acc~1;getCurrentFloorID_~retValue_acc~1 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~1; 3290#L470-13true __utac_acc__Specification2_spec__3_#t~ret0 := getCurrentFloorID_#res;__utac_acc__Specification2_spec__3_~tmp~0 := __utac_acc__Specification2_spec__3_#t~ret0;havoc __utac_acc__Specification2_spec__3_#t~ret0;__utac_acc__Specification2_spec__3_~floor~0 := __utac_acc__Specification2_spec__3_~tmp~0; 2737#L105-1true assume 0 == __utac_acc__Specification2_spec__3_~floor~0; 2700#L106-1true assume 0 != ~floorButtons_spc2_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~2;havoc areDoorsOpen_~retValue_acc~2;areDoorsOpen_~retValue_acc~2 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~2; 2889#L479-7true __utac_acc__Specification2_spec__3_#t~ret1 := areDoorsOpen_#res;__utac_acc__Specification2_spec__3_~tmp___4~0 := __utac_acc__Specification2_spec__3_#t~ret1;havoc __utac_acc__Specification2_spec__3_#t~ret1; 2671#L110-2true assume 0 != __utac_acc__Specification2_spec__3_~tmp___4~0;~floorButtons_spc2_0~0 := 0; 1075#L165-1true cleanup_~i~3 := 1 + cleanup_~i~3; 1922#L3140-2true [2019-01-01 23:19:29,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:19:29,862 INFO L82 PathProgramCache]: Analyzing trace with hash 875917567, now seen corresponding path program 1 times [2019-01-01 23:19:29,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:19:29,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:19:29,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:19:29,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:19:29,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:19:30,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:19:30,286 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-01 23:19:30,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:19:30,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:19:30,296 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:19:30,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:19:30,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1676387731, now seen corresponding path program 1 times [2019-01-01 23:19:30,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:19:30,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:19:30,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:19:30,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:19:30,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:19:30,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:19:30,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:19:31,592 WARN L181 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 88 DAG size of output: 84 [2019-01-01 23:19:32,639 WARN L181 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2019-01-01 23:19:32,651 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:19:32,652 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:19:32,652 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:19:32,652 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:19:32,653 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:19:32,653 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:19:32,653 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:19:32,653 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:19:32,653 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec2_product20_false-unreach-call_true-termination.cil.c_Iteration1_Loop [2019-01-01 23:19:32,653 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:19:32,654 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:19:32,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:32,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:32,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:32,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:32,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:32,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:32,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:32,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:33,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:33,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:33,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:33,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:33,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:33,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:33,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:33,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:33,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-01 23:19:33,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:33,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-01 23:19:33,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:33,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:33,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:33,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:33,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:33,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:33,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:33,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:33,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:33,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:33,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:33,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:33,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:33,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:34,124 WARN L181 SmtUtils]: Spent 339.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-01 23:19:34,343 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:19:34,344 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-01 23:19:34,354 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:19:34,354 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:19:34,362 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:19:34,363 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification2_spec__3_~tmp___2~0=0} Honda state: {ULTIMATE.start___utac_acc__Specification2_spec__3_~tmp___2~0=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-01 23:19:34,386 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:19:34,387 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:19:34,392 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:19:34,393 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_cleanup_#t~ret159=0} Honda state: {ULTIMATE.start_cleanup_#t~ret159=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:19:34,414 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:19:34,415 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:19:34,419 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:19:34,419 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_~tmp___1~1=0} Honda state: {ULTIMATE.start_anyStopRequested_~tmp___1~1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:19:34,460 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:19:34,461 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:19:34,477 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:19:34,478 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_~tmp___3~1=-8, ULTIMATE.start_isFloorCalling_#res=-8, ~calls_0~0=-8, ULTIMATE.start_isFloorCalling_~retValue_acc~20=-8} Honda state: {ULTIMATE.start_anyStopRequested_~tmp___3~1=-8, ULTIMATE.start_isFloorCalling_#res=-8, ~calls_0~0=-8, ULTIMATE.start_isFloorCalling_~retValue_acc~20=-8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:19:34,531 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:19:34,531 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:19:34,550 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:19:34,550 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification2_spec__3_#t~ret4=0} Honda state: {ULTIMATE.start___utac_acc__Specification2_spec__3_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:19:34,610 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:19:34,610 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-01 23:19:34,622 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:19:34,622 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isFloorCalling_#in~floorID=0, ULTIMATE.start_isFloorCalling_~floorID=0} Honda state: {ULTIMATE.start_isFloorCalling_#in~floorID=0, ULTIMATE.start_isFloorCalling_~floorID=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:19:34,655 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:19:34,656 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:19:34,667 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:19:34,668 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification2_spec__3_#t~ret3=0} Honda state: {ULTIMATE.start___utac_acc__Specification2_spec__3_#t~ret3=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-01 23:19:34,697 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:19:34,697 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:19:34,699 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:19:34,700 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification2_spec__3_#t~ret2=0} Honda state: {ULTIMATE.start___utac_acc__Specification2_spec__3_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:19:34,733 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:19:34,733 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:19:34,738 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:19:34,738 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification2_spec__3_#t~ret1=0} Honda state: {ULTIMATE.start___utac_acc__Specification2_spec__3_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:19:34,762 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:19:34,762 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:19:34,770 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:19:34,770 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification2_spec__3_#t~ret0=0} Honda state: {ULTIMATE.start___utac_acc__Specification2_spec__3_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:19:34,791 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:19:34,791 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:19:34,794 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:19:34,794 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_#t~ret58=0} Honda state: {ULTIMATE.start_timeShift_#t~ret58=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:19:34,815 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:19:34,815 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:19:34,818 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:19:34,818 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification2_spec__3_~tmp___0~0=0} Honda state: {ULTIMATE.start___utac_acc__Specification2_spec__3_~tmp___0~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:19:34,841 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:19:34,841 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:19:34,865 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:19:34,865 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~weight~0=1, ~maximumWeight~0=0} Honda state: {~weight~0=1, ~maximumWeight~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:19:34,987 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:19:34,988 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:19:35,021 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:19:35,021 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:19:35,075 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:19:35,080 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:19:35,081 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:19:35,081 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:19:35,081 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:19:35,081 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:19:35,081 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:19:35,081 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:19:35,081 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:19:35,081 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec2_product20_false-unreach-call_true-termination.cil.c_Iteration1_Loop [2019-01-01 23:19:35,082 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:19:35,082 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:19:35,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:35,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:35,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:35,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:35,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:35,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:35,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:35,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:35,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:35,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:35,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:35,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:35,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:35,419 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-01 23:19:35,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:35,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:35,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:35,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-01 23:19:35,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:35,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:35,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:35,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:35,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:35,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:35,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:35,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-01 23:19:35,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:35,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:35,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-01 23:19:35,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:35,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:35,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:35,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:35,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:19:35,744 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-01 23:19:36,055 WARN L181 SmtUtils]: Spent 298.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-01 23:19:36,205 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-01 23:19:36,361 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-01 23:19:36,650 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-01 23:19:36,776 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-01 23:19:37,004 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-01 23:19:37,403 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:19:37,409 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:19:37,411 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-01 23:19:37,413 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:19:37,413 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:19:37,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:19:37,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:19:37,414 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:19:37,416 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:19:37,416 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:19:37,422 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:19:37,422 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:19:37,423 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:19:37,423 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:19:37,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:19:37,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:19:37,424 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:19:37,424 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:19:37,424 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:19:37,425 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:19:37,430 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-01 23:19:37,432 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:19:37,432 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:19:37,432 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:19:37,432 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:19:37,432 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:19:37,434 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:19:37,434 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:19:37,435 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:19:37,437 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-01 23:19:37,437 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:19:37,438 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:19:37,438 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:19:37,438 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:19:37,438 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:19:37,438 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:19:37,441 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:19:37,442 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:19:37,443 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-01 23:19:37,443 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:19:37,443 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:19:37,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:19:37,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:19:37,446 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:19:37,447 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:19:37,447 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:19:37,448 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:19:37,448 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-01 23:19:37,449 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:19:37,451 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:19:37,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:19:37,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:19:37,451 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:19:37,452 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:19:37,452 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:19:37,453 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:19:37,453 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-01 23:19:37,457 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:19:37,457 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:19:37,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:19:37,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:19:37,457 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:19:37,458 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:19:37,458 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:19:37,460 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:19:37,461 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-01 23:19:37,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:19:37,462 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:19:37,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:19:37,463 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:19:37,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:19:37,466 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:19:37,466 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:19:37,476 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:19:37,477 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-01 23:19:37,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:19:37,478 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:19:37,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:19:37,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:19:37,478 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:19:37,481 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:19:37,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:19:37,483 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:19:37,483 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-01 23:19:37,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:19:37,486 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:19:37,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:19:37,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:19:37,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:19:37,487 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:19:37,487 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:19:37,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:19:37,490 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-01 23:19:37,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:19:37,491 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:19:37,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:19:37,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:19:37,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:19:37,492 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:19:37,492 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:19:37,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:19:37,496 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-01 23:19:37,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:19:37,497 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:19:37,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:19:37,497 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:19:37,497 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:19:37,501 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:19:37,501 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:19:37,506 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:19:37,506 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-01 23:19:37,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:19:37,507 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:19:37,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:19:37,507 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:19:37,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:19:37,512 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:19:37,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:19:37,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:19:37,523 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-01 23:19:37,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:19:37,526 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:19:37,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:19:37,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:19:37,526 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:19:37,527 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:19:37,528 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:19:37,529 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:19:37,530 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-01 23:19:37,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:19:37,530 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:19:37,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:19:37,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:19:37,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:19:37,531 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:19:37,531 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:19:37,536 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:19:37,536 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-01 23:19:37,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:19:37,537 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:19:37,537 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:19:37,537 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:19:37,537 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:19:37,540 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:19:37,540 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:19:37,546 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:19:37,554 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 23:19:37,554 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 23:19:37,556 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:19:37,557 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:19:37,557 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:19:37,558 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-01 23:19:37,562 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:19:37,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:19:37,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:19:37,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:19:37,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:19:37,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:19:38,033 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-01 23:19:38,053 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-01 23:19:38,055 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4823 states. Second operand 5 states. [2019-01-01 23:19:38,942 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4823 states.. Second operand 5 states. Result 7284 states and 13718 transitions. Complement of second has 9 states. [2019-01-01 23:19:38,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 23:19:38,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 23:19:38,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9151 transitions. [2019-01-01 23:19:38,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 9151 transitions. Stem has 24 letters. Loop has 22 letters. [2019-01-01 23:19:38,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:19:38,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 9151 transitions. Stem has 46 letters. Loop has 22 letters. [2019-01-01 23:19:38,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:19:38,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 9151 transitions. Stem has 24 letters. Loop has 44 letters. [2019-01-01 23:19:38,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:19:38,965 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7284 states and 13718 transitions. [2019-01-01 23:19:39,060 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:19:39,064 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7284 states to 0 states and 0 transitions. [2019-01-01 23:19:39,065 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 23:19:39,065 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 23:19:39,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 23:19:39,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:19:39,067 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:19:39,067 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:19:39,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:19:39,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:19:39,075 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2019-01-01 23:19:39,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:19:39,079 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-01 23:19:39,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-01 23:19:39,081 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-01 23:19:39,081 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:19:39,081 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 23:19:39,081 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 23:19:39,081 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 23:19:39,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 23:19:39,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:19:39,083 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:19:39,083 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:19:39,083 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:19:39,084 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:19:39,084 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 23:19:39,084 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:19:39,084 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 23:19:39,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:19:39 BoogieIcfgContainer [2019-01-01 23:19:39,093 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:19:39,094 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:19:39,094 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:19:39,094 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:19:39,095 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:19:29" (3/4) ... [2019-01-01 23:19:39,101 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 23:19:39,101 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:19:39,102 INFO L168 Benchmark]: Toolchain (without parser) took 26681.44 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 520.1 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -163.8 MB). Peak memory consumption was 356.3 MB. Max. memory is 11.5 GB. [2019-01-01 23:19:39,103 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:19:39,103 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1162.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -150.9 MB). Peak memory consumption was 56.7 MB. Max. memory is 11.5 GB. [2019-01-01 23:19:39,106 INFO L168 Benchmark]: Boogie Procedure Inliner took 347.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 11.5 GB. [2019-01-01 23:19:39,106 INFO L168 Benchmark]: Boogie Preprocessor took 331.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 48.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 11.5 GB. [2019-01-01 23:19:39,108 INFO L168 Benchmark]: RCFGBuilder took 15132.60 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 188.7 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -138.5 MB). Peak memory consumption was 444.0 MB. Max. memory is 11.5 GB. [2019-01-01 23:19:39,109 INFO L168 Benchmark]: BuchiAutomizer took 9695.31 ms. Allocated memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: 197.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.1 MB). Peak memory consumption was 225.3 MB. Max. memory is 11.5 GB. [2019-01-01 23:19:39,109 INFO L168 Benchmark]: Witness Printer took 6.84 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:19:39,116 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1162.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -150.9 MB). Peak memory consumption was 56.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 347.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 331.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 48.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 15132.60 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 188.7 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -138.5 MB). Peak memory consumption was 444.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9695.31 ms. Allocated memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: 197.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.1 MB). Peak memory consumption was 225.3 MB. Max. memory is 11.5 GB. * Witness Printer took 6.84 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function cleanupTimeShifts + -1 * i and consists of 6 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.6s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 7.7s. Construction of modules took 0.1s. Büchi inclusion checks took 1.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 9117 SDtfs, 18200 SDslu, 4575 SDs, 0 SdLazy, 9 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital109 mio100 ax100 hnf100 lsp16 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq211 hnf89 smp100 dnf176 smp100 tf103 neg96 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 15ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 13 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...