./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 30f4e4ab 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_parent_ptr.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 fba36da5e1e25c0eb21d7d749a840ca84da8c0fc .............................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-30f4e4a [2019-11-28 03:53:59,211 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 03:53:59,214 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 03:53:59,226 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 03:53:59,227 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 03:53:59,228 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 03:53:59,229 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 03:53:59,231 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 03:53:59,233 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 03:53:59,234 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 03:53:59,235 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 03:53:59,236 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 03:53:59,236 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 03:53:59,237 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 03:53:59,238 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 03:53:59,240 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 03:53:59,240 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 03:53:59,241 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 03:53:59,243 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 03:53:59,245 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 03:53:59,247 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 03:53:59,248 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 03:53:59,249 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 03:53:59,250 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 03:53:59,253 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 03:53:59,253 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 03:53:59,253 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 03:53:59,254 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 03:53:59,254 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 03:53:59,255 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 03:53:59,256 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 03:53:59,256 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 03:53:59,257 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 03:53:59,258 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 03:53:59,259 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 03:53:59,259 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 03:53:59,260 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 03:53:59,260 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 03:53:59,261 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 03:53:59,262 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 03:53:59,262 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 03:53:59,263 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 03:53:59,281 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 03:53:59,281 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 03:53:59,282 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 03:53:59,282 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 03:53:59,283 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 03:53:59,283 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 03:53:59,283 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 03:53:59,283 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 03:53:59,284 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 03:53:59,284 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 03:53:59,284 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 03:53:59,284 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 03:53:59,284 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 03:53:59,285 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 03:53:59,285 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 03:53:59,285 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 03:53:59,285 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 03:53:59,285 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 03:53:59,286 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 03:53:59,286 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 03:53:59,286 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 03:53:59,286 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 03:53:59,287 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 03:53:59,288 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 03:53:59,288 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 03:53:59,288 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 03:53:59,288 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 03:53:59,289 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 03:53:59,289 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 03:53:59,289 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 03:53:59,289 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 03:53:59,290 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 03:53:59,290 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 -> fba36da5e1e25c0eb21d7d749a840ca84da8c0fc [2019-11-28 03:53:59,692 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 03:53:59,706 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 03:53:59,714 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 03:53:59,716 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 03:53:59,716 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 03:53:59,717 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i [2019-11-28 03:53:59,783 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2867a0af7/4b85d4fe1a204b5db0b57f3660d17f31/FLAG75c4c7acb [2019-11-28 03:54:00,272 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 03:54:00,273 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_parent_ptr.i [2019-11-28 03:54:00,293 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2867a0af7/4b85d4fe1a204b5db0b57f3660d17f31/FLAG75c4c7acb [2019-11-28 03:54:00,605 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2867a0af7/4b85d4fe1a204b5db0b57f3660d17f31 [2019-11-28 03:54:00,608 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 03:54:00,610 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 03:54:00,611 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 03:54:00,611 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 03:54:00,614 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 03:54:00,615 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:54:00" (1/1) ... [2019-11-28 03:54:00,618 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6822e6d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:00, skipping insertion in model container [2019-11-28 03:54:00,618 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:54:00" (1/1) ... [2019-11-28 03:54:00,625 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 03:54:00,678 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 03:54:01,183 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:54:01,195 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 03:54:01,270 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:54:01,329 INFO L208 MainTranslator]: Completed translation [2019-11-28 03:54:01,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:01 WrapperNode [2019-11-28 03:54:01,330 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 03:54:01,331 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 03:54:01,331 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 03:54:01,331 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 03:54:01,340 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:01" (1/1) ... [2019-11-28 03:54:01,361 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:01" (1/1) ... [2019-11-28 03:54:01,389 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 03:54:01,389 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 03:54:01,389 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 03:54:01,390 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 03:54:01,400 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:01" (1/1) ... [2019-11-28 03:54:01,400 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:01" (1/1) ... [2019-11-28 03:54:01,404 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:01" (1/1) ... [2019-11-28 03:54:01,404 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:01" (1/1) ... [2019-11-28 03:54:01,423 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:01" (1/1) ... [2019-11-28 03:54:01,427 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:01" (1/1) ... [2019-11-28 03:54:01,429 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:01" (1/1) ... [2019-11-28 03:54:01,432 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 03:54:01,433 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 03:54:01,433 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 03:54:01,433 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 03:54:01,434 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:01" (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 03:54:01,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 03:54:01,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-28 03:54:01,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 03:54:01,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 03:54:01,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 03:54:01,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 03:54:01,994 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 03:54:01,995 INFO L297 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-28 03:54:01,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:54:01 BoogieIcfgContainer [2019-11-28 03:54:01,997 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 03:54:01,998 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 03:54:01,998 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 03:54:02,004 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 03:54:02,005 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:54:02,005 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:54:00" (1/3) ... [2019-11-28 03:54:02,007 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1424e312 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:54:02, skipping insertion in model container [2019-11-28 03:54:02,007 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:54:02,008 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:01" (2/3) ... [2019-11-28 03:54:02,009 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1424e312 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:54:02, skipping insertion in model container [2019-11-28 03:54:02,009 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:54:02,010 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:54:01" (3/3) ... [2019-11-28 03:54:02,012 INFO L371 chiAutomizerObserver]: Analyzing ICFG tree_parent_ptr.i [2019-11-28 03:54:02,069 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 03:54:02,070 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 03:54:02,070 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 03:54:02,070 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 03:54:02,071 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 03:54:02,071 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 03:54:02,071 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 03:54:02,071 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 03:54:02,091 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-11-28 03:54:02,119 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2019-11-28 03:54:02,120 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:54:02,120 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:54:02,127 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 03:54:02,128 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-28 03:54:02,128 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 03:54:02,128 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-11-28 03:54:02,132 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2019-11-28 03:54:02,132 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:54:02,132 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:54:02,133 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 03:54:02,133 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-28 03:54:02,142 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 10#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~mem16.base, main_#t~mem16.offset, main_#t~nondet17, main_#t~malloc18.base, main_#t~malloc18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~nondet3, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~malloc26.base, main_#t~malloc26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.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(12);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);call write~$Pointer$(0, 0, main_~root~0.base, 8 + main_~root~0.offset, 4); 18#L541-2true [2019-11-28 03:54:02,143 INFO L796 eck$LassoCheckResult]: Loop: 18#L541-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; 20#L530-2true assume !true; 7#L529-5true call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 6#L535true 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(12);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;call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(main_~n~0.base, main_~n~0.offset, main_#t~mem15.base, 8 + main_#t~mem15.offset, 4);havoc main_#t~mem15.base, main_#t~mem15.offset; 9#L535-2true call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 13#L541true assume !((main_#t~mem16.base == 0 && main_#t~mem16.offset == 0) && 0 != main_#t~nondet17);havoc main_#t~mem16.base, main_#t~mem16.offset;havoc main_#t~nondet17; 18#L541-2true [2019-11-28 03:54:02,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:02,150 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-28 03:54:02,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:02,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543513573] [2019-11-28 03:54:02,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:02,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:02,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:02,316 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:54:02,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:02,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1235889697, now seen corresponding path program 1 times [2019-11-28 03:54:02,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:02,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954676345] [2019-11-28 03:54:02,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:02,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:54:02,351 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 03:54:02,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954676345] [2019-11-28 03:54:02,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:54:02,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 03:54:02,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46140827] [2019-11-28 03:54:02,358 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:54:02,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:54:02,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 03:54:02,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 03:54:02,374 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2019-11-28 03:54:02,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:54:02,380 INFO L93 Difference]: Finished difference Result 21 states and 29 transitions. [2019-11-28 03:54:02,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 03:54:02,382 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 29 transitions. [2019-11-28 03:54:02,384 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2019-11-28 03:54:02,388 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 25 transitions. [2019-11-28 03:54:02,389 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-28 03:54:02,389 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-28 03:54:02,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 25 transitions. [2019-11-28 03:54:02,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:54:02,390 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2019-11-28 03:54:02,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 25 transitions. [2019-11-28 03:54:02,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-28 03:54:02,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 03:54:02,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2019-11-28 03:54:02,418 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2019-11-28 03:54:02,418 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2019-11-28 03:54:02,418 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 03:54:02,418 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 25 transitions. [2019-11-28 03:54:02,419 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2019-11-28 03:54:02,419 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:54:02,419 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:54:02,420 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 03:54:02,420 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:54:02,420 INFO L794 eck$LassoCheckResult]: Stem: 64#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 61#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~mem16.base, main_#t~mem16.offset, main_#t~nondet17, main_#t~malloc18.base, main_#t~malloc18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~nondet3, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~malloc26.base, main_#t~malloc26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.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(12);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);call write~$Pointer$(0, 0, main_~root~0.base, 8 + main_~root~0.offset, 4); 62#L541-2 [2019-11-28 03:54:02,420 INFO L796 eck$LassoCheckResult]: Loop: 62#L541-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; 65#L530-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; 66#L529-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; 50#L529-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; 51#L529-5 call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 57#L535 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(12);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;call main_#t~mem15.base, main_#t~mem15.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(main_~n~0.base, main_~n~0.offset, main_#t~mem15.base, 8 + main_#t~mem15.offset, 4);havoc main_#t~mem15.base, main_#t~mem15.offset; 58#L535-2 call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 60#L541 assume !((main_#t~mem16.base == 0 && main_#t~mem16.offset == 0) && 0 != main_#t~nondet17);havoc main_#t~mem16.base, main_#t~mem16.offset;havoc main_#t~nondet17; 62#L541-2 [2019-11-28 03:54:02,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:02,421 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-11-28 03:54:02,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:02,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499370699] [2019-11-28 03:54:02,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:02,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:02,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:02,452 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:54:02,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:02,453 INFO L82 PathProgramCache]: Analyzing trace with hash 2066931060, now seen corresponding path program 1 times [2019-11-28 03:54:02,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:02,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893473004] [2019-11-28 03:54:02,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:02,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:54:02,603 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 03:54:02,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893473004] [2019-11-28 03:54:02,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:54:02,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 03:54:02,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103292727] [2019-11-28 03:54:02,605 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:54:02,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:54:02,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 03:54:02,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 03:54:02,606 INFO L87 Difference]: Start difference. First operand 17 states and 25 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-11-28 03:54:02,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:54:02,741 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2019-11-28 03:54:02,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 03:54:02,743 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2019-11-28 03:54:02,744 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-11-28 03:54:02,747 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 35 transitions. [2019-11-28 03:54:02,747 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-11-28 03:54:02,747 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-11-28 03:54:02,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 35 transitions. [2019-11-28 03:54:02,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:54:02,748 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 35 transitions. [2019-11-28 03:54:02,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 35 transitions. [2019-11-28 03:54:02,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2019-11-28 03:54:02,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-28 03:54:02,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2019-11-28 03:54:02,752 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-11-28 03:54:02,752 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-11-28 03:54:02,752 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 03:54:02,753 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2019-11-28 03:54:02,754 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2019-11-28 03:54:02,754 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:54:02,754 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:54:02,754 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 03:54:02,755 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:54:02,755 INFO L794 eck$LassoCheckResult]: Stem: 116#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 114#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~mem16.base, main_#t~mem16.offset, main_#t~nondet17, main_#t~malloc18.base, main_#t~malloc18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~nondet3, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~malloc26.base, main_#t~malloc26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.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(12);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);call write~$Pointer$(0, 0, main_~root~0.base, 8 + main_~root~0.offset, 4); 115#L541-2 [2019-11-28 03:54:02,755 INFO L796 eck$LassoCheckResult]: Loop: 115#L541-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; 118#L530-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; 119#L529-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; 101#L529-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; 102#L529-5 call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 108#L535 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; 109#L535-2 call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 113#L541 assume !((main_#t~mem16.base == 0 && main_#t~mem16.offset == 0) && 0 != main_#t~nondet17);havoc main_#t~mem16.base, main_#t~mem16.offset;havoc main_#t~nondet17; 115#L541-2 [2019-11-28 03:54:02,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:02,756 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2019-11-28 03:54:02,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:02,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895499971] [2019-11-28 03:54:02,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:02,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:02,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:02,784 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:54:02,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:02,785 INFO L82 PathProgramCache]: Analyzing trace with hash 2066932982, now seen corresponding path program 1 times [2019-11-28 03:54:02,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:02,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153690804] [2019-11-28 03:54:02,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:02,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:02,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:02,810 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:54:02,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:02,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1537472840, now seen corresponding path program 1 times [2019-11-28 03:54:02,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:02,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631086252] [2019-11-28 03:54:02,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:02,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:54:02,927 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 03:54:02,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631086252] [2019-11-28 03:54:02,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:54:02,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 03:54:02,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094918807] [2019-11-28 03:54:03,173 WARN L192 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2019-11-28 03:54:03,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:54:03,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 03:54:03,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 03:54:03,296 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 11 Second operand 5 states. [2019-11-28 03:54:03,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:54:03,482 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2019-11-28 03:54:03,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 03:54:03,482 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 46 transitions. [2019-11-28 03:54:03,484 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2019-11-28 03:54:03,485 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 46 transitions. [2019-11-28 03:54:03,486 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2019-11-28 03:54:03,486 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2019-11-28 03:54:03,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 46 transitions. [2019-11-28 03:54:03,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:54:03,487 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 46 transitions. [2019-11-28 03:54:03,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 46 transitions. [2019-11-28 03:54:03,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2019-11-28 03:54:03,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-28 03:54:03,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2019-11-28 03:54:03,491 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2019-11-28 03:54:03,492 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2019-11-28 03:54:03,492 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 03:54:03,492 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 39 transitions. [2019-11-28 03:54:03,493 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2019-11-28 03:54:03,493 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:54:03,494 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:54:03,494 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 03:54:03,494 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:54:03,495 INFO L794 eck$LassoCheckResult]: Stem: 182#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 180#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~mem16.base, main_#t~mem16.offset, main_#t~nondet17, main_#t~malloc18.base, main_#t~malloc18.offset, main_#t~mem19.base, main_#t~mem19.offset, main_#t~mem20.base, main_#t~mem20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~nondet3, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~mem25.base, main_#t~mem25.offset, main_#t~malloc26.base, main_#t~malloc26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~malloc29.base, main_#t~malloc29.offset, main_#t~mem30.base, main_#t~mem30.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(12);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);call write~$Pointer$(0, 0, main_~root~0.base, 8 + main_~root~0.offset, 4); 181#L541-2 [2019-11-28 03:54:03,495 INFO L796 eck$LassoCheckResult]: Loop: 181#L541-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; 192#L530-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; 189#L529-1 assume !main_#t~short6; 190#L529-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#L529-5 call main_#t~mem10.base, main_#t~mem10.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 193#L535 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; 178#L535-2 call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 179#L541 assume !((main_#t~mem16.base == 0 && main_#t~mem16.offset == 0) && 0 != main_#t~nondet17);havoc main_#t~mem16.base, main_#t~mem16.offset;havoc main_#t~nondet17; 181#L541-2 [2019-11-28 03:54:03,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:03,495 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2019-11-28 03:54:03,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:03,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849228321] [2019-11-28 03:54:03,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:03,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:03,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:03,529 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:54:03,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:03,530 INFO L82 PathProgramCache]: Analyzing trace with hash 2124191284, now seen corresponding path program 1 times [2019-11-28 03:54:03,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:03,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277515129] [2019-11-28 03:54:03,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:03,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:03,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:03,555 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:54:03,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:03,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1480214538, now seen corresponding path program 1 times [2019-11-28 03:54:03,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:03,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439291022] [2019-11-28 03:54:03,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:03,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:03,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:03,617 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:54:03,776 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-11-28 03:54:04,061 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-11-28 03:54:04,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 03:54:04 BoogieIcfgContainer [2019-11-28 03:54:04,175 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 03:54:04,175 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 03:54:04,175 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 03:54:04,176 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 03:54:04,176 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:54:01" (3/4) ... [2019-11-28 03:54:04,179 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-28 03:54:04,226 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 03:54:04,226 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 03:54:04,229 INFO L168 Benchmark]: Toolchain (without parser) took 3618.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 957.7 MB in the beginning and 893.7 MB in the end (delta: 64.0 MB). Peak memory consumption was 196.1 MB. Max. memory is 11.5 GB. [2019-11-28 03:54:04,229 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:54:04,230 INFO L168 Benchmark]: CACSL2BoogieTranslator took 719.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -155.8 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2019-11-28 03:54:04,231 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 03:54:04,232 INFO L168 Benchmark]: Boogie Preprocessor took 43.12 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:54:04,233 INFO L168 Benchmark]: RCFGBuilder took 564.53 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.4 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. [2019-11-28 03:54:04,234 INFO L168 Benchmark]: BuchiAutomizer took 2176.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 893.7 MB in the end (delta: 176.3 MB). Peak memory consumption was 176.3 MB. Max. memory is 11.5 GB. [2019-11-28 03:54:04,235 INFO L168 Benchmark]: Witness Printer took 51.46 ms. Allocated memory is still 1.2 GB. Free memory is still 893.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:54:04,240 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 719.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -155.8 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 58.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.12 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 564.53 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.4 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2176.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 893.7 MB in the end (delta: 176.3 MB). Peak memory consumption was 176.3 MB. Max. memory is 11.5 GB. * Witness Printer took 51.46 ms. Allocated memory is still 1.2 GB. Free memory is still 893.7 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 2.0s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.5s. 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: 527]: 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@195d7f88=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7f3b0ec2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5abd9886=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@38141fb7=0, NULL=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@349d57cc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@39051ac4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3cf12739=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4127301a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2a780db5=0, root=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3064ec57=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@195d7f88=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7f5a016=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@24096690=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6c2d3dcb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2b7c66ec=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@293d3240=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1b9dea6a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3064ec57=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6d48ccb2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2efa750d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6c2d3dcb=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@38141fb7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3cf12739=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@337101a5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2a780db5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1a3592c0=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@e761ee1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5abd9886=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2b4f4b72=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@527ae007=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@39051ac4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@79bc20f7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@337101a5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@1b9dea6a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@56e35173=0, n=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@17562a0a=6, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@e761ee1=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@24096690=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7d7dc7d0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@349d57cc=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4127301a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4024312e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@79bc20f7=0, root=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4024312e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7d7dc7d0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@515300fa=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1a3592c0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6d48ccb2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2efa750d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7f3b0ec2=0, s=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2b4f4b72=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@527ae007=0, s=0, n=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@293d3240=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 527]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L523] struct TreeNode* root = malloc(sizeof(*root)), *n; [L524] root->left = ((void *)0) [L525] root->right = ((void *)0) [L526] root->parent = ((void *)0) Loop: [L527] COND TRUE __VERIFIER_nondet_int() [L528] n = root [L529] EXPR n->left [L529] n->left && n->right [L529] COND FALSE !(n->left && n->right) [L535] EXPR n->left [L535] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L541] EXPR n->right [L541] COND FALSE !(!n->right && __VERIFIER_nondet_int()) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...