./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-linkedlists/cll_traverse-alloca.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_01f06d7e-03bd-419b-968c-c7f1f2c2fb76/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_01f06d7e-03bd-419b-968c-c7f1f2c2fb76/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_01f06d7e-03bd-419b-968c-c7f1f2c2fb76/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_01f06d7e-03bd-419b-968c-c7f1f2c2fb76/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-linkedlists/cll_traverse-alloca.i -s /tmp/vcloud-vcloud-master/worker/working_dir_01f06d7e-03bd-419b-968c-c7f1f2c2fb76/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_01f06d7e-03bd-419b-968c-c7f1f2c2fb76/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 a2a51f996e4cf34954505c04e8fa9e53d244d46a ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 09:01:48,278 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:01:48,280 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:01:48,292 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:01:48,292 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:01:48,294 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:01:48,295 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:01:48,297 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:01:48,299 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:01:48,301 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:01:48,303 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:01:48,304 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:01:48,305 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:01:48,305 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:01:48,306 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:01:48,307 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:01:48,307 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:01:48,308 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:01:48,309 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:01:48,311 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:01:48,312 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:01:48,313 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:01:48,314 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:01:48,314 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:01:48,316 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:01:48,316 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:01:48,316 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:01:48,317 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:01:48,317 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:01:48,318 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:01:48,318 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:01:48,319 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:01:48,320 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:01:48,320 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:01:48,321 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:01:48,321 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:01:48,322 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:01:48,322 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:01:48,322 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:01:48,323 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:01:48,323 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:01:48,324 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_01f06d7e-03bd-419b-968c-c7f1f2c2fb76/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 09:01:48,339 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:01:48,339 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:01:48,341 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:01:48,342 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:01:48,342 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:01:48,343 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 09:01:48,343 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 09:01:48,343 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 09:01:48,344 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 09:01:48,344 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 09:01:48,344 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 09:01:48,344 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:01:48,345 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 09:01:48,345 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:01:48,345 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:01:48,345 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 09:01:48,345 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 09:01:48,345 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 09:01:48,346 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:01:48,346 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 09:01:48,346 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:01:48,346 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 09:01:48,347 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:01:48,347 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:01:48,347 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 09:01:48,347 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:01:48,348 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:01:48,348 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 09:01:48,349 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 09:01:48,349 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_01f06d7e-03bd-419b-968c-c7f1f2c2fb76/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 -> a2a51f996e4cf34954505c04e8fa9e53d244d46a [2019-10-22 09:01:48,378 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:01:48,391 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:01:48,394 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:01:48,395 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:01:48,396 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:01:48,396 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_01f06d7e-03bd-419b-968c-c7f1f2c2fb76/bin/uautomizer/../../sv-benchmarks/c/termination-memory-linkedlists/cll_traverse-alloca.i [2019-10-22 09:01:48,444 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_01f06d7e-03bd-419b-968c-c7f1f2c2fb76/bin/uautomizer/data/7d6bfcad6/e77060debbed47ff9869a5b8b71856d9/FLAG649a5977f [2019-10-22 09:01:48,908 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:01:48,909 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_01f06d7e-03bd-419b-968c-c7f1f2c2fb76/sv-benchmarks/c/termination-memory-linkedlists/cll_traverse-alloca.i [2019-10-22 09:01:48,924 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_01f06d7e-03bd-419b-968c-c7f1f2c2fb76/bin/uautomizer/data/7d6bfcad6/e77060debbed47ff9869a5b8b71856d9/FLAG649a5977f [2019-10-22 09:01:48,941 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_01f06d7e-03bd-419b-968c-c7f1f2c2fb76/bin/uautomizer/data/7d6bfcad6/e77060debbed47ff9869a5b8b71856d9 [2019-10-22 09:01:48,945 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:01:48,946 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:01:48,947 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:01:48,950 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:01:48,953 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:01:48,954 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:01:48" (1/1) ... [2019-10-22 09:01:48,956 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ac1ccf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:48, skipping insertion in model container [2019-10-22 09:01:48,957 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:01:48" (1/1) ... [2019-10-22 09:01:48,963 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:01:48,998 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:01:49,296 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:01:49,306 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:01:49,358 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:01:49,405 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:01:49,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:49 WrapperNode [2019-10-22 09:01:49,406 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:01:49,407 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:01:49,407 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:01:49,407 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:01:49,415 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:49" (1/1) ... [2019-10-22 09:01:49,426 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:49" (1/1) ... [2019-10-22 09:01:49,442 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:01:49,443 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:01:49,443 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:01:49,443 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:01:49,448 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:49" (1/1) ... [2019-10-22 09:01:49,448 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:49" (1/1) ... [2019-10-22 09:01:49,451 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:49" (1/1) ... [2019-10-22 09:01:49,451 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:49" (1/1) ... [2019-10-22 09:01:49,457 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:49" (1/1) ... [2019-10-22 09:01:49,461 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:49" (1/1) ... [2019-10-22 09:01:49,462 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:49" (1/1) ... [2019-10-22 09:01:49,464 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:01:49,464 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:01:49,464 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:01:49,465 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:01:49,465 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_01f06d7e-03bd-419b-968c-c7f1f2c2fb76/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 09:01:49,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 09:01:49,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 09:01:49,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 09:01:49,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 09:01:49,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:01:49,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:01:49,751 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:01:49,751 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-22 09:01:49,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:49 BoogieIcfgContainer [2019-10-22 09:01:49,752 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:01:49,753 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 09:01:49,753 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 09:01:49,756 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 09:01:49,757 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:01:49,757 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 09:01:48" (1/3) ... [2019-10-22 09:01:49,757 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@33a78fc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:01:49, skipping insertion in model container [2019-10-22 09:01:49,758 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:01:49,758 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:49" (2/3) ... [2019-10-22 09:01:49,758 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@33a78fc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:01:49, skipping insertion in model container [2019-10-22 09:01:49,758 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:01:49,758 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:49" (3/3) ... [2019-10-22 09:01:49,760 INFO L371 chiAutomizerObserver]: Analyzing ICFG cll_traverse-alloca.i [2019-10-22 09:01:49,800 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 09:01:49,800 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 09:01:49,800 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 09:01:49,800 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:01:49,800 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:01:49,800 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 09:01:49,800 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:01:49,801 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 09:01:49,812 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-10-22 09:01:49,831 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2019-10-22 09:01:49,831 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:49,832 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:49,837 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:01:49,838 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:01:49,838 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 09:01:49,838 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-10-22 09:01:49,839 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2019-10-22 09:01:49,839 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:49,839 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:49,839 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:01:49,840 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:01:49,845 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~nondet6, main_#t~ret7.base, main_#t~ret7.offset, main_~n~0, main_~head~1.base, main_~head~1.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6;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; 12#L552-3true [2019-10-22 09:01:49,846 INFO L793 eck$LassoCheckResult]: Loop: 12#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; 10#L552-2true init_cll_#t~post3 := init_cll_~i~0;init_cll_~i~0 := 1 + init_cll_#t~post3;havoc init_cll_#t~post3; 12#L552-3true [2019-10-22 09:01:49,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:49,849 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-10-22 09:01:49,855 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:49,855 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834919613] [2019-10-22 09:01:49,855 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:49,855 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:49,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:49,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:49,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:49,964 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:49,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:49,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2019-10-22 09:01:49,966 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:49,966 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145498032] [2019-10-22 09:01:49,966 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:49,967 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:49,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:49,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:50,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:50,018 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:50,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:50,022 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-10-22 09:01:50,022 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:50,022 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606129675] [2019-10-22 09:01:50,023 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:50,023 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:50,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:50,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:50,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:50,106 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:50,368 WARN L191 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 82 [2019-10-22 09:01:50,410 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 09:01:50,518 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-10-22 09:01:50,518 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:50,524 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 09:01:50,627 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-10-22 09:01:50,628 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:50,630 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 09:01:50,630 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:156, output treesize:158 [2019-10-22 09:01:50,864 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-10-22 09:01:50,934 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:01:50,934 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:01:50,935 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:01:50,935 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:01:50,935 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:01:50,935 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:01:50,935 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:01:50,935 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:01:50,935 INFO L131 ssoRankerPreferences]: Filename of dumped script: cll_traverse-alloca.i_Iteration1_Lasso [2019-10-22 09:01:50,936 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:01:50,936 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:01:50,954 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 09:01:50,959 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 09:01:50,961 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 09:01:50,963 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 09:01:50,965 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 09:01:50,968 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 09:01:50,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:50,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:01:50,975 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 09:01:50,977 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 09:01:50,979 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 09:01:51,270 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-10-22 09:01:51,270 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 09:01:51,626 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:01:51,632 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:01:51,634 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 09:01:51,635 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:51,635 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:51,636 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:51,636 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:51,636 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:51,638 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:51,638 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:51,640 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:51,640 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 09:01:51,641 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:51,641 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:51,641 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:51,642 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:51,642 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:51,642 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:51,642 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:51,643 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:51,643 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 09:01:51,644 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:51,644 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:51,644 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:51,644 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:51,645 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:51,645 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:51,645 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:51,646 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:51,646 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 09:01:51,647 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:51,647 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:51,647 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:51,647 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:51,648 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:51,648 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:51,648 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:51,649 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:51,649 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 09:01:51,650 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:51,650 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:51,650 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:51,650 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:51,652 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:51,652 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:51,664 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:51,664 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 09:01:51,665 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:51,665 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:51,665 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:51,665 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:51,665 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:51,666 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:51,666 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:51,667 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:51,667 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 09:01:51,668 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:51,668 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:51,668 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:51,668 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:51,668 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:51,669 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:51,669 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:51,669 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:51,670 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 09:01:51,670 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:51,676 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:51,676 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:51,676 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:51,677 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:51,678 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:51,681 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:51,681 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 09:01:51,682 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:51,682 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:51,685 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:51,685 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:51,685 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:51,686 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:51,686 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:51,687 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:51,687 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 09:01:51,687 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:51,688 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:51,688 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:51,688 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:51,688 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:51,688 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:51,688 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:51,689 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:51,689 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 09:01:51,690 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:51,690 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:51,690 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:51,690 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:51,692 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:51,692 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:51,692 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:51,693 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:51,695 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 09:01:51,696 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:51,696 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:51,697 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:51,697 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:51,698 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:51,700 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:51,707 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:51,709 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 09:01:51,709 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:51,710 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:51,710 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:51,710 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:51,710 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:51,711 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:51,713 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:51,715 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:51,715 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 09:01:51,716 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:51,716 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:51,716 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:51,716 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:51,716 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:51,717 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:51,717 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:51,718 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:51,721 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 09:01:51,722 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:51,722 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:51,722 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:51,722 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:51,725 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:51,729 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:51,742 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:51,744 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 09:01:51,745 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:51,746 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:51,746 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:51,746 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:51,747 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:51,747 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:51,747 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:51,749 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:51,749 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 09:01:51,749 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:51,749 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:51,750 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:51,750 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:51,755 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:51,756 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:51,762 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:51,774 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 09:01:51,775 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:51,775 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:51,776 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:51,776 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:51,777 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:51,777 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:51,781 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:51,781 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 09:01:51,782 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:51,782 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:51,782 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:51,782 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:51,783 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:51,783 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:51,783 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:51,784 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:51,784 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 09:01:51,784 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:51,785 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:51,785 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:51,785 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:51,786 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:51,786 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:51,789 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:51,790 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 09:01:51,790 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:51,790 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:01:51,791 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:51,791 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:51,791 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:51,791 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:01:51,791 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:01:51,793 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:01:51,793 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 09:01:51,794 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:01:51,794 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:01:51,794 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:01:51,794 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:01:51,796 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:01:51,796 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:01:51,813 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:01:51,846 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-10-22 09:01:51,846 INFO L444 ModelExtractionUtils]: 11 out of 16 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-10-22 09:01:51,848 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:01:51,849 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:01:51,849 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:01:51,850 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 09:01:51,875 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-10-22 09:01:51,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:51,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:51,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:51,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:51,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:51,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:01:51,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:51,959 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 09:01:51,974 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 09:01:51,975 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 3 states. [2019-10-22 09:01:52,016 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states.. Second operand 3 states. Result 27 states and 36 transitions. Complement of second has 7 states. [2019-10-22 09:01:52,017 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 09:01:52,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:01:52,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2019-10-22 09:01:52,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 2 letters. Loop has 2 letters. [2019-10-22 09:01:52,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:52,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 4 letters. Loop has 2 letters. [2019-10-22 09:01:52,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:52,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 2 letters. Loop has 4 letters. [2019-10-22 09:01:52,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:01:52,024 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 36 transitions. [2019-10-22 09:01:52,029 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-10-22 09:01:52,033 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 8 states and 10 transitions. [2019-10-22 09:01:52,035 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2019-10-22 09:01:52,036 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-10-22 09:01:52,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2019-10-22 09:01:52,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:01:52,037 INFO L688 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-10-22 09:01:52,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2019-10-22 09:01:52,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-10-22 09:01:52,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-10-22 09:01:52,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2019-10-22 09:01:52,064 INFO L711 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-10-22 09:01:52,064 INFO L591 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-10-22 09:01:52,064 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 09:01:52,064 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2019-10-22 09:01:52,065 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-10-22 09:01:52,066 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:52,066 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:52,066 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 09:01:52,066 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-10-22 09:01:52,067 INFO L791 eck$LassoCheckResult]: Stem: 93#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 89#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~ret7.base, main_#t~ret7.offset, main_~n~0, main_~head~1.base, main_~head~1.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6;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; 90#L552-3 assume !(init_cll_~i~0 < init_cll_~n); 91#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; 92#L559 main_#t~ret7.base, main_#t~ret7.offset := init_cll_#res.base, init_cll_#res.offset;main_~head~1.base, main_~head~1.offset := main_#t~ret7.base, main_#t~ret7.offset;havoc main_#t~ret7.base, main_#t~ret7.offset;traverse_#in~head.base, traverse_#in~head.offset := main_~head~1.base, main_~head~1.offset;havoc traverse_#t~mem5.base, traverse_#t~mem5.offset, traverse_~head.base, traverse_~head.offset, traverse_~curr~1.base, traverse_~curr~1.offset;traverse_~head.base, traverse_~head.offset := traverse_#in~head.base, traverse_#in~head.offset;traverse_~curr~1.base, traverse_~curr~1.offset := traverse_~head.base, traverse_~head.offset; 94#L564-2 [2019-10-22 09:01:52,067 INFO L793 eck$LassoCheckResult]: Loop: 94#L564-2 assume !!(traverse_~curr~1.base != 0 || traverse_~curr~1.offset != 0);call traverse_#t~mem5.base, traverse_#t~mem5.offset := read~$Pointer$(traverse_~curr~1.base, 4 + traverse_~curr~1.offset, 8);traverse_~curr~1.base, traverse_~curr~1.offset := traverse_#t~mem5.base, traverse_#t~mem5.offset;havoc traverse_#t~mem5.base, traverse_#t~mem5.offset; 94#L564-2 [2019-10-22 09:01:52,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:52,067 INFO L82 PathProgramCache]: Analyzing trace with hash 28696935, now seen corresponding path program 1 times [2019-10-22 09:01:52,068 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:52,068 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817525038] [2019-10-22 09:01:52,068 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:52,068 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:52,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:52,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:52,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:52,110 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:52,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:52,110 INFO L82 PathProgramCache]: Analyzing trace with hash 58, now seen corresponding path program 1 times [2019-10-22 09:01:52,110 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:52,111 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038851246] [2019-10-22 09:01:52,111 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:52,111 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:52,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:52,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:52,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:52,123 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:52,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:52,125 INFO L82 PathProgramCache]: Analyzing trace with hash 889605012, now seen corresponding path program 1 times [2019-10-22 09:01:52,125 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:52,125 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100692414] [2019-10-22 09:01:52,125 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:52,125 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:52,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:52,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:52,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:52,160 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:52,592 WARN L191 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 109 [2019-10-22 09:01:52,611 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 09:01:52,740 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-10-22 09:01:52,740 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:52,746 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 09:01:52,844 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:01:52,845 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 09:01:52,845 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:180, output treesize:156 [2019-10-22 09:01:52,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 09:01:52 BoogieIcfgContainer [2019-10-22 09:01:52,962 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 09:01:52,963 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:01:52,963 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:01:52,963 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:01:52,963 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:49" (3/4) ... [2019-10-22 09:01:52,966 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-10-22 09:01:53,000 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_01f06d7e-03bd-419b-968c-c7f1f2c2fb76/bin/uautomizer/witness.graphml [2019-10-22 09:01:53,001 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:01:53,002 INFO L168 Benchmark]: Toolchain (without parser) took 4055.91 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 224.9 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -189.1 MB). Peak memory consumption was 35.9 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:53,002 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:01:53,003 INFO L168 Benchmark]: CACSL2BoogieTranslator took 458.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -190.4 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:53,003 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.81 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 09:01:53,004 INFO L168 Benchmark]: Boogie Preprocessor took 21.55 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 09:01:53,004 INFO L168 Benchmark]: RCFGBuilder took 287.83 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: 23.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:53,005 INFO L168 Benchmark]: BuchiAutomizer took 3209.85 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 79.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -33.7 MB). Peak memory consumption was 305.6 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:53,005 INFO L168 Benchmark]: Witness Printer took 38.06 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 09:01:53,008 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 458.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -190.4 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.81 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 21.55 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 287.83 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: 23.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3209.85 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 79.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -33.7 MB). Peak memory consumption was 305.6 MB. Max. memory is 11.5 GB. * Witness Printer took 38.06 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 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.1s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 2.9s. 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 8 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 9 SDtfs, 9 SDslu, 14 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: 14ms 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, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7ef75631=0, \result=0, NULL=-2, next_node=0, \result=-1, next_node=0, head=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4f054d07=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7ef75631=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3d70353b=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@56bd13d8=0, head=0, head=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1b58c4d4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1b58c4d4=0, curr=0, \old(n)=0, n=0, head=-1, n=0, head=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6ac82b4e=0, head=0, head=-1, curr=-1, NULL=0, curr=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6ac82b4e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3d70353b=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] COND TRUE curr != ((void *)0) [L565] EXPR curr->next [L565] curr = curr->next End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...