./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 f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/memsafety-ext/tree_stack.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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.25-f470102 [2019-11-28 21:26:26,064 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 21:26:26,066 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 21:26:26,080 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 21:26:26,080 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 21:26:26,082 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 21:26:26,083 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 21:26:26,085 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 21:26:26,087 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 21:26:26,088 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 21:26:26,089 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 21:26:26,091 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 21:26:26,091 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 21:26:26,092 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 21:26:26,093 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 21:26:26,095 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 21:26:26,098 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 21:26:26,099 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 21:26:26,104 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 21:26:26,106 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 21:26:26,110 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 21:26:26,113 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 21:26:26,114 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 21:26:26,115 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 21:26:26,118 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 21:26:26,118 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 21:26:26,118 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 21:26:26,120 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 21:26:26,121 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 21:26:26,123 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 21:26:26,124 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 21:26:26,125 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 21:26:26,126 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 21:26:26,127 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 21:26:26,128 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 21:26:26,129 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 21:26:26,130 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 21:26:26,130 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 21:26:26,130 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 21:26:26,131 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 21:26:26,132 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 21:26:26,133 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 21:26:26,149 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 21:26:26,150 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 21:26:26,151 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 21:26:26,151 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 21:26:26,151 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 21:26:26,152 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 21:26:26,152 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 21:26:26,152 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 21:26:26,152 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 21:26:26,153 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 21:26:26,153 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 21:26:26,153 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 21:26:26,153 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 21:26:26,154 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 21:26:26,154 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 21:26:26,154 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 21:26:26,154 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 21:26:26,155 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 21:26:26,155 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 21:26:26,155 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 21:26:26,155 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 21:26:26,155 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 21:26:26,156 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 21:26:26,156 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 21:26:26,156 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 21:26:26,156 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 21:26:26,157 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 21:26:26,157 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 21:26:26,157 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 21:26:26,157 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 21:26:26,158 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 21:26:26,158 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 21:26:26,159 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 21:26:26,159 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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-11-28 21:26:26,479 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 21:26:26,496 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 21:26:26,500 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 21:26:26,502 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 21:26:26,502 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 21:26:26,503 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/tree_stack.i [2019-11-28 21:26:26,578 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5007f7b37/b23dcef8764f4f0d927da9a0aa3bfd0f/FLAGa9c0e1bb2 [2019-11-28 21:26:27,150 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 21:26:27,151 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_stack.i [2019-11-28 21:26:27,164 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5007f7b37/b23dcef8764f4f0d927da9a0aa3bfd0f/FLAGa9c0e1bb2 [2019-11-28 21:26:27,422 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5007f7b37/b23dcef8764f4f0d927da9a0aa3bfd0f [2019-11-28 21:26:27,426 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 21:26:27,427 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 21:26:27,429 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 21:26:27,429 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 21:26:27,432 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 21:26:27,433 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 09:26:27" (1/1) ... [2019-11-28 21:26:27,436 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bb3677d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:27, skipping insertion in model container [2019-11-28 21:26:27,437 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 09:26:27" (1/1) ... [2019-11-28 21:26:27,444 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 21:26:27,501 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 21:26:27,950 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 21:26:27,959 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 21:26:28,010 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 21:26:28,067 INFO L208 MainTranslator]: Completed translation [2019-11-28 21:26:28,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:28 WrapperNode [2019-11-28 21:26:28,068 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 21:26:28,069 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 21:26:28,070 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 21:26:28,070 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 21:26:28,079 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:28" (1/1) ... [2019-11-28 21:26:28,101 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:28" (1/1) ... [2019-11-28 21:26:28,128 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 21:26:28,129 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 21:26:28,129 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 21:26:28,129 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 21:26:28,138 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:28" (1/1) ... [2019-11-28 21:26:28,138 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:28" (1/1) ... [2019-11-28 21:26:28,142 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:28" (1/1) ... [2019-11-28 21:26:28,142 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:28" (1/1) ... [2019-11-28 21:26:28,152 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:28" (1/1) ... [2019-11-28 21:26:28,158 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:28" (1/1) ... [2019-11-28 21:26:28,160 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:28" (1/1) ... [2019-11-28 21:26:28,164 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 21:26:28,164 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 21:26:28,165 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 21:26:28,165 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 21:26:28,166 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:26:28,240 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 21:26:28,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-28 21:26:28,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 21:26:28,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 21:26:28,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 21:26:28,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 21:26:28,720 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 21:26:28,721 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-28 21:26:28,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 09:26:28 BoogieIcfgContainer [2019-11-28 21:26:28,722 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 21:26:28,723 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 21:26:28,723 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 21:26:28,726 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 21:26:28,727 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:26:28,727 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 09:26:27" (1/3) ... [2019-11-28 21:26:28,729 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1cf806f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 09:26:28, skipping insertion in model container [2019-11-28 21:26:28,729 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:26:28,729 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:26:28" (2/3) ... [2019-11-28 21:26:28,730 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1cf806f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 09:26:28, skipping insertion in model container [2019-11-28 21:26:28,730 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:26:28,731 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 09:26:28" (3/3) ... [2019-11-28 21:26:28,732 INFO L371 chiAutomizerObserver]: Analyzing ICFG tree_stack.i [2019-11-28 21:26:28,772 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 21:26:28,773 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 21:26:28,773 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 21:26:28,773 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 21:26:28,773 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 21:26:28,773 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 21:26:28,773 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 21:26:28,774 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 21:26:28,786 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-11-28 21:26:28,806 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2019-11-28 21:26:28,807 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:26:28,807 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:26:28,813 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 21:26:28,813 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-28 21:26:28,813 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 21:26:28,814 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-11-28 21:26:28,815 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2019-11-28 21:26:28,816 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:26:28,816 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:26:28,816 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 21:26:28,816 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-28 21:26:28,824 INFO L794 eck$LassoCheckResult]: Stem: 16#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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-11-28 21:26:28,824 INFO L796 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~mem10.base, main_#t~mem10.offset;havoc main_#t~nondet11;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-11-28 21:26:28,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:28,830 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-28 21:26:28,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:28,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599767559] [2019-11-28 21:26:28,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:28,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:28,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:28,991 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:28,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:28,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1235889697, now seen corresponding path program 1 times [2019-11-28 21:26:28,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:28,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602167320] [2019-11-28 21:26:28,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:29,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:29,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:26:29,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602167320] [2019-11-28 21:26:29,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:26:29,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 21:26:29,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911391835] [2019-11-28 21:26:29,039 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 21:26:29,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:26:29,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 21:26:29,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 21:26:29,060 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2019-11-28 21:26:29,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:26:29,069 INFO L93 Difference]: Finished difference Result 21 states and 29 transitions. [2019-11-28 21:26:29,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 21:26:29,072 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 29 transitions. [2019-11-28 21:26:29,073 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2019-11-28 21:26:29,078 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 25 transitions. [2019-11-28 21:26:29,080 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-28 21:26:29,080 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-28 21:26:29,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 25 transitions. [2019-11-28 21:26:29,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:26:29,081 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2019-11-28 21:26:29,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 25 transitions. [2019-11-28 21:26:29,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-28 21:26:29,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 21:26:29,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2019-11-28 21:26:29,120 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2019-11-28 21:26:29,121 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2019-11-28 21:26:29,121 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 21:26:29,121 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 25 transitions. [2019-11-28 21:26:29,122 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2019-11-28 21:26:29,122 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:26:29,122 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:26:29,123 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 21:26:29,123 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:26:29,123 INFO L794 eck$LassoCheckResult]: Stem: 65#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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-11-28 21:26:29,125 INFO L796 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~short6;havoc main_#t~mem5.base, main_#t~mem5.offset;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~mem10.base, main_#t~mem10.offset;havoc main_#t~nondet11;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-11-28 21:26:29,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:29,127 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-11-28 21:26:29,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:29,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802358788] [2019-11-28 21:26:29,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:29,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:29,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:29,199 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:29,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:29,200 INFO L82 PathProgramCache]: Analyzing trace with hash 2066931060, now seen corresponding path program 1 times [2019-11-28 21:26:29,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:29,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857026699] [2019-11-28 21:26:29,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:29,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:29,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:26:29,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857026699] [2019-11-28 21:26:29,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:26:29,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 21:26:29,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121275699] [2019-11-28 21:26:29,322 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 21:26:29,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:26:29,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 21:26:29,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 21:26:29,324 INFO L87 Difference]: Start difference. First operand 17 states and 25 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-11-28 21:26:29,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:26:29,465 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2019-11-28 21:26:29,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 21:26:29,466 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2019-11-28 21:26:29,468 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-11-28 21:26:29,470 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 35 transitions. [2019-11-28 21:26:29,470 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-11-28 21:26:29,471 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-11-28 21:26:29,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 35 transitions. [2019-11-28 21:26:29,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:26:29,471 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 35 transitions. [2019-11-28 21:26:29,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 35 transitions. [2019-11-28 21:26:29,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2019-11-28 21:26:29,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-28 21:26:29,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2019-11-28 21:26:29,476 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-11-28 21:26:29,476 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-11-28 21:26:29,476 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 21:26:29,476 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2019-11-28 21:26:29,477 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2019-11-28 21:26:29,477 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:26:29,477 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:26:29,478 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 21:26:29,478 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:26:29,478 INFO L794 eck$LassoCheckResult]: Stem: 118#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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-11-28 21:26:29,478 INFO L796 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~short6;havoc main_#t~mem5.base, main_#t~mem5.offset;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~mem10.base, main_#t~mem10.offset;havoc main_#t~nondet11; 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-11-28 21:26:29,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:29,479 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2019-11-28 21:26:29,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:29,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17387439] [2019-11-28 21:26:29,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:29,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:29,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:29,503 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:29,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:29,504 INFO L82 PathProgramCache]: Analyzing trace with hash 2066932982, now seen corresponding path program 1 times [2019-11-28 21:26:29,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:29,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901778153] [2019-11-28 21:26:29,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:29,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:29,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:29,534 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:29,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:29,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1537472840, now seen corresponding path program 1 times [2019-11-28 21:26:29,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:29,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142804795] [2019-11-28 21:26:29,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:29,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:26:29,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:26:29,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142804795] [2019-11-28 21:26:29,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:26:29,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 21:26:29,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498915814] [2019-11-28 21:26:29,871 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2019-11-28 21:26:29,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:26:29,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 21:26:29,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 21:26:29,975 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 11 Second operand 5 states. [2019-11-28 21:26:30,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:26:30,141 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2019-11-28 21:26:30,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 21:26:30,142 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 46 transitions. [2019-11-28 21:26:30,144 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2019-11-28 21:26:30,145 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 46 transitions. [2019-11-28 21:26:30,145 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2019-11-28 21:26:30,145 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2019-11-28 21:26:30,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 46 transitions. [2019-11-28 21:26:30,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:26:30,146 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 46 transitions. [2019-11-28 21:26:30,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 46 transitions. [2019-11-28 21:26:30,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2019-11-28 21:26:30,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-28 21:26:30,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2019-11-28 21:26:30,150 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2019-11-28 21:26:30,150 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2019-11-28 21:26:30,150 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 21:26:30,150 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 39 transitions. [2019-11-28 21:26:30,151 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2019-11-28 21:26:30,151 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:26:30,151 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:26:30,152 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 21:26:30,152 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:26:30,152 INFO L794 eck$LassoCheckResult]: Stem: 183#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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-11-28 21:26:30,152 INFO L796 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~short6;havoc main_#t~mem5.base, main_#t~mem5.offset;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~mem10.base, main_#t~mem10.offset;havoc main_#t~nondet11; 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-11-28 21:26:30,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:30,153 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2019-11-28 21:26:30,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:30,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505313489] [2019-11-28 21:26:30,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:30,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:30,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:30,171 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:30,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:30,172 INFO L82 PathProgramCache]: Analyzing trace with hash 2124191284, now seen corresponding path program 1 times [2019-11-28 21:26:30,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:30,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15609931] [2019-11-28 21:26:30,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:30,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:30,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:30,192 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:30,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:26:30,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1480214538, now seen corresponding path program 1 times [2019-11-28 21:26:30,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:26:30,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899841016] [2019-11-28 21:26:30,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:26:30,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:30,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:26:30,235 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:26:30,396 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-11-28 21:26:30,508 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-28 21:26:30,636 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-11-28 21:26:30,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 09:26:30 BoogieIcfgContainer [2019-11-28 21:26:30,766 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 21:26:30,767 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 21:26:30,767 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 21:26:30,768 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 21:26:30,769 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 09:26:28" (3/4) ... [2019-11-28 21:26:30,772 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-28 21:26:30,848 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 21:26:30,848 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 21:26:30,853 INFO L168 Benchmark]: Toolchain (without parser) took 3422.89 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 955.0 MB in the beginning and 875.1 MB in the end (delta: 79.9 MB). Peak memory consumption was 187.9 MB. Max. memory is 11.5 GB. [2019-11-28 21:26:30,856 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 21:26:30,857 INFO L168 Benchmark]: CACSL2BoogieTranslator took 640.32 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -134.9 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-28 21:26:30,859 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.36 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. [2019-11-28 21:26:30,860 INFO L168 Benchmark]: Boogie Preprocessor took 35.17 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 21:26:30,861 INFO L168 Benchmark]: RCFGBuilder took 557.78 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. [2019-11-28 21:26:30,864 INFO L168 Benchmark]: BuchiAutomizer took 2043.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 875.1 MB in the end (delta: 175.3 MB). Peak memory consumption was 175.3 MB. Max. memory is 11.5 GB. [2019-11-28 21:26:30,865 INFO L168 Benchmark]: Witness Printer took 81.04 ms. Allocated memory is still 1.1 GB. Free memory is still 875.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 21:26:30,871 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.29 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 640.32 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -134.9 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 59.36 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.17 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 557.78 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2043.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 875.1 MB in the end (delta: 175.3 MB). Peak memory consumption was 175.3 MB. Max. memory is 11.5 GB. * Witness Printer took 81.04 ms. Allocated memory is still 1.1 GB. Free memory is still 875.1 MB. There was no memory consumed. 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.9s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.4s. 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=1} State at position 1 is {s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6b55aeed=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@304844a0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@56709322=0, NULL=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2062399a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6e529e95=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@77360a8b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@149c6d63=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6b13dcd4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7227c317=0, root=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@59ab91b4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6b55aeed=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@24e6561f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5b9e0ad3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6b8b156a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2cfc4348=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7529af86=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5f8a09f4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5b9e0ad3=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@12fb886a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6b8b156a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@149c6d63=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@59ab91b4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7227c317=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2062399a=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@30dd4b7e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@56709322=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@536c26ba=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1351f5fe=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5a34d4b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@77360a8b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5f8a09f4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@307186fa=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5a4f301e=0, n=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@19960ff7=10, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@30dd4b7e=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@239c8b08=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6e529e95=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6b13dcd4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5a34d4b=0, root=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@307186fa=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@239c8b08=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6bda6433=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@30066a98=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@12fb886a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@304844a0=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@536c26ba=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1351f5fe=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6bda6433=0, s=0, n=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7529af86=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...