./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-linkedlists/cll_search-alloca_false-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_bc626f5a-fffb-4efa-a267-793040069908/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_bc626f5a-fffb-4efa-a267-793040069908/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_bc626f5a-fffb-4efa-a267-793040069908/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_bc626f5a-fffb-4efa-a267-793040069908/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-linkedlists/cll_search-alloca_false-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_bc626f5a-fffb-4efa-a267-793040069908/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_bc626f5a-fffb-4efa-a267-793040069908/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 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.23-1dbac8b [2018-11-10 07:09:48,677 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 07:09:48,678 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 07:09:48,684 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 07:09:48,684 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 07:09:48,685 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 07:09:48,686 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 07:09:48,687 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 07:09:48,689 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 07:09:48,689 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 07:09:48,690 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 07:09:48,690 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 07:09:48,691 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 07:09:48,692 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 07:09:48,693 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 07:09:48,693 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 07:09:48,694 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 07:09:48,695 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 07:09:48,697 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 07:09:48,698 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 07:09:48,699 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 07:09:48,700 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 07:09:48,702 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 07:09:48,702 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 07:09:48,702 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 07:09:48,703 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 07:09:48,704 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 07:09:48,705 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 07:09:48,705 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 07:09:48,706 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 07:09:48,706 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 07:09:48,707 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 07:09:48,707 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 07:09:48,707 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 07:09:48,709 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 07:09:48,709 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 07:09:48,709 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_bc626f5a-fffb-4efa-a267-793040069908/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 07:09:48,720 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 07:09:48,720 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 07:09:48,721 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 07:09:48,722 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 07:09:48,722 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 07:09:48,722 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 07:09:48,722 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 07:09:48,722 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 07:09:48,722 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 07:09:48,722 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 07:09:48,723 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 07:09:48,723 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 07:09:48,723 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 07:09:48,723 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 07:09:48,723 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 07:09:48,725 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 07:09:48,725 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 07:09:48,725 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 07:09:48,725 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 07:09:48,725 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 07:09:48,725 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 07:09:48,726 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 07:09:48,726 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 07:09:48,726 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 07:09:48,726 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 07:09:48,726 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 07:09:48,726 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 07:09:48,727 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 07:09:48,727 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_bc626f5a-fffb-4efa-a267-793040069908/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 34137da927ca86d2fb49adf8270ebc903b8c1dbe [2018-11-10 07:09:48,746 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 07:09:48,755 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 07:09:48,758 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 07:09:48,759 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 07:09:48,759 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 07:09:48,760 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_bc626f5a-fffb-4efa-a267-793040069908/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-linkedlists/cll_search-alloca_false-termination.c.i [2018-11-10 07:09:48,802 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bc626f5a-fffb-4efa-a267-793040069908/bin-2019/uautomizer/data/dbf73ebd8/7e62fb230dd84f0ca1f7533802c67140/FLAG4ee87c400 [2018-11-10 07:09:49,129 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 07:09:49,129 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_bc626f5a-fffb-4efa-a267-793040069908/sv-benchmarks/c/termination-memory-linkedlists/cll_search-alloca_false-termination.c.i [2018-11-10 07:09:49,136 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bc626f5a-fffb-4efa-a267-793040069908/bin-2019/uautomizer/data/dbf73ebd8/7e62fb230dd84f0ca1f7533802c67140/FLAG4ee87c400 [2018-11-10 07:09:49,144 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_bc626f5a-fffb-4efa-a267-793040069908/bin-2019/uautomizer/data/dbf73ebd8/7e62fb230dd84f0ca1f7533802c67140 [2018-11-10 07:09:49,146 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 07:09:49,147 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 07:09:49,148 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 07:09:49,148 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 07:09:49,150 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 07:09:49,150 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:09:49" (1/1) ... [2018-11-10 07:09:49,152 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cfc6dce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:09:49, skipping insertion in model container [2018-11-10 07:09:49,152 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:09:49" (1/1) ... [2018-11-10 07:09:49,157 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 07:09:49,180 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 07:09:49,346 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:09:49,354 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 07:09:49,381 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:09:49,404 INFO L193 MainTranslator]: Completed translation [2018-11-10 07:09:49,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:09:49 WrapperNode [2018-11-10 07:09:49,405 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 07:09:49,405 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 07:09:49,405 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 07:09:49,405 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 07:09:49,453 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:09:49" (1/1) ... [2018-11-10 07:09:49,464 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:09:49" (1/1) ... [2018-11-10 07:09:49,476 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 07:09:49,476 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 07:09:49,476 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 07:09:49,477 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 07:09:49,482 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:09:49" (1/1) ... [2018-11-10 07:09:49,482 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:09:49" (1/1) ... [2018-11-10 07:09:49,485 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:09:49" (1/1) ... [2018-11-10 07:09:49,485 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:09:49" (1/1) ... [2018-11-10 07:09:49,489 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:09:49" (1/1) ... [2018-11-10 07:09:49,493 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:09:49" (1/1) ... [2018-11-10 07:09:49,494 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:09:49" (1/1) ... [2018-11-10 07:09:49,496 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 07:09:49,496 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 07:09:49,496 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 07:09:49,496 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 07:09:49,497 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:09:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc626f5a-fffb-4efa-a267-793040069908/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:09:49,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 07:09:49,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 07:09:49,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-10 07:09:49,542 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-10 07:09:49,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 07:09:49,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 07:09:49,743 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 07:09:49,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:09:49 BoogieIcfgContainer [2018-11-10 07:09:49,743 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 07:09:49,743 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 07:09:49,744 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 07:09:49,747 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 07:09:49,747 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:09:49,748 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 07:09:49" (1/3) ... [2018-11-10 07:09:49,749 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4b27cb7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 07:09:49, skipping insertion in model container [2018-11-10 07:09:49,749 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:09:49,749 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:09:49" (2/3) ... [2018-11-10 07:09:49,750 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4b27cb7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 07:09:49, skipping insertion in model container [2018-11-10 07:09:49,750 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:09:49,750 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:09:49" (3/3) ... [2018-11-10 07:09:49,751 INFO L375 chiAutomizerObserver]: Analyzing ICFG cll_search-alloca_false-termination.c.i [2018-11-10 07:09:49,799 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 07:09:49,799 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 07:09:49,799 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 07:09:49,800 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 07:09:49,800 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 07:09:49,800 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 07:09:49,800 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 07:09:49,800 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 07:09:49,800 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 07:09:49,812 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2018-11-10 07:09:49,831 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-11-10 07:09:49,831 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:09:49,831 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:09:49,836 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 07:09:49,837 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 07:09:49,837 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 07:09:49,837 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2018-11-10 07:09:49,838 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-11-10 07:09:49,838 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:09:49,839 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:09:49,839 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 07:09:49,839 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 07:09:49,846 INFO L793 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;assume { :begin_inline_init_cll } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 12;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;init_cll_~curr~0.base, init_cll_~curr~0.offset := init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset; 19#L550true SUMMARY for call write~int(0, init_cll_~curr~0.base, init_cll_~curr~0.offset + 0, 4); srcloc: L550 22#L550-1true 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; 3#L552-4true [2018-11-10 07:09:49,847 INFO L795 eck$LassoCheckResult]: Loop: 3#L552-4true assume true; 16#L552-1true assume !!(init_cll_~i~0 < init_cll_~n);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 12;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];init_cll_#t~malloc4.base, init_cll_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;init_cll_~next_node~0.base, init_cll_~next_node~0.offset := init_cll_#t~malloc4.base, init_cll_#t~malloc4.offset; 8#L554true SUMMARY for call write~int(init_cll_~i~0, init_cll_~next_node~0.base, init_cll_~next_node~0.offset + 0, 4); srcloc: L554 11#L554-1true SUMMARY for call write~$Pointer$(init_cll_~next_node~0.base, init_cll_~next_node~0.offset, init_cll_~curr~0.base, init_cll_~curr~0.offset + 4, 8); srcloc: L554-1 6#L555true init_cll_~curr~0.base, init_cll_~curr~0.offset := init_cll_~next_node~0.base, init_cll_~next_node~0.offset; 23#L552-3true init_cll_#t~post3 := init_cll_~i~0;init_cll_~i~0 := init_cll_#t~post3 + 1;havoc init_cll_#t~post3; 3#L552-4true [2018-11-10 07:09:49,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:09:49,851 INFO L82 PathProgramCache]: Analyzing trace with hash 925540, now seen corresponding path program 1 times [2018-11-10 07:09:49,853 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:09:49,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:09:49,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:09:49,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:09:49,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:09:49,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:09:49,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:09:49,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:09:49,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1128974665, now seen corresponding path program 1 times [2018-11-10 07:09:49,942 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:09:49,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:09:49,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:09:49,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:09:49,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:09:49,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:09:49,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:09:49,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:09:49,961 INFO L82 PathProgramCache]: Analyzing trace with hash -686910868, now seen corresponding path program 1 times [2018-11-10 07:09:49,961 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:09:49,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:09:49,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:09:49,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:09:49,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:09:49,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:09:49,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:09:50,186 WARN L179 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2018-11-10 07:09:50,393 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:09:50,394 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:09:50,394 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:09:50,394 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:09:50,395 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 07:09:50,395 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:09:50,395 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:09:50,395 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:09:50,395 INFO L131 ssoRankerPreferences]: Filename of dumped script: cll_search-alloca_false-termination.c.i_Iteration1_Lasso [2018-11-10 07:09:50,395 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:09:50,396 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:09:50,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:09:50,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:09:50,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:09:50,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:09:50,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:09:50,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:09:50,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:09:50,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:09:50,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:09:50,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:09:50,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:09:50,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:09:50,729 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2018-11-10 07:09:50,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:09:50,988 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:09:50,992 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 07:09:50,993 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:09:50,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:09:50,994 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:09:50,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:09:50,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:09:50,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:09:50,997 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:09:50,997 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:09:51,000 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:09:51,000 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:09:51,001 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:09:51,001 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:09:51,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:09:51,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:09:51,001 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:09:51,002 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:09:51,002 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:09:51,003 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:09:51,003 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:09:51,004 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:09:51,004 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:09:51,004 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:09:51,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:09:51,004 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:09:51,005 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:09:51,005 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:09:51,006 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:09:51,006 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:09:51,006 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:09:51,007 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:09:51,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:09:51,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:09:51,007 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:09:51,008 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:09:51,008 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:09:51,008 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:09:51,009 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:09:51,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:09:51,009 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:09:51,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:09:51,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:09:51,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:09:51,010 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:09:51,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:09:51,024 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:09:51,024 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:09:51,025 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:09:51,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:09:51,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:09:51,025 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:09:51,029 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:09:51,029 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:09:51,033 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:09:51,033 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:09:51,033 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:09:51,033 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:09:51,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:09:51,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:09:51,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:09:51,034 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:09:51,034 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:09:51,036 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:09:51,036 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:09:51,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:09:51,037 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:09:51,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:09:51,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:09:51,037 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:09:51,038 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:09:51,038 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:09:51,038 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:09:51,039 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:09:51,039 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:09:51,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:09:51,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:09:51,039 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:09:51,041 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:09:51,041 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:09:51,045 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:09:51,045 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:09:51,046 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:09:51,046 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:09:51,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:09:51,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:09:51,046 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:09:51,047 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:09:51,047 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:09:51,049 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:09:51,050 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:09:51,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:09:51,050 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:09:51,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:09:51,051 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:09:51,051 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:09:51,051 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:09:51,051 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:09:51,052 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:09:51,053 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:09:51,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:09:51,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:09:51,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:09:51,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:09:51,058 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:09:51,059 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:09:51,067 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:09:51,067 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:09:51,068 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:09:51,068 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 07:09:51,068 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 07:09:51,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:09:51,078 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-10 07:09:51,078 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-10 07:09:51,132 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:09:51,132 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:09:51,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:09:51,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:09:51,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:09:51,133 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:09:51,135 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:09:51,135 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:09:51,158 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 07:09:51,172 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 07:09:51,172 INFO L444 ModelExtractionUtils]: 18 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 07:09:51,174 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 07:09:51,176 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 07:09:51,176 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 07:09:51,177 INFO L519 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 [] [2018-11-10 07:09:51,199 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-10 07:09:51,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:09:51,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:09:51,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:09:51,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:09:51,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:09:51,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:09:51,250 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 07:09:51,250 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states. Second operand 4 states. [2018-11-10 07:09:51,280 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states.. Second operand 4 states. Result 52 states and 59 transitions. Complement of second has 7 states. [2018-11-10 07:09:51,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 07:09:51,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 07:09:51,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2018-11-10 07:09:51,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 38 transitions. Stem has 4 letters. Loop has 6 letters. [2018-11-10 07:09:51,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:09:51,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 38 transitions. Stem has 10 letters. Loop has 6 letters. [2018-11-10 07:09:51,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:09:51,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 38 transitions. Stem has 4 letters. Loop has 12 letters. [2018-11-10 07:09:51,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:09:51,287 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 59 transitions. [2018-11-10 07:09:51,289 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 07:09:51,292 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 20 states and 22 transitions. [2018-11-10 07:09:51,292 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-10 07:09:51,293 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-10 07:09:51,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2018-11-10 07:09:51,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 07:09:51,293 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-11-10 07:09:51,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2018-11-10 07:09:51,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-10 07:09:51,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-10 07:09:51,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-11-10 07:09:51,311 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-11-10 07:09:51,311 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-11-10 07:09:51,311 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 07:09:51,311 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 22 transitions. [2018-11-10 07:09:51,312 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 07:09:51,312 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:09:51,313 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:09:51,313 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:09:51,313 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 07:09:51,313 INFO L793 eck$LassoCheckResult]: Stem: 159#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 157#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;assume { :begin_inline_init_cll } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 12;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;init_cll_~curr~0.base, init_cll_~curr~0.offset := init_cll_#t~malloc2.base, init_cll_#t~malloc2.offset; 158#L550 SUMMARY for call write~int(0, init_cll_~curr~0.base, init_cll_~curr~0.offset + 0, 4); srcloc: L550 162#L550-1 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; 143#L552-4 assume true; 145#L552-1 assume !(init_cll_~i~0 < init_cll_~n); 149#L552-5 SUMMARY for call write~$Pointer$(init_cll_~head~0.base, init_cll_~head~0.offset, init_cll_~curr~0.base, init_cll_~curr~0.offset + 4, 8); srcloc: L552-5 147#L558 init_cll_#res.base, init_cll_#res.offset := init_cll_~head~0.base, init_cll_~head~0.offset; 148#L559 main_#t~ret8.base, main_#t~ret8.offset := init_cll_#res.base, init_cll_#res.offset;assume { :end_inline_init_cll } true;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;assume { :begin_inline_search } true;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; 156#L564-4 [2018-11-10 07:09:51,314 INFO L795 eck$LassoCheckResult]: Loop: 156#L564-4 assume true; 160#L564-1 SUMMARY for call search_#t~mem5 := read~int(search_~curr~1.base, search_~curr~1.offset + 0, 4); srcloc: L564-1 161#L564-2 assume !!(search_#t~mem5 != search_~i);havoc search_#t~mem5; 152#L565 SUMMARY for call search_#t~mem6.base, search_#t~mem6.offset := read~$Pointer$(search_~curr~1.base, search_~curr~1.offset + 4, 8); srcloc: L565 153#L565-1 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; 156#L564-4 [2018-11-10 07:09:51,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:09:51,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1778905265, now seen corresponding path program 1 times [2018-11-10 07:09:51,314 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:09:51,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:09:51,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:09:51,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:09:51,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:09:51,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:09:51,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:09:51,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:09:51,332 INFO L82 PathProgramCache]: Analyzing trace with hash 56370562, now seen corresponding path program 1 times [2018-11-10 07:09:51,332 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:09:51,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:09:51,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:09:51,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:09:51,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:09:51,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:09:51,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:09:51,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:09:51,340 INFO L82 PathProgramCache]: Analyzing trace with hash 2099192530, now seen corresponding path program 1 times [2018-11-10 07:09:51,340 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:09:51,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:09:51,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:09:51,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:09:51,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:09:51,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:09:51,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:09:51,595 WARN L179 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 101 [2018-11-10 07:09:51,682 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 07:09:51,685 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 07:09:51,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 07:09:51 BoogieIcfgContainer [2018-11-10 07:09:51,695 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 07:09:51,695 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 07:09:51,695 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 07:09:51,695 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 07:09:51,695 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:09:49" (3/4) ... [2018-11-10 07:09:51,697 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-10 07:09:51,732 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_bc626f5a-fffb-4efa-a267-793040069908/bin-2019/uautomizer/witness.graphml [2018-11-10 07:09:51,732 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 07:09:51,733 INFO L168 Benchmark]: Toolchain (without parser) took 2586.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 956.6 MB in the beginning and 1.0 GB in the end (delta: -45.4 MB). Peak memory consumption was 90.9 MB. Max. memory is 11.5 GB. [2018-11-10 07:09:51,733 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:09:51,734 INFO L168 Benchmark]: CACSL2BoogieTranslator took 257.31 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 935.1 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 07:09:51,734 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 935.1 MB in the beginning and 1.1 GB in the end (delta: -198.0 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-11-10 07:09:51,735 INFO L168 Benchmark]: Boogie Preprocessor took 19.47 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 07:09:51,735 INFO L168 Benchmark]: RCFGBuilder took 247.04 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2018-11-10 07:09:51,736 INFO L168 Benchmark]: BuchiAutomizer took 1951.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 111.4 MB). Peak memory consumption was 111.4 MB. Max. memory is 11.5 GB. [2018-11-10 07:09:51,736 INFO L168 Benchmark]: Witness Printer took 37.11 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:09:51,738 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 257.31 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 935.1 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 70.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 935.1 MB in the beginning and 1.1 GB in the end (delta: -198.0 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.47 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 247.04 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1951.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 111.4 MB). Peak memory consumption was 111.4 MB. Max. memory is 11.5 GB. * Witness Printer took 37.11 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * 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 20 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.8s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 1.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 1. 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 20 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 19 SDtfs, 24 SDslu, 28 SDs, 0 SdLazy, 8 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital195 mio100 ax100 hnf100 lsp96 ukn83 mio100 lsp19 div100 bol100 ite100 ukn100 eq216 hnf89 smp100 dnf176 smp100 tf100 neg96 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 64ms VariablesStem: 4 VariablesLoop: 6 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 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. [2018-11-10 07:09:51,746 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 07:09:51,747 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 07:09:51,752 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 07:09:51,753 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {i=1, NULL=0, curr=5, \result=0, head=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4cce8108=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3d2e683a=0, next_node=0, \result=5, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@22bf80ea=3, next_node=0, head=5, head=5, \old(i)=3, NULL=12, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4cce8108=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3add71df=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4ec3bc7=5, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@277b7f5a=0, i=3, curr=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2cd46fe0=0, head=5, \old(n)=0, n=0, head=5, head=0, n=0, head=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3633faae=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2cd46fe0=0, curr=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3633faae=0, NULL=5, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4ec3bc7=0, curr=5, 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(); [L571] CALL, EXPR init_cll(n) [L548] node_t* head; [L549] EXPR, FCALL malloc(sizeof(node_t)) [L549] node_t* curr = malloc(sizeof(node_t)); [L550] FCALL curr->val = 0 [L551] head = curr [L552] int i = 1; [L552] COND FALSE !(i < n) [L558] FCALL curr->next = head [L559] RET return head; [L571] EXPR init_cll(n) [L571] node_t* head = init_cll(n); [L572] CALL search(head, __VERIFIER_nondet_int()) [L563] node_t* curr = head; Loop: [L564] EXPR, FCALL curr->val [L564] COND TRUE curr->val != i [L565] EXPR, FCALL curr->next [L565] curr = curr->next End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...