./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/elevator_spec1_product24_false-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/product-lines/elevator_spec1_product24_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 f6103b74ce18f230972d65a7f322c96917948475 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 03:57:37,364 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 03:57:37,365 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 03:57:37,378 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 03:57:37,378 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 03:57:37,379 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 03:57:37,381 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 03:57:37,382 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 03:57:37,384 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 03:57:37,385 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 03:57:37,386 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 03:57:37,386 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 03:57:37,387 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 03:57:37,388 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 03:57:37,389 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 03:57:37,390 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 03:57:37,391 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 03:57:37,393 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 03:57:37,395 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 03:57:37,396 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 03:57:37,397 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 03:57:37,399 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 03:57:37,401 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 03:57:37,401 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 03:57:37,402 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 03:57:37,402 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 03:57:37,403 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 03:57:37,404 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 03:57:37,405 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 03:57:37,406 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 03:57:37,406 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 03:57:37,407 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 03:57:37,407 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 03:57:37,408 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 03:57:37,409 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 03:57:37,409 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 03:57:37,410 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 03:57:37,427 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 03:57:37,428 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 03:57:37,429 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 03:57:37,429 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 03:57:37,429 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 03:57:37,430 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 03:57:37,430 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 03:57:37,430 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 03:57:37,430 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 03:57:37,430 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 03:57:37,431 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 03:57:37,431 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 03:57:37,431 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 03:57:37,431 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 03:57:37,431 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 03:57:37,431 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 03:57:37,432 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 03:57:37,432 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 03:57:37,432 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 03:57:37,432 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 03:57:37,432 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 03:57:37,432 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 03:57:37,433 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 03:57:37,433 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 03:57:37,433 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 03:57:37,433 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 03:57:37,433 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 03:57:37,434 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 03:57:37,434 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 03:57:37,434 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 03:57:37,434 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 03:57:37,435 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 03:57:37,435 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 -> f6103b74ce18f230972d65a7f322c96917948475 [2019-01-14 03:57:37,474 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 03:57:37,490 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 03:57:37,497 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 03:57:37,499 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 03:57:37,499 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 03:57:37,500 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/elevator_spec1_product24_false-unreach-call_true-termination.cil.c [2019-01-14 03:57:37,567 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d45458284/8f69b67ceb4341a6a4d57effb094b5f8/FLAGc76c7ba8c [2019-01-14 03:57:38,231 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 03:57:38,231 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/elevator_spec1_product24_false-unreach-call_true-termination.cil.c [2019-01-14 03:57:38,254 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d45458284/8f69b67ceb4341a6a4d57effb094b5f8/FLAGc76c7ba8c [2019-01-14 03:57:38,403 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d45458284/8f69b67ceb4341a6a4d57effb094b5f8 [2019-01-14 03:57:38,407 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 03:57:38,409 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 03:57:38,410 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 03:57:38,410 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 03:57:38,415 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 03:57:38,416 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:57:38" (1/1) ... [2019-01-14 03:57:38,420 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13b4cbb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:57:38, skipping insertion in model container [2019-01-14 03:57:38,421 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:57:38" (1/1) ... [2019-01-14 03:57:38,430 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 03:57:38,522 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 03:57:39,207 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 03:57:39,340 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 03:57:39,501 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 03:57:39,603 INFO L195 MainTranslator]: Completed translation [2019-01-14 03:57:39,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:57:39 WrapperNode [2019-01-14 03:57:39,604 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 03:57:39,605 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 03:57:39,605 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 03:57:39,605 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 03:57:39,614 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:57:39" (1/1) ... [2019-01-14 03:57:39,655 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:57:39" (1/1) ... [2019-01-14 03:57:39,972 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 03:57:39,973 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 03:57:39,973 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 03:57:39,973 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 03:57:39,984 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:57:39" (1/1) ... [2019-01-14 03:57:39,985 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:57:39" (1/1) ... [2019-01-14 03:57:40,035 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:57:39" (1/1) ... [2019-01-14 03:57:40,035 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:57:39" (1/1) ... [2019-01-14 03:57:40,190 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:57:39" (1/1) ... [2019-01-14 03:57:40,332 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:57:39" (1/1) ... [2019-01-14 03:57:40,374 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:57:39" (1/1) ... [2019-01-14 03:57:40,456 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 03:57:40,457 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 03:57:40,457 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 03:57:40,457 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 03:57:40,458 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:57:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:57:40,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 03:57:40,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-14 03:57:40,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 03:57:40,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 03:57:56,383 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 03:57:56,384 INFO L286 CfgBuilder]: Removed 1577 assue(true) statements. [2019-01-14 03:57:56,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:57:56 BoogieIcfgContainer [2019-01-14 03:57:56,389 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 03:57:56,389 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 03:57:56,389 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 03:57:56,393 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 03:57:56,394 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 03:57:56,394 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 03:57:38" (1/3) ... [2019-01-14 03:57:56,396 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4c747a53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 03:57:56, skipping insertion in model container [2019-01-14 03:57:56,396 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 03:57:56,396 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:57:39" (2/3) ... [2019-01-14 03:57:56,397 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4c747a53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 03:57:56, skipping insertion in model container [2019-01-14 03:57:56,397 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 03:57:56,397 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:57:56" (3/3) ... [2019-01-14 03:57:56,399 INFO L375 chiAutomizerObserver]: Analyzing ICFG elevator_spec1_product24_false-unreach-call_true-termination.cil.c [2019-01-14 03:57:56,455 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 03:57:56,456 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 03:57:56,456 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 03:57:56,456 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 03:57:56,456 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 03:57:56,457 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 03:57:56,457 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 03:57:56,457 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 03:57:56,457 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 03:57:56,562 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6906 states. [2019-01-14 03:57:56,742 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3413 [2019-01-14 03:57:56,742 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:57:56,743 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:57:56,764 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:57:56,764 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:57:56,764 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 03:57:56,764 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6906 states. [2019-01-14 03:57:56,844 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3413 [2019-01-14 03:57:56,844 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:57:56,844 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:57:56,850 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:57:56,850 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:57:56,858 INFO L794 eck$LassoCheckResult]: Stem: 1588#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0;call #t~string18.base, #t~string18.offset := #Ultimate.allocOnStack(30);call #t~string19.base, #t~string19.offset := #Ultimate.allocOnStack(9);call #t~string20.base, #t~string20.offset := #Ultimate.allocOnStack(21);call #t~string21.base, #t~string21.offset := #Ultimate.allocOnStack(30);call #t~string22.base, #t~string22.offset := #Ultimate.allocOnStack(9);call #t~string23.base, #t~string23.offset := #Ultimate.allocOnStack(21);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(30);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(9);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(25);call #t~string30.base, #t~string30.offset := #Ultimate.allocOnStack(30);call #t~string31.base, #t~string31.offset := #Ultimate.allocOnStack(9);call #t~string32.base, #t~string32.offset := #Ultimate.allocOnStack(25);~cleanupTimeShifts~0 := 12;~calls_0~0 := 0;~calls_1~0 := 0;~calls_2~0 := 0;~calls_3~0 := 0;~calls_4~0 := 0;~personOnFloor_0_0~0 := 0;~personOnFloor_0_1~0 := 0;~personOnFloor_0_2~0 := 0;~personOnFloor_0_3~0 := 0;~personOnFloor_0_4~0 := 0;~personOnFloor_1_0~0 := 0;~personOnFloor_1_1~0 := 0;~personOnFloor_1_2~0 := 0;~personOnFloor_1_3~0 := 0;~personOnFloor_1_4~0 := 0;~personOnFloor_2_0~0 := 0;~personOnFloor_2_1~0 := 0;~personOnFloor_2_2~0 := 0;~personOnFloor_2_3~0 := 0;~personOnFloor_2_4~0 := 0;~personOnFloor_3_0~0 := 0;~personOnFloor_3_1~0 := 0;~personOnFloor_3_2~0 := 0;~personOnFloor_3_3~0 := 0;~personOnFloor_3_4~0 := 0;~personOnFloor_4_0~0 := 0;~personOnFloor_4_1~0 := 0;~personOnFloor_4_2~0 := 0;~personOnFloor_4_3~0 := 0;~personOnFloor_4_4~0 := 0;~personOnFloor_5_0~0 := 0;~personOnFloor_5_1~0 := 0;~personOnFloor_5_2~0 := 0;~personOnFloor_5_3~0 := 0;~personOnFloor_5_4~0 := 0;~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~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~string109.base, #t~string109.offset := #Ultimate.allocOnStack(10);call #t~string111.base, #t~string111.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string111.base, #t~string111.offset, 1);call write~init~int(95, #t~string111.base, 1 + #t~string111.offset, 1);call write~init~int(93, #t~string111.base, 2 + #t~string111.offset, 1);call write~init~int(0, #t~string111.base, 3 + #t~string111.offset, 1);call #t~string113.base, #t~string113.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string113.base, #t~string113.offset, 1);call write~init~int(93, #t~string113.base, 1 + #t~string113.offset, 1);call write~init~int(32, #t~string113.base, 2 + #t~string113.offset, 1);call write~init~int(0, #t~string113.base, 3 + #t~string113.offset, 1);call #t~string115.base, #t~string115.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string115.base, #t~string115.offset, 1);call write~init~int(97, #t~string115.base, 1 + #t~string115.offset, 1);call write~init~int(116, #t~string115.base, 2 + #t~string115.offset, 1);call write~init~int(32, #t~string115.base, 3 + #t~string115.offset, 1);call write~init~int(0, #t~string115.base, 4 + #t~string115.offset, 1);call #t~string117.base, #t~string117.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string117.base, #t~string117.offset, 1);call write~init~int(105, #t~string117.base, 1 + #t~string117.offset, 1);call write~init~int(0, #t~string117.base, 2 + #t~string117.offset, 1);call #t~string119.base, #t~string119.offset := #Ultimate.allocOnStack(10);call #t~string121.base, #t~string121.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string121.base, #t~string121.offset, 1);call write~init~int(112, #t~string121.base, 1 + #t~string121.offset, 1);call write~init~int(0, #t~string121.base, 2 + #t~string121.offset, 1);call #t~string123.base, #t~string123.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string123.base, #t~string123.offset, 1);call write~init~int(111, #t~string123.base, 1 + #t~string123.offset, 1);call write~init~int(119, #t~string123.base, 2 + #t~string123.offset, 1);call write~init~int(110, #t~string123.base, 3 + #t~string123.offset, 1);call write~init~int(0, #t~string123.base, 4 + #t~string123.offset, 1);call #t~string125.base, #t~string125.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string125.base, #t~string125.offset, 1);call write~init~int(73, #t~string125.base, 1 + #t~string125.offset, 1);call write~init~int(76, #t~string125.base, 2 + #t~string125.offset, 1);call write~init~int(95, #t~string125.base, 3 + #t~string125.offset, 1);call write~init~int(112, #t~string125.base, 4 + #t~string125.offset, 1);call write~init~int(58, #t~string125.base, 5 + #t~string125.offset, 1);call write~init~int(0, #t~string125.base, 6 + #t~string125.offset, 1);call #t~string127.base, #t~string127.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string127.base, #t~string127.offset, 1);call write~init~int(37, #t~string127.base, 1 + #t~string127.offset, 1);call write~init~int(105, #t~string127.base, 2 + #t~string127.offset, 1);call write~init~int(0, #t~string127.base, 3 + #t~string127.offset, 1);call #t~string129.base, #t~string129.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string129.base, #t~string129.offset, 1);call write~init~int(37, #t~string129.base, 1 + #t~string129.offset, 1);call write~init~int(105, #t~string129.base, 2 + #t~string129.offset, 1);call write~init~int(0, #t~string129.base, 3 + #t~string129.offset, 1);call #t~string131.base, #t~string131.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string131.base, #t~string131.offset, 1);call write~init~int(37, #t~string131.base, 1 + #t~string131.offset, 1);call write~init~int(105, #t~string131.base, 2 + #t~string131.offset, 1);call write~init~int(0, #t~string131.base, 3 + #t~string131.offset, 1);call #t~string133.base, #t~string133.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string133.base, #t~string133.offset, 1);call write~init~int(37, #t~string133.base, 1 + #t~string133.offset, 1);call write~init~int(105, #t~string133.base, 2 + #t~string133.offset, 1);call write~init~int(0, #t~string133.base, 3 + #t~string133.offset, 1);call #t~string135.base, #t~string135.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string135.base, #t~string135.offset, 1);call write~init~int(37, #t~string135.base, 1 + #t~string135.offset, 1);call write~init~int(105, #t~string135.base, 2 + #t~string135.offset, 1);call write~init~int(0, #t~string135.base, 3 + #t~string135.offset, 1);call #t~string137.base, #t~string137.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string137.base, #t~string137.offset, 1);call write~init~int(70, #t~string137.base, 1 + #t~string137.offset, 1);call write~init~int(95, #t~string137.base, 2 + #t~string137.offset, 1);call write~init~int(112, #t~string137.base, 3 + #t~string137.offset, 1);call write~init~int(58, #t~string137.base, 4 + #t~string137.offset, 1);call write~init~int(0, #t~string137.base, 5 + #t~string137.offset, 1);call #t~string140.base, #t~string140.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string140.base, #t~string140.offset, 1);call write~init~int(37, #t~string140.base, 1 + #t~string140.offset, 1);call write~init~int(105, #t~string140.base, 2 + #t~string140.offset, 1);call write~init~int(0, #t~string140.base, 3 + #t~string140.offset, 1);call #t~string143.base, #t~string143.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string143.base, #t~string143.offset, 1);call write~init~int(37, #t~string143.base, 1 + #t~string143.offset, 1);call write~init~int(105, #t~string143.base, 2 + #t~string143.offset, 1);call write~init~int(0, #t~string143.base, 3 + #t~string143.offset, 1);call #t~string146.base, #t~string146.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string146.base, #t~string146.offset, 1);call write~init~int(37, #t~string146.base, 1 + #t~string146.offset, 1);call write~init~int(105, #t~string146.base, 2 + #t~string146.offset, 1);call write~init~int(0, #t~string146.base, 3 + #t~string146.offset, 1);call #t~string149.base, #t~string149.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string149.base, #t~string149.offset, 1);call write~init~int(37, #t~string149.base, 1 + #t~string149.offset, 1);call write~init~int(105, #t~string149.base, 2 + #t~string149.offset, 1);call write~init~int(0, #t~string149.base, 3 + #t~string149.offset, 1);call #t~string152.base, #t~string152.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string152.base, #t~string152.offset, 1);call write~init~int(37, #t~string152.base, 1 + #t~string152.offset, 1);call write~init~int(105, #t~string152.base, 2 + #t~string152.offset, 1);call write~init~int(0, #t~string152.base, 3 + #t~string152.offset, 1);call #t~string154.base, #t~string154.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string154.base, #t~string154.offset, 1);call write~init~int(0, #t~string154.base, 1 + #t~string154.offset, 1);call #t~string157.base, #t~string157.offset := #Ultimate.allocOnStack(9);~landingButtons_spc1_0~0 := 0;~landingButtons_spc1_1~0 := 0;~landingButtons_spc1_2~0 := 0;~landingButtons_spc1_3~0 := 0;~landingButtons_spc1_4~0 := 0; 5834#L-1true havoc main_#res;havoc main_#t~ret48, main_~retValue_acc~4, main_~tmp~11;havoc main_~retValue_acc~4;havoc main_~tmp~11; 5995#L3523true havoc valid_product_#res;havoc valid_product_~retValue_acc~31;havoc valid_product_~retValue_acc~31;valid_product_~retValue_acc~31 := 1;valid_product_#res := valid_product_~retValue_acc~31; 6893#L3531true main_#t~ret48 := valid_product_#res;main_~tmp~11 := main_#t~ret48;havoc main_#t~ret48; 997#L764true assume 0 != main_~tmp~11; 5262#L733true ~landingButtons_spc1_0~0 := 0;~landingButtons_spc1_1~0 := 0;~landingButtons_spc1_2~0 := 0;~landingButtons_spc1_3~0 := 0;~landingButtons_spc1_4~0 := 0; 5207#L3203true havoc bigMacCall_#t~ret41, bigMacCall_~tmp~8;havoc bigMacCall_~tmp~8;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~28;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~28; 444#L3426true assume 0 == getOrigin_~person;getOrigin_~retValue_acc~28 := 4;getOrigin_#res := getOrigin_~retValue_acc~28; 2303#L3451true bigMacCall_#t~ret41 := getOrigin_#res;bigMacCall_~tmp~8 := bigMacCall_#t~ret41;havoc bigMacCall_#t~ret41;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~8;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 2250#L1142true assume 0 == initPersonOnFloor_~floor; 2191#L1143true assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 6367#L1250-1true callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID, callOnFloor_~__utac__ad__arg1~0;callOnFloor_~floorID := callOnFloor_#in~floorID;havoc callOnFloor_~__utac__ad__arg1~0;callOnFloor_~__utac__ad__arg1~0 := callOnFloor_~floorID;__utac_acc__Specification1_spec__2_#in~floor := callOnFloor_~__utac__ad__arg1~0;havoc __utac_acc__Specification1_spec__2_~floor;__utac_acc__Specification1_spec__2_~floor := __utac_acc__Specification1_spec__2_#in~floor; 5024#L3210true assume 0 == __utac_acc__Specification1_spec__2_~floor;~landingButtons_spc1_0~0 := 1; 1335#L3222-2true assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 247#L946-2true havoc angelinaCall_#t~ret38, angelinaCall_~tmp~5;havoc angelinaCall_~tmp~5;getOrigin_#in~person := 2;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~28;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~28; 445#L3426-1true assume 0 == getOrigin_~person;getOrigin_~retValue_acc~28 := 4;getOrigin_#res := getOrigin_~retValue_acc~28; 2302#L3451-1true angelinaCall_#t~ret38 := getOrigin_#res;angelinaCall_~tmp~5 := angelinaCall_#t~ret38;havoc angelinaCall_#t~ret38;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 2, angelinaCall_~tmp~5;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 2251#L1142-1true assume 0 == initPersonOnFloor_~floor; 2192#L1143-2true assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 6371#L1250-3true callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID, callOnFloor_~__utac__ad__arg1~0;callOnFloor_~floorID := callOnFloor_#in~floorID;havoc callOnFloor_~__utac__ad__arg1~0;callOnFloor_~__utac__ad__arg1~0 := callOnFloor_~floorID;__utac_acc__Specification1_spec__2_#in~floor := callOnFloor_~__utac__ad__arg1~0;havoc __utac_acc__Specification1_spec__2_~floor;__utac_acc__Specification1_spec__2_~floor := __utac_acc__Specification1_spec__2_#in~floor; 934#L3210-2true assume 0 == __utac_acc__Specification1_spec__2_~floor;~landingButtons_spc1_0~0 := 1; 1340#L3222-5true assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 228#L946-5true havoc cleanup_#t~ret42, cleanup_#t~ret43, cleanup_~i~0, cleanup_~tmp~9, cleanup_~tmp___0~0, cleanup_~__cil_tmp4~2;havoc cleanup_~i~0;havoc cleanup_~tmp~9;havoc cleanup_~tmp___0~0;havoc cleanup_~__cil_tmp4~2;havoc timeShift_#t~ret108, timeShift_~tmp~25;havoc timeShift_~tmp~25;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~10;havoc areDoorsOpen_~retValue_acc~10;areDoorsOpen_~retValue_acc~10 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~10; 1598#L1693true timeShift_#t~ret108 := areDoorsOpen_#res;timeShift_~tmp~25 := timeShift_#t~ret108;havoc timeShift_#t~ret108; 278#L2704true assume 0 != timeShift_~tmp~25; 314#L2705true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 999#L2349-11true havoc __utac_acc__Specification1_spec__3_#t~ret166, __utac_acc__Specification1_spec__3_#t~ret167, __utac_acc__Specification1_spec__3_#t~ret168, __utac_acc__Specification1_spec__3_#t~ret169, __utac_acc__Specification1_spec__3_#t~ret170, __utac_acc__Specification1_spec__3_#t~ret171, __utac_acc__Specification1_spec__3_~floor~0, __utac_acc__Specification1_spec__3_~tmp~30, __utac_acc__Specification1_spec__3_~tmp___0~13, __utac_acc__Specification1_spec__3_~tmp___1~8, __utac_acc__Specification1_spec__3_~tmp___2~6, __utac_acc__Specification1_spec__3_~tmp___3~5, __utac_acc__Specification1_spec__3_~tmp___4~3;havoc __utac_acc__Specification1_spec__3_~floor~0;havoc __utac_acc__Specification1_spec__3_~tmp~30;havoc __utac_acc__Specification1_spec__3_~tmp___0~13;havoc __utac_acc__Specification1_spec__3_~tmp___1~8;havoc __utac_acc__Specification1_spec__3_~tmp___2~6;havoc __utac_acc__Specification1_spec__3_~tmp___3~5;havoc __utac_acc__Specification1_spec__3_~tmp___4~3;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~9;havoc getCurrentFloorID_~retValue_acc~9;getCurrentFloorID_~retValue_acc~9 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~9; 2384#L1684-10true __utac_acc__Specification1_spec__3_#t~ret166 := getCurrentFloorID_#res;__utac_acc__Specification1_spec__3_~tmp~30 := __utac_acc__Specification1_spec__3_#t~ret166;havoc __utac_acc__Specification1_spec__3_#t~ret166;__utac_acc__Specification1_spec__3_~floor~0 := __utac_acc__Specification1_spec__3_~tmp~30; 561#L3248true assume 0 == __utac_acc__Specification1_spec__3_~floor~0; 457#L3249true assume 0 != ~landingButtons_spc1_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~10;havoc areDoorsOpen_~retValue_acc~10;areDoorsOpen_~retValue_acc~10 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~10; 1599#L1693-1true __utac_acc__Specification1_spec__3_#t~ret167 := areDoorsOpen_#res;__utac_acc__Specification1_spec__3_~tmp___4~3 := __utac_acc__Specification1_spec__3_#t~ret167;havoc __utac_acc__Specification1_spec__3_#t~ret167; 430#L3253true assume 0 != __utac_acc__Specification1_spec__3_~tmp___4~3;~landingButtons_spc1_0~0 := 0; 3671#L3308true cleanup_~i~0 := 0; 5098#L563-2true [2019-01-14 03:57:56,859 INFO L796 eck$LassoCheckResult]: Loop: 5098#L563-2true assume !false; 5163#L564true cleanup_~__cil_tmp4~2 := ~cleanupTimeShifts~0 - 1; 5043#L567true assume cleanup_~i~0 < cleanup_~__cil_tmp4~2;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~8;havoc isBlocked_~retValue_acc~8;isBlocked_~retValue_acc~8 := ~blocked~0;isBlocked_#res := isBlocked_~retValue_acc~8; 1800#L1531true cleanup_#t~ret42 := isBlocked_#res;cleanup_~tmp___0~0 := cleanup_#t~ret42;havoc cleanup_#t~ret42; 857#L571true assume 1 != cleanup_~tmp___0~0; 858#L571-1true havoc isIdle_#res;havoc isIdle_#t~ret56, isIdle_~retValue_acc~15, isIdle_~tmp~15;havoc isIdle_~retValue_acc~15;havoc isIdle_~tmp~15;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret51, anyStopRequested_#t~ret52, anyStopRequested_#t~ret53, anyStopRequested_#t~ret54, anyStopRequested_#t~ret55, anyStopRequested_~retValue_acc~14, anyStopRequested_~tmp~14, anyStopRequested_~tmp___0~2, anyStopRequested_~tmp___1~1, anyStopRequested_~tmp___2~1, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~14;havoc anyStopRequested_~tmp~14;havoc anyStopRequested_~tmp___0~2;havoc anyStopRequested_~tmp___1~1;havoc anyStopRequested_~tmp___2~1;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~5;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~5; 3385#L866-130true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~5 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~5; 6387#L893-130true anyStopRequested_#t~ret51 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret51;havoc anyStopRequested_#t~ret51; 5270#L1792true assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~14 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~14; 2475#L1856true isIdle_#t~ret56 := anyStopRequested_#res;isIdle_~tmp~15 := isIdle_#t~ret56;havoc isIdle_#t~ret56;isIdle_~retValue_acc~15 := (if 0 == isIdle_~tmp~15 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~15; 1602#L1869true cleanup_#t~ret43 := isIdle_#res;cleanup_~tmp~9 := cleanup_#t~ret43;havoc cleanup_#t~ret43; 1289#L583true assume !(0 != cleanup_~tmp~9);havoc timeShift_#t~ret108, timeShift_~tmp~25;havoc timeShift_~tmp~25;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~10;havoc areDoorsOpen_~retValue_acc~10;areDoorsOpen_~retValue_acc~10 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~10; 1595#L1693-6true timeShift_#t~ret108 := areDoorsOpen_#res;timeShift_~tmp~25 := timeShift_#t~ret108;havoc timeShift_#t~ret108; 277#L2704-1true assume 0 != timeShift_~tmp~25; 315#L2705-2true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 996#L2349-23true havoc __utac_acc__Specification1_spec__3_#t~ret166, __utac_acc__Specification1_spec__3_#t~ret167, __utac_acc__Specification1_spec__3_#t~ret168, __utac_acc__Specification1_spec__3_#t~ret169, __utac_acc__Specification1_spec__3_#t~ret170, __utac_acc__Specification1_spec__3_#t~ret171, __utac_acc__Specification1_spec__3_~floor~0, __utac_acc__Specification1_spec__3_~tmp~30, __utac_acc__Specification1_spec__3_~tmp___0~13, __utac_acc__Specification1_spec__3_~tmp___1~8, __utac_acc__Specification1_spec__3_~tmp___2~6, __utac_acc__Specification1_spec__3_~tmp___3~5, __utac_acc__Specification1_spec__3_~tmp___4~3;havoc __utac_acc__Specification1_spec__3_~floor~0;havoc __utac_acc__Specification1_spec__3_~tmp~30;havoc __utac_acc__Specification1_spec__3_~tmp___0~13;havoc __utac_acc__Specification1_spec__3_~tmp___1~8;havoc __utac_acc__Specification1_spec__3_~tmp___2~6;havoc __utac_acc__Specification1_spec__3_~tmp___3~5;havoc __utac_acc__Specification1_spec__3_~tmp___4~3;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~9;havoc getCurrentFloorID_~retValue_acc~9;getCurrentFloorID_~retValue_acc~9 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~9; 2364#L1684-21true __utac_acc__Specification1_spec__3_#t~ret166 := getCurrentFloorID_#res;__utac_acc__Specification1_spec__3_~tmp~30 := __utac_acc__Specification1_spec__3_#t~ret166;havoc __utac_acc__Specification1_spec__3_#t~ret166;__utac_acc__Specification1_spec__3_~floor~0 := __utac_acc__Specification1_spec__3_~tmp~30; 563#L3248-1true assume 0 == __utac_acc__Specification1_spec__3_~floor~0; 455#L3249-1true assume 0 != ~landingButtons_spc1_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~10;havoc areDoorsOpen_~retValue_acc~10;areDoorsOpen_~retValue_acc~10 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~10; 1596#L1693-7true __utac_acc__Specification1_spec__3_#t~ret167 := areDoorsOpen_#res;__utac_acc__Specification1_spec__3_~tmp___4~3 := __utac_acc__Specification1_spec__3_#t~ret167;havoc __utac_acc__Specification1_spec__3_#t~ret167; 421#L3253-2true assume 0 != __utac_acc__Specification1_spec__3_~tmp___4~3;~landingButtons_spc1_0~0 := 0; 3673#L3308-1true cleanup_~i~0 := 1 + cleanup_~i~0; 5098#L563-2true [2019-01-14 03:57:56,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:57:56,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1234750710, now seen corresponding path program 1 times [2019-01-14 03:57:56,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:57:56,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:57:56,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:57:56,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:57:56,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:57:57,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:57:57,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:57:57,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:57:57,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 03:57:57,308 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 03:57:57,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:57:57,309 INFO L82 PathProgramCache]: Analyzing trace with hash -316262643, now seen corresponding path program 1 times [2019-01-14 03:57:57,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:57:57,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:57:57,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:57:57,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:57:57,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:57:57,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:57:57,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:57:58,212 WARN L181 SmtUtils]: Spent 833.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 84 [2019-01-14 03:57:58,998 WARN L181 SmtUtils]: Spent 773.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2019-01-14 03:57:59,011 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:57:59,012 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:57:59,013 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:57:59,013 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:57:59,013 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 03:57:59,013 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:57:59,013 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:57:59,013 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:57:59,014 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec1_product24_false-unreach-call_true-termination.cil.c_Iteration1_Loop [2019-01-14 03:57:59,014 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:57:59,015 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:57:59,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:57:59,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:57:59,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-14 03:57:59,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:57:59,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:57:59,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:57:59,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:57:59,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:57:59,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:57:59,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:57:59,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:57:59,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:57:59,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:57:59,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:57:59,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:57:59,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:57:59,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:57:59,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:57:59,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:57:59,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:57:59,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-14 03:57:59,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:57:59,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:57:59,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:57:59,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:57:59,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:57:59,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:57:59,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:57:59,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-14 03:57:59,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-14 03:57:59,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:57:59,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:57:59,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:57:59,959 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:57:59,959 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:57:59,974 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:57:59,975 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:57:59,989 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:57:59,990 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isIdle_#t~ret56=0} Honda state: {ULTIMATE.start_isIdle_#t~ret56=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:58:00,012 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:58:00,012 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:58:00,020 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:58:00,020 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_isIdle_#res=0, ULTIMATE.start_cleanup_~tmp~9=0, ULTIMATE.start_isIdle_~retValue_acc~15=0} Honda state: {ULTIMATE.start_isIdle_#res=0, ULTIMATE.start_cleanup_~tmp~9=0, ULTIMATE.start_isIdle_~retValue_acc~15=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 03:58:00,066 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:58:00,066 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:58:00,135 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 03:58:00,135 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:58:12,178 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-01-14 03:58:12,181 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:58:12,181 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:58:12,181 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:58:12,181 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:58:12,181 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:58:12,181 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:58:12,182 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:58:12,182 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:58:12,182 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec1_product24_false-unreach-call_true-termination.cil.c_Iteration1_Loop [2019-01-14 03:58:12,182 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:58:12,182 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:58:12,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:12,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:12,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:12,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:12,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:12,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:12,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:12,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:12,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:12,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:12,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:12,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:12,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:12,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:12,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:12,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:12,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:12,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:12,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:12,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:12,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:12,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:12,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:12,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:12,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:12,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:12,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:12,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:12,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:12,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:12,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:12,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:12,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:58:12,895 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-14 03:58:13,194 WARN L181 SmtUtils]: Spent 285.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-14 03:58:13,374 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-14 03:58:13,910 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-14 03:58:14,090 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-14 03:58:14,274 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:58:14,280 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 03:58:14,281 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:58:14,283 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:58:14,283 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:58:14,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:58:14,283 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:58:14,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:58:14,285 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:58:14,285 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:58:14,287 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:58:14,288 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:58:14,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:58:14,288 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:58:14,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:58:14,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:58:14,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:58:14,290 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:58:14,290 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:58:14,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:58:14,293 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:58:14,294 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:58:14,294 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:58:14,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:58:14,294 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 03:58:14,294 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:58:14,297 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 03:58:14,298 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:58:14,309 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:58:14,310 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:58:14,310 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:58:14,310 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:58:14,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:58:14,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:58:14,313 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:58:14,313 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:58:14,313 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:58:14,315 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:58:14,315 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:58:14,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:58:14,316 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:58:14,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:58:14,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:58:14,316 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:58:14,319 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:58:14,319 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:58:14,325 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 03:58:14,334 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 03:58:14,334 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 03:58:14,337 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 03:58:14,337 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 03:58:14,337 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 03:58:14,338 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~cleanupTimeShifts~0, ULTIMATE.start_cleanup_~i~0) = 1*~cleanupTimeShifts~0 - 1*ULTIMATE.start_cleanup_~i~0 Supporting invariants [] [2019-01-14 03:58:14,339 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 03:58:14,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:58:14,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:58:14,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:58:14,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:58:14,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:58:14,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:58:15,018 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-14 03:58:15,020 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6906 states. Second operand 5 states. [2019-01-14 03:58:15,506 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-14 03:58:16,447 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6906 states.. Second operand 5 states. Result 10379 states and 19557 transitions. Complement of second has 9 states. [2019-01-14 03:58:16,449 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-14 03:58:16,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 03:58:16,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13082 transitions. [2019-01-14 03:58:16,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13082 transitions. Stem has 33 letters. Loop has 22 letters. [2019-01-14 03:58:16,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:58:16,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13082 transitions. Stem has 55 letters. Loop has 22 letters. [2019-01-14 03:58:16,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:58:16,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13082 transitions. Stem has 33 letters. Loop has 44 letters. [2019-01-14 03:58:16,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:58:16,489 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10379 states and 19557 transitions. [2019-01-14 03:58:16,614 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 03:58:16,618 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10379 states to 0 states and 0 transitions. [2019-01-14 03:58:16,621 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 03:58:16,621 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 03:58:16,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 03:58:16,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:58:16,622 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 03:58:16,622 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 03:58:16,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 03:58:16,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 03:58:16,631 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2019-01-14 03:58:16,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:58:16,635 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-14 03:58:16,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 03:58:16,636 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-14 03:58:16,636 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 03:58:16,636 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 03:58:16,637 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 03:58:16,645 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 03:58:16,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 03:58:16,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:58:16,645 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 03:58:16,645 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 03:58:16,646 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 03:58:16,646 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 03:58:16,646 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 03:58:16,646 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 03:58:16,646 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 03:58:16,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 03:58:16 BoogieIcfgContainer [2019-01-14 03:58:16,659 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 03:58:16,660 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 03:58:16,660 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 03:58:16,660 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 03:58:16,662 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:57:56" (3/4) ... [2019-01-14 03:58:16,668 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 03:58:16,669 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 03:58:16,670 INFO L168 Benchmark]: Toolchain (without parser) took 38261.98 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 591.9 MB). Free memory was 947.2 MB in the beginning and 1.4 GB in the end (delta: -403.8 MB). Peak memory consumption was 188.1 MB. Max. memory is 11.5 GB. [2019-01-14 03:58:16,674 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 03:58:16,677 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1194.21 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.0 MB). Free memory was 947.2 MB in the beginning and 1.1 GB in the end (delta: -113.3 MB). Peak memory consumption was 51.3 MB. Max. memory is 11.5 GB. [2019-01-14 03:58:16,681 INFO L168 Benchmark]: Boogie Procedure Inliner took 367.99 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 983.0 MB in the end (delta: 77.5 MB). Peak memory consumption was 77.5 MB. Max. memory is 11.5 GB. [2019-01-14 03:58:16,685 INFO L168 Benchmark]: Boogie Preprocessor took 483.24 ms. Allocated memory is still 1.1 GB. Free memory was 983.0 MB in the beginning and 919.6 MB in the end (delta: 63.4 MB). Peak memory consumption was 63.4 MB. Max. memory is 11.5 GB. [2019-01-14 03:58:16,686 INFO L168 Benchmark]: RCFGBuilder took 15932.09 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 495.5 MB). Free memory was 912.6 MB in the beginning and 1.3 GB in the end (delta: -420.1 MB). Peak memory consumption was 448.3 MB. Max. memory is 11.5 GB. [2019-01-14 03:58:16,687 INFO L168 Benchmark]: BuchiAutomizer took 20270.12 ms. Allocated memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: -524.3 kB). Free memory was 1.3 GB in the beginning and 1.4 GB in the end (delta: -18.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 03:58:16,692 INFO L168 Benchmark]: Witness Printer took 8.87 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 03:58:16,700 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1194.21 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.0 MB). Free memory was 947.2 MB in the beginning and 1.1 GB in the end (delta: -113.3 MB). Peak memory consumption was 51.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 367.99 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 983.0 MB in the end (delta: 77.5 MB). Peak memory consumption was 77.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 483.24 ms. Allocated memory is still 1.1 GB. Free memory was 983.0 MB in the beginning and 919.6 MB in the end (delta: 63.4 MB). Peak memory consumption was 63.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 15932.09 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 495.5 MB). Free memory was 912.6 MB in the beginning and 1.3 GB in the end (delta: -420.1 MB). Peak memory consumption was 448.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 20270.12 ms. Allocated memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: -524.3 kB). Free memory was 1.3 GB in the beginning and 1.4 GB in the end (delta: -18.3 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 8.87 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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 20.2s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 17.5s. Construction of modules took 0.1s. Büchi inclusion checks took 1.9s. 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: 13048 SDtfs, 19490 SDslu, 6483 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: 16ms VariablesStem: 0 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 1 LassoNonterminationAnalysisTime: 12.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...