./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/working_dir_7217b3f8-c30d-412c-a573-63b1628d7398/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7217b3f8-c30d-412c-a573-63b1628d7398/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7217b3f8-c30d-412c-a573-63b1628d7398/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7217b3f8-c30d-412c-a573-63b1628d7398/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-linkedlists/cll_search-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/working_dir_7217b3f8-c30d-412c-a573-63b1628d7398/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7217b3f8-c30d-412c-a573-63b1628d7398/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-10-22 08:56:55,219 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:56:55,221 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:56:55,230 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:56:55,230 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:56:55,231 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:56:55,232 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:56:55,233 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:56:55,234 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:56:55,235 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:56:55,236 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:56:55,236 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:56:55,237 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:56:55,238 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:56:55,238 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:56:55,239 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:56:55,240 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:56:55,241 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:56:55,242 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:56:55,244 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:56:55,245 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:56:55,246 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:56:55,247 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:56:55,248 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:56:55,250 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:56:55,250 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:56:55,251 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:56:55,252 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:56:55,252 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:56:55,253 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:56:55,253 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:56:55,254 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:56:55,255 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:56:55,255 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:56:55,256 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:56:55,257 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:56:55,257 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:56:55,258 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:56:55,258 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:56:55,259 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:56:55,259 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:56:55,260 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7217b3f8-c30d-412c-a573-63b1628d7398/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 08:56:55,273 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:56:55,273 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:56:55,274 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:56:55,275 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:56:55,275 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:56:55,275 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:56:55,275 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:56:55,275 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:56:55,275 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:56:55,276 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:56:55,276 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:56:55,276 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:56:55,276 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:56:55,276 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:56:55,276 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:56:55,276 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:56:55,277 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:56:55,277 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:56:55,277 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:56:55,277 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:56:55,277 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:56:55,277 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:56:55,277 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:56:55,278 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:56:55,278 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:56:55,278 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:56:55,278 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:56:55,278 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:56:55,279 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:56:55,279 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/working_dir_7217b3f8-c30d-412c-a573-63b1628d7398/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-10-22 08:56:55,302 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:56:55,312 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:56:55,315 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:56:55,317 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:56:55,317 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:56:55,318 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7217b3f8-c30d-412c-a573-63b1628d7398/bin/uautomizer/../../sv-benchmarks/c/termination-memory-linkedlists/cll_search-alloca-2.i [2019-10-22 08:56:55,369 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7217b3f8-c30d-412c-a573-63b1628d7398/bin/uautomizer/data/0a2dff567/8a2a6cd7585b4cc2a69b2c1bf277233d/FLAG6bb910545 [2019-10-22 08:56:55,809 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:56:55,809 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7217b3f8-c30d-412c-a573-63b1628d7398/sv-benchmarks/c/termination-memory-linkedlists/cll_search-alloca-2.i [2019-10-22 08:56:55,818 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7217b3f8-c30d-412c-a573-63b1628d7398/bin/uautomizer/data/0a2dff567/8a2a6cd7585b4cc2a69b2c1bf277233d/FLAG6bb910545 [2019-10-22 08:56:55,830 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7217b3f8-c30d-412c-a573-63b1628d7398/bin/uautomizer/data/0a2dff567/8a2a6cd7585b4cc2a69b2c1bf277233d [2019-10-22 08:56:55,833 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:56:55,835 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:56:55,836 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:56:55,836 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:56:55,839 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:56:55,840 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:56:55" (1/1) ... [2019-10-22 08:56:55,843 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f6156a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:55, skipping insertion in model container [2019-10-22 08:56:55,843 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:56:55" (1/1) ... [2019-10-22 08:56:55,850 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:56:55,880 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:56:56,199 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:56:56,210 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:56:56,247 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:56:56,284 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:56:56,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:56 WrapperNode [2019-10-22 08:56:56,285 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:56:56,286 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:56:56,286 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:56:56,286 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:56:56,294 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:56" (1/1) ... [2019-10-22 08:56:56,307 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:56" (1/1) ... [2019-10-22 08:56:56,325 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:56:56,326 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:56:56,326 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:56:56,326 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:56:56,334 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:56" (1/1) ... [2019-10-22 08:56:56,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:56" (1/1) ... [2019-10-22 08:56:56,337 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:56" (1/1) ... [2019-10-22 08:56:56,337 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:56" (1/1) ... [2019-10-22 08:56:56,343 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:56" (1/1) ... [2019-10-22 08:56:56,347 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:56" (1/1) ... [2019-10-22 08:56:56,348 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:56" (1/1) ... [2019-10-22 08:56:56,350 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:56:56,350 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:56:56,350 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:56:56,351 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:56:56,351 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7217b3f8-c30d-412c-a573-63b1628d7398/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-10-22 08:56:56,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:56:56,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:56:56,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 08:56:56,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 08:56:56,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 08:56:56,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:56:56,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:56:56,766 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:56:56,767 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-22 08:56:56,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:56:56 BoogieIcfgContainer [2019-10-22 08:56:56,768 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:56:56,769 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:56:56,769 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:56:56,773 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:56:56,774 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:56:56,774 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:56:55" (1/3) ... [2019-10-22 08:56:56,775 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@27a28041 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:56:56, skipping insertion in model container [2019-10-22 08:56:56,775 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:56:56,775 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:56" (2/3) ... [2019-10-22 08:56:56,776 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@27a28041 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:56:56, skipping insertion in model container [2019-10-22 08:56:56,776 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:56:56,776 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:56:56" (3/3) ... [2019-10-22 08:56:56,778 INFO L371 chiAutomizerObserver]: Analyzing ICFG cll_search-alloca-2.i [2019-10-22 08:56:56,825 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:56:56,825 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:56:56,826 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:56:56,826 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:56:56,826 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:56:56,826 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:56:56,826 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:56:56,827 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:56:56,840 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-10-22 08:56:56,860 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-10-22 08:56:56,860 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:56,860 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:56,866 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:56:56,867 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:56,867 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:56:56,867 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-10-22 08:56:56,868 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-10-22 08:56:56,868 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:56,868 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:56,868 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:56:56,869 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:56,876 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-10-22 08:56:56,876 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-10-22 08:56:56,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:56,882 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-10-22 08:56:56,890 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:56,890 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258103234] [2019-10-22 08:56:56,891 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:56,891 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:56,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:56,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:57,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:57,035 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:57,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:57,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2019-10-22 08:56:57,037 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:57,038 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437682470] [2019-10-22 08:56:57,038 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:57,038 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:57,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:57,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:57,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:57,084 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:57,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:57,086 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-10-22 08:56:57,086 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:57,086 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355217873] [2019-10-22 08:56:57,086 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:57,086 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:57,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:57,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:57,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:57,177 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:57,450 WARN L191 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 82 [2019-10-22 08:56:57,497 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 08:56:57,646 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-10-22 08:56:57,647 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:57,653 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 08:56:57,746 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:57,748 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-22 08:56:57,748 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:156, output treesize:158 [2019-10-22 08:56:57,972 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-10-22 08:56:58,039 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:56:58,040 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:56:58,041 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:56:58,041 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:56:58,042 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:56:58,042 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:56:58,042 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:56:58,042 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:56:58,042 INFO L131 ssoRankerPreferences]: Filename of dumped script: cll_search-alloca-2.i_Iteration1_Lasso [2019-10-22 08:56:58,042 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:56:58,042 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:56:58,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:58,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:58,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:58,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:58,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:58,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:58,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:58,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:58,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:58,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:58,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:58,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:58,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:56:58,712 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:56:58,717 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:56:58,719 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-10-22 08:56:58,721 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:58,721 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:58,723 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:58,723 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:58,723 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:58,725 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:58,726 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:58,727 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:58,728 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-10-22 08:56:58,729 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:58,729 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:58,729 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:58,729 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:58,732 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:58,732 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:58,733 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:58,733 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:58,734 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-10-22 08:56:58,735 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:58,735 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:58,735 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:58,735 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:58,735 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:58,736 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:58,736 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:58,737 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:58,737 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-10-22 08:56:58,741 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:58,741 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:58,741 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:58,741 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:58,741 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:58,742 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:58,742 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:58,743 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:58,743 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-10-22 08:56:58,744 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:58,744 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:58,744 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:58,744 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:58,745 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:58,745 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:58,745 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:58,747 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:58,747 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-10-22 08:56:58,748 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:58,748 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:58,749 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:58,749 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:58,752 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:58,753 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:58,756 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:58,756 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-10-22 08:56:58,757 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:58,757 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:58,757 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:58,757 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:58,773 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:58,774 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:58,774 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:58,775 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:58,775 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-10-22 08:56:58,776 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:58,776 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:58,776 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:58,776 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:58,777 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:58,777 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:58,777 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:58,778 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:58,778 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-10-22 08:56:58,779 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:58,779 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:58,779 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:58,779 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:58,781 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:58,781 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:58,787 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:58,787 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-10-22 08:56:58,788 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:58,788 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:58,789 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:58,789 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:58,789 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:58,789 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:58,790 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:58,791 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:58,791 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-10-22 08:56:58,792 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:58,792 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:58,792 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:58,792 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:58,793 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:58,793 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:58,793 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:58,795 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:58,796 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-10-22 08:56:58,796 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:58,797 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:58,797 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:58,797 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:58,797 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:58,797 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:58,797 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:58,798 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:58,799 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-10-22 08:56:58,799 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:58,800 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:58,800 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:58,800 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:58,800 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:58,800 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:58,800 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:58,805 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:58,806 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-10-22 08:56:58,806 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:58,806 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:58,807 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:58,807 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:58,807 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:58,807 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:58,808 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:58,809 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:58,809 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-10-22 08:56:58,810 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:58,810 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:58,810 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:58,810 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:58,813 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:58,814 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:58,824 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:58,825 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-10-22 08:56:58,825 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:58,825 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:58,826 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:58,826 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:58,826 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:58,826 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:58,826 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:58,828 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:58,828 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-10-22 08:56:58,828 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:58,829 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:58,829 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:58,829 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:58,830 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:58,830 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:58,835 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:58,835 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-10-22 08:56:58,836 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:58,836 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:56:58,836 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:58,836 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:58,836 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:58,837 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:56:58,837 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:56:58,838 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:58,838 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-10-22 08:56:58,839 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:58,839 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:58,839 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:58,839 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:58,840 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:58,840 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:58,844 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:56:58,844 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-10-22 08:56:58,845 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:56:58,845 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:56:58,845 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:56:58,845 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:56:58,847 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:56:58,848 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:56:58,886 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:56:58,914 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-10-22 08:56:58,922 INFO L444 ModelExtractionUtils]: 10 out of 16 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-10-22 08:56:58,924 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:56:58,925 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:56:58,925 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:56:58,926 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-10-22 08:56:58,948 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-10-22 08:56:58,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:58,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:58,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:56:58,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:58,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:58,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:56:58,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:59,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:59,024 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-10-22 08:56:59,026 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states. Second operand 3 states. [2019-10-22 08:56:59,073 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-10-22 08:56:59,076 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-10-22 08:56:59,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:56:59,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2019-10-22 08:56:59,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 2 letters. Loop has 2 letters. [2019-10-22 08:56:59,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:59,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 4 letters. Loop has 2 letters. [2019-10-22 08:56:59,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:59,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 2 letters. Loop has 4 letters. [2019-10-22 08:56:59,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:56:59,083 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2019-10-22 08:56:59,085 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:56:59,089 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 9 states and 11 transitions. [2019-10-22 08:56:59,091 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-10-22 08:56:59,091 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-10-22 08:56:59,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2019-10-22 08:56:59,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:56:59,093 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-10-22 08:56:59,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2019-10-22 08:56:59,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-10-22 08:56:59,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-10-22 08:56:59,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2019-10-22 08:56:59,122 INFO L711 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-10-22 08:56:59,123 INFO L591 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-10-22 08:56:59,123 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:56:59,123 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2019-10-22 08:56:59,123 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:56:59,124 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:56:59,124 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:56:59,124 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:56:59,124 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:56:59,124 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-10-22 08:56:59,125 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-10-22 08:56:59,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:59,125 INFO L82 PathProgramCache]: Analyzing trace with hash 28696935, now seen corresponding path program 1 times [2019-10-22 08:56:59,125 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:59,127 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128153181] [2019-10-22 08:56:59,127 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:59,127 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:59,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:59,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:59,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:59,164 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:59,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:59,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1702, now seen corresponding path program 1 times [2019-10-22 08:56:59,165 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:59,165 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640873284] [2019-10-22 08:56:59,166 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:59,166 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:59,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:59,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:59,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:59,173 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:59,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:59,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1807951500, now seen corresponding path program 1 times [2019-10-22 08:56:59,177 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:59,177 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575499415] [2019-10-22 08:56:59,177 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:59,177 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:59,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:59,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:59,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:59,217 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:59,694 WARN L191 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 114 [2019-10-22 08:56:59,708 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 08:56:59,843 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-10-22 08:56:59,843 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:59,849 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 08:56:59,964 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-10-22 08:56:59,965 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:56:59,966 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-22 08:56:59,966 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:186, output treesize:162 [2019-10-22 08:57:00,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:57:00 BoogieIcfgContainer [2019-10-22 08:57:00,097 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:57:00,097 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:57:00,097 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:57:00,097 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:57:00,098 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:56:56" (3/4) ... [2019-10-22 08:57:00,101 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-10-22 08:57:00,165 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_7217b3f8-c30d-412c-a573-63b1628d7398/bin/uautomizer/witness.graphml [2019-10-22 08:57:00,165 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:57:00,167 INFO L168 Benchmark]: Toolchain (without parser) took 4332.46 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 235.4 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -192.0 MB). Peak memory consumption was 43.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:00,167 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:57:00,168 INFO L168 Benchmark]: CACSL2BoogieTranslator took 449.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -205.1 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:00,168 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:00,168 INFO L168 Benchmark]: Boogie Preprocessor took 24.44 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.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:00,169 INFO L168 Benchmark]: RCFGBuilder took 417.80 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.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:00,170 INFO L168 Benchmark]: BuchiAutomizer took 3328.05 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 75.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -20.0 MB). Peak memory consumption was 305.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:00,170 INFO L168 Benchmark]: Witness Printer took 68.23 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:00,173 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 449.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -205.1 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.44 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.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 417.80 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.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3328.05 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 75.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -20.0 MB). Peak memory consumption was 305.3 MB. Max. memory is 11.5 GB. * Witness Printer took 68.23 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 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 3.2s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 3.0s. 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: 8ms 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@57d493e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6b39dff=0, next_node=0, \result=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7b472c74=2, next_node=0, head=-1, head=-1, \old(i)=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@57d493e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@74aba238=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@79ce0831=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@6561eb8d=0, i=2, curr=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@434199b5=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@5566cd2e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@434199b5=0, curr=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5566cd2e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@79ce0831=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...