./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/product-lines/elevator_spec1_product32_false-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e5581ce0-1962-4a11-bdd7-4db75b02c29c/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e5581ce0-1962-4a11-bdd7-4db75b02c29c/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e5581ce0-1962-4a11-bdd7-4db75b02c29c/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e5581ce0-1962-4a11-bdd7-4db75b02c29c/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/product-lines/elevator_spec1_product32_false-unreach-call_true-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_e5581ce0-1962-4a11-bdd7-4db75b02c29c/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e5581ce0-1962-4a11-bdd7-4db75b02c29c/bin-2019/uautomizer --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 c19987793b6e68bdb17fd7f8908095882b728be3 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-22 22:04:31,807 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 22:04:31,808 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 22:04:31,816 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 22:04:31,816 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 22:04:31,817 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 22:04:31,817 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 22:04:31,819 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 22:04:31,820 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 22:04:31,820 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 22:04:31,821 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 22:04:31,821 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 22:04:31,822 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 22:04:31,823 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 22:04:31,824 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 22:04:31,824 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 22:04:31,825 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 22:04:31,826 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 22:04:31,827 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 22:04:31,829 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 22:04:31,829 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 22:04:31,830 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 22:04:31,832 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 22:04:31,832 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 22:04:31,832 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 22:04:31,833 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 22:04:31,834 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 22:04:31,834 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 22:04:31,835 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 22:04:31,836 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 22:04:31,836 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 22:04:31,836 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 22:04:31,837 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 22:04:31,837 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 22:04:31,837 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 22:04:31,838 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 22:04:31,838 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e5581ce0-1962-4a11-bdd7-4db75b02c29c/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-22 22:04:31,849 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 22:04:31,849 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 22:04:31,850 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 22:04:31,850 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 22:04:31,850 INFO L133 SettingsManager]: * Use SBE=true [2018-11-22 22:04:31,851 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-22 22:04:31,851 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-22 22:04:31,851 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-22 22:04:31,851 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-22 22:04:31,851 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-22 22:04:31,851 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-22 22:04:31,851 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 22:04:31,851 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 22:04:31,852 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-22 22:04:31,852 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 22:04:31,852 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 22:04:31,852 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 22:04:31,852 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-22 22:04:31,852 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-22 22:04:31,852 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-22 22:04:31,853 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 22:04:31,853 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 22:04:31,853 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-22 22:04:31,853 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 22:04:31,853 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-22 22:04:31,853 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 22:04:31,853 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 22:04:31,854 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-22 22:04:31,854 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 22:04:31,854 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-22 22:04:31,854 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-22 22:04:31,855 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-22 22:04:31,855 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_e5581ce0-1962-4a11-bdd7-4db75b02c29c/bin-2019/uautomizer 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 -> c19987793b6e68bdb17fd7f8908095882b728be3 [2018-11-22 22:04:31,879 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 22:04:31,888 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 22:04:31,891 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 22:04:31,892 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 22:04:31,892 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 22:04:31,893 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e5581ce0-1962-4a11-bdd7-4db75b02c29c/bin-2019/uautomizer/../../sv-benchmarks/c/product-lines/elevator_spec1_product32_false-unreach-call_true-termination.cil.c [2018-11-22 22:04:31,940 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e5581ce0-1962-4a11-bdd7-4db75b02c29c/bin-2019/uautomizer/data/52f2c956e/9ab9cdb369a84fc1af4d752caee17d0d/FLAGae864ac3a [2018-11-22 22:04:32,385 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 22:04:32,385 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e5581ce0-1962-4a11-bdd7-4db75b02c29c/sv-benchmarks/c/product-lines/elevator_spec1_product32_false-unreach-call_true-termination.cil.c [2018-11-22 22:04:32,399 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e5581ce0-1962-4a11-bdd7-4db75b02c29c/bin-2019/uautomizer/data/52f2c956e/9ab9cdb369a84fc1af4d752caee17d0d/FLAGae864ac3a [2018-11-22 22:04:32,700 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e5581ce0-1962-4a11-bdd7-4db75b02c29c/bin-2019/uautomizer/data/52f2c956e/9ab9cdb369a84fc1af4d752caee17d0d [2018-11-22 22:04:32,703 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 22:04:32,704 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 22:04:32,705 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 22:04:32,705 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 22:04:32,708 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 22:04:32,708 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:04:32" (1/1) ... [2018-11-22 22:04:32,710 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41fe7c31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:04:32, skipping insertion in model container [2018-11-22 22:04:32,711 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:04:32" (1/1) ... [2018-11-22 22:04:32,719 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 22:04:32,776 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 22:04:33,154 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:04:33,247 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 22:04:33,321 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:04:33,353 INFO L195 MainTranslator]: Completed translation [2018-11-22 22:04:33,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:04:33 WrapperNode [2018-11-22 22:04:33,353 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 22:04:33,354 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 22:04:33,354 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 22:04:33,354 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 22:04:33,359 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:04:33" (1/1) ... [2018-11-22 22:04:33,380 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:04:33" (1/1) ... [2018-11-22 22:04:33,562 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 22:04:33,563 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 22:04:33,563 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 22:04:33,563 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 22:04:33,570 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:04:33" (1/1) ... [2018-11-22 22:04:33,570 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:04:33" (1/1) ... [2018-11-22 22:04:33,598 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:04:33" (1/1) ... [2018-11-22 22:04:33,598 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:04:33" (1/1) ... [2018-11-22 22:04:33,672 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:04:33" (1/1) ... [2018-11-22 22:04:33,767 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:04:33" (1/1) ... [2018-11-22 22:04:33,789 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:04:33" (1/1) ... [2018-11-22 22:04:33,826 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 22:04:33,827 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 22:04:33,827 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 22:04:33,827 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 22:04:33,828 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:04:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5581ce0-1962-4a11-bdd7-4db75b02c29c/bin-2019/uautomizer/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 [2018-11-22 22:04:33,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-22 22:04:33,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-11-22 22:04:33,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 22:04:33,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 22:04:40,638 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 22:04:40,638 INFO L280 CfgBuilder]: Removed 1673 assue(true) statements. [2018-11-22 22:04:40,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:04:40 BoogieIcfgContainer [2018-11-22 22:04:40,639 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 22:04:40,639 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-22 22:04:40,640 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-22 22:04:40,642 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-22 22:04:40,642 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 22:04:40,643 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.11 10:04:32" (1/3) ... [2018-11-22 22:04:40,643 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6e92a98d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 10:04:40, skipping insertion in model container [2018-11-22 22:04:40,643 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 22:04:40,644 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:04:33" (2/3) ... [2018-11-22 22:04:40,644 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6e92a98d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 10:04:40, skipping insertion in model container [2018-11-22 22:04:40,644 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 22:04:40,644 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:04:40" (3/3) ... [2018-11-22 22:04:40,646 INFO L375 chiAutomizerObserver]: Analyzing ICFG elevator_spec1_product32_false-unreach-call_true-termination.cil.c [2018-11-22 22:04:40,684 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-22 22:04:40,684 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-22 22:04:40,684 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-22 22:04:40,684 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-22 22:04:40,685 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 22:04:40,685 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 22:04:40,685 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-22 22:04:40,685 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 22:04:40,685 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-22 22:04:40,748 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7122 states. [2018-11-22 22:04:40,837 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3521 [2018-11-22 22:04:40,837 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:04:40,837 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:04:40,849 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:04:40,849 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:04:40,850 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-22 22:04:40,850 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7122 states. [2018-11-22 22:04:40,890 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3521 [2018-11-22 22:04:40,890 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:04:40,890 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:04:40,894 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:04:40,894 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:04:40,898 INFO L794 eck$LassoCheckResult]: Stem: 2884#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call #t~string61.base, #t~string61.offset := #Ultimate.alloc(10);call #t~string63.base, #t~string63.offset := #Ultimate.alloc(4);call write~init~int(91, #t~string63.base, #t~string63.offset, 1);call write~init~int(95, #t~string63.base, 1 + #t~string63.offset, 1);call write~init~int(93, #t~string63.base, 2 + #t~string63.offset, 1);call write~init~int(0, #t~string63.base, 3 + #t~string63.offset, 1);call #t~string65.base, #t~string65.offset := #Ultimate.alloc(4);call write~init~int(91, #t~string65.base, #t~string65.offset, 1);call write~init~int(93, #t~string65.base, 1 + #t~string65.offset, 1);call write~init~int(32, #t~string65.base, 2 + #t~string65.offset, 1);call write~init~int(0, #t~string65.base, 3 + #t~string65.offset, 1);call #t~string67.base, #t~string67.offset := #Ultimate.alloc(5);call write~init~int(32, #t~string67.base, #t~string67.offset, 1);call write~init~int(97, #t~string67.base, 1 + #t~string67.offset, 1);call write~init~int(116, #t~string67.base, 2 + #t~string67.offset, 1);call write~init~int(32, #t~string67.base, 3 + #t~string67.offset, 1);call write~init~int(0, #t~string67.base, 4 + #t~string67.offset, 1);call #t~string69.base, #t~string69.offset := #Ultimate.alloc(3);call write~init~int(37, #t~string69.base, #t~string69.offset, 1);call write~init~int(105, #t~string69.base, 1 + #t~string69.offset, 1);call write~init~int(0, #t~string69.base, 2 + #t~string69.offset, 1);call #t~string71.base, #t~string71.offset := #Ultimate.alloc(10);call #t~string73.base, #t~string73.offset := #Ultimate.alloc(3);call write~init~int(117, #t~string73.base, #t~string73.offset, 1);call write~init~int(112, #t~string73.base, 1 + #t~string73.offset, 1);call write~init~int(0, #t~string73.base, 2 + #t~string73.offset, 1);call #t~string75.base, #t~string75.offset := #Ultimate.alloc(5);call write~init~int(100, #t~string75.base, #t~string75.offset, 1);call write~init~int(111, #t~string75.base, 1 + #t~string75.offset, 1);call write~init~int(119, #t~string75.base, 2 + #t~string75.offset, 1);call write~init~int(110, #t~string75.base, 3 + #t~string75.offset, 1);call write~init~int(0, #t~string75.base, 4 + #t~string75.offset, 1);call #t~string77.base, #t~string77.offset := #Ultimate.alloc(7);call write~init~int(32, #t~string77.base, #t~string77.offset, 1);call write~init~int(73, #t~string77.base, 1 + #t~string77.offset, 1);call write~init~int(76, #t~string77.base, 2 + #t~string77.offset, 1);call write~init~int(95, #t~string77.base, 3 + #t~string77.offset, 1);call write~init~int(112, #t~string77.base, 4 + #t~string77.offset, 1);call write~init~int(58, #t~string77.base, 5 + #t~string77.offset, 1);call write~init~int(0, #t~string77.base, 6 + #t~string77.offset, 1);call #t~string79.base, #t~string79.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string79.base, #t~string79.offset, 1);call write~init~int(37, #t~string79.base, 1 + #t~string79.offset, 1);call write~init~int(105, #t~string79.base, 2 + #t~string79.offset, 1);call write~init~int(0, #t~string79.base, 3 + #t~string79.offset, 1);call #t~string81.base, #t~string81.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string81.base, #t~string81.offset, 1);call write~init~int(37, #t~string81.base, 1 + #t~string81.offset, 1);call write~init~int(105, #t~string81.base, 2 + #t~string81.offset, 1);call write~init~int(0, #t~string81.base, 3 + #t~string81.offset, 1);call #t~string83.base, #t~string83.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string83.base, #t~string83.offset, 1);call write~init~int(37, #t~string83.base, 1 + #t~string83.offset, 1);call write~init~int(105, #t~string83.base, 2 + #t~string83.offset, 1);call write~init~int(0, #t~string83.base, 3 + #t~string83.offset, 1);call #t~string85.base, #t~string85.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string85.base, #t~string85.offset, 1);call write~init~int(37, #t~string85.base, 1 + #t~string85.offset, 1);call write~init~int(105, #t~string85.base, 2 + #t~string85.offset, 1);call write~init~int(0, #t~string85.base, 3 + #t~string85.offset, 1);call #t~string87.base, #t~string87.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string87.base, #t~string87.offset, 1);call write~init~int(37, #t~string87.base, 1 + #t~string87.offset, 1);call write~init~int(105, #t~string87.base, 2 + #t~string87.offset, 1);call write~init~int(0, #t~string87.base, 3 + #t~string87.offset, 1);call #t~string89.base, #t~string89.offset := #Ultimate.alloc(6);call write~init~int(32, #t~string89.base, #t~string89.offset, 1);call write~init~int(70, #t~string89.base, 1 + #t~string89.offset, 1);call write~init~int(95, #t~string89.base, 2 + #t~string89.offset, 1);call write~init~int(112, #t~string89.base, 3 + #t~string89.offset, 1);call write~init~int(58, #t~string89.base, 4 + #t~string89.offset, 1);call write~init~int(0, #t~string89.base, 5 + #t~string89.offset, 1);call #t~string92.base, #t~string92.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string92.base, #t~string92.offset, 1);call write~init~int(37, #t~string92.base, 1 + #t~string92.offset, 1);call write~init~int(105, #t~string92.base, 2 + #t~string92.offset, 1);call write~init~int(0, #t~string92.base, 3 + #t~string92.offset, 1);call #t~string95.base, #t~string95.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string95.base, #t~string95.offset, 1);call write~init~int(37, #t~string95.base, 1 + #t~string95.offset, 1);call write~init~int(105, #t~string95.base, 2 + #t~string95.offset, 1);call write~init~int(0, #t~string95.base, 3 + #t~string95.offset, 1);call #t~string98.base, #t~string98.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string98.base, #t~string98.offset, 1);call write~init~int(37, #t~string98.base, 1 + #t~string98.offset, 1);call write~init~int(105, #t~string98.base, 2 + #t~string98.offset, 1);call write~init~int(0, #t~string98.base, 3 + #t~string98.offset, 1);call #t~string101.base, #t~string101.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string101.base, #t~string101.offset, 1);call write~init~int(37, #t~string101.base, 1 + #t~string101.offset, 1);call write~init~int(105, #t~string101.base, 2 + #t~string101.offset, 1);call write~init~int(0, #t~string101.base, 3 + #t~string101.offset, 1);call #t~string104.base, #t~string104.offset := #Ultimate.alloc(4);call write~init~int(32, #t~string104.base, #t~string104.offset, 1);call write~init~int(37, #t~string104.base, 1 + #t~string104.offset, 1);call write~init~int(105, #t~string104.base, 2 + #t~string104.offset, 1);call write~init~int(0, #t~string104.base, 3 + #t~string104.offset, 1);call #t~string106.base, #t~string106.offset := #Ultimate.alloc(2);call write~init~int(10, #t~string106.base, #t~string106.offset, 1);call write~init~int(0, #t~string106.base, 1 + #t~string106.offset, 1);call #t~string109.base, #t~string109.offset := #Ultimate.alloc(9);call #t~string151.base, #t~string151.offset := #Ultimate.alloc(30);call #t~string152.base, #t~string152.offset := #Ultimate.alloc(9);call #t~string153.base, #t~string153.offset := #Ultimate.alloc(21);call #t~string154.base, #t~string154.offset := #Ultimate.alloc(30);call #t~string155.base, #t~string155.offset := #Ultimate.alloc(9);call #t~string156.base, #t~string156.offset := #Ultimate.alloc(21);call #t~string160.base, #t~string160.offset := #Ultimate.alloc(30);call #t~string161.base, #t~string161.offset := #Ultimate.alloc(9);call #t~string162.base, #t~string162.offset := #Ultimate.alloc(25);call #t~string163.base, #t~string163.offset := #Ultimate.alloc(30);call #t~string164.base, #t~string164.offset := #Ultimate.alloc(9);call #t~string165.base, #t~string165.offset := #Ultimate.alloc(25);~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;~cleanupTimeShifts~0 := 12;~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;~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;~head~0.base, ~head~0.offset := 0, 0; 6785#L-1true havoc main_#res;havoc main_#t~ret125, main_~retValue_acc~23, main_~tmp~25;havoc main_~retValue_acc~23;havoc main_~tmp~25; 3042#L2241true havoc valid_product_#res;havoc valid_product_~retValue_acc~25;havoc valid_product_~retValue_acc~25;valid_product_~retValue_acc~25 := 1;valid_product_#res := valid_product_~retValue_acc~25; 5381#L2249true main_#t~ret125 := valid_product_#res;main_~tmp~25 := main_#t~ret125;havoc main_#t~ret125; 3567#L2205true assume 0 != main_~tmp~25; 2258#L2175true ~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; 4577#L2268true havoc bigMacCall_#t~ret118, bigMacCall_~tmp~22;havoc bigMacCall_~tmp~22;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~1;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~1; 3920#L85true assume 0 == getOrigin_~person;getOrigin_~retValue_acc~1 := 4;getOrigin_#res := getOrigin_~retValue_acc~1; 2892#L110true bigMacCall_#t~ret118 := getOrigin_#res;bigMacCall_~tmp~22 := bigMacCall_#t~ret118;havoc bigMacCall_#t~ret118;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~22;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 5047#L3158true assume 0 == initPersonOnFloor_~floor; 4989#L3159true assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 4214#L3266-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; 5112#L2275true assume 0 == __utac_acc__Specification1_spec__2_~floor;~landingButtons_spc1_0~0 := 1; 6902#L2287-2true assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 5762#L2962-2true havoc angelinaCall_#t~ret115, angelinaCall_~tmp~19;havoc angelinaCall_~tmp~19;getOrigin_#in~person := 2;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~1;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~1; 3900#L85-1true assume 0 == getOrigin_~person;getOrigin_~retValue_acc~1 := 4;getOrigin_#res := getOrigin_~retValue_acc~1; 2889#L110-1true angelinaCall_#t~ret115 := getOrigin_#res;angelinaCall_~tmp~19 := angelinaCall_#t~ret115;havoc angelinaCall_#t~ret115;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 2, angelinaCall_~tmp~19;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 5045#L3158-1true assume 0 == initPersonOnFloor_~floor; 4995#L3159-2true assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 4212#L3266-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; 5117#L2275-2true assume 0 == __utac_acc__Specification1_spec__2_~floor;~landingButtons_spc1_0~0 := 1; 6906#L2287-5true assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 5751#L2962-5true havoc cleanup_#t~ret119, cleanup_#t~ret120, cleanup_~i~1, cleanup_~tmp~23, cleanup_~tmp___0~9, cleanup_~__cil_tmp4~1;havoc cleanup_~i~1;havoc cleanup_~tmp~23;havoc cleanup_~tmp___0~9;havoc cleanup_~__cil_tmp4~1;havoc timeShift_#t~ret60, timeShift_~tmp~14;havoc timeShift_~tmp~14;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~5;havoc areDoorsOpen_~retValue_acc~5;areDoorsOpen_~retValue_acc~5 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~5; 3998#L457true timeShift_#t~ret60 := areDoorsOpen_#res;timeShift_~tmp~14 := timeShift_#t~ret60;havoc timeShift_#t~ret60; 2228#L1468true assume 0 != timeShift_~tmp~14; 2283#L1469true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 2297#L1113-11true havoc __utac_acc__Specification1_spec__3_#t~ret127, __utac_acc__Specification1_spec__3_#t~ret128, __utac_acc__Specification1_spec__3_#t~ret129, __utac_acc__Specification1_spec__3_#t~ret130, __utac_acc__Specification1_spec__3_#t~ret131, __utac_acc__Specification1_spec__3_#t~ret132, __utac_acc__Specification1_spec__3_~floor~0, __utac_acc__Specification1_spec__3_~tmp~26, __utac_acc__Specification1_spec__3_~tmp___0~11, __utac_acc__Specification1_spec__3_~tmp___1~6, __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~26;havoc __utac_acc__Specification1_spec__3_~tmp___0~11;havoc __utac_acc__Specification1_spec__3_~tmp___1~6;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~4;havoc getCurrentFloorID_~retValue_acc~4;getCurrentFloorID_~retValue_acc~4 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~4; 4281#L448-10true __utac_acc__Specification1_spec__3_#t~ret127 := getCurrentFloorID_#res;__utac_acc__Specification1_spec__3_~tmp~26 := __utac_acc__Specification1_spec__3_#t~ret127;havoc __utac_acc__Specification1_spec__3_#t~ret127;__utac_acc__Specification1_spec__3_~floor~0 := __utac_acc__Specification1_spec__3_~tmp~26; 6006#L2313true assume 0 == __utac_acc__Specification1_spec__3_~floor~0; 5983#L2314true assume 0 != ~landingButtons_spc1_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~5;havoc areDoorsOpen_~retValue_acc~5;areDoorsOpen_~retValue_acc~5 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~5; 3999#L457-1true __utac_acc__Specification1_spec__3_#t~ret128 := areDoorsOpen_#res;__utac_acc__Specification1_spec__3_~tmp___4~3 := __utac_acc__Specification1_spec__3_#t~ret128;havoc __utac_acc__Specification1_spec__3_#t~ret128; 5959#L2318true assume 0 != __utac_acc__Specification1_spec__3_~tmp___4~3;~landingButtons_spc1_0~0 := 0; 947#L2373true cleanup_~i~1 := 0; 435#L2007-2true [2018-11-22 22:04:40,899 INFO L796 eck$LassoCheckResult]: Loop: 435#L2007-2true assume !false; 52#L2008true cleanup_~__cil_tmp4~1 := ~cleanupTimeShifts~0 - 1; 1553#L2011true assume cleanup_~i~1 < cleanup_~__cil_tmp4~1;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~3;havoc isBlocked_~retValue_acc~3;isBlocked_~retValue_acc~3 := ~blocked~0;isBlocked_#res := isBlocked_~retValue_acc~3; 4155#L275true cleanup_#t~ret119 := isBlocked_#res;cleanup_~tmp___0~9 := cleanup_#t~ret119;havoc cleanup_#t~ret119; 1450#L2015true assume 1 != cleanup_~tmp___0~9; 1420#L2015-1true havoc isIdle_#res;havoc isIdle_#t~ret8, isIdle_~retValue_acc~10, isIdle_~tmp~4;havoc isIdle_~retValue_acc~10;havoc isIdle_~tmp~4;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret3, anyStopRequested_#t~ret4, anyStopRequested_#t~ret5, anyStopRequested_#t~ret6, anyStopRequested_#t~ret7, anyStopRequested_~retValue_acc~9, anyStopRequested_~tmp~3, anyStopRequested_~tmp___0~0, anyStopRequested_~tmp___1~0, anyStopRequested_~tmp___2~0, anyStopRequested_~tmp___3~0;havoc anyStopRequested_~retValue_acc~9;havoc anyStopRequested_~tmp~3;havoc anyStopRequested_~tmp___0~0;havoc anyStopRequested_~tmp___1~0;havoc anyStopRequested_~tmp___2~0;havoc anyStopRequested_~tmp___3~0;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~29;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~29; 478#L2883-130true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~29 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~29; 4321#L2910-130true anyStopRequested_#t~ret3 := isFloorCalling_#res;anyStopRequested_~tmp___3~0 := anyStopRequested_#t~ret3;havoc anyStopRequested_#t~ret3; 5961#L556true assume 0 != anyStopRequested_~tmp___3~0;anyStopRequested_~retValue_acc~9 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~9; 3437#L620true isIdle_#t~ret8 := anyStopRequested_#res;isIdle_~tmp~4 := isIdle_#t~ret8;havoc isIdle_#t~ret8;isIdle_~retValue_acc~10 := (if 0 == isIdle_~tmp~4 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~10; 4003#L633true cleanup_#t~ret120 := isIdle_#res;cleanup_~tmp~23 := cleanup_#t~ret120;havoc cleanup_#t~ret120; 3530#L2027true assume !(0 != cleanup_~tmp~23);havoc timeShift_#t~ret60, timeShift_~tmp~14;havoc timeShift_~tmp~14;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~5;havoc areDoorsOpen_~retValue_acc~5;areDoorsOpen_~retValue_acc~5 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~5; 3991#L457-6true timeShift_#t~ret60 := areDoorsOpen_#res;timeShift_~tmp~14 := timeShift_#t~ret60;havoc timeShift_#t~ret60; 2230#L1468-1true assume 0 != timeShift_~tmp~14; 2288#L1469-2true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 2292#L1113-23true havoc __utac_acc__Specification1_spec__3_#t~ret127, __utac_acc__Specification1_spec__3_#t~ret128, __utac_acc__Specification1_spec__3_#t~ret129, __utac_acc__Specification1_spec__3_#t~ret130, __utac_acc__Specification1_spec__3_#t~ret131, __utac_acc__Specification1_spec__3_#t~ret132, __utac_acc__Specification1_spec__3_~floor~0, __utac_acc__Specification1_spec__3_~tmp~26, __utac_acc__Specification1_spec__3_~tmp___0~11, __utac_acc__Specification1_spec__3_~tmp___1~6, __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~26;havoc __utac_acc__Specification1_spec__3_~tmp___0~11;havoc __utac_acc__Specification1_spec__3_~tmp___1~6;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~4;havoc getCurrentFloorID_~retValue_acc~4;getCurrentFloorID_~retValue_acc~4 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~4; 4260#L448-21true __utac_acc__Specification1_spec__3_#t~ret127 := getCurrentFloorID_#res;__utac_acc__Specification1_spec__3_~tmp~26 := __utac_acc__Specification1_spec__3_#t~ret127;havoc __utac_acc__Specification1_spec__3_#t~ret127;__utac_acc__Specification1_spec__3_~floor~0 := __utac_acc__Specification1_spec__3_~tmp~26; 6008#L2313-1true assume 0 == __utac_acc__Specification1_spec__3_~floor~0; 6046#L2314-1true assume 0 != ~landingButtons_spc1_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~5;havoc areDoorsOpen_~retValue_acc~5;areDoorsOpen_~retValue_acc~5 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~5; 3992#L457-7true __utac_acc__Specification1_spec__3_#t~ret128 := areDoorsOpen_#res;__utac_acc__Specification1_spec__3_~tmp___4~3 := __utac_acc__Specification1_spec__3_#t~ret128;havoc __utac_acc__Specification1_spec__3_#t~ret128; 5960#L2318-2true assume 0 != __utac_acc__Specification1_spec__3_~tmp___4~3;~landingButtons_spc1_0~0 := 0; 917#L2373-1true cleanup_~i~1 := 1 + cleanup_~i~1; 435#L2007-2true [2018-11-22 22:04:40,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:04:40,906 INFO L82 PathProgramCache]: Analyzing trace with hash 880410858, now seen corresponding path program 1 times [2018-11-22 22:04:40,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:04:40,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:04:40,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:04:40,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:04:40,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:04:41,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:04:41,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:04:41,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:04:41,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 22:04:41,115 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 22:04:41,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:04:41,116 INFO L82 PathProgramCache]: Analyzing trace with hash 240294125, now seen corresponding path program 1 times [2018-11-22 22:04:41,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:04:41,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:04:41,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:04:41,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:04:41,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:04:41,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:04:41,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:04:41,318 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 84 [2018-11-22 22:04:41,487 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2018-11-22 22:04:41,494 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:04:41,495 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:04:41,495 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:04:41,496 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:04:41,496 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-22 22:04:41,496 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:04:41,496 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:04:41,496 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:04:41,496 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec1_product32_false-unreach-call_true-termination.cil.c_Iteration1_Loop [2018-11-22 22:04:41,496 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:04:41,497 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:04:41,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:04:41,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:04:41,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:04:41,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:04:41,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:04:41,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:04:41,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:04:41,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:04:41,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:04:41,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:04:41,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:04:41,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:04:41,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:04:41,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:04:41,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:04:41,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:04:41,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:04:41,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:04:41,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:04:41,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:04:41,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:04:41,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:04:41,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:04:41,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:04:41,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:04:41,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:04:41,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:04:41,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:04:41,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:04:41,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:04:41,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:04:41,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:04:41,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:04:41,840 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:04:41,840 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5581ce0-1962-4a11-bdd7-4db75b02c29c/bin-2019/uautomizer/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 [2018-11-22 22:04:41,854 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:04:41,854 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 22:04:41,859 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 22:04:41,859 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification1_spec__3_#t~ret132=0} Honda state: {ULTIMATE.start___utac_acc__Specification1_spec__3_#t~ret132=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5581ce0-1962-4a11-bdd7-4db75b02c29c/bin-2019/uautomizer/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 [2018-11-22 22:04:41,882 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:04:41,882 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 22:04:41,884 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 22:04:41,884 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_~tmp___1~0=0} Honda state: {ULTIMATE.start_anyStopRequested_~tmp___1~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5581ce0-1962-4a11-bdd7-4db75b02c29c/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:04:41,900 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:04:41,900 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 22:04:41,902 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 22:04:41,902 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification1_spec__3_#t~ret131=0} Honda state: {ULTIMATE.start___utac_acc__Specification1_spec__3_#t~ret131=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5581ce0-1962-4a11-bdd7-4db75b02c29c/bin-2019/uautomizer/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 [2018-11-22 22:04:41,918 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:04:41,918 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 22:04:41,935 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 22:04:41,936 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~weight~0=1, ~maximumWeight~0=0} Honda state: {~weight~0=1, ~maximumWeight~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5581ce0-1962-4a11-bdd7-4db75b02c29c/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:04:41,942 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:04:41,942 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5581ce0-1962-4a11-bdd7-4db75b02c29c/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:04:41,978 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-22 22:04:41,978 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 22:04:42,407 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-22 22:04:42,408 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:04:42,408 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:04:42,409 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:04:42,409 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:04:42,409 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 22:04:42,409 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:04:42,409 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:04:42,409 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:04:42,409 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec1_product32_false-unreach-call_true-termination.cil.c_Iteration1_Loop [2018-11-22 22:04:42,409 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:04:42,410 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:04:42,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:04:42,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:04:42,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:04:42,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:04:42,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:04:42,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:04:42,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:04:42,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:04:42,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:04:42,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:04:42,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:04:42,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:04:42,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:04:42,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:04:42,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:04:42,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:04:42,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:04:42,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:04:42,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:04:42,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:04:42,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:04:42,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:04:42,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:04:42,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:04:42,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:04:42,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:04:42,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:04:42,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:04:42,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:04:42,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:04:42,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:04:42,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:04:42,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:04:42,835 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:04:42,839 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 22:04:42,840 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 [2018-11-22 22:04:42,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:04:42,841 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:04:42,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:04:42,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:04:42,842 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:04:42,843 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:04:42,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:04:42,845 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:04:42,846 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 [2018-11-22 22:04:42,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:04:42,847 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:04:42,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:04:42,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:04:42,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:04:42,848 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:04:42,848 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:04:42,848 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:04:42,849 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 [2018-11-22 22:04:42,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:04:42,849 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:04:42,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:04:42,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:04:42,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:04:42,850 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:04:42,850 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:04:42,851 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:04:42,851 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 [2018-11-22 22:04:42,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:04:42,851 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:04:42,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:04:42,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:04:42,852 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:04:42,852 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:04:42,852 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:04:42,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:04:42,856 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 [2018-11-22 22:04:42,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:04:42,857 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:04:42,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:04:42,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:04:42,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:04:42,858 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:04:42,858 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:04:42,858 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:04:42,859 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 [2018-11-22 22:04:42,859 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:04:42,859 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:04:42,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:04:42,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:04:42,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:04:42,860 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:04:42,860 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:04:42,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:04:42,865 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 [2018-11-22 22:04:42,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:04:42,865 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:04:42,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:04:42,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:04:42,865 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:04:42,866 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:04:42,866 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:04:42,867 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:04:42,867 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 [2018-11-22 22:04:42,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:04:42,867 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:04:42,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:04:42,868 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 22:04:42,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:04:42,869 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 22:04:42,869 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:04:42,876 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:04:42,876 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 [2018-11-22 22:04:42,876 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:04:42,876 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:04:42,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:04:42,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:04:42,877 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:04:42,878 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:04:42,878 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:04:42,879 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:04:42,880 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 [2018-11-22 22:04:42,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:04:42,880 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:04:42,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:04:42,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:04:42,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:04:42,881 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:04:42,881 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:04:42,882 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:04:42,882 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 [2018-11-22 22:04:42,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:04:42,883 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:04:42,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:04:42,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:04:42,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:04:42,883 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:04:42,884 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:04:42,888 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 22:04:42,893 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-22 22:04:42,894 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-22 22:04:42,895 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 22:04:42,895 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-22 22:04:42,896 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 22:04:42,897 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~cleanupTimeShifts~0, ULTIMATE.start_cleanup_~i~1) = 1*~cleanupTimeShifts~0 - 1*ULTIMATE.start_cleanup_~i~1 Supporting invariants [] [2018-11-22 22:04:42,898 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-22 22:04:42,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:04:43,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:04:43,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:04:43,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:04:43,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:04:43,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:04:43,067 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 [2018-11-22 22:04:43,068 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7122 states. Second operand 5 states. [2018-11-22 22:04:43,449 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7122 states.. Second operand 5 states. Result 10703 states and 20133 transitions. Complement of second has 9 states. [2018-11-22 22:04:43,450 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 [2018-11-22 22:04:43,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-22 22:04:43,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13466 transitions. [2018-11-22 22:04:43,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13466 transitions. Stem has 33 letters. Loop has 22 letters. [2018-11-22 22:04:43,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:04:43,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13466 transitions. Stem has 55 letters. Loop has 22 letters. [2018-11-22 22:04:43,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:04:43,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13466 transitions. Stem has 33 letters. Loop has 44 letters. [2018-11-22 22:04:43,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:04:43,465 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10703 states and 20133 transitions. [2018-11-22 22:04:43,518 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-22 22:04:43,520 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10703 states to 0 states and 0 transitions. [2018-11-22 22:04:43,521 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-22 22:04:43,521 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-22 22:04:43,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-22 22:04:43,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 22:04:43,522 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 22:04:43,522 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 22:04:43,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 22:04:43,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:04:43,525 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2018-11-22 22:04:43,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:04:43,527 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-22 22:04:43,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-22 22:04:43,528 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-22 22:04:43,528 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-22 22:04:43,528 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-22 22:04:43,528 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-22 22:04:43,528 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-22 22:04:43,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-22 22:04:43,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 22:04:43,528 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 22:04:43,528 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 22:04:43,529 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 22:04:43,529 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-22 22:04:43,529 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-22 22:04:43,529 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-22 22:04:43,529 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-22 22:04:43,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.11 10:04:43 BoogieIcfgContainer [2018-11-22 22:04:43,533 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-22 22:04:43,534 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 22:04:43,534 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 22:04:43,534 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 22:04:43,534 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:04:40" (3/4) ... [2018-11-22 22:04:43,537 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-22 22:04:43,537 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 22:04:43,538 INFO L168 Benchmark]: Toolchain (without parser) took 10834.45 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 621.8 MB). Free memory was 956.4 MB in the beginning and 1.2 GB in the end (delta: -211.9 MB). Peak memory consumption was 409.9 MB. Max. memory is 11.5 GB. [2018-11-22 22:04:43,538 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:04:43,539 INFO L168 Benchmark]: CACSL2BoogieTranslator took 648.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 178.3 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -189.9 MB). Peak memory consumption was 63.4 MB. Max. memory is 11.5 GB. [2018-11-22 22:04:43,539 INFO L168 Benchmark]: Boogie Procedure Inliner took 208.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 78.9 MB). Peak memory consumption was 78.9 MB. Max. memory is 11.5 GB. [2018-11-22 22:04:43,540 INFO L168 Benchmark]: Boogie Preprocessor took 263.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 992.8 MB in the end (delta: 74.7 MB). Peak memory consumption was 74.7 MB. Max. memory is 11.5 GB. [2018-11-22 22:04:43,540 INFO L168 Benchmark]: RCFGBuilder took 6812.39 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 445.6 MB). Free memory was 992.8 MB in the beginning and 1.2 GB in the end (delta: -242.1 MB). Peak memory consumption was 423.9 MB. Max. memory is 11.5 GB. [2018-11-22 22:04:43,541 INFO L168 Benchmark]: BuchiAutomizer took 2894.09 ms. Allocated memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: -2.1 MB). Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.5 MB). Peak memory consumption was 64.4 MB. Max. memory is 11.5 GB. [2018-11-22 22:04:43,541 INFO L168 Benchmark]: Witness Printer took 3.17 ms. Allocated memory is still 1.7 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:04:43,544 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 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 648.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 178.3 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -189.9 MB). Peak memory consumption was 63.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 208.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 78.9 MB). Peak memory consumption was 78.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 263.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 992.8 MB in the end (delta: 74.7 MB). Peak memory consumption was 74.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 6812.39 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 445.6 MB). Free memory was 992.8 MB in the beginning and 1.2 GB in the end (delta: -242.1 MB). Peak memory consumption was 423.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2894.09 ms. Allocated memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: -2.1 MB). Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.5 MB). Peak memory consumption was 64.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.17 ms. Allocated memory is still 1.7 GB. Free memory is still 1.2 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 2.8s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 2.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. 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.0s 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: 13432 SDtfs, 20066 SDslu, 6675 SDs, 0 SdLazy, 9 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s 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: 8ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...