./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/array-examples/standard_vararg_true-unreach-call_ground_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0781dbac-5832-453c-bade-a991b3558d5b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0781dbac-5832-453c-bade-a991b3558d5b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0781dbac-5832-453c-bade-a991b3558d5b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0781dbac-5832-453c-bade-a991b3558d5b/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-examples/standard_vararg_true-unreach-call_ground_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_0781dbac-5832-453c-bade-a991b3558d5b/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0781dbac-5832-453c-bade-a991b3558d5b/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0ec1e9b4474a625821a91c382460b2fed74a8091 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 09:57:44,773 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 09:57:44,774 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 09:57:44,781 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 09:57:44,781 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 09:57:44,782 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 09:57:44,783 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 09:57:44,784 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 09:57:44,785 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 09:57:44,785 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 09:57:44,786 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 09:57:44,786 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 09:57:44,787 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 09:57:44,787 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 09:57:44,788 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 09:57:44,789 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 09:57:44,789 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 09:57:44,790 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 09:57:44,792 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 09:57:44,793 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 09:57:44,793 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 09:57:44,794 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 09:57:44,796 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 09:57:44,796 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 09:57:44,796 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 09:57:44,797 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 09:57:44,797 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 09:57:44,798 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 09:57:44,798 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 09:57:44,799 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 09:57:44,799 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 09:57:44,800 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 09:57:44,800 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 09:57:44,800 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 09:57:44,800 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 09:57:44,801 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 09:57:44,801 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0781dbac-5832-453c-bade-a991b3558d5b/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 09:57:44,809 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 09:57:44,810 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 09:57:44,810 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 09:57:44,811 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 09:57:44,811 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 09:57:44,811 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 09:57:44,811 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 09:57:44,811 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 09:57:44,811 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 09:57:44,811 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 09:57:44,812 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 09:57:44,812 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 09:57:44,812 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 09:57:44,812 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 09:57:44,812 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 09:57:44,812 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 09:57:44,812 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 09:57:44,812 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 09:57:44,813 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 09:57:44,813 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 09:57:44,813 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 09:57:44,813 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 09:57:44,813 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 09:57:44,813 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 09:57:44,813 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 09:57:44,814 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 09:57:44,814 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 09:57:44,814 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 09:57:44,814 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 09:57:44,814 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 09:57:44,815 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 09:57:44,815 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_0781dbac-5832-453c-bade-a991b3558d5b/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0ec1e9b4474a625821a91c382460b2fed74a8091 [2018-11-10 09:57:44,838 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 09:57:44,847 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 09:57:44,849 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 09:57:44,851 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 09:57:44,851 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 09:57:44,851 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0781dbac-5832-453c-bade-a991b3558d5b/bin-2019/uautomizer/../../sv-benchmarks/c/array-examples/standard_vararg_true-unreach-call_ground_true-termination.i [2018-11-10 09:57:44,892 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0781dbac-5832-453c-bade-a991b3558d5b/bin-2019/uautomizer/data/85535295c/d3ff0b752cb94c8e94a3fa1e1f4be1ca/FLAG7cf14c903 [2018-11-10 09:57:45,284 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 09:57:45,284 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0781dbac-5832-453c-bade-a991b3558d5b/sv-benchmarks/c/array-examples/standard_vararg_true-unreach-call_ground_true-termination.i [2018-11-10 09:57:45,288 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0781dbac-5832-453c-bade-a991b3558d5b/bin-2019/uautomizer/data/85535295c/d3ff0b752cb94c8e94a3fa1e1f4be1ca/FLAG7cf14c903 [2018-11-10 09:57:45,298 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0781dbac-5832-453c-bade-a991b3558d5b/bin-2019/uautomizer/data/85535295c/d3ff0b752cb94c8e94a3fa1e1f4be1ca [2018-11-10 09:57:45,301 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 09:57:45,302 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 09:57:45,303 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 09:57:45,303 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 09:57:45,306 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 09:57:45,306 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:57:45" (1/1) ... [2018-11-10 09:57:45,308 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ae94ac8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:45, skipping insertion in model container [2018-11-10 09:57:45,308 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:57:45" (1/1) ... [2018-11-10 09:57:45,314 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 09:57:45,326 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 09:57:45,423 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 09:57:45,426 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 09:57:45,436 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 09:57:45,448 INFO L193 MainTranslator]: Completed translation [2018-11-10 09:57:45,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:45 WrapperNode [2018-11-10 09:57:45,448 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 09:57:45,449 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 09:57:45,449 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 09:57:45,449 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 09:57:45,454 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:45" (1/1) ... [2018-11-10 09:57:45,459 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:45" (1/1) ... [2018-11-10 09:57:45,470 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 09:57:45,470 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 09:57:45,471 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 09:57:45,471 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 09:57:45,476 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:45" (1/1) ... [2018-11-10 09:57:45,476 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:45" (1/1) ... [2018-11-10 09:57:45,477 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:45" (1/1) ... [2018-11-10 09:57:45,477 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:45" (1/1) ... [2018-11-10 09:57:45,479 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:45" (1/1) ... [2018-11-10 09:57:45,516 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:45" (1/1) ... [2018-11-10 09:57:45,517 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:45" (1/1) ... [2018-11-10 09:57:45,518 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 09:57:45,519 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 09:57:45,519 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 09:57:45,519 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 09:57:45,519 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0781dbac-5832-453c-bade-a991b3558d5b/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:57:45,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 09:57:45,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 09:57:45,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 09:57:45,661 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 09:57:45,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:57:45 BoogieIcfgContainer [2018-11-10 09:57:45,662 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 09:57:45,662 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 09:57:45,662 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 09:57:45,665 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 09:57:45,666 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 09:57:45,666 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 09:57:45" (1/3) ... [2018-11-10 09:57:45,667 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2e0366fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 09:57:45, skipping insertion in model container [2018-11-10 09:57:45,667 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 09:57:45,667 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:57:45" (2/3) ... [2018-11-10 09:57:45,667 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2e0366fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 09:57:45, skipping insertion in model container [2018-11-10 09:57:45,667 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 09:57:45,667 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:57:45" (3/3) ... [2018-11-10 09:57:45,668 INFO L375 chiAutomizerObserver]: Analyzing ICFG standard_vararg_true-unreach-call_ground_true-termination.i [2018-11-10 09:57:45,713 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 09:57:45,713 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 09:57:45,713 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 09:57:45,713 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 09:57:45,713 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 09:57:45,713 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 09:57:45,713 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 09:57:45,714 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 09:57:45,714 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 09:57:45,722 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-10 09:57:45,735 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-11-10 09:57:45,735 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:57:45,735 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:57:45,739 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 09:57:45,739 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 09:57:45,739 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 09:57:45,740 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-10 09:57:45,741 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-11-10 09:57:45,741 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:57:45,741 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:57:45,741 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 09:57:45,741 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 09:57:45,748 INFO L793 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~post1, main_#t~mem0, main_#t~mem3, main_#t~post2, main_~#aa~0.base, main_~#aa~0.offset, main_~a~0, main_~x~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 400000;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#aa~0.base, main_~#aa~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~a~0 := 0; 16#L6-4true [2018-11-10 09:57:45,749 INFO L795 eck$LassoCheckResult]: Loop: 16#L6-4true assume true; 3#L6-1true SUMMARY for call main_#t~mem0 := read~int(main_~#aa~0.base, main_~#aa~0.offset + main_~a~0 * 4, 4); srcloc: L6-1 20#L6-2true assume !!(main_#t~mem0 >= 0);havoc main_#t~mem0;main_#t~post1 := main_~a~0;main_~a~0 := main_#t~post1 + 1;havoc main_#t~post1; 16#L6-4true [2018-11-10 09:57:45,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:57:45,753 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-10 09:57:45,755 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:57:45,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:57:45,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:57:45,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:57:45,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:57:45,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:57:45,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:57:45,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:57:45,828 INFO L82 PathProgramCache]: Analyzing trace with hash 35818, now seen corresponding path program 1 times [2018-11-10 09:57:45,828 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:57:45,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:57:45,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:57:45,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:57:45,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:57:45,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:57:45,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:57:45,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:57:45,842 INFO L82 PathProgramCache]: Analyzing trace with hash 28694760, now seen corresponding path program 1 times [2018-11-10 09:57:45,842 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:57:45,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:57:45,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:57:45,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:57:45,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:57:45,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:57:45,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:57:46,001 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:57:46,002 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:57:46,002 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:57:46,002 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:57:46,002 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 09:57:46,002 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:57:46,003 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:57:46,003 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:57:46,003 INFO L131 ssoRankerPreferences]: Filename of dumped script: standard_vararg_true-unreach-call_ground_true-termination.i_Iteration1_Lasso [2018-11-10 09:57:46,003 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:57:46,003 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:57:46,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:57:46,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:57:46,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:57:46,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:57:46,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:57:46,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:57:46,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:57:46,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:57:46,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:57:46,325 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:57:46,329 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 09:57:46,331 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:57:46,332 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:57:46,332 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:57:46,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:57:46,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:57:46,333 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:57:46,335 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:57:46,335 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:57:46,338 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:57:46,338 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:57:46,339 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:57:46,339 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:57:46,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:57:46,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:57:46,339 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:57:46,340 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:57:46,340 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:57:46,340 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:57:46,341 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:57:46,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:57:46,341 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:57:46,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:57:46,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:57:46,342 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:57:46,342 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:57:46,342 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:57:46,343 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:57:46,343 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:57:46,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:57:46,344 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:57:46,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:57:46,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:57:46,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:57:46,345 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:57:46,345 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:57:46,345 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:57:46,346 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:57:46,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:57:46,346 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:57:46,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:57:46,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:57:46,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:57:46,347 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:57:46,347 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:57:46,348 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:57:46,349 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:57:46,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:57:46,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:57:46,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:57:46,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:57:46,352 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:57:46,352 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:57:46,355 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:57:46,356 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:57:46,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:57:46,356 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 09:57:46,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:57:46,357 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:57:46,359 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 09:57:46,359 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:57:46,375 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:57:46,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 [2018-11-10 09:57:46,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:57:46,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:57:46,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:57:46,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:57:46,378 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:57:46,378 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:57:46,382 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:57:46,383 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:57:46,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:57:46,383 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:57:46,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:57:46,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:57:46,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:57:46,384 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:57:46,384 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:57:46,386 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:57:46,386 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:57:46,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:57:46,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:57:46,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:57:46,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:57:46,388 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:57:46,389 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:57:46,393 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:57:46,394 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:57:46,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:57:46,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:57:46,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:57:46,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:57:46,397 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:57:46,397 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:57:46,407 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:57:46,407 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:57:46,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:57:46,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:57:46,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:57:46,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:57:46,409 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:57:46,409 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:57:46,414 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:57:46,414 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:57:46,415 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:57:46,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:57:46,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:57:46,415 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:57:46,418 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:57:46,418 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:57:46,445 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 09:57:46,478 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-10 09:57:46,478 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-10 09:57:46,480 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 09:57:46,482 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 09:57:46,482 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 09:57:46,483 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#aa~0.base)_1, ULTIMATE.start_main_~a~0, ULTIMATE.start_main_~#aa~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_~#aa~0.base)_1 - 4*ULTIMATE.start_main_~a~0 - 1*ULTIMATE.start_main_~#aa~0.offset Supporting invariants [] [2018-11-10 09:57:46,501 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-10 09:57:46,513 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 09:57:46,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:57:46,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:57:46,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:57:46,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:57:46,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:57:46,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:57:46,568 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 09:57:46,569 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 4 states. [2018-11-10 09:57:46,605 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 4 states. Result 44 states and 53 transitions. Complement of second has 8 states. [2018-11-10 09:57:46,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 09:57:46,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 09:57:46,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2018-11-10 09:57:46,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 2 letters. Loop has 3 letters. [2018-11-10 09:57:46,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:57:46,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 5 letters. Loop has 3 letters. [2018-11-10 09:57:46,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:57:46,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 2 letters. Loop has 6 letters. [2018-11-10 09:57:46,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:57:46,610 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 53 transitions. [2018-11-10 09:57:46,612 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:57:46,614 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 16 states and 18 transitions. [2018-11-10 09:57:46,615 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-10 09:57:46,616 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-10 09:57:46,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 18 transitions. [2018-11-10 09:57:46,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:57:46,616 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-11-10 09:57:46,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 18 transitions. [2018-11-10 09:57:46,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-10 09:57:46,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-10 09:57:46,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-11-10 09:57:46,634 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-11-10 09:57:46,634 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-11-10 09:57:46,634 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 09:57:46,634 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 18 transitions. [2018-11-10 09:57:46,634 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:57:46,635 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:57:46,635 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:57:46,635 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 09:57:46,635 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:57:46,635 INFO L793 eck$LassoCheckResult]: Stem: 130#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 126#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~post1, main_#t~mem0, main_#t~mem3, main_#t~post2, main_~#aa~0.base, main_~#aa~0.offset, main_~a~0, main_~x~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 400000;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#aa~0.base, main_~#aa~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~a~0 := 0; 127#L6-4 assume true; 117#L6-1 SUMMARY for call main_#t~mem0 := read~int(main_~#aa~0.base, main_~#aa~0.offset + main_~a~0 * 4, 4); srcloc: L6-1 118#L6-2 assume !(main_#t~mem0 >= 0);havoc main_#t~mem0; 131#L6-5 havoc main_~x~0;main_~x~0 := 0; 121#L10-4 [2018-11-10 09:57:46,635 INFO L795 eck$LassoCheckResult]: Loop: 121#L10-4 assume true; 122#L10-1 assume !!(main_~x~0 < main_~a~0); 124#L11 SUMMARY for call main_#t~mem3 := read~int(main_~#aa~0.base, main_~#aa~0.offset + main_~x~0 * 4, 4); srcloc: L11 128#L11-1 assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if main_#t~mem3 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 129#L2 assume !(__VERIFIER_assert_~cond == 0); 125#L2-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3; 123#L10-3 main_#t~post2 := main_~x~0;main_~x~0 := main_#t~post2 + 1;havoc main_#t~post2; 121#L10-4 [2018-11-10 09:57:46,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:57:46,636 INFO L82 PathProgramCache]: Analyzing trace with hash 889537515, now seen corresponding path program 1 times [2018-11-10 09:57:46,636 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:57:46,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:57:46,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:57:46,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:57:46,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:57:46,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:57:46,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:57:46,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:57:46,649 INFO L82 PathProgramCache]: Analyzing trace with hash -324286882, now seen corresponding path program 1 times [2018-11-10 09:57:46,649 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:57:46,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:57:46,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:57:46,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:57:46,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:57:46,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:57:46,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:57:46,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:57:46,658 INFO L82 PathProgramCache]: Analyzing trace with hash -627562700, now seen corresponding path program 1 times [2018-11-10 09:57:46,659 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:57:46,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:57:46,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:57:46,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:57:46,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:57:46,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:57:46,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:57:46,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:57:46,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 09:57:46,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 09:57:46,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 09:57:46,778 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. cyclomatic complexity: 4 Second operand 4 states. [2018-11-10 09:57:46,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:57:46,802 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-11-10 09:57:46,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 09:57:46,803 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 25 transitions. [2018-11-10 09:57:46,804 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:57:46,805 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 18 states and 19 transitions. [2018-11-10 09:57:46,805 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-10 09:57:46,805 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-10 09:57:46,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 19 transitions. [2018-11-10 09:57:46,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:57:46,805 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-10 09:57:46,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 19 transitions. [2018-11-10 09:57:46,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2018-11-10 09:57:46,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-10 09:57:46,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-11-10 09:57:46,807 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-11-10 09:57:46,807 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-11-10 09:57:46,807 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 09:57:46,807 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 17 transitions. [2018-11-10 09:57:46,807 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 09:57:46,807 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:57:46,807 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:57:46,809 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2018-11-10 09:57:46,809 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:57:46,809 INFO L793 eck$LassoCheckResult]: Stem: 181#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 177#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~post1, main_#t~mem0, main_#t~mem3, main_#t~post2, main_~#aa~0.base, main_~#aa~0.offset, main_~a~0, main_~x~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 400000;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#aa~0.base, main_~#aa~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~a~0 := 0; 178#L6-4 assume true; 170#L6-1 SUMMARY for call main_#t~mem0 := read~int(main_~#aa~0.base, main_~#aa~0.offset + main_~a~0 * 4, 4); srcloc: L6-1 171#L6-2 assume !!(main_#t~mem0 >= 0);havoc main_#t~mem0;main_#t~post1 := main_~a~0;main_~a~0 := main_#t~post1 + 1;havoc main_#t~post1; 183#L6-4 assume true; 168#L6-1 SUMMARY for call main_#t~mem0 := read~int(main_~#aa~0.base, main_~#aa~0.offset + main_~a~0 * 4, 4); srcloc: L6-1 169#L6-2 assume !(main_#t~mem0 >= 0);havoc main_#t~mem0; 182#L6-5 havoc main_~x~0;main_~x~0 := 0; 172#L10-4 [2018-11-10 09:57:46,809 INFO L795 eck$LassoCheckResult]: Loop: 172#L10-4 assume true; 173#L10-1 assume !!(main_~x~0 < main_~a~0); 175#L11 SUMMARY for call main_#t~mem3 := read~int(main_~#aa~0.base, main_~#aa~0.offset + main_~x~0 * 4, 4); srcloc: L11 179#L11-1 assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if main_#t~mem3 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 180#L2 assume !(__VERIFIER_assert_~cond == 0); 176#L2-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3; 174#L10-3 main_#t~post2 := main_~x~0;main_~x~0 := main_#t~post2 + 1;havoc main_#t~post2; 172#L10-4 [2018-11-10 09:57:46,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:57:46,809 INFO L82 PathProgramCache]: Analyzing trace with hash 265420432, now seen corresponding path program 1 times [2018-11-10 09:57:46,809 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:57:46,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:57:46,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:57:46,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:57:46,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:57:46,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:57:46,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:57:46,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:57:46,824 INFO L82 PathProgramCache]: Analyzing trace with hash -324286882, now seen corresponding path program 2 times [2018-11-10 09:57:46,824 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:57:46,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:57:46,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:57:46,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:57:46,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:57:46,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:57:46,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:57:46,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:57:46,833 INFO L82 PathProgramCache]: Analyzing trace with hash 285743343, now seen corresponding path program 1 times [2018-11-10 09:57:46,833 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:57:46,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:57:46,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:57:46,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:57:46,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:57:46,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:57:46,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:57:47,031 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:57:47,031 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:57:47,032 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:57:47,032 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:57:47,032 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 09:57:47,032 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:57:47,032 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:57:47,032 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:57:47,032 INFO L131 ssoRankerPreferences]: Filename of dumped script: standard_vararg_true-unreach-call_ground_true-termination.i_Iteration3_Lasso [2018-11-10 09:57:47,032 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:57:47,032 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:57:47,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:57:47,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:57:47,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:57:47,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:57:47,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:57:47,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:57:47,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:57:47,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:57:47,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:57:47,268 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:57:47,268 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 09:57:47,268 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:57:47,269 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:57:47,269 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:57:47,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:57:47,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:57:47,269 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:57:47,270 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:57:47,270 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:57:47,271 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:57:47,271 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:57:47,271 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:57:47,271 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:57:47,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:57:47,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:57:47,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:57:47,272 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:57:47,272 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:57:47,273 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:57:47,273 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:57:47,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:57:47,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:57:47,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:57:47,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:57:47,275 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:57:47,275 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:57:47,281 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:57:47,281 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:57:47,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:57:47,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:57:47,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:57:47,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:57:47,283 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:57:47,283 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:57:47,288 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:57:47,288 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:57:47,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:57:47,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:57:47,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:57:47,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:57:47,292 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:57:47,292 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:57:47,306 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 09:57:47,318 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 09:57:47,318 INFO L444 ModelExtractionUtils]: 17 out of 25 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-10 09:57:47,319 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 09:57:47,320 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 09:57:47,320 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 09:57:47,320 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~a~0, ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~a~0 - 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2018-11-10 09:57:47,328 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-10 09:57:47,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:57:47,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:57:47,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:57:47,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:57:47,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:57:47,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:57:47,384 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 09:57:47,384 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 17 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-11-10 09:57:47,405 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 17 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 23 states and 25 transitions. Complement of second has 6 states. [2018-11-10 09:57:47,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 09:57:47,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 09:57:47,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-11-10 09:57:47,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 7 letters. [2018-11-10 09:57:47,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:57:47,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 16 letters. Loop has 7 letters. [2018-11-10 09:57:47,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:57:47,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 14 letters. [2018-11-10 09:57:47,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:57:47,407 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 25 transitions. [2018-11-10 09:57:47,407 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 09:57:47,407 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 0 states and 0 transitions. [2018-11-10 09:57:47,408 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 09:57:47,408 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 09:57:47,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 09:57:47,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 09:57:47,408 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 09:57:47,408 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 09:57:47,408 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 09:57:47,408 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 09:57:47,408 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 09:57:47,408 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 09:57:47,408 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 09:57:47,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 09:57:47 BoogieIcfgContainer [2018-11-10 09:57:47,414 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 09:57:47,414 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 09:57:47,414 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 09:57:47,414 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 09:57:47,415 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:57:45" (3/4) ... [2018-11-10 09:57:47,418 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 09:57:47,418 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 09:57:47,419 INFO L168 Benchmark]: Toolchain (without parser) took 2116.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 959.2 MB in the beginning and 1.1 GB in the end (delta: -107.8 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. [2018-11-10 09:57:47,420 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 09:57:47,421 INFO L168 Benchmark]: CACSL2BoogieTranslator took 145.13 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 947.4 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-11-10 09:57:47,421 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.65 ms. Allocated memory is still 1.0 GB. Free memory was 947.4 MB in the beginning and 944.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 09:57:47,422 INFO L168 Benchmark]: Boogie Preprocessor took 47.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -184.8 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-10 09:57:47,422 INFO L168 Benchmark]: RCFGBuilder took 143.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-10 09:57:47,423 INFO L168 Benchmark]: BuchiAutomizer took 1751.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.5 MB). Peak memory consumption was 45.5 MB. Max. memory is 11.5 GB. [2018-11-10 09:57:47,423 INFO L168 Benchmark]: Witness Printer took 3.73 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 09:57:47,428 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 145.13 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 947.4 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.65 ms. Allocated memory is still 1.0 GB. Free memory was 947.4 MB in the beginning and 944.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -184.8 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 143.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1751.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.5 MB). Peak memory consumption was 45.5 MB. Max. memory is 11.5 GB. * Witness Printer took 3.73 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[aa] + -4 * a + -1 * aa and consists of 5 locations. One deterministic module has affine ranking function a + -1 * x and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.7s and 4 iterations. TraceHistogramMax:2. Analysis of lassos took 1.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 16 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 33 SDtfs, 30 SDslu, 31 SDs, 0 SdLazy, 32 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital106 mio100 ax100 hnf100 lsp91 ukn101 mio100 lsp48 div100 bol100 ite100 ukn100 eq179 hnf87 smp100 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...