./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/memsafety-ext/tree_stack.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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_2804b2f1-735a-4679-b8d1-25253224f413/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2804b2f1-735a-4679-b8d1-25253224f413/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2804b2f1-735a-4679-b8d1-25253224f413/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2804b2f1-735a-4679-b8d1-25253224f413/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/memsafety-ext/tree_stack.i -s /tmp/vcloud-vcloud-master/worker/working_dir_2804b2f1-735a-4679-b8d1-25253224f413/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2804b2f1-735a-4679-b8d1-25253224f413/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 32bit --witnessprinter.graph.data.programhash 3e23c3bca784f04992b2007c94519fee617936af ............................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:30,725 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:01:30,727 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:01:30,736 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:01:30,736 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:01:30,737 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:01:30,738 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:01:30,739 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:01:30,740 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:01:30,741 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:01:30,741 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:01:30,742 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:01:30,742 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:01:30,743 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:01:30,743 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:01:30,744 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:01:30,745 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:01:30,746 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:01:30,747 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:01:30,748 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:01:30,750 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:01:30,750 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:01:30,751 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:01:30,752 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:01:30,754 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:01:30,754 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:01:30,754 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:01:30,755 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:01:30,755 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:01:30,756 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:01:30,756 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:01:30,757 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:01:30,757 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:01:30,758 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:01:30,759 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:01:30,759 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:01:30,759 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:01:30,760 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:01:30,760 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:01:30,761 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:01:30,761 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:01:30,762 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2804b2f1-735a-4679-b8d1-25253224f413/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 09:01:30,774 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:01:30,774 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:01:30,775 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:01:30,775 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:01:30,775 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:01:30,775 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 09:01:30,776 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 09:01:30,776 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 09:01:30,776 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 09:01:30,776 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 09:01:30,776 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 09:01:30,777 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:01:30,777 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 09:01:30,777 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 09:01:30,777 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:01:30,777 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 09:01:30,777 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:01:30,778 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 09:01:30,778 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 09:01:30,778 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 09:01:30,778 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 09:01:30,778 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:01:30,778 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 09:01:30,778 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:01:30,779 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 09:01:30,779 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:01:30,779 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:01:30,779 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 09:01:30,779 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:01:30,779 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:01:30,780 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 09:01:30,781 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 09:01:30,781 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_2804b2f1-735a-4679-b8d1-25253224f413/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3e23c3bca784f04992b2007c94519fee617936af [2019-10-22 09:01:30,808 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:01:30,819 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:01:30,821 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:01:30,823 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:01:30,823 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:01:30,823 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2804b2f1-735a-4679-b8d1-25253224f413/bin/uautomizer/../../sv-benchmarks/c/memsafety-ext/tree_stack.i [2019-10-22 09:01:30,882 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2804b2f1-735a-4679-b8d1-25253224f413/bin/uautomizer/data/97d751ae7/dd087aec0c474508a93bc0598d344054/FLAG12fb2d54b [2019-10-22 09:01:31,295 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:01:31,295 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2804b2f1-735a-4679-b8d1-25253224f413/sv-benchmarks/c/memsafety-ext/tree_stack.i [2019-10-22 09:01:31,309 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2804b2f1-735a-4679-b8d1-25253224f413/bin/uautomizer/data/97d751ae7/dd087aec0c474508a93bc0598d344054/FLAG12fb2d54b [2019-10-22 09:01:31,642 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2804b2f1-735a-4679-b8d1-25253224f413/bin/uautomizer/data/97d751ae7/dd087aec0c474508a93bc0598d344054 [2019-10-22 09:01:31,644 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:01:31,646 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:01:31,647 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:01:31,647 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:01:31,654 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:01:31,655 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:01:31" (1/1) ... [2019-10-22 09:01:31,658 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49677bba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:31, skipping insertion in model container [2019-10-22 09:01:31,658 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:01:31" (1/1) ... [2019-10-22 09:01:31,666 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:01:31,712 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:01:32,119 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:01:32,131 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:01:32,193 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:01:32,238 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:01:32,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:32 WrapperNode [2019-10-22 09:01:32,238 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:01:32,239 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:01:32,239 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:01:32,239 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:01:32,247 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:32" (1/1) ... [2019-10-22 09:01:32,269 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:32" (1/1) ... [2019-10-22 09:01:32,295 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:01:32,300 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:01:32,300 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:01:32,300 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:01:32,315 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:32" (1/1) ... [2019-10-22 09:01:32,315 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:32" (1/1) ... [2019-10-22 09:01:32,319 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:32" (1/1) ... [2019-10-22 09:01:32,328 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:32" (1/1) ... [2019-10-22 09:01:32,339 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:32" (1/1) ... [2019-10-22 09:01:32,348 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:32" (1/1) ... [2019-10-22 09:01:32,349 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:32" (1/1) ... [2019-10-22 09:01:32,358 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:01:32,359 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:01:32,359 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:01:32,359 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:01:32,360 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2804b2f1-735a-4679-b8d1-25253224f413/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:32,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 09:01:32,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 09:01:32,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 09:01:32,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 09:01:32,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:01:32,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:01:32,786 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:01:32,786 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 09:01:32,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:32 BoogieIcfgContainer [2019-10-22 09:01:32,788 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:01:32,788 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 09:01:32,788 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 09:01:32,792 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 09:01:32,793 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:01:32,793 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 09:01:31" (1/3) ... [2019-10-22 09:01:32,794 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3282b13b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:01:32, skipping insertion in model container [2019-10-22 09:01:32,795 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:01:32,795 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:32" (2/3) ... [2019-10-22 09:01:32,795 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3282b13b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:01:32, skipping insertion in model container [2019-10-22 09:01:32,796 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:01:32,796 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:32" (3/3) ... [2019-10-22 09:01:32,798 INFO L371 chiAutomizerObserver]: Analyzing ICFG tree_stack.i [2019-10-22 09:01:32,847 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 09:01:32,847 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 09:01:32,847 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 09:01:32,847 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:01:32,847 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:01:32,847 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 09:01:32,848 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:01:32,848 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 09:01:32,862 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-10-22 09:01:32,881 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2019-10-22 09:01:32,881 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:32,881 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:32,887 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:01:32,887 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-10-22 09:01:32,887 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 09:01:32,887 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-10-22 09:01:32,888 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2019-10-22 09:01:32,889 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:32,889 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:32,889 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:01:32,889 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-10-22 09:01:32,894 INFO L791 eck$LassoCheckResult]: Stem: 16#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 14#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~short6, main_#t~mem10.base, main_#t~mem10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet3, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~malloc24.base, main_#t~malloc24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); 5#L538-2true [2019-10-22 09:01:32,895 INFO L793 eck$LassoCheckResult]: Loop: 5#L538-2true assume !!(0 != main_#t~nondet3);havoc main_#t~nondet3;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 3#L528-2true assume !true; 13#L527-5true call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 12#L533true assume (main_#t~mem10.base == 0 && main_#t~mem10.offset == 0) && 0 != main_#t~nondet11;havoc main_#t~nondet11;havoc main_#t~mem10.base, main_#t~mem10.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(main_#t~malloc12.base, main_#t~malloc12.offset, main_~n~0.base, main_~n~0.offset, 4);call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem13.base, main_#t~mem13.offset, 4);havoc main_#t~mem13.base, main_#t~mem13.offset;call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem14.base, 4 + main_#t~mem14.offset, 4);havoc main_#t~mem14.base, main_#t~mem14.offset; 17#L533-2true call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 22#L538true assume !((main_#t~mem15.base == 0 && main_#t~mem15.offset == 0) && 0 != main_#t~nondet16);havoc main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~nondet16; 5#L538-2true [2019-10-22 09:01:32,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:32,899 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-10-22 09:01:32,905 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:32,905 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89588209] [2019-10-22 09:01:32,905 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:32,906 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:32,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:32,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:33,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:33,024 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:33,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:33,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1235889697, now seen corresponding path program 1 times [2019-10-22 09:01:33,026 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:33,026 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315888762] [2019-10-22 09:01:33,026 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:33,026 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:33,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:33,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:33,056 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:33,057 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315888762] [2019-10-22 09:01:33,057 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:33,058 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:01:33,058 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308788483] [2019-10-22 09:01:33,061 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:01:33,062 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:33,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 09:01:33,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 09:01:33,074 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2019-10-22 09:01:33,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:33,079 INFO L93 Difference]: Finished difference Result 21 states and 29 transitions. [2019-10-22 09:01:33,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 09:01:33,081 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 29 transitions. [2019-10-22 09:01:33,082 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2019-10-22 09:01:33,086 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 25 transitions. [2019-10-22 09:01:33,087 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-10-22 09:01:33,087 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-10-22 09:01:33,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 25 transitions. [2019-10-22 09:01:33,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:01:33,088 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2019-10-22 09:01:33,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 25 transitions. [2019-10-22 09:01:33,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-10-22 09:01:33,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-22 09:01:33,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2019-10-22 09:01:33,110 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2019-10-22 09:01:33,111 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2019-10-22 09:01:33,111 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 09:01:33,111 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 25 transitions. [2019-10-22 09:01:33,111 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2019-10-22 09:01:33,112 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:33,112 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:33,112 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:01:33,112 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:33,112 INFO L791 eck$LassoCheckResult]: Stem: 65#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 62#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~short6, main_#t~mem10.base, main_#t~mem10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet3, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~malloc24.base, main_#t~malloc24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); 53#L538-2 [2019-10-22 09:01:33,113 INFO L793 eck$LassoCheckResult]: Loop: 53#L538-2 assume !!(0 != main_#t~nondet3);havoc main_#t~nondet3;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 50#L528-2 call main_#t~mem4.base, main_#t~mem4.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short6 := main_#t~mem4.base != 0 || main_#t~mem4.offset != 0; 51#L527-1 assume main_#t~short6;call main_#t~mem5.base, main_#t~mem5.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4);main_#t~short6 := main_#t~mem5.base != 0 || main_#t~mem5.offset != 0; 52#L527-3 assume !main_#t~short6;havoc main_#t~mem5.base, main_#t~mem5.offset;havoc main_#t~short6;havoc main_#t~mem4.base, main_#t~mem4.offset; 58#L527-5 call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 60#L533 assume (main_#t~mem10.base == 0 && main_#t~mem10.offset == 0) && 0 != main_#t~nondet11;havoc main_#t~nondet11;havoc main_#t~mem10.base, main_#t~mem10.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(main_#t~malloc12.base, main_#t~malloc12.offset, main_~n~0.base, main_~n~0.offset, 4);call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem13.base, main_#t~mem13.offset, 4);havoc main_#t~mem13.base, main_#t~mem13.offset;call main_#t~mem14.base, main_#t~mem14.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem14.base, 4 + main_#t~mem14.offset, 4);havoc main_#t~mem14.base, main_#t~mem14.offset; 61#L533-2 call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 64#L538 assume !((main_#t~mem15.base == 0 && main_#t~mem15.offset == 0) && 0 != main_#t~nondet16);havoc main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~nondet16; 53#L538-2 [2019-10-22 09:01:33,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:33,113 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-10-22 09:01:33,113 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:33,114 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873094558] [2019-10-22 09:01:33,114 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:33,114 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:33,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:33,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:33,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:33,137 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:33,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:33,138 INFO L82 PathProgramCache]: Analyzing trace with hash 2066931060, now seen corresponding path program 1 times [2019-10-22 09:01:33,138 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:33,138 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343245057] [2019-10-22 09:01:33,139 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:33,139 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:33,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:33,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:33,263 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:33,263 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343245057] [2019-10-22 09:01:33,263 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:33,263 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:01:33,263 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345018084] [2019-10-22 09:01:33,264 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:01:33,264 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:33,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:01:33,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:01:33,265 INFO L87 Difference]: Start difference. First operand 17 states and 25 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-10-22 09:01:33,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:33,403 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2019-10-22 09:01:33,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:01:33,404 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2019-10-22 09:01:33,405 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-10-22 09:01:33,407 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 35 transitions. [2019-10-22 09:01:33,407 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-10-22 09:01:33,407 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-10-22 09:01:33,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 35 transitions. [2019-10-22 09:01:33,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:01:33,408 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 35 transitions. [2019-10-22 09:01:33,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 35 transitions. [2019-10-22 09:01:33,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2019-10-22 09:01:33,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-22 09:01:33,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2019-10-22 09:01:33,423 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-10-22 09:01:33,423 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-10-22 09:01:33,423 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 09:01:33,423 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2019-10-22 09:01:33,423 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2019-10-22 09:01:33,424 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:33,424 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:33,424 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:01:33,424 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:33,424 INFO L791 eck$LassoCheckResult]: Stem: 118#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 115#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~short6, main_#t~mem10.base, main_#t~mem10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet3, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~malloc24.base, main_#t~malloc24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); 105#L538-2 [2019-10-22 09:01:33,424 INFO L793 eck$LassoCheckResult]: Loop: 105#L538-2 assume !!(0 != main_#t~nondet3);havoc main_#t~nondet3;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 101#L528-2 call main_#t~mem4.base, main_#t~mem4.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short6 := main_#t~mem4.base != 0 || main_#t~mem4.offset != 0; 102#L527-1 assume main_#t~short6;call main_#t~mem5.base, main_#t~mem5.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4);main_#t~short6 := main_#t~mem5.base != 0 || main_#t~mem5.offset != 0; 103#L527-3 assume !main_#t~short6;havoc main_#t~mem5.base, main_#t~mem5.offset;havoc main_#t~short6;havoc main_#t~mem4.base, main_#t~mem4.offset; 120#L527-5 call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 112#L533 assume !((main_#t~mem10.base == 0 && main_#t~mem10.offset == 0) && 0 != main_#t~nondet11);havoc main_#t~nondet11;havoc main_#t~mem10.base, main_#t~mem10.offset; 113#L533-2 call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 117#L538 assume !((main_#t~mem15.base == 0 && main_#t~mem15.offset == 0) && 0 != main_#t~nondet16);havoc main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~nondet16; 105#L538-2 [2019-10-22 09:01:33,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:33,425 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2019-10-22 09:01:33,425 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:33,425 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405326175] [2019-10-22 09:01:33,425 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:33,425 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:33,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:33,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:33,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:33,455 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:33,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:33,455 INFO L82 PathProgramCache]: Analyzing trace with hash 2066932982, now seen corresponding path program 1 times [2019-10-22 09:01:33,455 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:33,456 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591720648] [2019-10-22 09:01:33,467 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:33,468 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:33,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:33,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:33,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:33,486 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:33,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:33,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1537472840, now seen corresponding path program 1 times [2019-10-22 09:01:33,487 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:33,487 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256299510] [2019-10-22 09:01:33,487 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:33,488 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:33,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:33,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:33,553 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:33,553 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256299510] [2019-10-22 09:01:33,553 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:33,553 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:01:33,554 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045338832] [2019-10-22 09:01:33,733 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2019-10-22 09:01:33,827 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:33,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:01:33,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:01:33,828 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 11 Second operand 5 states. [2019-10-22 09:01:33,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:33,996 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2019-10-22 09:01:33,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 09:01:33,997 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 46 transitions. [2019-10-22 09:01:33,999 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2019-10-22 09:01:33,999 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 46 transitions. [2019-10-22 09:01:34,000 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2019-10-22 09:01:34,000 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2019-10-22 09:01:34,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 46 transitions. [2019-10-22 09:01:34,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:01:34,000 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 46 transitions. [2019-10-22 09:01:34,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 46 transitions. [2019-10-22 09:01:34,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2019-10-22 09:01:34,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-22 09:01:34,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2019-10-22 09:01:34,003 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2019-10-22 09:01:34,003 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2019-10-22 09:01:34,003 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 09:01:34,003 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 39 transitions. [2019-10-22 09:01:34,006 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2019-10-22 09:01:34,007 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:01:34,007 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:01:34,007 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:01:34,007 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:34,007 INFO L791 eck$LassoCheckResult]: Stem: 183#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 181#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet7, main_#t~mem8.base, main_#t~mem8.offset, main_#t~mem9.base, main_#t~mem9.offset, main_#t~mem4.base, main_#t~mem4.offset, main_#t~mem5.base, main_#t~mem5.offset, main_#t~short6, main_#t~mem10.base, main_#t~mem10.offset, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~mem13.base, main_#t~mem13.offset, main_#t~mem14.base, main_#t~mem14.offset, main_#t~mem15.base, main_#t~mem15.offset, main_#t~nondet16, main_#t~malloc17.base, main_#t~malloc17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~nondet3, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~malloc24.base, main_#t~malloc24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~mem26.base, main_#t~mem26.offset, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~s~0.base, main_~s~0.offset, main_~st~0.base, main_~st~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnHeap(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); 171#L538-2 [2019-10-22 09:01:34,008 INFO L793 eck$LassoCheckResult]: Loop: 171#L538-2 assume !!(0 != main_#t~nondet3);havoc main_#t~nondet3;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 168#L528-2 call main_#t~mem4.base, main_#t~mem4.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short6 := main_#t~mem4.base != 0 || main_#t~mem4.offset != 0; 169#L527-1 assume !main_#t~short6; 170#L527-3 assume !main_#t~short6;havoc main_#t~mem5.base, main_#t~mem5.offset;havoc main_#t~short6;havoc main_#t~mem4.base, main_#t~mem4.offset; 195#L527-5 call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 194#L533 assume !((main_#t~mem10.base == 0 && main_#t~mem10.offset == 0) && 0 != main_#t~nondet11);havoc main_#t~nondet11;havoc main_#t~mem10.base, main_#t~mem10.offset; 184#L533-2 call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 185#L538 assume !((main_#t~mem15.base == 0 && main_#t~mem15.offset == 0) && 0 != main_#t~nondet16);havoc main_#t~mem15.base, main_#t~mem15.offset;havoc main_#t~nondet16; 171#L538-2 [2019-10-22 09:01:34,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:34,008 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2019-10-22 09:01:34,008 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:34,008 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50612550] [2019-10-22 09:01:34,008 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:34,009 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:34,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:34,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:34,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:34,047 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:34,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:34,047 INFO L82 PathProgramCache]: Analyzing trace with hash 2124191284, now seen corresponding path program 1 times [2019-10-22 09:01:34,048 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:34,048 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204501203] [2019-10-22 09:01:34,048 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:34,048 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:34,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:34,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:34,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:34,069 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:34,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:34,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1480214538, now seen corresponding path program 1 times [2019-10-22 09:01:34,069 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:34,070 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131160869] [2019-10-22 09:01:34,070 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:34,070 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:34,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:34,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:34,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:34,098 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:34,230 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-10-22 09:01:34,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 09:01:34 BoogieIcfgContainer [2019-10-22 09:01:34,543 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 09:01:34,545 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:01:34,545 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:01:34,545 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:01:34,546 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:32" (3/4) ... [2019-10-22 09:01:34,549 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-10-22 09:01:34,593 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_2804b2f1-735a-4679-b8d1-25253224f413/bin/uautomizer/witness.graphml [2019-10-22 09:01:34,594 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:01:34,595 INFO L168 Benchmark]: Toolchain (without parser) took 2949.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.0 MB). Free memory was 945.7 MB in the beginning and 934.6 MB in the end (delta: 11.2 MB). Peak memory consumption was 173.2 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:34,596 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:01:34,596 INFO L168 Benchmark]: CACSL2BoogieTranslator took 592.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.0 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -198.4 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:34,597 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.32 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: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:34,597 INFO L168 Benchmark]: Boogie Preprocessor took 58.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:34,598 INFO L168 Benchmark]: RCFGBuilder took 429.12 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: 31.9 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:34,598 INFO L168 Benchmark]: BuchiAutomizer took 1755.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 937.8 MB in the end (delta: 168.0 MB). Peak memory consumption was 168.0 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:34,599 INFO L168 Benchmark]: Witness Printer took 49.11 ms. Allocated memory is still 1.2 GB. Free memory was 937.8 MB in the beginning and 934.6 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:34,605 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 592.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.0 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -198.4 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 60.32 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: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 58.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 429.12 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: 31.9 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1755.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 937.8 MB in the end (delta: 168.0 MB). Peak memory consumption was 168.0 MB. Max. memory is 11.5 GB. * Witness Printer took 49.11 ms. Allocated memory is still 1.2 GB. Free memory was 937.8 MB in the beginning and 934.6 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 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 3 terminating modules (3 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.3 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 28 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.6s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.2s. Construction of modules took 0.2s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 28 states and ocurred in iteration 3. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 68 SDtfs, 29 SDslu, 60 SDs, 0 SdLazy, 100 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: 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: 525]: 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 {s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@62926f33=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@79e0f12b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1e23dea8=0, NULL=-2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@53acecd7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6e16c81e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@37f5db2e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6c4d4f6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2663488f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@468c75ce=0, root=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@58b4f030=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@62926f33=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@30cbd68c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1e1fde3f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@15b0d203=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@33fd859b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3aa26484=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@b155009=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1e1fde3f=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@19a5813=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@15b0d203=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6c4d4f6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@58b4f030=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@468c75ce=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@53acecd7=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@295e4d84=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1e23dea8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@50491bbd=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2652c184=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@341583d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@37f5db2e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@b155009=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2c07c289=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@346e2b60=0, n=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5ad885ea=7, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@295e4d84=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@46422d75=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6e16c81e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2663488f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@341583d=0, root=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2c07c289=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@46422d75=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7b0ab63e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@2970c764=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@19a5813=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@79e0f12b=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@50491bbd=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2652c184=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7b0ab63e=0, s=0, n=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3aa26484=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 525]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L522] struct TreeNode* root = malloc(sizeof(*root)), *n; [L523] root->left = ((void *)0) [L524] root->right = ((void *)0) Loop: [L525] COND TRUE __VERIFIER_nondet_int() [L526] n = root [L527] EXPR n->left [L527] n->left && n->right [L527] COND FALSE !(n->left && n->right) [L533] EXPR n->left [L533] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L538] EXPR n->right [L538] COND FALSE !(!n->right && __VERIFIER_nondet_int()) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...