./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-linkedlists/cll_search-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_51713917-6317-4f8e-b2a7-40e53ba2ab90/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_51713917-6317-4f8e-b2a7-40e53ba2ab90/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_51713917-6317-4f8e-b2a7-40e53ba2ab90/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_51713917-6317-4f8e-b2a7-40e53ba2ab90/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-linkedlists/cll_search-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_51713917-6317-4f8e-b2a7-40e53ba2ab90/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_51713917-6317-4f8e-b2a7-40e53ba2ab90/bin/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 64bit --witnessprinter.graph.data.programhash 34137da927ca86d2fb49adf8270ebc903b8c1dbe ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:24:24,647 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:24:24,649 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:24:24,666 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:24:24,666 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:24:24,668 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:24:24,670 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:24:24,679 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:24:24,684 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:24:24,688 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:24:24,691 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:24:24,692 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:24:24,693 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:24:24,695 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:24:24,697 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:24:24,698 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:24:24,699 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:24:24,699 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:24:24,702 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:24:24,706 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:24:24,710 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:24:24,712 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:24:24,715 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:24:24,716 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:24:24,718 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:24:24,718 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:24:24,718 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:24:24,719 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:24:24,719 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:24:24,720 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:24:24,720 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:24:24,721 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:24:24,722 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:24:24,722 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:24:24,723 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:24:24,724 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:24:24,724 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:24:24,724 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:24:24,725 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:24:24,725 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:24:24,726 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:24:24,727 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_51713917-6317-4f8e-b2a7-40e53ba2ab90/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 23:24:24,741 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:24:24,741 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:24:24,742 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:24:24,743 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:24:24,743 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:24:24,743 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 23:24:24,743 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 23:24:24,743 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 23:24:24,743 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 23:24:24,744 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 23:24:24,744 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 23:24:24,744 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:24:24,744 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:24:24,744 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:24:24,745 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:24:24,745 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 23:24:24,745 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 23:24:24,745 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 23:24:24,745 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:24:24,746 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 23:24:24,746 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:24:24,746 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 23:24:24,746 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:24:24,746 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:24:24,747 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 23:24:24,747 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:24:24,747 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:24:24,750 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 23:24:24,751 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 23:24:24,754 INFO L138 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/run_dir_51713917-6317-4f8e-b2a7-40e53ba2ab90/bin/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 34137da927ca86d2fb49adf8270ebc903b8c1dbe [2019-11-15 23:24:24,786 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:24:24,800 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:24:24,803 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:24:24,804 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:24:24,805 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:24:24,805 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_51713917-6317-4f8e-b2a7-40e53ba2ab90/bin/uautomizer/../../sv-benchmarks/c/termination-memory-linkedlists/cll_search-alloca-2.i [2019-11-15 23:24:24,884 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_51713917-6317-4f8e-b2a7-40e53ba2ab90/bin/uautomizer/data/70c277110/c17dd5ce49f64c62abcc0863a586d1e5/FLAGaae084588 [2019-11-15 23:24:25,394 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:24:25,395 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_51713917-6317-4f8e-b2a7-40e53ba2ab90/sv-benchmarks/c/termination-memory-linkedlists/cll_search-alloca-2.i [2019-11-15 23:24:25,418 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_51713917-6317-4f8e-b2a7-40e53ba2ab90/bin/uautomizer/data/70c277110/c17dd5ce49f64c62abcc0863a586d1e5/FLAGaae084588 [2019-11-15 23:24:25,717 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_51713917-6317-4f8e-b2a7-40e53ba2ab90/bin/uautomizer/data/70c277110/c17dd5ce49f64c62abcc0863a586d1e5 [2019-11-15 23:24:25,720 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:24:25,722 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:24:25,723 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:24:25,723 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:24:25,727 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:24:25,728 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:24:25" (1/1) ... [2019-11-15 23:24:25,731 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f168ca0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:25, skipping insertion in model container [2019-11-15 23:24:25,731 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:24:25" (1/1) ... [2019-11-15 23:24:25,738 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:24:25,781 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:24:26,146 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:24:26,157 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:24:26,205 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:24:26,264 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:24:26,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:26 WrapperNode [2019-11-15 23:24:26,265 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:24:26,266 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:24:26,266 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:24:26,267 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:24:26,275 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:26" (1/1) ... [2019-11-15 23:24:26,300 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:26" (1/1) ... [2019-11-15 23:24:26,318 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:24:26,321 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:24:26,321 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:24:26,321 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:24:26,329 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:26" (1/1) ... [2019-11-15 23:24:26,329 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:26" (1/1) ... [2019-11-15 23:24:26,344 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:26" (1/1) ... [2019-11-15 23:24:26,345 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:26" (1/1) ... [2019-11-15 23:24:26,358 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:26" (1/1) ... [2019-11-15 23:24:26,362 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:26" (1/1) ... [2019-11-15 23:24:26,364 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:26" (1/1) ... [2019-11-15 23:24:26,367 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:24:26,367 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:24:26,374 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:24:26,375 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:24:26,376 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_51713917-6317-4f8e-b2a7-40e53ba2ab90/bin/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 [2019-11-15 23:24:26,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 23:24:26,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:24:26,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 23:24:26,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 23:24:26,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 23:24:26,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:24:26,438 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:24:26,730 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:24:26,731 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-11-15 23:24:26,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:24:26 BoogieIcfgContainer [2019-11-15 23:24:26,732 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:24:26,733 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 23:24:26,733 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 23:24:26,736 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 23:24:26,737 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:24:26,738 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 11:24:25" (1/3) ... [2019-11-15 23:24:26,739 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7f95f850 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:24:26, skipping insertion in model container [2019-11-15 23:24:26,739 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:24:26,739 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:24:26" (2/3) ... [2019-11-15 23:24:26,740 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7f95f850 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:24:26, skipping insertion in model container [2019-11-15 23:24:26,740 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:24:26,740 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:24:26" (3/3) ... [2019-11-15 23:24:26,742 INFO L371 chiAutomizerObserver]: Analyzing ICFG cll_search-alloca-2.i [2019-11-15 23:24:26,793 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 23:24:26,793 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 23:24:26,793 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 23:24:26,793 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:24:26,793 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:24:26,793 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 23:24:26,793 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:24:26,793 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 23:24:26,808 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-11-15 23:24:26,829 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-15 23:24:26,829 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:24:26,829 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:24:26,835 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 23:24:26,835 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 23:24:26,835 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 23:24:26,835 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-11-15 23:24:26,836 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-15 23:24:26,837 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:24:26,837 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:24:26,837 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 23:24:26,837 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 23:24:26,843 INFO L791 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~ret8.base, main_#t~ret8.offset, main_#t~nondet9, main_~n~0, main_~head~1.base, main_~head~1.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7;init_cll_#in~n := main_~n~0;havoc init_cll_#res.base, init_cll_#res.offset;havoc init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset, init_cll_#t~malloc4.base, init_cll_#t~malloc4.offset, init_cll_#t~post3, init_cll_~i~0, init_cll_~next_node~0.base, init_cll_~next_node~0.offset, init_cll_~n, init_cll_~head~0.base, init_cll_~head~0.offset, init_cll_~curr~0.base, init_cll_~curr~0.offset;init_cll_~n := init_cll_#in~n;havoc init_cll_~head~0.base, init_cll_~head~0.offset;call init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset := #Ultimate.allocOnHeap(12);init_cll_~curr~0.base, init_cll_~curr~0.offset := init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset;call write~int(0, init_cll_~curr~0.base, init_cll_~curr~0.offset, 4);init_cll_~head~0.base, init_cll_~head~0.offset := init_cll_~curr~0.base, init_cll_~curr~0.offset;init_cll_~i~0 := 1; 13#L552-3true [2019-11-15 23:24:26,843 INFO L793 eck$LassoCheckResult]: Loop: 13#L552-3true assume !!(init_cll_~i~0 < init_cll_~n);call init_cll_#t~malloc4.base, init_cll_#t~malloc4.offset := #Ultimate.allocOnHeap(12);init_cll_~next_node~0.base, init_cll_~next_node~0.offset := init_cll_#t~malloc4.base, init_cll_#t~malloc4.offset;call write~int(init_cll_~i~0, init_cll_~next_node~0.base, init_cll_~next_node~0.offset, 4);call write~$Pointer$(init_cll_~next_node~0.base, init_cll_~next_node~0.offset, init_cll_~curr~0.base, 4 + init_cll_~curr~0.offset, 8);init_cll_~curr~0.base, init_cll_~curr~0.offset := init_cll_~next_node~0.base, init_cll_~next_node~0.offset; 11#L552-2true init_cll_#t~post3 := init_cll_~i~0;init_cll_~i~0 := 1 + init_cll_#t~post3;havoc init_cll_#t~post3; 13#L552-3true [2019-11-15 23:24:26,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:26,848 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-15 23:24:26,854 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:26,855 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137266798] [2019-11-15 23:24:26,855 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:26,855 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:26,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:26,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:26,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:26,985 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:24:26,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:26,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2019-11-15 23:24:26,987 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:26,987 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297852189] [2019-11-15 23:24:26,987 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:26,987 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:26,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:27,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:27,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:27,023 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:24:27,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:27,025 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-11-15 23:24:27,025 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:27,025 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826637311] [2019-11-15 23:24:27,026 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:27,026 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:27,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:27,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:27,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:27,098 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:24:27,436 WARN L191 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 82 [2019-11-15 23:24:27,505 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:24:27,655 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-15 23:24:27,656 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:24:27,665 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:24:27,821 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-11-15 23:24:27,821 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:24:27,824 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:24:27,824 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:156, output treesize:158 [2019-11-15 23:24:27,959 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-11-15 23:24:28,176 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-11-15 23:24:28,284 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:24:28,285 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:24:28,285 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:24:28,286 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:24:28,286 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:24:28,286 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:24:28,286 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:24:28,287 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:24:28,287 INFO L131 ssoRankerPreferences]: Filename of dumped script: cll_search-alloca-2.i_Iteration1_Lasso [2019-11-15 23:24:28,287 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:24:28,287 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:24:28,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:28,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:28,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:28,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:28,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:28,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:28,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:28,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:28,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:28,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:28,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:28,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:28,748 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-11-15 23:24:28,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:24:29,231 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:24:29,237 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:24:29,239 INFO L120 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-11-15 23:24:29,242 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:29,242 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:29,244 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:29,244 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:29,244 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:29,249 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:29,249 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:29,252 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:29,254 INFO L120 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-11-15 23:24:29,256 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:29,259 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:29,260 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:29,260 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:29,260 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:29,261 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:29,262 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:29,264 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:29,265 INFO L120 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-11-15 23:24:29,266 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:29,266 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:29,267 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:29,267 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:29,275 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:29,276 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:29,277 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:29,282 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:29,283 INFO L120 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-11-15 23:24:29,284 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:29,285 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:29,285 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:29,286 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:29,286 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:29,286 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:29,287 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:29,288 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:29,289 INFO L120 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-11-15 23:24:29,291 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:29,291 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:29,291 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:29,292 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:29,292 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:29,293 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:29,293 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:29,295 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:29,296 INFO L120 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-11-15 23:24:29,298 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:29,299 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:29,299 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:29,299 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:29,304 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:24:29,304 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:24:29,316 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:29,331 INFO L120 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-11-15 23:24:29,332 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:29,333 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:29,333 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:29,333 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:29,333 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:29,334 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:29,334 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:29,336 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:29,336 INFO L120 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-11-15 23:24:29,337 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:29,337 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:29,337 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:29,338 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:29,338 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:29,338 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:29,339 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:29,339 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:29,340 INFO L120 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-11-15 23:24:29,341 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:29,341 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:29,341 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:29,341 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:29,343 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:24:29,344 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:24:29,348 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:29,350 INFO L120 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-11-15 23:24:29,352 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:29,352 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:29,353 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:29,353 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:29,353 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:29,354 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:29,354 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:29,356 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:29,357 INFO L120 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-11-15 23:24:29,358 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:29,358 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:29,359 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:29,359 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:29,359 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:29,360 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:29,360 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:29,362 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:29,362 INFO L120 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-11-15 23:24:29,364 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:29,364 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:29,365 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:29,365 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:29,365 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:29,366 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:29,366 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:29,369 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:29,370 INFO L120 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-11-15 23:24:29,371 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:29,371 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:29,372 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:29,372 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:29,372 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:29,375 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:29,375 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:29,385 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:29,386 INFO L120 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-11-15 23:24:29,387 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:29,387 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:29,387 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:29,388 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:29,388 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:29,389 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:29,389 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:29,395 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:29,396 INFO L120 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-11-15 23:24:29,398 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:29,398 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:29,398 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:29,399 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:29,410 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:24:29,411 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:24:29,446 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:29,449 INFO L120 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-11-15 23:24:29,451 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:29,453 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:29,453 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:29,453 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:29,453 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:29,458 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:29,459 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:29,460 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:29,461 INFO L120 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-11-15 23:24:29,468 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:29,468 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:29,468 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:29,468 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:29,470 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:24:29,470 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:24:29,475 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:29,483 INFO L120 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-11-15 23:24:29,484 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:29,484 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:24:29,484 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:29,484 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:29,485 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:29,485 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:24:29,485 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:24:29,486 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:29,487 INFO L120 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-11-15 23:24:29,498 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:29,498 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:29,498 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:29,499 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:29,500 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:24:29,500 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:24:29,504 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:24:29,505 INFO L120 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-11-15 23:24:29,505 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:24:29,506 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:24:29,506 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:24:29,506 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:24:29,508 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:24:29,512 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:24:29,538 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:24:29,577 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-15 23:24:29,580 INFO L444 ModelExtractionUtils]: 10 out of 16 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-11-15 23:24:29,583 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:24:29,586 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 23:24:29,586 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:24:29,587 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_init_cll_~n, ULTIMATE.start_init_cll_~i~0) = 1*ULTIMATE.start_init_cll_~n - 1*ULTIMATE.start_init_cll_~i~0 Supporting invariants [] [2019-11-15 23:24:29,599 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-15 23:24:29,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:29,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:29,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:24:29,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:24:29,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:24:29,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:24:29,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:24:29,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:24:29,691 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 [2019-11-15 23:24:29,692 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states. Second operand 3 states. [2019-11-15 23:24:29,745 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states.. Second operand 3 states. Result 30 states and 39 transitions. Complement of second has 7 states. [2019-11-15 23:24:29,746 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 [2019-11-15 23:24:29,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 23:24:29,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2019-11-15 23:24:29,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 2 letters. Loop has 2 letters. [2019-11-15 23:24:29,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:24:29,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-15 23:24:29,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:24:29,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 2 letters. Loop has 4 letters. [2019-11-15 23:24:29,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:24:29,753 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2019-11-15 23:24:29,761 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 23:24:29,766 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 9 states and 11 transitions. [2019-11-15 23:24:29,767 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-15 23:24:29,767 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-15 23:24:29,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2019-11-15 23:24:29,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:24:29,769 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-11-15 23:24:29,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2019-11-15 23:24:29,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-11-15 23:24:29,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-15 23:24:29,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2019-11-15 23:24:29,798 INFO L711 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-11-15 23:24:29,799 INFO L591 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-11-15 23:24:29,799 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 23:24:29,799 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2019-11-15 23:24:29,800 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 23:24:29,800 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:24:29,800 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:24:29,801 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 23:24:29,801 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 23:24:29,803 INFO L791 eck$LassoCheckResult]: Stem: 99#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 93#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~ret8.base, main_#t~ret8.offset, main_#t~nondet9, main_~n~0, main_~head~1.base, main_~head~1.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7;init_cll_#in~n := main_~n~0;havoc init_cll_#res.base, init_cll_#res.offset;havoc init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset, init_cll_#t~malloc4.base, init_cll_#t~malloc4.offset, init_cll_#t~post3, init_cll_~i~0, init_cll_~next_node~0.base, init_cll_~next_node~0.offset, init_cll_~n, init_cll_~head~0.base, init_cll_~head~0.offset, init_cll_~curr~0.base, init_cll_~curr~0.offset;init_cll_~n := init_cll_#in~n;havoc init_cll_~head~0.base, init_cll_~head~0.offset;call init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset := #Ultimate.allocOnHeap(12);init_cll_~curr~0.base, init_cll_~curr~0.offset := init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset;call write~int(0, init_cll_~curr~0.base, init_cll_~curr~0.offset, 4);init_cll_~head~0.base, init_cll_~head~0.offset := init_cll_~curr~0.base, init_cll_~curr~0.offset;init_cll_~i~0 := 1; 94#L552-3 assume !(init_cll_~i~0 < init_cll_~n); 95#L552-4 call write~$Pointer$(init_cll_~head~0.base, init_cll_~head~0.offset, init_cll_~curr~0.base, 4 + init_cll_~curr~0.offset, 8);init_cll_#res.base, init_cll_#res.offset := init_cll_~head~0.base, init_cll_~head~0.offset; 96#L559 main_#t~ret8.base, main_#t~ret8.offset := init_cll_#res.base, init_cll_#res.offset;main_~head~1.base, main_~head~1.offset := main_#t~ret8.base, main_#t~ret8.offset;havoc main_#t~ret8.base, main_#t~ret8.offset;search_#in~head.base, search_#in~head.offset, search_#in~i := main_~head~1.base, main_~head~1.offset, main_#t~nondet9;havoc search_#t~mem6.base, search_#t~mem6.offset, search_#t~mem5, search_~head.base, search_~head.offset, search_~i, search_~curr~1.base, search_~curr~1.offset;search_~head.base, search_~head.offset := search_#in~head.base, search_#in~head.offset;search_~i := search_#in~i;search_~curr~1.base, search_~curr~1.offset := search_~head.base, search_~head.offset; 98#L564-3 [2019-11-15 23:24:29,803 INFO L793 eck$LassoCheckResult]: Loop: 98#L564-3 call search_#t~mem5 := read~int(search_~curr~1.base, search_~curr~1.offset, 4); 97#L564-1 assume !!(search_#t~mem5 != search_~i);havoc search_#t~mem5;call search_#t~mem6.base, search_#t~mem6.offset := read~$Pointer$(search_~curr~1.base, 4 + search_~curr~1.offset, 8);search_~curr~1.base, search_~curr~1.offset := search_#t~mem6.base, search_#t~mem6.offset;havoc search_#t~mem6.base, search_#t~mem6.offset; 98#L564-3 [2019-11-15 23:24:29,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:29,804 INFO L82 PathProgramCache]: Analyzing trace with hash 28696935, now seen corresponding path program 1 times [2019-11-15 23:24:29,804 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:29,805 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299258645] [2019-11-15 23:24:29,805 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:29,805 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:29,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:29,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:29,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:29,872 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:24:29,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:29,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1702, now seen corresponding path program 1 times [2019-11-15 23:24:29,873 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:29,873 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357082117] [2019-11-15 23:24:29,874 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:29,874 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:29,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:29,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:29,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:29,887 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:24:29,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:24:29,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1807951500, now seen corresponding path program 1 times [2019-11-15 23:24:29,891 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:24:29,891 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292243968] [2019-11-15 23:24:29,891 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:29,891 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:24:29,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:24:29,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:29,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:24:29,936 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:24:30,488 WARN L191 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 114 [2019-11-15 23:24:30,508 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:24:30,650 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-11-15 23:24:30,651 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:24:30,664 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:24:30,772 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-11-15 23:24:30,772 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:24:30,774 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:24:30,774 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:186, output treesize:162 [2019-11-15 23:24:30,918 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-11-15 23:24:30,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 11:24:30 BoogieIcfgContainer [2019-11-15 23:24:30,960 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 23:24:30,961 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:24:30,961 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:24:30,961 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:24:30,962 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:24:26" (3/4) ... [2019-11-15 23:24:30,964 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-15 23:24:31,034 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_51713917-6317-4f8e-b2a7-40e53ba2ab90/bin/uautomizer/witness.graphml [2019-11-15 23:24:31,035 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:24:31,036 INFO L168 Benchmark]: Toolchain (without parser) took 5314.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 938.0 MB in the beginning and 957.6 MB in the end (delta: -19.6 MB). Peak memory consumption was 111.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:24:31,036 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:24:31,037 INFO L168 Benchmark]: CACSL2BoogieTranslator took 542.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -176.6 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:24:31,038 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.71 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:24:31,038 INFO L168 Benchmark]: Boogie Preprocessor took 46.13 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:24:31,039 INFO L168 Benchmark]: RCFGBuilder took 365.29 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: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2019-11-15 23:24:31,040 INFO L168 Benchmark]: BuchiAutomizer took 4227.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 964.6 MB in the end (delta: 121.5 MB). Peak memory consumption was 121.5 MB. Max. memory is 11.5 GB. [2019-11-15 23:24:31,040 INFO L168 Benchmark]: Witness Printer took 74.02 ms. Allocated memory is still 1.2 GB. Free memory was 964.6 MB in the beginning and 957.6 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:24:31,043 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 542.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -176.6 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.71 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.13 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 365.29 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: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4227.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 964.6 MB in the end (delta: 121.5 MB). Peak memory consumption was 121.5 MB. Max. memory is 11.5 GB. * Witness Printer took 74.02 ms. Allocated memory is still 1.2 GB. Free memory was 964.6 MB in the beginning and 957.6 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. 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 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function n + -1 * i and consists of 5 locations. The remainder module has 9 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.1s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 3.8s. 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 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 9 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 10 SDtfs, 10 SDslu, 16 SDs, 0 SdLazy, 6 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital260 mio100 ax100 hnf100 lsp97 ukn43 mio100 lsp25 div100 bol100 ite100 ukn100 eq185 hnf92 smp100 dnf170 smp100 tf100 neg95 sie120 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 564]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=-2} State at position 1 is {i=1, NULL=0, curr=-1, \result=0, head=0, NULL=-2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@72a6e9da=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@14bb0b07=0, next_node=0, \result=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7b6798a3=2, next_node=0, head=-1, head=-1, \old(i)=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@72a6e9da=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1a88104f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@421e457e=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@16ff5bb7=0, i=2, curr=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@10517c92=0, head=-1, \old(n)=0, n=0, head=-1, head=0, n=0, head=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3d7ab569=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@10517c92=0, curr=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3d7ab569=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@421e457e=0, curr=-1, head=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 564]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L570] int n = __VERIFIER_nondet_int(); [L548] node_t* head; [L549] node_t* curr = malloc(sizeof(node_t)); [L550] curr->val = 0 [L551] head = curr [L552] int i = 1; [L552] COND FALSE !(i < n) [L558] curr->next = head [L559] return head; [L571] node_t* head = init_cll(n); [L563] node_t* curr = head; Loop: [L564] EXPR curr->val [L564] COND TRUE curr->val != i [L565] EXPR curr->next [L565] curr = curr->next End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...