./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/verifythis/tree_del_iter.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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/AutomizerReach.xml -i ../sv-benchmarks/c/verifythis/tree_del_iter.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cce1bb7a06b9dd56fbf663e182ffe801720ee05ee19a126a08070f1616bc4afe --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:39:35,426 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:39:35,460 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 03:39:35,468 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:39:35,468 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:39:35,482 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:39:35,483 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:39:35,483 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:39:35,483 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:39:35,483 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:39:35,483 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:39:35,484 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:39:35,484 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:39:35,484 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:39:35,484 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:39:35,484 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:39:35,484 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:39:35,484 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:39:35,484 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:39:35,484 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:39:35,485 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:39:35,485 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:39:35,485 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:39:35,485 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:39:35,485 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:39:35,485 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:39:35,485 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:39:35,485 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:39:35,485 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:39:35,485 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:39:35,485 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:39:35,486 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:39:35,486 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:39:35,486 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:39:35,486 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:39:35,486 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:39:35,486 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:39:35,486 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:39:35,486 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:39:35,486 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:39:35,486 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:39:35,486 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:39:35,486 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:39:35,486 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:39:35,486 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:39:35,486 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:39:35,486 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:39:35,486 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:39:35,486 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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(G ! call(reach_error())) ) 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 -> cce1bb7a06b9dd56fbf663e182ffe801720ee05ee19a126a08070f1616bc4afe [2025-01-09 03:39:35,646 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:39:35,651 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:39:35,652 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:39:35,653 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:39:35,653 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:39:35,654 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/tree_del_iter.c [2025-01-09 03:39:36,860 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/14dcae2c2/8264d732b2ce4abaa65128a8f2221e9d/FLAG2df3b9cf4 [2025-01-09 03:39:37,118 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:39:37,118 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/verifythis/tree_del_iter.c [2025-01-09 03:39:37,125 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/14dcae2c2/8264d732b2ce4abaa65128a8f2221e9d/FLAG2df3b9cf4 [2025-01-09 03:39:37,447 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/14dcae2c2/8264d732b2ce4abaa65128a8f2221e9d [2025-01-09 03:39:37,450 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:39:37,451 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:39:37,456 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:39:37,456 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:39:37,459 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:39:37,460 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:39:37" (1/1) ... [2025-01-09 03:39:37,460 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39582f48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:39:37, skipping insertion in model container [2025-01-09 03:39:37,461 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:39:37" (1/1) ... [2025-01-09 03:39:37,474 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:39:37,577 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/verifythis/tree_del_iter.c[586,599] [2025-01-09 03:39:37,592 WARN L1731 CHandler]: Possible shadowing of function min [2025-01-09 03:39:37,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:39:37,613 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:39:37,622 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/verifythis/tree_del_iter.c[586,599] [2025-01-09 03:39:37,630 WARN L1731 CHandler]: Possible shadowing of function min [2025-01-09 03:39:37,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:39:37,654 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:39:37,654 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:39:37 WrapperNode [2025-01-09 03:39:37,655 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:39:37,656 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:39:37,656 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:39:37,656 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:39:37,661 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:39:37" (1/1) ... [2025-01-09 03:39:37,667 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:39:37" (1/1) ... [2025-01-09 03:39:37,683 INFO L138 Inliner]: procedures = 29, calls = 64, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 105 [2025-01-09 03:39:37,684 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:39:37,685 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:39:37,685 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:39:37,685 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:39:37,691 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:39:37" (1/1) ... [2025-01-09 03:39:37,691 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:39:37" (1/1) ... [2025-01-09 03:39:37,693 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:39:37" (1/1) ... [2025-01-09 03:39:37,719 INFO L175 MemorySlicer]: Split 28 memory accesses to 4 slices as follows [2, 2, 19, 5]. 68 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 7 writes are split as follows [0, 1, 4, 2]. [2025-01-09 03:39:37,719 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:39:37" (1/1) ... [2025-01-09 03:39:37,719 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:39:37" (1/1) ... [2025-01-09 03:39:37,726 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:39:37" (1/1) ... [2025-01-09 03:39:37,727 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:39:37" (1/1) ... [2025-01-09 03:39:37,729 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:39:37" (1/1) ... [2025-01-09 03:39:37,730 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:39:37" (1/1) ... [2025-01-09 03:39:37,730 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:39:37" (1/1) ... [2025-01-09 03:39:37,732 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:39:37,733 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:39:37,733 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:39:37,733 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:39:37,734 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:39:37" (1/1) ... [2025-01-09 03:39:37,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:39:37,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:39:37,764 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 03:39:37,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 03:39:37,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:39:37,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 03:39:37,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 03:39:37,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 03:39:37,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 03:39:37,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-09 03:39:37,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 03:39:37,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 03:39:37,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 03:39:37,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 03:39:37,790 INFO L130 BoogieDeclarations]: Found specification of procedure min [2025-01-09 03:39:37,792 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2025-01-09 03:39:37,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 03:39:37,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 03:39:37,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 03:39:37,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 03:39:37,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-01-09 03:39:37,793 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-01-09 03:39:37,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 03:39:37,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 03:39:37,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 03:39:37,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-09 03:39:37,793 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2025-01-09 03:39:37,793 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2025-01-09 03:39:37,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:39:37,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 03:39:37,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 03:39:37,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 03:39:37,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 03:39:37,797 INFO L130 BoogieDeclarations]: Found specification of procedure size [2025-01-09 03:39:37,797 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2025-01-09 03:39:37,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:39:37,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:39:37,797 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-09 03:39:37,797 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-09 03:39:37,797 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2025-01-09 03:39:37,797 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2025-01-09 03:39:37,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 03:39:37,904 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:39:37,906 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:39:38,153 INFO L? ?]: Removed 70 outVars from TransFormulas that were not future-live. [2025-01-09 03:39:38,153 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:39:38,165 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:39:38,165 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 03:39:38,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:39:38 BoogieIcfgContainer [2025-01-09 03:39:38,166 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:39:38,168 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:39:38,168 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:39:38,171 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:39:38,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:39:37" (1/3) ... [2025-01-09 03:39:38,172 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@380ef324 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:39:38, skipping insertion in model container [2025-01-09 03:39:38,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:39:37" (2/3) ... [2025-01-09 03:39:38,172 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@380ef324 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:39:38, skipping insertion in model container [2025-01-09 03:39:38,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:39:38" (3/3) ... [2025-01-09 03:39:38,174 INFO L128 eAbstractionObserver]: Analyzing ICFG tree_del_iter.c [2025-01-09 03:39:38,184 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:39:38,185 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG tree_del_iter.c that has 7 procedures, 81 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-01-09 03:39:38,229 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:39:38,245 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@db33a4c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:39:38,246 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:39:38,249 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 54 states have internal predecessors, (66), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 03:39:38,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 03:39:38,258 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:39:38,259 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:39:38,259 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:39:38,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:39:38,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1262311066, now seen corresponding path program 1 times [2025-01-09 03:39:38,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:39:38,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113343090] [2025-01-09 03:39:38,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:39:38,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:39:38,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 03:39:38,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 03:39:38,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:39:38,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:39:38,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:39:38,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:39:38,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113343090] [2025-01-09 03:39:38,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113343090] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:39:38,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:39:38,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:39:38,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900246588] [2025-01-09 03:39:38,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:39:38,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:39:38,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:39:38,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:39:38,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:39:38,714 INFO L87 Difference]: Start difference. First operand has 81 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 54 states have internal predecessors, (66), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 03:39:38,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:39:38,766 INFO L93 Difference]: Finished difference Result 138 states and 185 transitions. [2025-01-09 03:39:38,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:39:38,768 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2025-01-09 03:39:38,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:39:38,775 INFO L225 Difference]: With dead ends: 138 [2025-01-09 03:39:38,775 INFO L226 Difference]: Without dead ends: 78 [2025-01-09 03:39:38,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:39:38,780 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:39:38,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 399 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:39:38,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-01-09 03:39:38,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-01-09 03:39:38,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 50 states have (on average 1.18) internal successors, (59), 51 states have internal predecessors, (59), 20 states have call successors, (20), 6 states have call predecessors, (20), 7 states have return successors, (23), 20 states have call predecessors, (23), 20 states have call successors, (23) [2025-01-09 03:39:38,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 102 transitions. [2025-01-09 03:39:38,810 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 102 transitions. Word has length 37 [2025-01-09 03:39:38,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:39:38,811 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 102 transitions. [2025-01-09 03:39:38,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 03:39:38,811 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 102 transitions. [2025-01-09 03:39:38,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-09 03:39:38,813 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:39:38,813 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:39:38,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 03:39:38,813 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:39:38,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:39:38,814 INFO L85 PathProgramCache]: Analyzing trace with hash -516959793, now seen corresponding path program 1 times [2025-01-09 03:39:38,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:39:38,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70866506] [2025-01-09 03:39:38,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:39:38,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:39:38,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 03:39:38,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 03:39:38,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:39:38,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:39:39,120 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 03:39:39,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:39:39,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70866506] [2025-01-09 03:39:39,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70866506] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:39:39,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479137616] [2025-01-09 03:39:39,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:39:39,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:39:39,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:39:39,125 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:39:39,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 03:39:39,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 03:39:39,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 03:39:39,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:39:39,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:39:39,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 03:39:39,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:39:39,343 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 03:39:39,345 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:39:39,547 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 03:39:39,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479137616] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:39:39,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:39:39,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 10 [2025-01-09 03:39:39,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809280293] [2025-01-09 03:39:39,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:39:39,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 03:39:39,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:39:39,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 03:39:39,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:39:39,550 INFO L87 Difference]: Start difference. First operand 78 states and 102 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 5 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2025-01-09 03:39:39,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:39:39,647 INFO L93 Difference]: Finished difference Result 137 states and 180 transitions. [2025-01-09 03:39:39,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:39:39,647 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 5 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 49 [2025-01-09 03:39:39,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:39:39,649 INFO L225 Difference]: With dead ends: 137 [2025-01-09 03:39:39,651 INFO L226 Difference]: Without dead ends: 80 [2025-01-09 03:39:39,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:39:39,652 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 2 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:39:39,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 625 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:39:39,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-01-09 03:39:39,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-01-09 03:39:39,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 53 states have internal predecessors, (60), 20 states have call successors, (20), 6 states have call predecessors, (20), 8 states have return successors, (25), 20 states have call predecessors, (25), 20 states have call successors, (25) [2025-01-09 03:39:39,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 105 transitions. [2025-01-09 03:39:39,664 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 105 transitions. Word has length 49 [2025-01-09 03:39:39,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:39:39,664 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 105 transitions. [2025-01-09 03:39:39,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 5 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2025-01-09 03:39:39,664 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 105 transitions. [2025-01-09 03:39:39,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-01-09 03:39:39,668 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:39:39,668 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:39:39,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 03:39:39,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:39:39,872 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:39:39,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:39:39,872 INFO L85 PathProgramCache]: Analyzing trace with hash -402262932, now seen corresponding path program 1 times [2025-01-09 03:39:39,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:39:39,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081802523] [2025-01-09 03:39:39,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:39:39,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:39:39,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 03:39:39,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 03:39:39,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:39:39,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:39:40,058 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-09 03:39:40,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:39:40,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081802523] [2025-01-09 03:39:40,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081802523] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:39:40,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:39:40,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:39:40,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956146773] [2025-01-09 03:39:40,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:39:40,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:39:40,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:39:40,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:39:40,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:39:40,060 INFO L87 Difference]: Start difference. First operand 80 states and 105 transitions. Second operand has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 4 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-01-09 03:39:40,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:39:40,106 INFO L93 Difference]: Finished difference Result 137 states and 180 transitions. [2025-01-09 03:39:40,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 03:39:40,106 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 4 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 61 [2025-01-09 03:39:40,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:39:40,109 INFO L225 Difference]: With dead ends: 137 [2025-01-09 03:39:40,111 INFO L226 Difference]: Without dead ends: 82 [2025-01-09 03:39:40,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:39:40,112 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 21 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:39:40,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 593 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:39:40,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-01-09 03:39:40,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-01-09 03:39:40,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 55 states have internal predecessors, (61), 20 states have call successors, (20), 6 states have call predecessors, (20), 9 states have return successors, (27), 20 states have call predecessors, (27), 20 states have call successors, (27) [2025-01-09 03:39:40,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 108 transitions. [2025-01-09 03:39:40,125 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 108 transitions. Word has length 61 [2025-01-09 03:39:40,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:39:40,125 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 108 transitions. [2025-01-09 03:39:40,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 4 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-01-09 03:39:40,125 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 108 transitions. [2025-01-09 03:39:40,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-09 03:39:40,128 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:39:40,128 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:39:40,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 03:39:40,128 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:39:40,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:39:40,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1348747578, now seen corresponding path program 1 times [2025-01-09 03:39:40,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:39:40,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800016264] [2025-01-09 03:39:40,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:39:40,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:39:40,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 03:39:40,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 03:39:40,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:39:40,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:39:40,410 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-09 03:39:40,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:39:40,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800016264] [2025-01-09 03:39:40,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800016264] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:39:40,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473884583] [2025-01-09 03:39:40,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:39:40,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:39:40,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:39:40,416 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:39:40,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 03:39:40,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 03:39:40,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 03:39:40,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:39:40,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:39:40,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 03:39:40,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:39:40,645 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-09 03:39:40,646 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:39:40,813 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-09 03:39:40,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473884583] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:39:40,813 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:39:40,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 15 [2025-01-09 03:39:40,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807377387] [2025-01-09 03:39:40,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:39:40,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 03:39:40,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:39:40,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 03:39:40,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-01-09 03:39:40,816 INFO L87 Difference]: Start difference. First operand 82 states and 108 transitions. Second operand has 15 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 7 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) [2025-01-09 03:39:40,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:39:40,992 INFO L93 Difference]: Finished difference Result 131 states and 173 transitions. [2025-01-09 03:39:40,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 03:39:40,992 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 7 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) Word has length 74 [2025-01-09 03:39:40,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:39:40,994 INFO L225 Difference]: With dead ends: 131 [2025-01-09 03:39:40,994 INFO L226 Difference]: Without dead ends: 84 [2025-01-09 03:39:40,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2025-01-09 03:39:40,995 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 45 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:39:40,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 739 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:39:40,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-01-09 03:39:41,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-01-09 03:39:41,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 53 states have (on average 1.169811320754717) internal successors, (62), 57 states have internal predecessors, (62), 20 states have call successors, (20), 6 states have call predecessors, (20), 10 states have return successors, (30), 20 states have call predecessors, (30), 20 states have call successors, (30) [2025-01-09 03:39:41,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 112 transitions. [2025-01-09 03:39:41,007 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 112 transitions. Word has length 74 [2025-01-09 03:39:41,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:39:41,007 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 112 transitions. [2025-01-09 03:39:41,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 7 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) [2025-01-09 03:39:41,007 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 112 transitions. [2025-01-09 03:39:41,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 03:39:41,012 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:39:41,012 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:39:41,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 03:39:41,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:39:41,213 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:39:41,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:39:41,213 INFO L85 PathProgramCache]: Analyzing trace with hash -2057537795, now seen corresponding path program 1 times [2025-01-09 03:39:41,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:39:41,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746463741] [2025-01-09 03:39:41,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:39:41,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:39:41,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 03:39:41,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 03:39:41,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:39:41,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 03:39:41,305 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 03:39:41,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 03:39:41,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 03:39:41,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:39:41,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 03:39:41,368 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 03:39:41,368 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 03:39:41,369 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 03:39:41,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 03:39:41,373 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-09 03:39:41,402 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 03:39:41,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 03:39:41 BoogieIcfgContainer [2025-01-09 03:39:41,404 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 03:39:41,408 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 03:39:41,408 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 03:39:41,408 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 03:39:41,409 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:39:38" (3/4) ... [2025-01-09 03:39:41,409 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 03:39:41,471 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 44. [2025-01-09 03:39:41,558 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 03:39:41,562 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 03:39:41,562 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 03:39:41,563 INFO L158 Benchmark]: Toolchain (without parser) took 4111.80ms. Allocated memory was 167.8MB in the beginning and 343.9MB in the end (delta: 176.2MB). Free memory was 129.0MB in the beginning and 273.4MB in the end (delta: -144.4MB). Peak memory consumption was 33.8MB. Max. memory is 16.1GB. [2025-01-09 03:39:41,564 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 226.5MB. Free memory is still 147.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 03:39:41,564 INFO L158 Benchmark]: CACSL2BoogieTranslator took 199.41ms. Allocated memory is still 167.8MB. Free memory was 129.0MB in the beginning and 116.0MB in the end (delta: 13.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 03:39:41,565 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.55ms. Allocated memory is still 167.8MB. Free memory was 116.0MB in the beginning and 114.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 03:39:41,565 INFO L158 Benchmark]: Boogie Preprocessor took 47.88ms. Allocated memory is still 167.8MB. Free memory was 114.4MB in the beginning and 111.2MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 03:39:41,568 INFO L158 Benchmark]: RCFGBuilder took 432.84ms. Allocated memory is still 167.8MB. Free memory was 111.2MB in the beginning and 88.1MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 03:39:41,568 INFO L158 Benchmark]: TraceAbstraction took 3239.59ms. Allocated memory was 167.8MB in the beginning and 343.9MB in the end (delta: 176.2MB). Free memory was 87.3MB in the beginning and 282.2MB in the end (delta: -194.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 03:39:41,568 INFO L158 Benchmark]: Witness Printer took 154.26ms. Allocated memory is still 343.9MB. Free memory was 282.2MB in the beginning and 273.4MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 03:39:41,570 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.16ms. Allocated memory is still 226.5MB. Free memory is still 147.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 199.41ms. Allocated memory is still 167.8MB. Free memory was 129.0MB in the beginning and 116.0MB in the end (delta: 13.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.55ms. Allocated memory is still 167.8MB. Free memory was 116.0MB in the beginning and 114.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.88ms. Allocated memory is still 167.8MB. Free memory was 114.4MB in the beginning and 111.2MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 432.84ms. Allocated memory is still 167.8MB. Free memory was 111.2MB in the beginning and 88.1MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3239.59ms. Allocated memory was 167.8MB in the beginning and 343.9MB in the end (delta: 176.2MB). Free memory was 87.3MB in the beginning and 282.2MB in the end (delta: -194.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 154.26ms. Allocated memory is still 343.9MB. Free memory was 282.2MB in the beginning and 273.4MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L110] CALL, EXPR nondet_tree() [L25] COND FALSE !(__VERIFIER_nondet_bool()) [L28] struct node *n = (struct node *)malloc(sizeof(struct node)); [L29] n->data = __VERIFIER_nondet_int() [L30] CALL, EXPR nondet_tree() [L25] COND TRUE __VERIFIER_nondet_bool() [L26] return 0; VAL [\result={0:0}] [L30] RET, EXPR nondet_tree() VAL [n={-1:0}] [L30] n->left = nondet_tree() [L31] CALL, EXPR nondet_tree() [L25] COND TRUE __VERIFIER_nondet_bool() [L26] return 0; VAL [\result={0:0}] [L31] RET, EXPR nondet_tree() VAL [n={-1:0}] [L31] n->right = nondet_tree() [L32] return n; VAL [\result={-1:0}] [L110] RET, EXPR nondet_tree() [L110] CALL task(nondet_tree()) [L86] CALL, EXPR min(t) VAL [\old(n)={-1:0}] [L37] COND FALSE !(!n) [L40] EXPR n->data [L40] int a = n->data; [L41] EXPR n->left VAL [\old(n)={-1:0}, a=2147483647, n={-1:0}] [L41] CALL, EXPR min(n->left) VAL [\old(n)={0:0}] [L37] COND TRUE !n [L38] return 2147483647; VAL [\old(n)={0:0}, \result=2147483647] [L41] RET, EXPR min(n->left) VAL [\old(n)={-1:0}, a=2147483647, n={-1:0}] [L41] int b = min(n->left); [L42] EXPR n->right VAL [\old(n)={-1:0}, a=2147483647, b=2147483647] [L42] CALL, EXPR min(n->right) VAL [\old(n)={0:0}] [L37] COND TRUE !n [L38] return 2147483647; VAL [\old(n)={0:0}, \result=2147483647] [L42] RET, EXPR min(n->right) VAL [\old(n)={-1:0}, a=2147483647, b=2147483647] [L42] int c = min(n->right); [L43] COND TRUE b <= a && b <= c [L43] return b; VAL [\old(n)={-1:0}, \result=2147483647] [L86] RET, EXPR min(t) VAL [t={-1:0}] [L86] int a = min(t); [L87] int b; VAL [a=2147483647, b={5:0}, t={-1:0}] [L89] CALL, EXPR size(t) VAL [\old(t)={-1:0}] [L81] COND FALSE !(!t) [L82] EXPR t->left VAL [\old(t)={-1:0}, t={-1:0}] [L82] CALL, EXPR size(t->left) VAL [\old(t)={0:0}] [L81] COND TRUE !t [L81] return 0; VAL [\old(t)={0:0}, \result=0] [L82] RET, EXPR size(t->left) VAL [\old(t)={-1:0}, t={-1:0}] [L82] EXPR t->right VAL [\old(t)={-1:0}] [L82] CALL, EXPR size(t->right) VAL [\old(t)={0:0}] [L81] COND TRUE !t [L81] return 0; VAL [\old(t)={0:0}, \result=0] [L82] RET, EXPR size(t->right) VAL [\old(t)={-1:0}] [L82] return size(t->left) + size(t->right) + 1; [L89] RET, EXPR size(t) VAL [a=2147483647, b={5:0}, t={-1:0}] [L89] int n = size(t); [L90] CALL assume_cycle_if_not(n != 0) [L9] COND FALSE !(!cond) [L90] RET assume_cycle_if_not(n != 0) [L91] EXPR, FCALL calloc(n, sizeof(int)) VAL [a=2147483647, b={5:0}, n=1, t={-1:0}] [L91] int *x = calloc(n, sizeof(int)); [L92] CALL tree_inorder(t, x, n) VAL [\old(a)={-2:0}, \old(i)=1, \old(t)={-1:0}] [L70] COND FALSE !(!t) [L73] EXPR t->left VAL [\old(a)={-2:0}, \old(i)=1, \old(t)={-1:0}, a={-2:0}, i=1, t={-1:0}] [L73] CALL, EXPR tree_inorder(t->left, a, i) VAL [\old(a)={-2:0}, \old(i)=1, \old(t)={0:0}] [L70] COND TRUE !t [L71] return i; VAL [\old(a)={-2:0}, \old(i)=1, \old(t)={0:0}, \result=1, a={-2:0}] [L73] RET, EXPR tree_inorder(t->left, a, i) VAL [\old(a)={-2:0}, \old(i)=1, \old(t)={-1:0}, a={-2:0}, i=1, t={-1:0}] [L73] i = tree_inorder(t->left, a, i) [L74] EXPR i++ [L74] EXPR t->data [L74] a[i++] = t->data [L75] EXPR t->right VAL [\old(a)={-2:0}, \old(i)=1, \old(t)={-1:0}, a={-2:0}, i=2] [L75] CALL, EXPR tree_inorder(t->right, a, i) VAL [\old(a)={-2:0}, \old(i)=2, \old(t)={0:0}] [L70] COND TRUE !t [L71] return i; VAL [\old(a)={-2:0}, \old(i)=2, \old(t)={0:0}, \result=2, a={-2:0}] [L75] RET, EXPR tree_inorder(t->right, a, i) VAL [\old(a)={-2:0}, \old(i)=1, \old(t)={-1:0}, a={-2:0}, i=2] [L75] i = tree_inorder(t->right, a, i) [L76] return i; VAL [\old(a)={-2:0}, \old(i)=1, \old(t)={-1:0}, \result=2, a={-2:0}, i=2] [L92] RET tree_inorder(t, x, n) VAL [a=2147483647, b={5:0}, n=1, t={-1:0}, x={-2:0}] [L93] EXPR x[0] [L93] CALL __VERIFIER_assert(a == x[0]) VAL [\old(cond)=0] [L16] COND TRUE !cond VAL [\old(cond)=0] [L16] reach_error() VAL [\old(cond)=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 81 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 84 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 68 mSDsluCounter, 2356 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1983 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 339 IncrementalHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 373 mSDtfsCounter, 339 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 278 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=4, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 430 NumberOfCodeBlocks, 430 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 459 ConstructedInterpolants, 0 QuantifiedInterpolants, 1142 SizeOfPredicates, 6 NumberOfNonLiveVariables, 634 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 156/168 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-01-09 03:39:41,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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