./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/memsafety-ext/tree_cnstr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/memsafety-ext/tree_cnstr.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 ba983053090b7e7410066c63fe0cfe9ad27960a7dc19d54045684ba21359c88d --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 19:28:24,690 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 19:28:24,738 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-02-06 19:28:24,742 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 19:28:24,742 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 19:28:24,742 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-02-06 19:28:24,764 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 19:28:24,765 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 19:28:24,765 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 19:28:24,766 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 19:28:24,766 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 19:28:24,767 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 19:28:24,767 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 19:28:24,767 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 19:28:24,768 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-06 19:28:24,768 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-06 19:28:24,768 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-06 19:28:24,768 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-06 19:28:24,768 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-06 19:28:24,768 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-06 19:28:24,768 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 19:28:24,768 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-06 19:28:24,768 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 19:28:24,768 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 19:28:24,768 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 19:28:24,768 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 19:28:24,768 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-06 19:28:24,769 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-06 19:28:24,769 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-06 19:28:24,769 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 19:28:24,769 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 19:28:24,769 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 19:28:24,769 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-06 19:28:24,769 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 19:28:24,769 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 19:28:24,770 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 19:28:24,770 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 19:28:24,770 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 19:28:24,770 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 19:28:24,770 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-06 19:28:24,770 INFO L153 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-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> ba983053090b7e7410066c63fe0cfe9ad27960a7dc19d54045684ba21359c88d [2025-02-06 19:28:24,981 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 19:28:24,990 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 19:28:24,991 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 19:28:24,992 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 19:28:24,992 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 19:28:24,993 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/tree_cnstr.i [2025-02-06 19:28:26,057 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d447ea2a7/72b192bbde0d41d194b6b5162324d0bd/FLAGe31cd2102 [2025-02-06 19:28:26,326 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 19:28:26,326 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_cnstr.i [2025-02-06 19:28:26,335 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d447ea2a7/72b192bbde0d41d194b6b5162324d0bd/FLAGe31cd2102 [2025-02-06 19:28:26,631 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d447ea2a7/72b192bbde0d41d194b6b5162324d0bd [2025-02-06 19:28:26,633 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 19:28:26,634 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 19:28:26,635 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 19:28:26,635 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 19:28:26,637 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 19:28:26,638 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 07:28:26" (1/1) ... [2025-02-06 19:28:26,638 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ad7556a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:28:26, skipping insertion in model container [2025-02-06 19:28:26,638 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 07:28:26" (1/1) ... [2025-02-06 19:28:26,654 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 19:28:26,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 19:28:26,833 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 19:28:26,866 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 19:28:26,883 INFO L204 MainTranslator]: Completed translation [2025-02-06 19:28:26,884 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:28:26 WrapperNode [2025-02-06 19:28:26,884 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 19:28:26,884 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 19:28:26,885 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 19:28:26,885 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 19:28:26,888 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:28:26" (1/1) ... [2025-02-06 19:28:26,895 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:28:26" (1/1) ... [2025-02-06 19:28:26,910 INFO L138 Inliner]: procedures = 123, calls = 36, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 124 [2025-02-06 19:28:26,910 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 19:28:26,911 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 19:28:26,911 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 19:28:26,911 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 19:28:26,916 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:28:26" (1/1) ... [2025-02-06 19:28:26,916 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:28:26" (1/1) ... [2025-02-06 19:28:26,918 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:28:26" (1/1) ... [2025-02-06 19:28:26,931 INFO L175 MemorySlicer]: Split 28 memory accesses to 2 slices as follows [2, 26]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 10 writes are split as follows [0, 10]. [2025-02-06 19:28:26,931 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:28:26" (1/1) ... [2025-02-06 19:28:26,931 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:28:26" (1/1) ... [2025-02-06 19:28:26,940 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:28:26" (1/1) ... [2025-02-06 19:28:26,944 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:28:26" (1/1) ... [2025-02-06 19:28:26,945 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:28:26" (1/1) ... [2025-02-06 19:28:26,945 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:28:26" (1/1) ... [2025-02-06 19:28:26,946 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 19:28:26,947 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 19:28:26,947 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 19:28:26,947 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 19:28:26,948 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:28:26" (1/1) ... [2025-02-06 19:28:26,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:28:26,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:28:26,968 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:28:26,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-02-06 19:28:26,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 19:28:26,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 19:28:26,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 19:28:26,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 19:28:26,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 19:28:26,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 19:28:26,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 19:28:26,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 19:28:26,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 19:28:26,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 19:28:26,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 19:28:27,050 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 19:28:27,052 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 19:28:27,282 INFO L? ?]: Removed 39 outVars from TransFormulas that were not future-live. [2025-02-06 19:28:27,283 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 19:28:27,288 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 19:28:27,290 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 19:28:27,291 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:28:27 BoogieIcfgContainer [2025-02-06 19:28:27,291 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 19:28:27,291 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-06 19:28:27,292 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-06 19:28:27,295 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-06 19:28:27,296 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:28:27,296 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.02 07:28:26" (1/3) ... [2025-02-06 19:28:27,296 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@78bd916e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 07:28:27, skipping insertion in model container [2025-02-06 19:28:27,297 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:28:27,297 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:28:26" (2/3) ... [2025-02-06 19:28:27,297 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@78bd916e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 07:28:27, skipping insertion in model container [2025-02-06 19:28:27,297 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:28:27,297 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:28:27" (3/3) ... [2025-02-06 19:28:27,297 INFO L363 chiAutomizerObserver]: Analyzing ICFG tree_cnstr.i [2025-02-06 19:28:27,332 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-06 19:28:27,332 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-06 19:28:27,332 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-06 19:28:27,332 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-06 19:28:27,332 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-06 19:28:27,332 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-06 19:28:27,332 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-06 19:28:27,333 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-06 19:28:27,336 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:28:27,345 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2025-02-06 19:28:27,345 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:28:27,345 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:28:27,349 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-06 19:28:27,349 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:28:27,349 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-06 19:28:27,349 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:28:27,351 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2025-02-06 19:28:27,351 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:28:27,351 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:28:27,351 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-06 19:28:27,351 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:28:27,356 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~nondet18#1, main_#t~short19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~short25#1, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~pred~0#1.base, main_~pred~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset;call write~$Pointer$#1(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4);" [2025-02-06 19:28:27,356 INFO L754 eck$LassoCheckResult]: Loop: "assume true;havoc main_#t~nondet4#1;" "assume 0 != main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset;" "assume !true;" "call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$#1(main_~n~0#1.base, main_~n~0#1.offset, 4);main_#t~short13#1 := main_#t~mem11#1.base == 0 && main_#t~mem11#1.offset == 0;" "assume main_#t~short13#1;havoc main_#t~nondet12#1;main_#t~short13#1 := 0 != main_#t~nondet12#1;" "assume main_#t~short13#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1;havoc main_#t~short13#1;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$#1(main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_~n~0#1.base, main_~n~0#1.offset, 4);havoc main_#t~malloc14#1.base, main_#t~malloc14#1.offset;call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$#1(main_~n~0#1.base, main_~n~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_#t~mem15#1.base, main_#t~mem15#1.offset, 4);havoc main_#t~mem15#1.base, main_#t~mem15#1.offset;call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$#1(main_~n~0#1.base, main_~n~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_#t~mem16#1.base, 4 + main_#t~mem16#1.offset, 4);havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;" "call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);main_#t~short19#1 := main_#t~mem17#1.base == 0 && main_#t~mem17#1.offset == 0;" "assume main_#t~short19#1;havoc main_#t~nondet18#1;main_#t~short19#1 := 0 != main_#t~nondet18#1;" "assume main_#t~short19#1;havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~nondet18#1;havoc main_#t~short19#1;call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$#1(main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);havoc main_#t~malloc20#1.base, main_#t~malloc20#1.offset;call main_#t~mem21#1.base, main_#t~mem21#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_#t~mem21#1.base, main_#t~mem21#1.offset, 4);havoc main_#t~mem21#1.base, main_#t~mem21#1.offset;call main_#t~mem22#1.base, main_#t~mem22#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_#t~mem22#1.base, 4 + main_#t~mem22#1.offset, 4);havoc main_#t~mem22#1.base, main_#t~mem22#1.offset;" [2025-02-06 19:28:27,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:28:27,360 INFO L85 PathProgramCache]: Analyzing trace with hash 2464, now seen corresponding path program 1 times [2025-02-06 19:28:27,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:28:27,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045925800] [2025-02-06 19:28:27,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:28:27,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:28:27,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:28:27,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:28:27,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:27,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:28:27,439 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:28:27,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:28:27,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:28:27,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:27,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:28:27,472 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:28:27,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:28:27,475 INFO L85 PathProgramCache]: Analyzing trace with hash 620156002, now seen corresponding path program 1 times [2025-02-06 19:28:27,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:28:27,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534589999] [2025-02-06 19:28:27,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:28:27,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:28:27,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 19:28:27,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 19:28:27,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:27,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:28:27,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:28:27,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:28:27,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534589999] [2025-02-06 19:28:27,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534589999] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:28:27,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:28:27,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 19:28:27,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865776596] [2025-02-06 19:28:27,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:28:27,571 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:28:27,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:28:27,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 19:28:27,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 19:28:27,593 INFO L87 Difference]: Start difference. First operand has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:28:27,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:28:27,597 INFO L93 Difference]: Finished difference Result 26 states and 39 transitions. [2025-02-06 19:28:27,598 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 39 transitions. [2025-02-06 19:28:27,599 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2025-02-06 19:28:27,603 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 23 states and 36 transitions. [2025-02-06 19:28:27,604 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2025-02-06 19:28:27,605 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2025-02-06 19:28:27,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 36 transitions. [2025-02-06 19:28:27,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:28:27,606 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 36 transitions. [2025-02-06 19:28:27,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 36 transitions. [2025-02-06 19:28:27,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-02-06 19:28:27,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.565217391304348) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:28:27,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 36 transitions. [2025-02-06 19:28:27,625 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 36 transitions. [2025-02-06 19:28:27,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 19:28:27,628 INFO L432 stractBuchiCegarLoop]: Abstraction has 23 states and 36 transitions. [2025-02-06 19:28:27,629 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-06 19:28:27,630 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 36 transitions. [2025-02-06 19:28:27,630 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2025-02-06 19:28:27,630 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:28:27,630 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:28:27,631 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-06 19:28:27,631 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:28:27,632 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~nondet18#1, main_#t~short19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~short25#1, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~pred~0#1.base, main_~pred~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset;call write~$Pointer$#1(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4);" [2025-02-06 19:28:27,632 INFO L754 eck$LassoCheckResult]: Loop: "assume true;havoc main_#t~nondet4#1;" "assume 0 != main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset;" "assume true;call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$#1(main_~n~0#1.base, main_~n~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1.base != 0 || main_#t~mem5#1.offset != 0;" "assume main_#t~short7#1;call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1.base != 0 || main_#t~mem6#1.offset != 0;" "assume !main_#t~short7#1;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~short7#1;" "call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$#1(main_~n~0#1.base, main_~n~0#1.offset, 4);main_#t~short13#1 := main_#t~mem11#1.base == 0 && main_#t~mem11#1.offset == 0;" "assume main_#t~short13#1;havoc main_#t~nondet12#1;main_#t~short13#1 := 0 != main_#t~nondet12#1;" "assume main_#t~short13#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1;havoc main_#t~short13#1;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$#1(main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_~n~0#1.base, main_~n~0#1.offset, 4);havoc main_#t~malloc14#1.base, main_#t~malloc14#1.offset;call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$#1(main_~n~0#1.base, main_~n~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_#t~mem15#1.base, main_#t~mem15#1.offset, 4);havoc main_#t~mem15#1.base, main_#t~mem15#1.offset;call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$#1(main_~n~0#1.base, main_~n~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_#t~mem16#1.base, 4 + main_#t~mem16#1.offset, 4);havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;" "call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);main_#t~short19#1 := main_#t~mem17#1.base == 0 && main_#t~mem17#1.offset == 0;" "assume main_#t~short19#1;havoc main_#t~nondet18#1;main_#t~short19#1 := 0 != main_#t~nondet18#1;" "assume main_#t~short19#1;havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~nondet18#1;havoc main_#t~short19#1;call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$#1(main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);havoc main_#t~malloc20#1.base, main_#t~malloc20#1.offset;call main_#t~mem21#1.base, main_#t~mem21#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_#t~mem21#1.base, main_#t~mem21#1.offset, 4);havoc main_#t~mem21#1.base, main_#t~mem21#1.offset;call main_#t~mem22#1.base, main_#t~mem22#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_#t~mem22#1.base, 4 + main_#t~mem22#1.offset, 4);havoc main_#t~mem22#1.base, main_#t~mem22#1.offset;" [2025-02-06 19:28:27,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:28:27,632 INFO L85 PathProgramCache]: Analyzing trace with hash 2464, now seen corresponding path program 2 times [2025-02-06 19:28:27,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:28:27,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905916471] [2025-02-06 19:28:27,633 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:28:27,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:28:27,642 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:28:27,651 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:28:27,651 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:28:27,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:28:27,651 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:28:27,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:28:27,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:28:27,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:27,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:28:27,678 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:28:27,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:28:27,679 INFO L85 PathProgramCache]: Analyzing trace with hash 2126628255, now seen corresponding path program 1 times [2025-02-06 19:28:27,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:28:27,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830315127] [2025-02-06 19:28:27,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:28:27,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:28:27,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 19:28:27,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 19:28:27,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:27,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:28:27,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:28:27,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:28:27,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830315127] [2025-02-06 19:28:27,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830315127] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:28:27,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:28:27,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 19:28:27,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133421259] [2025-02-06 19:28:27,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:28:27,970 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-02-06 19:28:27,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:28:27,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 19:28:27,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 19:28:27,971 INFO L87 Difference]: Start difference. First operand 23 states and 36 transitions. cyclomatic complexity: 15 Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:28:28,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:28:28,063 INFO L93 Difference]: Finished difference Result 35 states and 52 transitions. [2025-02-06 19:28:28,063 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 52 transitions. [2025-02-06 19:28:28,064 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2025-02-06 19:28:28,065 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 52 transitions. [2025-02-06 19:28:28,065 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2025-02-06 19:28:28,065 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2025-02-06 19:28:28,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 52 transitions. [2025-02-06 19:28:28,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:28:28,065 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 52 transitions. [2025-02-06 19:28:28,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 52 transitions. [2025-02-06 19:28:28,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2025-02-06 19:28:28,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 26 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:28:28,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 41 transitions. [2025-02-06 19:28:28,071 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 41 transitions. [2025-02-06 19:28:28,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 19:28:28,072 INFO L432 stractBuchiCegarLoop]: Abstraction has 27 states and 41 transitions. [2025-02-06 19:28:28,073 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-06 19:28:28,073 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 41 transitions. [2025-02-06 19:28:28,073 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 24 [2025-02-06 19:28:28,073 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:28:28,073 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:28:28,073 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-06 19:28:28,074 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:28:28,075 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~nondet18#1, main_#t~short19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~short25#1, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~pred~0#1.base, main_~pred~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset;call write~$Pointer$#1(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4);" [2025-02-06 19:28:28,075 INFO L754 eck$LassoCheckResult]: Loop: "assume true;havoc main_#t~nondet4#1;" "assume 0 != main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset;" "assume true;call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$#1(main_~n~0#1.base, main_~n~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1.base != 0 || main_#t~mem5#1.offset != 0;" "assume main_#t~short7#1;call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1.base != 0 || main_#t~mem6#1.offset != 0;" "assume !main_#t~short7#1;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~short7#1;" "call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$#1(main_~n~0#1.base, main_~n~0#1.offset, 4);main_#t~short13#1 := main_#t~mem11#1.base == 0 && main_#t~mem11#1.offset == 0;" "assume !main_#t~short13#1;" "assume !main_#t~short13#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1;havoc main_#t~short13#1;" "call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);main_#t~short19#1 := main_#t~mem17#1.base == 0 && main_#t~mem17#1.offset == 0;" "assume main_#t~short19#1;havoc main_#t~nondet18#1;main_#t~short19#1 := 0 != main_#t~nondet18#1;" "assume main_#t~short19#1;havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~nondet18#1;havoc main_#t~short19#1;call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$#1(main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);havoc main_#t~malloc20#1.base, main_#t~malloc20#1.offset;call main_#t~mem21#1.base, main_#t~mem21#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_#t~mem21#1.base, main_#t~mem21#1.offset, 4);havoc main_#t~mem21#1.base, main_#t~mem21#1.offset;call main_#t~mem22#1.base, main_#t~mem22#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_#t~mem22#1.base, 4 + main_#t~mem22#1.offset, 4);havoc main_#t~mem22#1.base, main_#t~mem22#1.offset;" [2025-02-06 19:28:28,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:28:28,075 INFO L85 PathProgramCache]: Analyzing trace with hash 2464, now seen corresponding path program 3 times [2025-02-06 19:28:28,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:28:28,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962183227] [2025-02-06 19:28:28,075 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:28:28,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:28:28,083 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:28:28,086 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:28:28,086 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 19:28:28,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:28:28,086 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:28:28,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:28:28,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:28:28,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:28,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:28:28,092 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:28:28,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:28:28,093 INFO L85 PathProgramCache]: Analyzing trace with hash 2127581567, now seen corresponding path program 1 times [2025-02-06 19:28:28,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:28:28,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145282043] [2025-02-06 19:28:28,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:28:28,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:28:28,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 19:28:28,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 19:28:28,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:28,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:28:28,117 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:28:28,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 19:28:28,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 19:28:28,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:28,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:28:28,141 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:28:28,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:28:28,143 INFO L85 PathProgramCache]: Analyzing trace with hash -2064228736, now seen corresponding path program 1 times [2025-02-06 19:28:28,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:28:28,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859132033] [2025-02-06 19:28:28,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:28:28,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:28:28,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 19:28:28,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 19:28:28,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:28,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:28:28,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:28:28,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:28:28,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859132033] [2025-02-06 19:28:28,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859132033] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:28:28,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:28:28,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 19:28:28,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548456021] [2025-02-06 19:28:28,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:28:30,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:28:30,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 19:28:30,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 19:28:30,561 INFO L87 Difference]: Start difference. First operand 27 states and 41 transitions. cyclomatic complexity: 16 Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:28:30,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:28:30,709 INFO L93 Difference]: Finished difference Result 59 states and 88 transitions. [2025-02-06 19:28:30,709 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 88 transitions. [2025-02-06 19:28:30,710 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 50 [2025-02-06 19:28:30,710 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 59 states and 88 transitions. [2025-02-06 19:28:30,710 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2025-02-06 19:28:30,710 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2025-02-06 19:28:30,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 88 transitions. [2025-02-06 19:28:30,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:28:30,711 INFO L218 hiAutomatonCegarLoop]: Abstraction has 59 states and 88 transitions. [2025-02-06 19:28:30,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 88 transitions. [2025-02-06 19:28:30,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 39. [2025-02-06 19:28:30,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.4615384615384615) internal successors, (57), 38 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:28:30,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 57 transitions. [2025-02-06 19:28:30,713 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 57 transitions. [2025-02-06 19:28:30,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 19:28:30,713 INFO L432 stractBuchiCegarLoop]: Abstraction has 39 states and 57 transitions. [2025-02-06 19:28:30,713 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-06 19:28:30,714 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 57 transitions. [2025-02-06 19:28:30,714 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 36 [2025-02-06 19:28:30,714 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:28:30,714 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:28:30,714 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-06 19:28:30,714 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 19:28:30,714 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~nondet18#1, main_#t~short19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~short25#1, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~pred~0#1.base, main_~pred~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset;call write~$Pointer$#1(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4);call write~$Pointer$#1(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4);" [2025-02-06 19:28:30,715 INFO L754 eck$LassoCheckResult]: Loop: "assume true;havoc main_#t~nondet4#1;" "assume 0 != main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset;" "assume true;call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$#1(main_~n~0#1.base, main_~n~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1.base != 0 || main_#t~mem5#1.offset != 0;" "assume !main_#t~short7#1;" "assume !main_#t~short7#1;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~short7#1;" "call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$#1(main_~n~0#1.base, main_~n~0#1.offset, 4);main_#t~short13#1 := main_#t~mem11#1.base == 0 && main_#t~mem11#1.offset == 0;" "assume main_#t~short13#1;havoc main_#t~nondet12#1;main_#t~short13#1 := 0 != main_#t~nondet12#1;" "assume !main_#t~short13#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1;havoc main_#t~short13#1;" "call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$#1(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4);main_#t~short19#1 := main_#t~mem17#1.base == 0 && main_#t~mem17#1.offset == 0;" "assume main_#t~short19#1;havoc main_#t~nondet18#1;main_#t~short19#1 := 0 != main_#t~nondet18#1;" "assume !main_#t~short19#1;havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~nondet18#1;havoc main_#t~short19#1;" [2025-02-06 19:28:30,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:28:30,715 INFO L85 PathProgramCache]: Analyzing trace with hash 2464, now seen corresponding path program 4 times [2025-02-06 19:28:30,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:28:30,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955044465] [2025-02-06 19:28:30,715 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:28:30,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:28:30,721 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-02-06 19:28:30,727 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:28:30,727 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:28:30,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:28:30,727 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:28:30,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:28:30,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:28:30,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:30,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:28:30,732 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:28:30,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:28:30,733 INFO L85 PathProgramCache]: Analyzing trace with hash -425498914, now seen corresponding path program 1 times [2025-02-06 19:28:30,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:28:30,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443346602] [2025-02-06 19:28:30,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:28:30,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:28:30,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 19:28:30,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 19:28:30,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:30,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:28:30,742 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:28:30,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 19:28:30,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 19:28:30,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:30,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:28:30,749 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:28:30,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:28:30,752 INFO L85 PathProgramCache]: Analyzing trace with hash -322341921, now seen corresponding path program 1 times [2025-02-06 19:28:30,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:28:30,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824159187] [2025-02-06 19:28:30,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:28:30,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:28:30,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 19:28:30,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 19:28:30,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:30,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:28:30,767 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:28:30,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 19:28:30,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 19:28:30,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:30,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:28:30,776 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:28:31,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:28:31,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:28:31,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:31,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:28:31,159 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:28:31,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:28:31,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:28:31,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:28:31,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:28:31,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 06.02 07:28:31 BoogieIcfgContainer [2025-02-06 19:28:31,189 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-06 19:28:31,190 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 19:28:31,190 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 19:28:31,190 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 19:28:31,190 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:28:27" (3/4) ... [2025-02-06 19:28:31,192 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-02-06 19:28:31,215 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 19:28:31,217 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 19:28:31,217 INFO L158 Benchmark]: Toolchain (without parser) took 4583.54ms. Allocated memory is still 142.6MB. Free memory was 110.7MB in the beginning and 59.7MB in the end (delta: 51.0MB). Peak memory consumption was 47.6MB. Max. memory is 16.1GB. [2025-02-06 19:28:31,218 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 19:28:31,218 INFO L158 Benchmark]: CACSL2BoogieTranslator took 249.55ms. Allocated memory is still 142.6MB. Free memory was 110.7MB in the beginning and 93.4MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 19:28:31,220 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.91ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 91.5MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 19:28:31,220 INFO L158 Benchmark]: Boogie Preprocessor took 35.56ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 89.5MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 19:28:31,220 INFO L158 Benchmark]: IcfgBuilder took 344.05ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 68.2MB in the end (delta: 21.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 19:28:31,221 INFO L158 Benchmark]: BuchiAutomizer took 3897.75ms. Allocated memory is still 142.6MB. Free memory was 68.2MB in the beginning and 62.0MB in the end (delta: 6.2MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. [2025-02-06 19:28:31,221 INFO L158 Benchmark]: Witness Printer took 27.02ms. Allocated memory is still 142.6MB. Free memory was 62.0MB in the beginning and 59.7MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 19:28:31,222 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 249.55ms. Allocated memory is still 142.6MB. Free memory was 110.7MB in the beginning and 93.4MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.91ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 91.5MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.56ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 89.5MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 344.05ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 68.2MB in the end (delta: 21.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 3897.75ms. Allocated memory is still 142.6MB. Free memory was 68.2MB in the beginning and 62.0MB in the end (delta: 6.2MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. * Witness Printer took 27.02ms. Allocated memory is still 142.6MB. Free memory was 62.0MB in the beginning and 59.7MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * 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 39 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.8s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 3.5s. Construction of modules took 0.1s. 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, 28 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 79 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 79 mSDsluCounter, 195 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 97 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 131 IncrementalHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 98 mSDtfsCounter, 131 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown 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 InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 532]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L529] struct TreeNode* root = malloc(sizeof(*root)), *n; [L529] struct TreeNode* root = malloc(sizeof(*root)), *n; [L530] root->left = ((void *)0) [L531] root->right = ((void *)0) Loop: [L532] COND TRUE __VERIFIER_nondet_int() [L532] COND TRUE __VERIFIER_nondet_int() [L533] n = root [L534] COND TRUE n->left && n->right [L534] EXPR n->left [L534] n->left && n->right [L534] n->left && n->right [L534] COND FALSE !(n->left && n->right) [L540] EXPR n->left [L540] !n->left && __VERIFIER_nondet_int() [L540] !n->left && __VERIFIER_nondet_int() [L540] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L545] EXPR n->right [L545] !n->right && __VERIFIER_nondet_int() [L545] !n->right && __VERIFIER_nondet_int() [L545] COND FALSE !(!n->right && __VERIFIER_nondet_int()) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 532]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L529] struct TreeNode* root = malloc(sizeof(*root)), *n; [L529] struct TreeNode* root = malloc(sizeof(*root)), *n; [L530] root->left = ((void *)0) [L531] root->right = ((void *)0) Loop: [L532] COND TRUE __VERIFIER_nondet_int() [L532] COND TRUE __VERIFIER_nondet_int() [L533] n = root [L534] COND TRUE n->left && n->right [L534] EXPR n->left [L534] n->left && n->right [L534] n->left && n->right [L534] COND FALSE !(n->left && n->right) [L540] EXPR n->left [L540] !n->left && __VERIFIER_nondet_int() [L540] !n->left && __VERIFIER_nondet_int() [L540] COND FALSE !(!n->left && __VERIFIER_nondet_int()) [L545] EXPR n->right [L545] !n->right && __VERIFIER_nondet_int() [L545] !n->right && __VERIFIER_nondet_int() [L545] COND FALSE !(!n->right && __VERIFIER_nondet_int()) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-02-06 19:28:31,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)