./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/product-lines/elevator_spec2_product32_false-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/product-lines/elevator_spec2_product32_false-unreach-call_true-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1ce3ea2e188fd0be186a6acc6b1f5b17e2df2a3a ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 23:21:04,727 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:21:04,730 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:21:04,751 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:21:04,751 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:21:04,752 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:21:04,754 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:21:04,756 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:21:04,757 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:21:04,759 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:21:04,760 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:21:04,760 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:21:04,761 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:21:04,762 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:21:04,764 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:21:04,765 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:21:04,766 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:21:04,768 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:21:04,770 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:21:04,772 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:21:04,773 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:21:04,775 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:21:04,779 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:21:04,780 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:21:04,781 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:21:04,782 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:21:04,783 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:21:04,783 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:21:04,787 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:21:04,790 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:21:04,792 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:21:04,794 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:21:04,796 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:21:04,796 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:21:04,797 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:21:04,799 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:21:04,801 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-01 23:21:04,820 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:21:04,820 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:21:04,822 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:21:04,822 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:21:04,822 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:21:04,823 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:21:04,823 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:21:04,823 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:21:04,823 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:21:04,823 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:21:04,824 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:21:04,824 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:21:04,824 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:21:04,824 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:21:04,824 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:21:04,824 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:21:04,826 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:21:04,826 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:21:04,826 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:21:04,826 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:21:04,827 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:21:04,827 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:21:04,827 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:21:04,827 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:21:04,827 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:21:04,828 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:21:04,828 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:21:04,828 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:21:04,828 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:21:04,828 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:21:04,828 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:21:04,831 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:21:04,831 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1ce3ea2e188fd0be186a6acc6b1f5b17e2df2a3a [2019-01-01 23:21:04,895 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:21:04,913 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:21:04,919 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:21:04,921 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:21:04,921 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:21:04,922 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/elevator_spec2_product32_false-unreach-call_true-termination.cil.c [2019-01-01 23:21:05,008 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32338c5a3/1513dd521c1b4c61a3e122e3fcd323f9/FLAG52eef8ee3 [2019-01-01 23:21:05,696 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:21:05,697 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/elevator_spec2_product32_false-unreach-call_true-termination.cil.c [2019-01-01 23:21:05,726 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32338c5a3/1513dd521c1b4c61a3e122e3fcd323f9/FLAG52eef8ee3 [2019-01-01 23:21:05,870 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32338c5a3/1513dd521c1b4c61a3e122e3fcd323f9 [2019-01-01 23:21:05,875 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:21:05,877 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:21:05,878 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:21:05,878 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:21:05,882 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:21:05,884 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:21:05" (1/1) ... [2019-01-01 23:21:05,887 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bf58ee4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:21:05, skipping insertion in model container [2019-01-01 23:21:05,887 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:21:05" (1/1) ... [2019-01-01 23:21:05,896 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:21:05,991 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:21:06,747 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:21:06,868 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:21:07,078 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:21:07,158 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:21:07,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:21:07 WrapperNode [2019-01-01 23:21:07,159 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:21:07,160 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:21:07,160 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:21:07,160 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:21:07,168 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:21:07" (1/1) ... [2019-01-01 23:21:07,209 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:21:07" (1/1) ... [2019-01-01 23:21:07,568 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:21:07,571 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:21:07,571 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:21:07,571 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:21:07,584 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:21:07" (1/1) ... [2019-01-01 23:21:07,584 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:21:07" (1/1) ... [2019-01-01 23:21:07,652 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:21:07" (1/1) ... [2019-01-01 23:21:07,652 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:21:07" (1/1) ... [2019-01-01 23:21:07,845 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:21:07" (1/1) ... [2019-01-01 23:21:08,075 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:21:07" (1/1) ... [2019-01-01 23:21:08,129 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:21:07" (1/1) ... [2019-01-01 23:21:08,208 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:21:08,209 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:21:08,210 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:21:08,211 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:21:08,212 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:21:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:21:08,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 23:21:08,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-01 23:21:08,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:21:08,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:21:25,267 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:21:25,268 INFO L280 CfgBuilder]: Removed 1709 assue(true) statements. [2019-01-01 23:21:25,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:21:25 BoogieIcfgContainer [2019-01-01 23:21:25,268 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:21:25,269 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:21:25,269 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:21:25,273 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:21:25,274 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:21:25,274 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:21:05" (1/3) ... [2019-01-01 23:21:25,275 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6be3c0c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:21:25, skipping insertion in model container [2019-01-01 23:21:25,275 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:21:25,275 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:21:07" (2/3) ... [2019-01-01 23:21:25,276 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6be3c0c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:21:25, skipping insertion in model container [2019-01-01 23:21:25,276 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:21:25,276 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:21:25" (3/3) ... [2019-01-01 23:21:25,278 INFO L375 chiAutomizerObserver]: Analyzing ICFG elevator_spec2_product32_false-unreach-call_true-termination.cil.c [2019-01-01 23:21:25,342 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:21:25,343 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:21:25,343 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:21:25,343 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:21:25,343 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:21:25,343 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:21:25,343 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:21:25,344 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:21:25,344 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:21:25,475 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7183 states. [2019-01-01 23:21:25,678 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3581 [2019-01-01 23:21:25,678 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:21:25,679 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:21:25,701 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:21:25,702 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:21:25,702 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:21:25,702 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7183 states. [2019-01-01 23:21:25,793 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3581 [2019-01-01 23:21:25,793 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:21:25,793 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:21:25,801 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:21:25,803 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:21:25,814 INFO L794 eck$LassoCheckResult]: Stem: 1624#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~weight~0 := 0;~maximumWeight~0 := 100;~executiveFloor~0 := 4;~blocked~0 := 0;~floorButtons_spc2_0~0 := 0;~floorButtons_spc2_1~0 := 0;~floorButtons_spc2_2~0 := 0;~floorButtons_spc2_3~0 := 0;~floorButtons_spc2_4~0 := 0;~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;call #t~string24.base, #t~string24.offset := #Ultimate.allocOnStack(30);call #t~string25.base, #t~string25.offset := #Ultimate.allocOnStack(9);call #t~string26.base, #t~string26.offset := #Ultimate.allocOnStack(21);call #t~string27.base, #t~string27.offset := #Ultimate.allocOnStack(30);call #t~string28.base, #t~string28.offset := #Ultimate.allocOnStack(9);call #t~string29.base, #t~string29.offset := #Ultimate.allocOnStack(21);call #t~string33.base, #t~string33.offset := #Ultimate.allocOnStack(30);call #t~string34.base, #t~string34.offset := #Ultimate.allocOnStack(9);call #t~string35.base, #t~string35.offset := #Ultimate.allocOnStack(25);call #t~string36.base, #t~string36.offset := #Ultimate.allocOnStack(30);call #t~string37.base, #t~string37.offset := #Ultimate.allocOnStack(9);call #t~string38.base, #t~string38.offset := #Ultimate.allocOnStack(25);~cleanupTimeShifts~0 := 12;~currentHeading~0 := 1;~currentFloorID~0 := 0;~persons_0~0 := 0;~persons_1~0 := 0;~persons_2~0 := 0;~persons_3~0 := 0;~persons_4~0 := 0;~persons_5~0 := 0;~doorState~0 := 1;~floorButtons_0~0 := 0;~floorButtons_1~0 := 0;~floorButtons_2~0 := 0;~floorButtons_3~0 := 0;~floorButtons_4~0 := 0;call #t~string123.base, #t~string123.offset := #Ultimate.allocOnStack(10);call #t~string125.base, #t~string125.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string125.base, #t~string125.offset, 1);call write~init~int(95, #t~string125.base, 1 + #t~string125.offset, 1);call write~init~int(93, #t~string125.base, 2 + #t~string125.offset, 1);call write~init~int(0, #t~string125.base, 3 + #t~string125.offset, 1);call #t~string127.base, #t~string127.offset := #Ultimate.allocOnStack(4);call write~init~int(91, #t~string127.base, #t~string127.offset, 1);call write~init~int(93, #t~string127.base, 1 + #t~string127.offset, 1);call write~init~int(32, #t~string127.base, 2 + #t~string127.offset, 1);call write~init~int(0, #t~string127.base, 3 + #t~string127.offset, 1);call #t~string129.base, #t~string129.offset := #Ultimate.allocOnStack(5);call write~init~int(32, #t~string129.base, #t~string129.offset, 1);call write~init~int(97, #t~string129.base, 1 + #t~string129.offset, 1);call write~init~int(116, #t~string129.base, 2 + #t~string129.offset, 1);call write~init~int(32, #t~string129.base, 3 + #t~string129.offset, 1);call write~init~int(0, #t~string129.base, 4 + #t~string129.offset, 1);call #t~string131.base, #t~string131.offset := #Ultimate.allocOnStack(3);call write~init~int(37, #t~string131.base, #t~string131.offset, 1);call write~init~int(105, #t~string131.base, 1 + #t~string131.offset, 1);call write~init~int(0, #t~string131.base, 2 + #t~string131.offset, 1);call #t~string133.base, #t~string133.offset := #Ultimate.allocOnStack(10);call #t~string135.base, #t~string135.offset := #Ultimate.allocOnStack(3);call write~init~int(117, #t~string135.base, #t~string135.offset, 1);call write~init~int(112, #t~string135.base, 1 + #t~string135.offset, 1);call write~init~int(0, #t~string135.base, 2 + #t~string135.offset, 1);call #t~string137.base, #t~string137.offset := #Ultimate.allocOnStack(5);call write~init~int(100, #t~string137.base, #t~string137.offset, 1);call write~init~int(111, #t~string137.base, 1 + #t~string137.offset, 1);call write~init~int(119, #t~string137.base, 2 + #t~string137.offset, 1);call write~init~int(110, #t~string137.base, 3 + #t~string137.offset, 1);call write~init~int(0, #t~string137.base, 4 + #t~string137.offset, 1);call #t~string139.base, #t~string139.offset := #Ultimate.allocOnStack(7);call write~init~int(32, #t~string139.base, #t~string139.offset, 1);call write~init~int(73, #t~string139.base, 1 + #t~string139.offset, 1);call write~init~int(76, #t~string139.base, 2 + #t~string139.offset, 1);call write~init~int(95, #t~string139.base, 3 + #t~string139.offset, 1);call write~init~int(112, #t~string139.base, 4 + #t~string139.offset, 1);call write~init~int(58, #t~string139.base, 5 + #t~string139.offset, 1);call write~init~int(0, #t~string139.base, 6 + #t~string139.offset, 1);call #t~string141.base, #t~string141.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string141.base, #t~string141.offset, 1);call write~init~int(37, #t~string141.base, 1 + #t~string141.offset, 1);call write~init~int(105, #t~string141.base, 2 + #t~string141.offset, 1);call write~init~int(0, #t~string141.base, 3 + #t~string141.offset, 1);call #t~string143.base, #t~string143.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string143.base, #t~string143.offset, 1);call write~init~int(37, #t~string143.base, 1 + #t~string143.offset, 1);call write~init~int(105, #t~string143.base, 2 + #t~string143.offset, 1);call write~init~int(0, #t~string143.base, 3 + #t~string143.offset, 1);call #t~string145.base, #t~string145.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string145.base, #t~string145.offset, 1);call write~init~int(37, #t~string145.base, 1 + #t~string145.offset, 1);call write~init~int(105, #t~string145.base, 2 + #t~string145.offset, 1);call write~init~int(0, #t~string145.base, 3 + #t~string145.offset, 1);call #t~string147.base, #t~string147.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string147.base, #t~string147.offset, 1);call write~init~int(37, #t~string147.base, 1 + #t~string147.offset, 1);call write~init~int(105, #t~string147.base, 2 + #t~string147.offset, 1);call write~init~int(0, #t~string147.base, 3 + #t~string147.offset, 1);call #t~string149.base, #t~string149.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string149.base, #t~string149.offset, 1);call write~init~int(37, #t~string149.base, 1 + #t~string149.offset, 1);call write~init~int(105, #t~string149.base, 2 + #t~string149.offset, 1);call write~init~int(0, #t~string149.base, 3 + #t~string149.offset, 1);call #t~string151.base, #t~string151.offset := #Ultimate.allocOnStack(6);call write~init~int(32, #t~string151.base, #t~string151.offset, 1);call write~init~int(70, #t~string151.base, 1 + #t~string151.offset, 1);call write~init~int(95, #t~string151.base, 2 + #t~string151.offset, 1);call write~init~int(112, #t~string151.base, 3 + #t~string151.offset, 1);call write~init~int(58, #t~string151.base, 4 + #t~string151.offset, 1);call write~init~int(0, #t~string151.base, 5 + #t~string151.offset, 1);call #t~string154.base, #t~string154.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string154.base, #t~string154.offset, 1);call write~init~int(37, #t~string154.base, 1 + #t~string154.offset, 1);call write~init~int(105, #t~string154.base, 2 + #t~string154.offset, 1);call write~init~int(0, #t~string154.base, 3 + #t~string154.offset, 1);call #t~string157.base, #t~string157.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string157.base, #t~string157.offset, 1);call write~init~int(37, #t~string157.base, 1 + #t~string157.offset, 1);call write~init~int(105, #t~string157.base, 2 + #t~string157.offset, 1);call write~init~int(0, #t~string157.base, 3 + #t~string157.offset, 1);call #t~string160.base, #t~string160.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string160.base, #t~string160.offset, 1);call write~init~int(37, #t~string160.base, 1 + #t~string160.offset, 1);call write~init~int(105, #t~string160.base, 2 + #t~string160.offset, 1);call write~init~int(0, #t~string160.base, 3 + #t~string160.offset, 1);call #t~string163.base, #t~string163.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string163.base, #t~string163.offset, 1);call write~init~int(37, #t~string163.base, 1 + #t~string163.offset, 1);call write~init~int(105, #t~string163.base, 2 + #t~string163.offset, 1);call write~init~int(0, #t~string163.base, 3 + #t~string163.offset, 1);call #t~string166.base, #t~string166.offset := #Ultimate.allocOnStack(4);call write~init~int(32, #t~string166.base, #t~string166.offset, 1);call write~init~int(37, #t~string166.base, 1 + #t~string166.offset, 1);call write~init~int(105, #t~string166.base, 2 + #t~string166.offset, 1);call write~init~int(0, #t~string166.base, 3 + #t~string166.offset, 1);call #t~string168.base, #t~string168.offset := #Ultimate.allocOnStack(2);call write~init~int(10, #t~string168.base, #t~string168.offset, 1);call write~init~int(0, #t~string168.base, 1 + #t~string168.offset, 1);call #t~string171.base, #t~string171.offset := #Ultimate.allocOnStack(9); 6476#L-1true havoc main_#res;havoc main_#t~ret61, main_~retValue_acc~12, main_~tmp~14;havoc main_~retValue_acc~12;havoc main_~tmp~14; 1219#L1286true havoc valid_product_#res;havoc valid_product_~retValue_acc~7;havoc valid_product_~retValue_acc~7;valid_product_~retValue_acc~7 := 1;valid_product_#res := valid_product_~retValue_acc~7; 1047#L1294true main_#t~ret61 := valid_product_#res;main_~tmp~14 := main_#t~ret61;havoc main_#t~ret61; 1661#L1868true assume 0 != main_~tmp~14; 396#L1843true ~floorButtons_spc2_0~0 := 0;~floorButtons_spc2_1~0 := 0;~floorButtons_spc2_2~0 := 0;~floorButtons_spc2_3~0 := 0;~floorButtons_spc2_4~0 := 0; 1074#L60true havoc bigMacCall_#t~ret54, bigMacCall_~tmp~11;havoc bigMacCall_~tmp~11;getOrigin_#in~person := 5;havoc getOrigin_#res;havoc getOrigin_~person, getOrigin_~retValue_acc~9;getOrigin_~person := getOrigin_#in~person;havoc getOrigin_~retValue_acc~9; 873#L1456true assume 0 == getOrigin_~person;getOrigin_~retValue_acc~9 := 4;getOrigin_#res := getOrigin_~retValue_acc~9; 58#L1481true bigMacCall_#t~ret54 := getOrigin_#res;bigMacCall_~tmp~11 := bigMacCall_#t~ret54;havoc bigMacCall_#t~ret54;initPersonOnFloor_#in~person, initPersonOnFloor_#in~floor := 5, bigMacCall_~tmp~11;havoc initPersonOnFloor_~person, initPersonOnFloor_~floor;initPersonOnFloor_~person := initPersonOnFloor_#in~person;initPersonOnFloor_~floor := initPersonOnFloor_#in~floor; 1030#L587true assume 0 == initPersonOnFloor_~floor; 1009#L588true assume 0 == initPersonOnFloor_~person;~personOnFloor_0_0~0 := 1; 4450#L695-1true callOnFloor_#in~floorID := initPersonOnFloor_~floor;havoc callOnFloor_~floorID;callOnFloor_~floorID := callOnFloor_#in~floorID; 5809#L379true assume 0 == callOnFloor_~floorID;~calls_0~0 := 1; 6096#L391-2true havoc cleanup_#t~ret55, cleanup_#t~ret56, cleanup_~i~2, cleanup_~tmp~12, cleanup_~tmp___0~3, cleanup_~__cil_tmp4~2;havoc cleanup_~i~2;havoc cleanup_~tmp~12;havoc cleanup_~tmp___0~3;havoc cleanup_~__cil_tmp4~2;havoc timeShift_#t~ret122, timeShift_~tmp~29;havoc timeShift_~tmp~29;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~15;havoc areDoorsOpen_~retValue_acc~15;areDoorsOpen_~retValue_acc~15 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~15; 6222#L2149true timeShift_#t~ret122 := areDoorsOpen_#res;timeShift_~tmp~29 := timeShift_#t~ret122;havoc timeShift_#t~ret122; 4574#L3159true assume 0 != timeShift_~tmp~29; 4640#L3160true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 4719#L2805-11true havoc __utac_acc__Specification2_spec__3_#t~ret0, __utac_acc__Specification2_spec__3_#t~ret1, __utac_acc__Specification2_spec__3_#t~ret2, __utac_acc__Specification2_spec__3_#t~ret3, __utac_acc__Specification2_spec__3_#t~ret4, __utac_acc__Specification2_spec__3_#t~ret5, __utac_acc__Specification2_spec__3_~floor~0, __utac_acc__Specification2_spec__3_~tmp~0, __utac_acc__Specification2_spec__3_~tmp___0~0, __utac_acc__Specification2_spec__3_~tmp___1~0, __utac_acc__Specification2_spec__3_~tmp___2~0, __utac_acc__Specification2_spec__3_~tmp___3~0, __utac_acc__Specification2_spec__3_~tmp___4~0;havoc __utac_acc__Specification2_spec__3_~floor~0;havoc __utac_acc__Specification2_spec__3_~tmp~0;havoc __utac_acc__Specification2_spec__3_~tmp___0~0;havoc __utac_acc__Specification2_spec__3_~tmp___1~0;havoc __utac_acc__Specification2_spec__3_~tmp___2~0;havoc __utac_acc__Specification2_spec__3_~tmp___3~0;havoc __utac_acc__Specification2_spec__3_~tmp___4~0;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~14;havoc getCurrentFloorID_~retValue_acc~14;getCurrentFloorID_~retValue_acc~14 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~14; 5770#L2140-10true __utac_acc__Specification2_spec__3_#t~ret0 := getCurrentFloorID_#res;__utac_acc__Specification2_spec__3_~tmp~0 := __utac_acc__Specification2_spec__3_#t~ret0;havoc __utac_acc__Specification2_spec__3_#t~ret0;__utac_acc__Specification2_spec__3_~floor~0 := __utac_acc__Specification2_spec__3_~tmp~0; 1712#L105true assume 0 == __utac_acc__Specification2_spec__3_~floor~0; 1692#L106true assume 0 != ~floorButtons_spc2_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~15;havoc areDoorsOpen_~retValue_acc~15;areDoorsOpen_~retValue_acc~15 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~15; 6213#L2149-1true __utac_acc__Specification2_spec__3_#t~ret1 := areDoorsOpen_#res;__utac_acc__Specification2_spec__3_~tmp___4~0 := __utac_acc__Specification2_spec__3_#t~ret1;havoc __utac_acc__Specification2_spec__3_#t~ret1; 1633#L110true assume 0 != __utac_acc__Specification2_spec__3_~tmp___4~0;~floorButtons_spc2_0~0 := 0; 4641#L165true cleanup_~i~2 := 0; 2242#L1675-2true [2019-01-01 23:21:25,824 INFO L796 eck$LassoCheckResult]: Loop: 2242#L1675-2true assume !false; 2357#L1676true cleanup_~__cil_tmp4~2 := ~cleanupTimeShifts~0 - 1; 2192#L1679true assume cleanup_~i~2 < cleanup_~__cil_tmp4~2;havoc isBlocked_#res;havoc isBlocked_~retValue_acc~13;havoc isBlocked_~retValue_acc~13;isBlocked_~retValue_acc~13 := ~blocked~0;isBlocked_#res := isBlocked_~retValue_acc~13; 5839#L1963true cleanup_#t~ret55 := isBlocked_#res;cleanup_~tmp___0~3 := cleanup_#t~ret55;havoc cleanup_#t~ret55; 2831#L1683true assume 1 != cleanup_~tmp___0~3; 2833#L1683-1true havoc isIdle_#res;havoc isIdle_#t~ret70, isIdle_~retValue_acc~20, isIdle_~tmp~19;havoc isIdle_~retValue_acc~20;havoc isIdle_~tmp~19;havoc anyStopRequested_#res;havoc anyStopRequested_#t~ret65, anyStopRequested_#t~ret66, anyStopRequested_#t~ret67, anyStopRequested_#t~ret68, anyStopRequested_#t~ret69, anyStopRequested_~retValue_acc~19, anyStopRequested_~tmp~18, anyStopRequested_~tmp___0~5, anyStopRequested_~tmp___1~4, anyStopRequested_~tmp___2~2, anyStopRequested_~tmp___3~1;havoc anyStopRequested_~retValue_acc~19;havoc anyStopRequested_~tmp~18;havoc anyStopRequested_~tmp___0~5;havoc anyStopRequested_~tmp___1~4;havoc anyStopRequested_~tmp___2~2;havoc anyStopRequested_~tmp___3~1;isFloorCalling_#in~floorID := 0;havoc isFloorCalling_#res;havoc isFloorCalling_~floorID, isFloorCalling_~retValue_acc~0;isFloorCalling_~floorID := isFloorCalling_#in~floorID;havoc isFloorCalling_~retValue_acc~0; 5298#L316-130true assume 0 == isFloorCalling_~floorID;isFloorCalling_~retValue_acc~0 := ~calls_0~0;isFloorCalling_#res := isFloorCalling_~retValue_acc~0; 4364#L343-130true anyStopRequested_#t~ret65 := isFloorCalling_#res;anyStopRequested_~tmp___3~1 := anyStopRequested_#t~ret65;havoc anyStopRequested_#t~ret65; 4831#L2248true assume 0 != anyStopRequested_~tmp___3~1;anyStopRequested_~retValue_acc~19 := 1;anyStopRequested_#res := anyStopRequested_~retValue_acc~19; 6000#L2312true isIdle_#t~ret70 := anyStopRequested_#res;isIdle_~tmp~19 := isIdle_#t~ret70;havoc isIdle_#t~ret70;isIdle_~retValue_acc~20 := (if 0 == isIdle_~tmp~19 then 1 else 0);isIdle_#res := isIdle_~retValue_acc~20; 6118#L2325true cleanup_#t~ret56 := isIdle_#res;cleanup_~tmp~12 := cleanup_#t~ret56;havoc cleanup_#t~ret56; 1648#L1695true assume !(0 != cleanup_~tmp~12);havoc timeShift_#t~ret122, timeShift_~tmp~29;havoc timeShift_~tmp~29;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~15;havoc areDoorsOpen_~retValue_acc~15;areDoorsOpen_~retValue_acc~15 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~15; 6218#L2149-6true timeShift_#t~ret122 := areDoorsOpen_#res;timeShift_~tmp~29 := timeShift_#t~ret122;havoc timeShift_#t~ret122; 4578#L3159-1true assume 0 != timeShift_~tmp~29; 4642#L3160-2true assume ~weight~0 > ~maximumWeight~0;~blocked~0 := 1; 4608#L2805-23true havoc __utac_acc__Specification2_spec__3_#t~ret0, __utac_acc__Specification2_spec__3_#t~ret1, __utac_acc__Specification2_spec__3_#t~ret2, __utac_acc__Specification2_spec__3_#t~ret3, __utac_acc__Specification2_spec__3_#t~ret4, __utac_acc__Specification2_spec__3_#t~ret5, __utac_acc__Specification2_spec__3_~floor~0, __utac_acc__Specification2_spec__3_~tmp~0, __utac_acc__Specification2_spec__3_~tmp___0~0, __utac_acc__Specification2_spec__3_~tmp___1~0, __utac_acc__Specification2_spec__3_~tmp___2~0, __utac_acc__Specification2_spec__3_~tmp___3~0, __utac_acc__Specification2_spec__3_~tmp___4~0;havoc __utac_acc__Specification2_spec__3_~floor~0;havoc __utac_acc__Specification2_spec__3_~tmp~0;havoc __utac_acc__Specification2_spec__3_~tmp___0~0;havoc __utac_acc__Specification2_spec__3_~tmp___1~0;havoc __utac_acc__Specification2_spec__3_~tmp___2~0;havoc __utac_acc__Specification2_spec__3_~tmp___3~0;havoc __utac_acc__Specification2_spec__3_~tmp___4~0;havoc getCurrentFloorID_#res;havoc getCurrentFloorID_~retValue_acc~14;havoc getCurrentFloorID_~retValue_acc~14;getCurrentFloorID_~retValue_acc~14 := ~currentFloorID~0;getCurrentFloorID_#res := getCurrentFloorID_~retValue_acc~14; 5807#L2140-21true __utac_acc__Specification2_spec__3_#t~ret0 := getCurrentFloorID_#res;__utac_acc__Specification2_spec__3_~tmp~0 := __utac_acc__Specification2_spec__3_#t~ret0;havoc __utac_acc__Specification2_spec__3_#t~ret0;__utac_acc__Specification2_spec__3_~floor~0 := __utac_acc__Specification2_spec__3_~tmp~0; 1710#L105-1true assume 0 == __utac_acc__Specification2_spec__3_~floor~0; 1666#L106-1true assume 0 != ~floorButtons_spc2_0~0;havoc areDoorsOpen_#res;havoc areDoorsOpen_~retValue_acc~15;havoc areDoorsOpen_~retValue_acc~15;areDoorsOpen_~retValue_acc~15 := ~doorState~0;areDoorsOpen_#res := areDoorsOpen_~retValue_acc~15; 6204#L2149-7true __utac_acc__Specification2_spec__3_#t~ret1 := areDoorsOpen_#res;__utac_acc__Specification2_spec__3_~tmp___4~0 := __utac_acc__Specification2_spec__3_#t~ret1;havoc __utac_acc__Specification2_spec__3_#t~ret1; 1627#L110-2true assume 0 != __utac_acc__Specification2_spec__3_~tmp___4~0;~floorButtons_spc2_0~0 := 0; 4643#L165-1true cleanup_~i~2 := 1 + cleanup_~i~2; 2242#L1675-2true [2019-01-01 23:21:25,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:21:25,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1561602685, now seen corresponding path program 1 times [2019-01-01 23:21:25,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:21:25,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:21:25,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:21:25,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:21:25,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:21:26,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:21:26,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:21:26,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:21:26,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 23:21:26,299 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:21:26,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:21:26,299 INFO L82 PathProgramCache]: Analyzing trace with hash -760732559, now seen corresponding path program 1 times [2019-01-01 23:21:26,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:21:26,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:21:26,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:21:26,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:21:26,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:21:26,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:21:26,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:21:27,795 WARN L181 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 88 DAG size of output: 82 [2019-01-01 23:21:27,932 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-01-01 23:21:27,953 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:21:27,954 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:21:27,955 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:21:27,955 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:21:27,955 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:21:27,955 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:21:27,955 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:21:27,955 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:21:27,956 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec2_product32_false-unreach-call_true-termination.cil.c_Iteration1_Loop [2019-01-01 23:21:27,956 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:21:27,956 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:21:27,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:28,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:28,164 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-01 23:21:28,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:28,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:28,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:28,369 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-01 23:21:28,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:28,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:28,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:28,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:28,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:28,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:28,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:28,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:28,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:28,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:28,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:28,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:28,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:28,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:28,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:28,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:28,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:28,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:28,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:28,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:28,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:28,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:28,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:28,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:28,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:28,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:28,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:28,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:29,806 WARN L181 SmtUtils]: Spent 540.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-01 23:21:30,109 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-01 23:21:30,161 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:21:30,162 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:21:30,167 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:21:30,168 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:21:30,174 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:21:30,174 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_anyStopRequested_~tmp___1~4=0} Honda state: {ULTIMATE.start_anyStopRequested_~tmp___1~4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:21:30,202 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:21:30,202 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:21:30,228 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:21:30,228 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_areDoorsOpen_#res=-5, ULTIMATE.start_timeShift_~tmp~29=-5, ULTIMATE.start___utac_acc__Specification2_spec__3_~tmp___4~0=-5, ~doorState~0=-5, ULTIMATE.start_areDoorsOpen_~retValue_acc~15=-5} Honda state: {ULTIMATE.start_areDoorsOpen_#res=-5, ULTIMATE.start_timeShift_~tmp~29=-5, ULTIMATE.start___utac_acc__Specification2_spec__3_~tmp___4~0=-5, ~doorState~0=-5, ULTIMATE.start_areDoorsOpen_~retValue_acc~15=-5} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:21:30,315 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:21:30,315 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:21:30,330 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:21:30,331 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_timeShift_#t~ret122=0} Honda state: {ULTIMATE.start_timeShift_#t~ret122=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:21:30,368 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:21:30,368 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:21:30,372 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:21:30,372 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___utac_acc__Specification2_spec__3_~tmp___2~0=0} Honda state: {ULTIMATE.start___utac_acc__Specification2_spec__3_~tmp___2~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:21:30,405 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:21:30,405 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:21:30,438 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:21:30,438 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:21:42,486 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-01-01 23:21:42,489 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:21:42,490 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:21:42,490 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:21:42,490 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:21:42,490 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:21:42,490 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:21:42,490 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:21:42,490 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:21:42,490 INFO L131 ssoRankerPreferences]: Filename of dumped script: elevator_spec2_product32_false-unreach-call_true-termination.cil.c_Iteration1_Loop [2019-01-01 23:21:42,491 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:21:42,491 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:21:42,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:42,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:42,692 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-01 23:21:42,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:42,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:42,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:42,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:42,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:42,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:42,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:42,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:42,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:42,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:42,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:42,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:42,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:42,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:42,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:43,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:43,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:43,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:43,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:43,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:43,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:43,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:43,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:43,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:43,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:43,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:43,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:43,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:43,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:43,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:43,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:21:43,370 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-01 23:21:43,839 WARN L181 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-01 23:21:43,984 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-01 23:21:44,247 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:21:44,253 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:21:44,255 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:21:44,257 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:21:44,258 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:21:44,258 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:21:44,259 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:21:44,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:21:44,263 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:21:44,264 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:21:44,291 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:21:44,291 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:21:44,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:21:44,293 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:21:44,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:21:44,293 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:21:44,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:21:44,300 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:21:44,303 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:21:44,328 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:21:44,329 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:21:44,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:21:44,329 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:21:44,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:21:44,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:21:44,333 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:21:44,334 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:21:44,334 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:21:44,335 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:21:44,335 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:21:44,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:21:44,344 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:21:44,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:21:44,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:21:44,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:21:44,345 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:21:44,345 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:21:44,346 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:21:44,352 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:21:44,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:21:44,353 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:21:44,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:21:44,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:21:44,353 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:21:44,354 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:21:44,354 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:21:44,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:21:44,359 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:21:44,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:21:44,360 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:21:44,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:21:44,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:21:44,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:21:44,368 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:21:44,369 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:21:44,372 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:21:44,375 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:21:44,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:21:44,380 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:21:44,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:21:44,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:21:44,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:21:44,382 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:21:44,382 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:21:44,388 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:21:44,389 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:21:44,391 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:21:44,393 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:21:44,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:21:44,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:21:44,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:21:44,394 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:21:44,394 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:21:44,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:21:44,401 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:21:44,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:21:44,402 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:21:44,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:21:44,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:21:44,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:21:44,409 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:21:44,409 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:21:44,410 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:21:44,411 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:21:44,411 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:21:44,412 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:21:44,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:21:44,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:21:44,415 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:21:44,416 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:21:44,416 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:21:44,426 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:21:44,427 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:21:44,427 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:21:44,427 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:21:44,428 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:21:44,428 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:21:44,428 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:21:44,428 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:21:44,432 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:21:44,433 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:21:44,434 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:21:44,434 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:21:44,434 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:21:44,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:21:44,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:21:44,435 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:21:44,435 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:21:44,435 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:21:44,436 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:21:44,438 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:21:44,438 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:21:44,439 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:21:44,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:21:44,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:21:44,439 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:21:44,442 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:21:44,444 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:21:44,445 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:21:44,447 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:21:44,447 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:21:44,448 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:21:44,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:21:44,448 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:21:44,448 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:21:44,451 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:21:44,451 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:21:44,453 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:21:44,454 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:21:44,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:21:44,456 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:21:44,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:21:44,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:21:44,456 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:21:44,458 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:21:44,458 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:21:44,460 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:21:44,461 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:21:44,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:21:44,466 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:21:44,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:21:44,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:21:44,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:21:44,467 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:21:44,469 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:21:44,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:21:44,471 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:21:44,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:21:44,473 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:21:44,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:21:44,474 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 23:21:44,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:21:44,474 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 23:21:44,474 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:21:44,490 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:21:44,491 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:21:44,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:21:44,494 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:21:44,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:21:44,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:21:44,494 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:21:44,495 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:21:44,495 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:21:44,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:21:44,498 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:21:44,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:21:44,500 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:21:44,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:21:44,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:21:44,501 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:21:44,501 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:21:44,503 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:21:44,504 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:21:44,504 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:21:44,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:21:44,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:21:44,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:21:44,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:21:44,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:21:44,510 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:21:44,510 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:21:44,511 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:21:44,515 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:21:44,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:21:44,515 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:21:44,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:21:44,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:21:44,516 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:21:44,516 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:21:44,516 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:21:44,517 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:21:44,518 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:21:44,518 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:21:44,518 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:21:44,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:21:44,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:21:44,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:21:44,520 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:21:44,520 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:21:44,521 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:21:44,522 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:21:44,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:21:44,522 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:21:44,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:21:44,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:21:44,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:21:44,524 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:21:44,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:21:44,526 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:21:44,526 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:21:44,527 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:21:44,527 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:21:44,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:21:44,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:21:44,527 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:21:44,533 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:21:44,534 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:21:44,535 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:21:44,535 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:21:44,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:21:44,537 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:21:44,537 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:21:44,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:21:44,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:21:44,538 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:21:44,538 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:21:44,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:21:44,540 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:21:44,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:21:44,541 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:21:44,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:21:44,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:21:44,542 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:21:44,543 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:21:44,543 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:21:44,544 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:21:44,545 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:21:44,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:21:44,546 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:21:44,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:21:44,546 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:21:44,546 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:21:44,547 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:21:44,547 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:21:44,549 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:21:44,549 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:21:44,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:21:44,550 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:21:44,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:21:44,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:21:44,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:21:44,551 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:21:44,551 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:21:44,558 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:21:44,568 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 23:21:44,568 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 23:21:44,576 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:21:44,576 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:21:44,577 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:21:44,577 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~cleanupTimeShifts~0, ULTIMATE.start_cleanup_~i~2) = 1*~cleanupTimeShifts~0 - 1*ULTIMATE.start_cleanup_~i~2 Supporting invariants [] [2019-01-01 23:21:44,579 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:21:44,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:21:45,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:21:45,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:21:45,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:21:45,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:21:45,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:21:45,526 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 23:21:45,527 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7183 states. Second operand 5 states. [2019-01-01 23:21:46,364 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7183 states.. Second operand 5 states. Result 10824 states and 20378 transitions. Complement of second has 9 states. [2019-01-01 23:21:46,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 23:21:46,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 23:21:46,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13591 transitions. [2019-01-01 23:21:46,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13591 transitions. Stem has 24 letters. Loop has 22 letters. [2019-01-01 23:21:46,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:21:46,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13591 transitions. Stem has 46 letters. Loop has 22 letters. [2019-01-01 23:21:46,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:21:46,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13591 transitions. Stem has 24 letters. Loop has 44 letters. [2019-01-01 23:21:46,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:21:46,395 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10824 states and 20378 transitions. [2019-01-01 23:21:46,534 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:21:46,538 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10824 states to 0 states and 0 transitions. [2019-01-01 23:21:46,540 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 23:21:46,540 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 23:21:46,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 23:21:46,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:21:46,542 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:21:46,542 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:21:46,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 23:21:46,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 23:21:46,552 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2019-01-01 23:21:46,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:21:46,556 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-01 23:21:46,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-01 23:21:46,557 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-01 23:21:46,557 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:21:46,558 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 23:21:46,558 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 23:21:46,558 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 23:21:46,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 23:21:46,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:21:46,558 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:21:46,558 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:21:46,558 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 23:21:46,558 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:21:46,559 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 23:21:46,559 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 23:21:46,559 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 23:21:46,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:21:46 BoogieIcfgContainer [2019-01-01 23:21:46,568 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:21:46,568 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:21:46,568 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:21:46,571 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:21:46,572 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:21:25" (3/4) ... [2019-01-01 23:21:46,579 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 23:21:46,579 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:21:46,580 INFO L168 Benchmark]: Toolchain (without parser) took 40704.96 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 632.3 MB). Free memory was 947.3 MB in the beginning and 1.3 GB in the end (delta: -315.6 MB). Peak memory consumption was 316.7 MB. Max. memory is 11.5 GB. [2019-01-01 23:21:46,582 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:21:46,582 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1281.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -140.4 MB). Peak memory consumption was 56.8 MB. Max. memory is 11.5 GB. [2019-01-01 23:21:46,584 INFO L168 Benchmark]: Boogie Procedure Inliner took 410.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 74.9 MB). Peak memory consumption was 74.9 MB. Max. memory is 11.5 GB. [2019-01-01 23:21:46,585 INFO L168 Benchmark]: Boogie Preprocessor took 637.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 944.8 MB in the end (delta: 68.1 MB). Peak memory consumption was 68.1 MB. Max. memory is 11.5 GB. [2019-01-01 23:21:46,586 INFO L168 Benchmark]: RCFGBuilder took 17059.53 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 504.4 MB). Free memory was 944.8 MB in the beginning and 1.3 GB in the end (delta: -317.6 MB). Peak memory consumption was 443.3 MB. Max. memory is 11.5 GB. [2019-01-01 23:21:46,587 INFO L168 Benchmark]: BuchiAutomizer took 21298.80 ms. Allocated memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: -1.6 MB). Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: -520.9 kB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:21:46,589 INFO L168 Benchmark]: Witness Printer took 11.09 ms. Allocated memory is still 1.7 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:21:46,598 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1281.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -140.4 MB). Peak memory consumption was 56.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 410.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 74.9 MB). Peak memory consumption was 74.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 637.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 944.8 MB in the end (delta: 68.1 MB). Peak memory consumption was 68.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 17059.53 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 504.4 MB). Free memory was 944.8 MB in the beginning and 1.3 GB in the end (delta: -317.6 MB). Peak memory consumption was 443.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 21298.80 ms. Allocated memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: -1.6 MB). Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: -520.9 kB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 11.09 ms. Allocated memory is still 1.7 GB. Free memory is still 1.3 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 21.2s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 18.7s. Construction of modules took 0.1s. Büchi inclusion checks took 1.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 13557 SDtfs, 20326 SDslu, 6795 SDs, 0 SdLazy, 9 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital109 mio100 ax100 hnf100 lsp16 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq211 hnf89 smp100 dnf176 smp100 tf103 neg96 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 36ms VariablesStem: 0 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 1 LassoNonterminationAnalysisTime: 12.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...