./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d 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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f2f6ef7968fa573a7da88ae0a516f1d800f437d82b0fa75227e8d7d318952eb1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 06:43:20,159 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 06:43:20,225 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 06:43:20,235 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 06:43:20,235 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 06:43:20,263 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 06:43:20,264 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 06:43:20,264 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 06:43:20,265 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 06:43:20,265 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 06:43:20,265 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 06:43:20,266 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 06:43:20,266 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 06:43:20,266 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 06:43:20,267 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 06:43:20,267 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 06:43:20,267 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 06:43:20,267 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 06:43:20,267 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 06:43:20,267 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 06:43:20,267 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 06:43:20,267 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 06:43:20,267 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 06:43:20,267 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 06:43:20,267 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 06:43:20,267 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 06:43:20,267 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 06:43:20,267 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 06:43:20,267 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 06:43:20,268 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 06:43:20,268 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 06:43:20,268 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 06:43:20,268 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 06:43:20,268 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:43:20,268 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 06:43:20,268 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 06:43:20,268 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 06:43:20,268 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 06:43:20,268 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 06:43:20,268 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 06:43:20,268 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 06:43:20,268 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 06:43:20,268 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> f2f6ef7968fa573a7da88ae0a516f1d800f437d82b0fa75227e8d7d318952eb1 [2025-02-08 06:43:20,537 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 06:43:20,548 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 06:43:20,550 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 06:43:20,551 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 06:43:20,551 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 06:43:20,552 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i [2025-02-08 06:43:21,816 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/67889fc6a/d53633c730ed43c990bc1d696119eafb/FLAGed7abfb1b [2025-02-08 06:43:22,087 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 06:43:22,087 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i [2025-02-08 06:43:22,097 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/67889fc6a/d53633c730ed43c990bc1d696119eafb/FLAGed7abfb1b [2025-02-08 06:43:22,113 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/67889fc6a/d53633c730ed43c990bc1d696119eafb [2025-02-08 06:43:22,115 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 06:43:22,116 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 06:43:22,117 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 06:43:22,117 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 06:43:22,121 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 06:43:22,121 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:43:22" (1/1) ... [2025-02-08 06:43:22,122 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64ae290 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:43:22, skipping insertion in model container [2025-02-08 06:43:22,122 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:43:22" (1/1) ... [2025-02-08 06:43:22,152 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 06:43:22,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:43:22,463 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 06:43:22,495 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:43:22,528 INFO L204 MainTranslator]: Completed translation [2025-02-08 06:43:22,529 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:43:22 WrapperNode [2025-02-08 06:43:22,529 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 06:43:22,530 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 06:43:22,530 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 06:43:22,530 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 06:43:22,535 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:43:22" (1/1) ... [2025-02-08 06:43:22,549 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:43:22" (1/1) ... [2025-02-08 06:43:22,568 INFO L138 Inliner]: procedures = 127, calls = 46, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 149 [2025-02-08 06:43:22,569 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 06:43:22,570 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 06:43:22,571 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 06:43:22,571 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 06:43:22,576 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:43:22" (1/1) ... [2025-02-08 06:43:22,576 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:43:22" (1/1) ... [2025-02-08 06:43:22,580 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:43:22" (1/1) ... [2025-02-08 06:43:22,604 INFO L175 MemorySlicer]: Split 27 memory accesses to 3 slices as follows [2, 10, 15]. 56 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 9 writes are split as follows [0, 2, 7]. [2025-02-08 06:43:22,604 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:43:22" (1/1) ... [2025-02-08 06:43:22,605 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:43:22" (1/1) ... [2025-02-08 06:43:22,614 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:43:22" (1/1) ... [2025-02-08 06:43:22,615 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:43:22" (1/1) ... [2025-02-08 06:43:22,616 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:43:22" (1/1) ... [2025-02-08 06:43:22,617 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:43:22" (1/1) ... [2025-02-08 06:43:22,620 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 06:43:22,627 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 06:43:22,628 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 06:43:22,628 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 06:43:22,628 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:43:22" (1/1) ... [2025-02-08 06:43:22,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:43:22,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:43:22,655 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-02-08 06:43:22,657 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-02-08 06:43:22,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 06:43:22,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 06:43:22,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 06:43:22,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 06:43:22,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 06:43:22,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 06:43:22,682 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-02-08 06:43:22,682 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-02-08 06:43:22,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 06:43:22,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 06:43:22,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 06:43:22,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 06:43:22,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 06:43:22,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 06:43:22,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 06:43:22,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 06:43:22,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 06:43:22,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 06:43:22,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-08 06:43:22,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-08 06:43:22,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-08 06:43:22,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 06:43:22,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 06:43:22,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 06:43:22,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 06:43:22,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 06:43:22,813 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 06:43:22,814 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 06:43:23,161 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12: assume false; [2025-02-08 06:43:23,161 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12: assume !false; [2025-02-08 06:43:23,161 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-1: assume false; [2025-02-08 06:43:23,162 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-1: assume !false; [2025-02-08 06:43:23,162 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L624: call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; [2025-02-08 06:43:23,162 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L645: havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset;assume { :end_inline_reach_error } true;assume false;main_#res#1 := 1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; [2025-02-08 06:43:23,162 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L645-1: assume { :begin_inline_reach_error } true;havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 06:43:23,197 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L577: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-02-08 06:43:23,213 INFO L? ?]: Removed 140 outVars from TransFormulas that were not future-live. [2025-02-08 06:43:23,213 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 06:43:23,226 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 06:43:23,226 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 06:43:23,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:43:23 BoogieIcfgContainer [2025-02-08 06:43:23,226 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 06:43:23,228 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 06:43:23,228 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 06:43:23,233 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 06:43:23,234 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 06:43:22" (1/3) ... [2025-02-08 06:43:23,236 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@178c19aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:43:23, skipping insertion in model container [2025-02-08 06:43:23,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:43:22" (2/3) ... [2025-02-08 06:43:23,236 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@178c19aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:43:23, skipping insertion in model container [2025-02-08 06:43:23,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:43:23" (3/3) ... [2025-02-08 06:43:23,237 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_unequal.i [2025-02-08 06:43:23,249 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 06:43:23,251 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2c_prepend_unequal.i that has 2 procedures, 127 locations, 1 initial locations, 4 loop locations, and 56 error locations. [2025-02-08 06:43:23,290 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 06:43:23,301 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=None, 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;@4a2650c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 06:43:23,301 INFO L334 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2025-02-08 06:43:23,306 INFO L276 IsEmpty]: Start isEmpty. Operand has 127 states, 65 states have (on average 2.0307692307692307) internal successors, (132), 122 states have internal predecessors, (132), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:43:23,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 06:43:23,310 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:43:23,311 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 06:43:23,311 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-08 06:43:23,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:43:23,316 INFO L85 PathProgramCache]: Analyzing trace with hash 157084922, now seen corresponding path program 1 times [2025-02-08 06:43:23,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:43:23,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086842863] [2025-02-08 06:43:23,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:43:23,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:43:23,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 06:43:23,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 06:43:23,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:43:23,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:23,519 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-08 06:43:23,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:43:23,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086842863] [2025-02-08 06:43:23,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086842863] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:43:23,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:43:23,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:43:23,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137169406] [2025-02-08 06:43:23,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:43:23,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:43:23,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:43:23,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:43:23,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:43:23,552 INFO L87 Difference]: Start difference. First operand has 127 states, 65 states have (on average 2.0307692307692307) internal successors, (132), 122 states have internal predecessors, (132), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:43:23,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:43:23,670 INFO L93 Difference]: Finished difference Result 125 states and 134 transitions. [2025-02-08 06:43:23,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:43:23,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-08 06:43:23,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:43:23,678 INFO L225 Difference]: With dead ends: 125 [2025-02-08 06:43:23,678 INFO L226 Difference]: Without dead ends: 121 [2025-02-08 06:43:23,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:43:23,681 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 2 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:43:23,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 201 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:43:23,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-02-08 06:43:23,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2025-02-08 06:43:23,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 64 states have (on average 1.90625) internal successors, (122), 116 states have internal predecessors, (122), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:43:23,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 128 transitions. [2025-02-08 06:43:23,726 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 128 transitions. Word has length 5 [2025-02-08 06:43:23,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:43:23,727 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 128 transitions. [2025-02-08 06:43:23,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:43:23,727 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 128 transitions. [2025-02-08 06:43:23,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 06:43:23,728 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:43:23,728 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 06:43:23,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 06:43:23,729 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-08 06:43:23,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:43:23,729 INFO L85 PathProgramCache]: Analyzing trace with hash 157084923, now seen corresponding path program 1 times [2025-02-08 06:43:23,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:43:23,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674615946] [2025-02-08 06:43:23,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:43:23,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:43:23,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 06:43:23,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 06:43:23,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:43:23,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:23,865 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-08 06:43:23,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:43:23,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674615946] [2025-02-08 06:43:23,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674615946] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:43:23,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:43:23,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:43:23,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844253437] [2025-02-08 06:43:23,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:43:23,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:43:23,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:43:23,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:43:23,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:43:23,869 INFO L87 Difference]: Start difference. First operand 121 states and 128 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:43:23,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:43:23,986 INFO L93 Difference]: Finished difference Result 119 states and 126 transitions. [2025-02-08 06:43:23,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:43:23,988 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-08 06:43:23,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:43:23,989 INFO L225 Difference]: With dead ends: 119 [2025-02-08 06:43:23,989 INFO L226 Difference]: Without dead ends: 119 [2025-02-08 06:43:23,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:43:23,989 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 2 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:43:23,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 198 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:43:23,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-02-08 06:43:23,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-02-08 06:43:23,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 64 states have (on average 1.875) internal successors, (120), 114 states have internal predecessors, (120), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:43:24,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 126 transitions. [2025-02-08 06:43:24,001 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 126 transitions. Word has length 5 [2025-02-08 06:43:24,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:43:24,002 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 126 transitions. [2025-02-08 06:43:24,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:43:24,002 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 126 transitions. [2025-02-08 06:43:24,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 06:43:24,002 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:43:24,002 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:43:24,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 06:43:24,003 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-08 06:43:24,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:43:24,003 INFO L85 PathProgramCache]: Analyzing trace with hash -700671299, now seen corresponding path program 1 times [2025-02-08 06:43:24,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:43:24,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709428807] [2025-02-08 06:43:24,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:43:24,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:43:24,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 06:43:24,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 06:43:24,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:43:24,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:24,101 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-08 06:43:24,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:43:24,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709428807] [2025-02-08 06:43:24,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709428807] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:43:24,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:43:24,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:43:24,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191829421] [2025-02-08 06:43:24,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:43:24,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:43:24,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:43:24,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:43:24,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:43:24,105 INFO L87 Difference]: Start difference. First operand 119 states and 126 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:43:24,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:43:24,127 INFO L93 Difference]: Finished difference Result 126 states and 134 transitions. [2025-02-08 06:43:24,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:43:24,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-02-08 06:43:24,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:43:24,128 INFO L225 Difference]: With dead ends: 126 [2025-02-08 06:43:24,128 INFO L226 Difference]: Without dead ends: 126 [2025-02-08 06:43:24,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:43:24,129 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 5 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:43:24,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 243 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:43:24,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-02-08 06:43:24,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 120. [2025-02-08 06:43:24,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 65 states have (on average 1.8615384615384616) internal successors, (121), 115 states have internal predecessors, (121), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:43:24,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 127 transitions. [2025-02-08 06:43:24,142 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 127 transitions. Word has length 12 [2025-02-08 06:43:24,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:43:24,142 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 127 transitions. [2025-02-08 06:43:24,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:43:24,142 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 127 transitions. [2025-02-08 06:43:24,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-08 06:43:24,143 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:43:24,143 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:43:24,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 06:43:24,143 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-08 06:43:24,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:43:24,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1310719763, now seen corresponding path program 1 times [2025-02-08 06:43:24,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:43:24,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974711795] [2025-02-08 06:43:24,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:43:24,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:43:24,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 06:43:24,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 06:43:24,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:43:24,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:24,307 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 06:43:24,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:43:24,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974711795] [2025-02-08 06:43:24,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974711795] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:43:24,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:43:24,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:43:24,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350944278] [2025-02-08 06:43:24,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:43:24,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:43:24,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:43:24,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:43:24,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:43:24,309 INFO L87 Difference]: Start difference. First operand 120 states and 127 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:43:24,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:43:24,509 INFO L93 Difference]: Finished difference Result 119 states and 126 transitions. [2025-02-08 06:43:24,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:43:24,510 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2025-02-08 06:43:24,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:43:24,511 INFO L225 Difference]: With dead ends: 119 [2025-02-08 06:43:24,511 INFO L226 Difference]: Without dead ends: 119 [2025-02-08 06:43:24,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:43:24,512 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 2 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:43:24,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 370 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:43:24,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-02-08 06:43:24,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-02-08 06:43:24,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 65 states have (on average 1.8461538461538463) internal successors, (120), 114 states have internal predecessors, (120), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:43:24,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 126 transitions. [2025-02-08 06:43:24,523 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 126 transitions. Word has length 21 [2025-02-08 06:43:24,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:43:24,523 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 126 transitions. [2025-02-08 06:43:24,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:43:24,523 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 126 transitions. [2025-02-08 06:43:24,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-08 06:43:24,523 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:43:24,523 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:43:24,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 06:43:24,524 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-08 06:43:24,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:43:24,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1310719764, now seen corresponding path program 1 times [2025-02-08 06:43:24,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:43:24,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347970770] [2025-02-08 06:43:24,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:43:24,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:43:24,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 06:43:24,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 06:43:24,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:43:24,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:24,765 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:43:24,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:43:24,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347970770] [2025-02-08 06:43:24,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347970770] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:43:24,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:43:24,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:43:24,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862225928] [2025-02-08 06:43:24,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:43:24,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:43:24,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:43:24,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:43:24,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:43:24,767 INFO L87 Difference]: Start difference. First operand 119 states and 126 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:43:24,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:43:24,933 INFO L93 Difference]: Finished difference Result 118 states and 125 transitions. [2025-02-08 06:43:24,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:43:24,934 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2025-02-08 06:43:24,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:43:24,935 INFO L225 Difference]: With dead ends: 118 [2025-02-08 06:43:24,935 INFO L226 Difference]: Without dead ends: 118 [2025-02-08 06:43:24,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:43:24,936 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 1 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:43:24,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 394 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:43:24,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-02-08 06:43:24,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2025-02-08 06:43:24,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 65 states have (on average 1.8307692307692307) internal successors, (119), 113 states have internal predecessors, (119), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:43:24,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 125 transitions. [2025-02-08 06:43:24,942 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 125 transitions. Word has length 21 [2025-02-08 06:43:24,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:43:24,942 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 125 transitions. [2025-02-08 06:43:24,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:43:24,943 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2025-02-08 06:43:24,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-08 06:43:24,943 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:43:24,943 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:43:24,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 06:43:24,943 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-08 06:43:24,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:43:24,944 INFO L85 PathProgramCache]: Analyzing trace with hash 2104865153, now seen corresponding path program 1 times [2025-02-08 06:43:24,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:43:24,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812537149] [2025-02-08 06:43:24,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:43:24,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:43:24,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 06:43:24,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 06:43:24,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:43:24,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:25,214 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:43:25,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:43:25,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812537149] [2025-02-08 06:43:25,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812537149] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:43:25,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020675048] [2025-02-08 06:43:25,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:43:25,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:43:25,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:43:25,218 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-02-08 06:43:25,219 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-02-08 06:43:25,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 06:43:25,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 06:43:25,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:43:25,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:25,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-08 06:43:25,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:43:25,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 06:43:25,432 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2025-02-08 06:43:25,506 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-08 06:43:25,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-02-08 06:43:25,520 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2025-02-08 06:43:25,520 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:43:25,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020675048] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:43:25,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:43:25,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 10 [2025-02-08 06:43:25,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723590651] [2025-02-08 06:43:25,609 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:43:25,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 06:43:25,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:43:25,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 06:43:25,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=86, Unknown=1, NotChecked=18, Total=132 [2025-02-08 06:43:25,611 INFO L87 Difference]: Start difference. First operand 118 states and 125 transitions. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 06:43:25,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:43:25,915 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2025-02-08 06:43:25,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:43:25,916 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2025-02-08 06:43:25,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:43:25,917 INFO L225 Difference]: With dead ends: 117 [2025-02-08 06:43:25,917 INFO L226 Difference]: Without dead ends: 117 [2025-02-08 06:43:25,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=122, Unknown=1, NotChecked=22, Total=182 [2025-02-08 06:43:25,917 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 1 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 117 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:43:25,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 479 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 356 Invalid, 0 Unknown, 117 Unchecked, 0.2s Time] [2025-02-08 06:43:25,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-02-08 06:43:25,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-02-08 06:43:25,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 65 states have (on average 1.8153846153846154) internal successors, (118), 112 states have internal predecessors, (118), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:43:25,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 124 transitions. [2025-02-08 06:43:25,925 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 124 transitions. Word has length 24 [2025-02-08 06:43:25,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:43:25,925 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 124 transitions. [2025-02-08 06:43:25,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 06:43:25,925 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 124 transitions. [2025-02-08 06:43:25,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-08 06:43:25,926 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:43:25,926 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:43:25,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 06:43:26,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:43:26,126 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-08 06:43:26,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:43:26,127 INFO L85 PathProgramCache]: Analyzing trace with hash 2104865154, now seen corresponding path program 1 times [2025-02-08 06:43:26,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:43:26,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45551694] [2025-02-08 06:43:26,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:43:26,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:43:26,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 06:43:26,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 06:43:26,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:43:26,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:26,536 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:43:26,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:43:26,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45551694] [2025-02-08 06:43:26,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45551694] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:43:26,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331493772] [2025-02-08 06:43:26,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:43:26,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:43:26,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:43:26,539 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-02-08 06:43:26,540 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-02-08 06:43:26,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 06:43:26,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 06:43:26,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:43:26,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:26,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-08 06:43:26,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:43:26,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 06:43:26,831 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 06:43:26,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-02-08 06:43:26,861 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:43:26,861 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:43:26,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331493772] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:43:26,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:43:26,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2025-02-08 06:43:26,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254363481] [2025-02-08 06:43:26,997 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:43:26,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-08 06:43:26,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:43:26,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 06:43:26,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2025-02-08 06:43:26,998 INFO L87 Difference]: Start difference. First operand 117 states and 124 transitions. Second operand has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 14 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 06:43:27,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:43:27,548 INFO L93 Difference]: Finished difference Result 124 states and 134 transitions. [2025-02-08 06:43:27,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 06:43:27,549 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 14 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2025-02-08 06:43:27,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:43:27,551 INFO L225 Difference]: With dead ends: 124 [2025-02-08 06:43:27,551 INFO L226 Difference]: Without dead ends: 124 [2025-02-08 06:43:27,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2025-02-08 06:43:27,552 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 5 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 06:43:27,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 806 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 06:43:27,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-02-08 06:43:27,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 116. [2025-02-08 06:43:27,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 65 states have (on average 1.8) internal successors, (117), 111 states have internal predecessors, (117), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:43:27,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2025-02-08 06:43:27,557 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 24 [2025-02-08 06:43:27,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:43:27,557 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2025-02-08 06:43:27,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 14 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 06:43:27,558 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2025-02-08 06:43:27,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-08 06:43:27,558 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:43:27,558 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:43:27,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 06:43:27,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:43:27,759 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-08 06:43:27,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:43:27,759 INFO L85 PathProgramCache]: Analyzing trace with hash -558846289, now seen corresponding path program 1 times [2025-02-08 06:43:27,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:43:27,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611536404] [2025-02-08 06:43:27,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:43:27,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:43:27,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 06:43:27,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 06:43:27,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:43:27,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:28,253 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 06:43:28,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:43:28,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611536404] [2025-02-08 06:43:28,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611536404] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:43:28,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121851382] [2025-02-08 06:43:28,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:43:28,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:43:28,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:43:28,257 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:43:28,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 06:43:28,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 06:43:28,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 06:43:28,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:43:28,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:28,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-08 06:43:28,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:43:28,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 06:43:28,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-08 06:43:28,417 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2025-02-08 06:43:28,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:43:28,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-08 06:43:28,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-08 06:43:28,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:43:28,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-08 06:43:28,540 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2025-02-08 06:43:28,577 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-08 06:43:28,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-02-08 06:43:28,582 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 12 not checked. [2025-02-08 06:43:28,582 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:43:28,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121851382] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:43:28,635 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:43:28,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 13 [2025-02-08 06:43:28,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595949547] [2025-02-08 06:43:28,635 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:43:28,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 06:43:28,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:43:28,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 06:43:28,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=147, Unknown=2, NotChecked=50, Total=240 [2025-02-08 06:43:28,636 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand has 15 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 13 states have internal predecessors, (41), 2 states have call successors, (3), 1 states have call predecessors, (3), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-08 06:43:29,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:43:29,086 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2025-02-08 06:43:29,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:43:29,086 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 13 states have internal predecessors, (41), 2 states have call successors, (3), 1 states have call predecessors, (3), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 35 [2025-02-08 06:43:29,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:43:29,087 INFO L225 Difference]: With dead ends: 125 [2025-02-08 06:43:29,087 INFO L226 Difference]: Without dead ends: 125 [2025-02-08 06:43:29,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=216, Unknown=2, NotChecked=62, Total=342 [2025-02-08 06:43:29,088 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 113 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 252 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 06:43:29,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 349 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 458 Invalid, 0 Unknown, 252 Unchecked, 0.4s Time] [2025-02-08 06:43:29,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-02-08 06:43:29,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 107. [2025-02-08 06:43:29,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 65 states have (on average 1.6615384615384616) internal successors, (108), 102 states have internal predecessors, (108), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:43:29,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 114 transitions. [2025-02-08 06:43:29,097 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 114 transitions. Word has length 35 [2025-02-08 06:43:29,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:43:29,097 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 114 transitions. [2025-02-08 06:43:29,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 13 states have internal predecessors, (41), 2 states have call successors, (3), 1 states have call predecessors, (3), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-08 06:43:29,098 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2025-02-08 06:43:29,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-08 06:43:29,098 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:43:29,098 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:43:29,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 06:43:29,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:43:29,299 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-08 06:43:29,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:43:29,300 INFO L85 PathProgramCache]: Analyzing trace with hash -558846288, now seen corresponding path program 1 times [2025-02-08 06:43:29,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:43:29,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952500948] [2025-02-08 06:43:29,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:43:29,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:43:29,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 06:43:29,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 06:43:29,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:43:29,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:29,853 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:43:29,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:43:29,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952500948] [2025-02-08 06:43:29,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952500948] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:43:29,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703657344] [2025-02-08 06:43:29,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:43:29,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:43:29,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:43:29,855 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:43:29,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 06:43:29,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 06:43:29,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 06:43:29,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:43:29,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:29,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-08 06:43:29,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:43:30,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 06:43:30,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-08 06:43:30,041 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2025-02-08 06:43:30,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:43:30,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-08 06:43:30,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-08 06:43:30,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:43:30,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-08 06:43:30,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-08 06:43:30,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:43:30,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-08 06:43:30,281 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 06:43:30,282 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 06:43:30,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703657344] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:43:30,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 06:43:30,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 17 [2025-02-08 06:43:30,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922777324] [2025-02-08 06:43:30,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:43:30,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:43:30,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:43:30,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:43:30,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=256, Unknown=1, NotChecked=32, Total=342 [2025-02-08 06:43:30,283 INFO L87 Difference]: Start difference. First operand 107 states and 114 transitions. Second operand has 7 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 06:43:30,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:43:30,413 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2025-02-08 06:43:30,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:43:30,414 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2025-02-08 06:43:30,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:43:30,414 INFO L225 Difference]: With dead ends: 101 [2025-02-08 06:43:30,414 INFO L226 Difference]: Without dead ends: 101 [2025-02-08 06:43:30,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=287, Unknown=1, NotChecked=34, Total=380 [2025-02-08 06:43:30,415 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 22 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 135 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:43:30,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 246 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 140 Invalid, 0 Unknown, 135 Unchecked, 0.1s Time] [2025-02-08 06:43:30,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-02-08 06:43:30,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-02-08 06:43:30,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 65 states have (on average 1.5692307692307692) internal successors, (102), 96 states have internal predecessors, (102), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:43:30,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 108 transitions. [2025-02-08 06:43:30,423 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 108 transitions. Word has length 35 [2025-02-08 06:43:30,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:43:30,423 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 108 transitions. [2025-02-08 06:43:30,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 06:43:30,423 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 108 transitions. [2025-02-08 06:43:30,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-08 06:43:30,424 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:43:30,424 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:43:30,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-08 06:43:30,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-02-08 06:43:30,625 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-08 06:43:30,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:43:30,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1296505759, now seen corresponding path program 1 times [2025-02-08 06:43:30,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:43:30,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793674796] [2025-02-08 06:43:30,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:43:30,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:43:30,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-08 06:43:30,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 06:43:30,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:43:30,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:30,738 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-08 06:43:30,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:43:30,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793674796] [2025-02-08 06:43:30,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793674796] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:43:30,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:43:30,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:43:30,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780044656] [2025-02-08 06:43:30,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:43:30,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:43:30,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:43:30,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:43:30,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:43:30,740 INFO L87 Difference]: Start difference. First operand 101 states and 108 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 06:43:30,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:43:30,878 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2025-02-08 06:43:30,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:43:30,879 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2025-02-08 06:43:30,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:43:30,879 INFO L225 Difference]: With dead ends: 99 [2025-02-08 06:43:30,879 INFO L226 Difference]: Without dead ends: 99 [2025-02-08 06:43:30,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:43:30,880 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 21 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:43:30,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 292 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:43:30,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-02-08 06:43:30,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-02-08 06:43:30,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 65 states have (on average 1.5384615384615385) internal successors, (100), 94 states have internal predecessors, (100), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:43:30,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2025-02-08 06:43:30,887 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 38 [2025-02-08 06:43:30,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:43:30,888 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2025-02-08 06:43:30,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 06:43:30,888 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2025-02-08 06:43:30,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-08 06:43:30,889 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:43:30,889 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:43:30,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 06:43:30,891 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-08 06:43:30,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:43:30,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1296505758, now seen corresponding path program 1 times [2025-02-08 06:43:30,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:43:30,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261084196] [2025-02-08 06:43:30,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:43:30,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:43:30,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-08 06:43:30,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 06:43:30,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:43:30,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:31,053 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-08 06:43:31,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:43:31,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261084196] [2025-02-08 06:43:31,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261084196] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:43:31,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:43:31,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:43:31,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111520522] [2025-02-08 06:43:31,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:43:31,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:43:31,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:43:31,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:43:31,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:43:31,056 INFO L87 Difference]: Start difference. First operand 99 states and 106 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 06:43:31,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:43:31,187 INFO L93 Difference]: Finished difference Result 97 states and 104 transitions. [2025-02-08 06:43:31,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:43:31,188 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2025-02-08 06:43:31,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:43:31,188 INFO L225 Difference]: With dead ends: 97 [2025-02-08 06:43:31,188 INFO L226 Difference]: Without dead ends: 97 [2025-02-08 06:43:31,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:43:31,189 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 20 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:43:31,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 304 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:43:31,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-02-08 06:43:31,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-02-08 06:43:31,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 65 states have (on average 1.5076923076923077) internal successors, (98), 92 states have internal predecessors, (98), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:43:31,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2025-02-08 06:43:31,195 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 38 [2025-02-08 06:43:31,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:43:31,195 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2025-02-08 06:43:31,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 06:43:31,196 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2025-02-08 06:43:31,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-08 06:43:31,196 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:43:31,196 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:43:31,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 06:43:31,197 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-08 06:43:31,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:43:31,197 INFO L85 PathProgramCache]: Analyzing trace with hash -401517153, now seen corresponding path program 1 times [2025-02-08 06:43:31,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:43:31,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440553054] [2025-02-08 06:43:31,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:43:31,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:43:31,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 06:43:31,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 06:43:31,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:43:31,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:31,417 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-08 06:43:31,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:43:31,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440553054] [2025-02-08 06:43:31,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440553054] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:43:31,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255868719] [2025-02-08 06:43:31,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:43:31,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:43:31,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:43:31,420 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:43:31,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 06:43:31,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 06:43:31,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 06:43:31,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:43:31,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:31,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-02-08 06:43:31,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:43:31,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 06:43:31,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 06:43:31,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-08 06:43:31,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-08 06:43:31,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:43:31,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-08 06:43:31,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:43:31,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2025-02-08 06:43:31,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-08 06:43:31,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:43:31,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:43:31,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:43:31,914 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-02-08 06:43:31,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-02-08 06:43:31,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-08 06:43:32,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-08 06:43:32,045 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2025-02-08 06:43:32,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:43:32,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-08 06:43:32,124 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 12 not checked. [2025-02-08 06:43:32,125 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:43:32,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255868719] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:43:32,251 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:43:32,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 22 [2025-02-08 06:43:32,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091422715] [2025-02-08 06:43:32,252 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:43:32,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-08 06:43:32,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:43:32,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-08 06:43:32,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=439, Unknown=1, NotChecked=42, Total=552 [2025-02-08 06:43:32,253 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand has 22 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 17 states have internal predecessors, (62), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-08 06:43:32,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:43:32,979 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2025-02-08 06:43:32,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 06:43:32,979 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 17 states have internal predecessors, (62), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 40 [2025-02-08 06:43:32,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:43:32,980 INFO L225 Difference]: With dead ends: 95 [2025-02-08 06:43:32,980 INFO L226 Difference]: Without dead ends: 95 [2025-02-08 06:43:32,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=153, Invalid=842, Unknown=1, NotChecked=60, Total=1056 [2025-02-08 06:43:32,981 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 221 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 06:43:32,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 676 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 758 Invalid, 0 Unknown, 96 Unchecked, 0.4s Time] [2025-02-08 06:43:32,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-02-08 06:43:32,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2025-02-08 06:43:32,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 63 states have (on average 1.4603174603174602) internal successors, (92), 87 states have internal predecessors, (92), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:43:32,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2025-02-08 06:43:32,985 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 40 [2025-02-08 06:43:32,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:43:32,986 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2025-02-08 06:43:32,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 17 states have internal predecessors, (62), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-08 06:43:32,986 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2025-02-08 06:43:32,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-08 06:43:32,987 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:43:32,987 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:43:32,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 06:43:33,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-08 06:43:33,191 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-08 06:43:33,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:43:33,191 INFO L85 PathProgramCache]: Analyzing trace with hash -370023135, now seen corresponding path program 1 times [2025-02-08 06:43:33,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:43:33,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544072192] [2025-02-08 06:43:33,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:43:33,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:43:33,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 06:43:33,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 06:43:33,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:43:33,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:33,598 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:43:33,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:43:33,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544072192] [2025-02-08 06:43:33,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544072192] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:43:33,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808280320] [2025-02-08 06:43:33,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:43:33,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:43:33,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:43:33,602 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:43:33,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 06:43:33,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 06:43:33,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 06:43:33,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:43:33,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:33,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-02-08 06:43:33,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:43:33,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-08 06:43:33,872 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2025-02-08 06:43:33,912 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2025-02-08 06:43:33,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2025-02-08 06:43:33,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-08 06:43:33,933 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 06:43:33,933 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 06:43:33,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [808280320] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:43:33,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 06:43:33,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [15] total 16 [2025-02-08 06:43:33,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135747026] [2025-02-08 06:43:33,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:43:33,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 06:43:33,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:43:33,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 06:43:33,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=203, Unknown=1, NotChecked=28, Total=272 [2025-02-08 06:43:33,934 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 06:43:34,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:43:34,094 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2025-02-08 06:43:34,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 06:43:34,095 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 40 [2025-02-08 06:43:34,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:43:34,095 INFO L225 Difference]: With dead ends: 93 [2025-02-08 06:43:34,095 INFO L226 Difference]: Without dead ends: 93 [2025-02-08 06:43:34,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=290, Unknown=1, NotChecked=34, Total=380 [2025-02-08 06:43:34,096 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 28 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 158 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:43:34,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 309 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 202 Invalid, 0 Unknown, 158 Unchecked, 0.1s Time] [2025-02-08 06:43:34,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-02-08 06:43:34,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2025-02-08 06:43:34,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 65 states have (on average 1.4307692307692308) internal successors, (93), 87 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:43:34,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 99 transitions. [2025-02-08 06:43:34,100 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 99 transitions. Word has length 40 [2025-02-08 06:43:34,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:43:34,100 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 99 transitions. [2025-02-08 06:43:34,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 06:43:34,100 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2025-02-08 06:43:34,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-08 06:43:34,101 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:43:34,101 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:43:34,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 06:43:34,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-08 06:43:34,301 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-08 06:43:34,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:43:34,302 INFO L85 PathProgramCache]: Analyzing trace with hash -370023134, now seen corresponding path program 1 times [2025-02-08 06:43:34,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:43:34,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101486230] [2025-02-08 06:43:34,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:43:34,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:43:34,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 06:43:34,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 06:43:34,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:43:34,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:34,964 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:43:34,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:43:34,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101486230] [2025-02-08 06:43:34,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101486230] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:43:34,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046236260] [2025-02-08 06:43:34,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:43:34,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:43:34,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:43:34,967 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:43:34,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 06:43:35,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 06:43:35,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 06:43:35,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:43:35,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:35,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-02-08 06:43:35,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:43:35,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 06:43:35,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-08 06:43:35,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-08 06:43:35,469 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_4|) 0) 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) is different from true [2025-02-08 06:43:35,516 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-02-08 06:43:35,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-02-08 06:43:35,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-02-08 06:43:35,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-08 06:43:35,626 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2025-02-08 06:43:35,626 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:43:35,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046236260] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:43:35,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:43:35,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 29 [2025-02-08 06:43:35,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530447480] [2025-02-08 06:43:35,788 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:43:35,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-08 06:43:35,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:43:35,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-08 06:43:35,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=956, Unknown=1, NotChecked=62, Total=1122 [2025-02-08 06:43:35,790 INFO L87 Difference]: Start difference. First operand 92 states and 99 transitions. Second operand has 30 states, 27 states have (on average 2.185185185185185) internal successors, (59), 26 states have internal predecessors, (59), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-08 06:43:36,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:43:36,628 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2025-02-08 06:43:36,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-08 06:43:36,629 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 2.185185185185185) internal successors, (59), 26 states have internal predecessors, (59), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 40 [2025-02-08 06:43:36,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:43:36,630 INFO L225 Difference]: With dead ends: 108 [2025-02-08 06:43:36,630 INFO L226 Difference]: Without dead ends: 108 [2025-02-08 06:43:36,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=185, Invalid=1624, Unknown=1, NotChecked=82, Total=1892 [2025-02-08 06:43:36,631 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 126 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 1035 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 109 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 06:43:36,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 913 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1035 Invalid, 0 Unknown, 109 Unchecked, 0.6s Time] [2025-02-08 06:43:36,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-02-08 06:43:36,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2025-02-08 06:43:36,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 79 states have (on average 1.3544303797468353) internal successors, (107), 101 states have internal predecessors, (107), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:43:36,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2025-02-08 06:43:36,636 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 40 [2025-02-08 06:43:36,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:43:36,636 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2025-02-08 06:43:36,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 2.185185185185185) internal successors, (59), 26 states have internal predecessors, (59), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-08 06:43:36,636 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2025-02-08 06:43:36,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-08 06:43:36,638 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:43:36,638 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-02-08 06:43:36,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-08 06:43:36,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:43:36,839 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-08 06:43:36,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:43:36,839 INFO L85 PathProgramCache]: Analyzing trace with hash 884381883, now seen corresponding path program 1 times [2025-02-08 06:43:36,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:43:36,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596067160] [2025-02-08 06:43:36,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:43:36,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:43:36,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 06:43:36,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 06:43:36,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:43:36,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:37,723 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:43:37,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:43:37,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596067160] [2025-02-08 06:43:37,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596067160] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:43:37,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099785140] [2025-02-08 06:43:37,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:43:37,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:43:37,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:43:37,726 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:43:37,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 06:43:37,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 06:43:37,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 06:43:37,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:43:37,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:37,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 92 conjuncts are in the unsatisfiable core [2025-02-08 06:43:37,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:43:37,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 06:43:38,108 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:43:38,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 06:43:38,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:43:38,314 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 06:43:38,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-02-08 06:43:38,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-02-08 06:43:38,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-08 06:43:38,610 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5| Int)) (= 0 (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_5|) 0))) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))))) is different from true [2025-02-08 06:43:38,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:43:38,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2025-02-08 06:43:38,667 INFO L349 Elim1Store]: treesize reduction 72, result has 37.4 percent of original size [2025-02-08 06:43:38,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 57 [2025-02-08 06:43:38,838 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-08 06:43:38,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2025-02-08 06:43:39,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 38 [2025-02-08 06:43:39,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2025-02-08 06:43:39,264 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2025-02-08 06:43:39,265 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:43:39,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099785140] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:43:39,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:43:39,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 45 [2025-02-08 06:43:39,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933652917] [2025-02-08 06:43:39,385 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:43:39,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-02-08 06:43:39,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:43:39,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-02-08 06:43:39,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1925, Unknown=1, NotChecked=88, Total=2162 [2025-02-08 06:43:39,387 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand has 46 states, 42 states have (on average 1.8333333333333333) internal successors, (77), 39 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 06:43:40,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:43:40,742 INFO L93 Difference]: Finished difference Result 157 states and 170 transitions. [2025-02-08 06:43:40,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-08 06:43:40,742 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 42 states have (on average 1.8333333333333333) internal successors, (77), 39 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 46 [2025-02-08 06:43:40,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:43:40,744 INFO L225 Difference]: With dead ends: 157 [2025-02-08 06:43:40,744 INFO L226 Difference]: Without dead ends: 157 [2025-02-08 06:43:40,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 811 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=299, Invalid=3486, Unknown=1, NotChecked=120, Total=3906 [2025-02-08 06:43:40,745 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 164 mSDsluCounter, 1285 mSDsCounter, 0 mSdLazyCounter, 1646 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 1353 SdHoareTripleChecker+Invalid, 1809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 147 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-08 06:43:40,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 1353 Invalid, 1809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1646 Invalid, 0 Unknown, 147 Unchecked, 0.8s Time] [2025-02-08 06:43:40,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-02-08 06:43:40,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 135. [2025-02-08 06:43:40,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 104 states have (on average 1.2980769230769231) internal successors, (135), 126 states have internal predecessors, (135), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 06:43:40,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 145 transitions. [2025-02-08 06:43:40,750 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 145 transitions. Word has length 46 [2025-02-08 06:43:40,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:43:40,750 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 145 transitions. [2025-02-08 06:43:40,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 42 states have (on average 1.8333333333333333) internal successors, (77), 39 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 06:43:40,750 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 145 transitions. [2025-02-08 06:43:40,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-08 06:43:40,751 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:43:40,751 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-02-08 06:43:40,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-08 06:43:40,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-08 06:43:40,952 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-08 06:43:40,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:43:40,952 INFO L85 PathProgramCache]: Analyzing trace with hash 884381884, now seen corresponding path program 1 times [2025-02-08 06:43:40,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:43:40,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487165791] [2025-02-08 06:43:40,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:43:40,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:43:40,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 06:43:40,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 06:43:40,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:43:40,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:42,203 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:43:42,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:43:42,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487165791] [2025-02-08 06:43:42,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487165791] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:43:42,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105477975] [2025-02-08 06:43:42,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:43:42,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:43:42,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:43:42,206 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:43:42,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 06:43:42,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 06:43:42,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 06:43:42,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:43:42,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:42,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 119 conjuncts are in the unsatisfiable core [2025-02-08 06:43:42,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:43:42,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 06:43:42,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 06:43:42,745 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:43:42,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 06:43:42,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-08 06:43:42,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:43:42,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:43:43,022 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 06:43:43,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 52 [2025-02-08 06:43:43,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-02-08 06:43:43,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2025-02-08 06:43:43,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-08 06:43:43,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-02-08 06:43:43,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-02-08 06:43:43,329 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) 0) 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= (store |c_old(#memory_$Pointer$#2.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.offset| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.offset|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) is different from true [2025-02-08 06:43:43,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:43:43,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 34 [2025-02-08 06:43:43,373 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-02-08 06:43:43,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-02-08 06:43:43,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2025-02-08 06:43:43,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-02-08 06:43:43,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 28 [2025-02-08 06:43:43,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-02-08 06:43:43,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-08 06:43:43,781 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2025-02-08 06:43:43,781 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:43:44,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105477975] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:43:44,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:43:44,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2025-02-08 06:43:44,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497045707] [2025-02-08 06:43:44,203 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:43:44,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-02-08 06:43:44,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:43:44,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-02-08 06:43:44,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=2806, Unknown=1, NotChecked=106, Total=3080 [2025-02-08 06:43:44,205 INFO L87 Difference]: Start difference. First operand 135 states and 145 transitions. Second operand has 49 states, 45 states have (on average 1.7777777777777777) internal successors, (80), 42 states have internal predecessors, (80), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 06:43:50,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:43:50,247 INFO L93 Difference]: Finished difference Result 157 states and 169 transitions. [2025-02-08 06:43:50,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-08 06:43:50,248 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 45 states have (on average 1.7777777777777777) internal successors, (80), 42 states have internal predecessors, (80), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 46 [2025-02-08 06:43:50,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:43:50,249 INFO L225 Difference]: With dead ends: 157 [2025-02-08 06:43:50,249 INFO L226 Difference]: Without dead ends: 157 [2025-02-08 06:43:50,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1047 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=332, Invalid=5220, Unknown=2, NotChecked=146, Total=5700 [2025-02-08 06:43:50,251 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 163 mSDsluCounter, 1363 mSDsCounter, 0 mSdLazyCounter, 1952 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 1438 SdHoareTripleChecker+Invalid, 2117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 149 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:43:50,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 1438 Invalid, 2117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1952 Invalid, 0 Unknown, 149 Unchecked, 1.1s Time] [2025-02-08 06:43:50,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-02-08 06:43:50,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 133. [2025-02-08 06:43:50,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 102 states have (on average 1.2941176470588236) internal successors, (132), 124 states have internal predecessors, (132), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 06:43:50,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 142 transitions. [2025-02-08 06:43:50,258 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 142 transitions. Word has length 46 [2025-02-08 06:43:50,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:43:50,258 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 142 transitions. [2025-02-08 06:43:50,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 45 states have (on average 1.7777777777777777) internal successors, (80), 42 states have internal predecessors, (80), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 06:43:50,259 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 142 transitions. [2025-02-08 06:43:50,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-08 06:43:50,259 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:43:50,260 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 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] [2025-02-08 06:43:50,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-08 06:43:50,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:43:50,460 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-08 06:43:50,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:43:50,461 INFO L85 PathProgramCache]: Analyzing trace with hash 711504085, now seen corresponding path program 2 times [2025-02-08 06:43:50,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:43:50,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826936870] [2025-02-08 06:43:50,461 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:43:50,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:43:50,474 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 52 statements into 2 equivalence classes. [2025-02-08 06:43:50,497 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 06:43:50,497 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:43:50,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:51,521 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:43:51,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:43:51,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826936870] [2025-02-08 06:43:51,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826936870] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:43:51,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137122386] [2025-02-08 06:43:51,521 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:43:51,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:43:51,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:43:51,523 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:43:51,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-08 06:43:51,647 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 52 statements into 2 equivalence classes. [2025-02-08 06:43:51,685 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 06:43:51,685 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:43:51,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:51,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 119 conjuncts are in the unsatisfiable core [2025-02-08 06:43:51,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:43:51,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 06:43:51,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:43:51,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:43:52,137 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-02-08 06:43:52,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 34 [2025-02-08 06:43:52,147 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-02-08 06:43:52,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 22 [2025-02-08 06:43:52,263 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-02-08 06:43:52,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 23 [2025-02-08 06:43:52,274 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-02-08 06:43:52,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2025-02-08 06:43:52,279 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-02-08 06:43:52,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2025-02-08 06:43:52,449 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_7|) 0) 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (store |c_old(#memory_$Pointer$#2.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.offset| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.offset|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) is different from true [2025-02-08 06:43:52,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:43:52,488 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-02-08 06:43:52,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 45 [2025-02-08 06:43:52,510 INFO L349 Elim1Store]: treesize reduction 28, result has 42.9 percent of original size [2025-02-08 06:43:52,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 30 [2025-02-08 06:43:52,516 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2025-02-08 06:43:52,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2025-02-08 06:43:52,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 33 [2025-02-08 06:43:52,910 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-02-08 06:43:52,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2025-02-08 06:43:53,042 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-08 06:43:53,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2025-02-08 06:43:53,045 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2025-02-08 06:43:53,045 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:43:53,104 INFO L349 Elim1Store]: treesize reduction 5, result has 75.0 percent of original size [2025-02-08 06:43:53,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2025-02-08 06:43:53,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137122386] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:43:53,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:43:53,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 51 [2025-02-08 06:43:53,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889089639] [2025-02-08 06:43:53,320 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:43:53,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-02-08 06:43:53,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:43:53,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-02-08 06:43:53,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=2893, Unknown=1, NotChecked=108, Total=3192 [2025-02-08 06:43:53,322 INFO L87 Difference]: Start difference. First operand 133 states and 142 transitions. Second operand has 52 states, 48 states have (on average 1.8541666666666667) internal successors, (89), 45 states have internal predecessors, (89), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 06:43:55,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:43:55,072 INFO L93 Difference]: Finished difference Result 157 states and 170 transitions. [2025-02-08 06:43:55,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-02-08 06:43:55,072 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 48 states have (on average 1.8541666666666667) internal successors, (89), 45 states have internal predecessors, (89), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 52 [2025-02-08 06:43:55,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:43:55,073 INFO L225 Difference]: With dead ends: 157 [2025-02-08 06:43:55,073 INFO L226 Difference]: Without dead ends: 157 [2025-02-08 06:43:55,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1431 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=389, Invalid=5776, Unknown=1, NotChecked=154, Total=6320 [2025-02-08 06:43:55,075 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 152 mSDsluCounter, 1718 mSDsCounter, 0 mSdLazyCounter, 1906 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 1790 SdHoareTripleChecker+Invalid, 2077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 150 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:43:55,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 1790 Invalid, 2077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1906 Invalid, 0 Unknown, 150 Unchecked, 1.0s Time] [2025-02-08 06:43:55,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-02-08 06:43:55,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 141. [2025-02-08 06:43:55,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 110 states have (on average 1.290909090909091) internal successors, (142), 132 states have internal predecessors, (142), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 06:43:55,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 152 transitions. [2025-02-08 06:43:55,079 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 152 transitions. Word has length 52 [2025-02-08 06:43:55,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:43:55,079 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 152 transitions. [2025-02-08 06:43:55,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 48 states have (on average 1.8541666666666667) internal successors, (89), 45 states have internal predecessors, (89), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 06:43:55,080 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 152 transitions. [2025-02-08 06:43:55,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-08 06:43:55,080 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:43:55,080 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 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] [2025-02-08 06:43:55,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-08 06:43:55,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-08 06:43:55,281 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-08 06:43:55,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:43:55,281 INFO L85 PathProgramCache]: Analyzing trace with hash 711504086, now seen corresponding path program 2 times [2025-02-08 06:43:55,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:43:55,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049627690] [2025-02-08 06:43:55,282 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:43:55,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:43:55,293 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 52 statements into 2 equivalence classes. [2025-02-08 06:43:55,317 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 06:43:55,317 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:43:55,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:57,168 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 15 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:43:57,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:43:57,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049627690] [2025-02-08 06:43:57,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049627690] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:43:57,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270128359] [2025-02-08 06:43:57,169 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:43:57,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:43:57,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:43:57,170 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:43:57,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-08 06:43:57,288 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 52 statements into 2 equivalence classes. [2025-02-08 06:43:57,344 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 06:43:57,344 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:43:57,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:43:57,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 124 conjuncts are in the unsatisfiable core [2025-02-08 06:43:57,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:43:57,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 06:43:57,599 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:43:57,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 06:43:57,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:43:57,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:43:57,904 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-02-08 06:43:57,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 38 [2025-02-08 06:43:57,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2025-02-08 06:43:58,089 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-02-08 06:43:58,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 31 [2025-02-08 06:43:58,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-08 06:43:58,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-02-08 06:43:58,304 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_8| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_8|) 0) 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.base|) (= (store |c_old(#memory_$Pointer$#2.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#2.offset| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#2.offset|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) is different from true [2025-02-08 06:43:58,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:43:58,342 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-02-08 06:43:58,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 55 [2025-02-08 06:43:58,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:43:58,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:43:58,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2025-02-08 06:43:58,365 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-02-08 06:43:58,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-02-08 06:43:58,914 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-02-08 06:43:58,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 29 [2025-02-08 06:43:58,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-02-08 06:43:58,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-08 06:43:59,013 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2025-02-08 06:43:59,013 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:43:59,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270128359] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:43:59,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:43:59,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 27] total 55 [2025-02-08 06:43:59,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139752913] [2025-02-08 06:43:59,561 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:43:59,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-02-08 06:43:59,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:43:59,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-02-08 06:43:59,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=3566, Unknown=1, NotChecked=120, Total=3906 [2025-02-08 06:43:59,563 INFO L87 Difference]: Start difference. First operand 141 states and 152 transitions. Second operand has 55 states, 52 states have (on average 1.6730769230769231) internal successors, (87), 46 states have internal predecessors, (87), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-08 06:44:01,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:44:01,307 INFO L93 Difference]: Finished difference Result 142 states and 152 transitions. [2025-02-08 06:44:01,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-02-08 06:44:01,308 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 52 states have (on average 1.6730769230769231) internal successors, (87), 46 states have internal predecessors, (87), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 52 [2025-02-08 06:44:01,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:44:01,308 INFO L225 Difference]: With dead ends: 142 [2025-02-08 06:44:01,308 INFO L226 Difference]: Without dead ends: 142 [2025-02-08 06:44:01,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1856 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=400, Invalid=6083, Unknown=1, NotChecked=158, Total=6642 [2025-02-08 06:44:01,310 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 94 mSDsluCounter, 1679 mSDsCounter, 0 mSdLazyCounter, 1561 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 1752 SdHoareTripleChecker+Invalid, 1715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 132 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-08 06:44:01,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 1752 Invalid, 1715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1561 Invalid, 0 Unknown, 132 Unchecked, 0.9s Time] [2025-02-08 06:44:01,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-02-08 06:44:01,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 137. [2025-02-08 06:44:01,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 106 states have (on average 1.2830188679245282) internal successors, (136), 128 states have internal predecessors, (136), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 06:44:01,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 146 transitions. [2025-02-08 06:44:01,314 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 146 transitions. Word has length 52 [2025-02-08 06:44:01,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:44:01,314 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 146 transitions. [2025-02-08 06:44:01,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 52 states have (on average 1.6730769230769231) internal successors, (87), 46 states have internal predecessors, (87), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-08 06:44:01,315 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 146 transitions. [2025-02-08 06:44:01,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-08 06:44:01,315 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:44:01,315 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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-02-08 06:44:01,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-02-08 06:44:01,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-08 06:44:01,519 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-08 06:44:01,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:44:01,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1337214797, now seen corresponding path program 1 times [2025-02-08 06:44:01,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:44:01,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290423026] [2025-02-08 06:44:01,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:44:01,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:44:01,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 06:44:01,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 06:44:01,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:44:01,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:44:01,741 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-08 06:44:01,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:44:01,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290423026] [2025-02-08 06:44:01,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290423026] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:44:01,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:44:01,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 06:44:01,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061793278] [2025-02-08 06:44:01,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:44:01,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 06:44:01,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:44:01,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 06:44:01,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-08 06:44:01,743 INFO L87 Difference]: Start difference. First operand 137 states and 146 transitions. Second operand has 10 states, 8 states have (on average 4.75) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 06:44:01,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:44:01,960 INFO L93 Difference]: Finished difference Result 134 states and 143 transitions. [2025-02-08 06:44:01,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 06:44:01,960 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 4.75) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 52 [2025-02-08 06:44:01,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:44:01,961 INFO L225 Difference]: With dead ends: 134 [2025-02-08 06:44:01,961 INFO L226 Difference]: Without dead ends: 134 [2025-02-08 06:44:01,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-08 06:44:01,962 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 31 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:44:01,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 418 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:44:01,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-02-08 06:44:01,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2025-02-08 06:44:01,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 106 states have (on average 1.2547169811320755) internal successors, (133), 125 states have internal predecessors, (133), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 06:44:01,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 143 transitions. [2025-02-08 06:44:01,967 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 143 transitions. Word has length 52 [2025-02-08 06:44:01,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:44:01,967 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 143 transitions. [2025-02-08 06:44:01,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 4.75) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 06:44:01,967 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 143 transitions. [2025-02-08 06:44:01,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-08 06:44:01,968 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:44:01,968 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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-02-08 06:44:01,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 06:44:01,969 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-08 06:44:01,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:44:01,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1337214796, now seen corresponding path program 1 times [2025-02-08 06:44:01,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:44:01,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933100504] [2025-02-08 06:44:01,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:44:01,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:44:01,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 06:44:01,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 06:44:01,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:44:01,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:44:02,307 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-08 06:44:02,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:44:02,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933100504] [2025-02-08 06:44:02,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933100504] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:44:02,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:44:02,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 06:44:02,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449553915] [2025-02-08 06:44:02,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:44:02,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 06:44:02,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:44:02,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 06:44:02,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-08 06:44:02,309 INFO L87 Difference]: Start difference. First operand 134 states and 143 transitions. Second operand has 10 states, 8 states have (on average 5.0) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 06:44:02,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:44:02,515 INFO L93 Difference]: Finished difference Result 132 states and 141 transitions. [2025-02-08 06:44:02,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 06:44:02,516 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 5.0) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 52 [2025-02-08 06:44:02,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:44:02,516 INFO L225 Difference]: With dead ends: 132 [2025-02-08 06:44:02,517 INFO L226 Difference]: Without dead ends: 132 [2025-02-08 06:44:02,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-08 06:44:02,517 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 33 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:44:02,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 402 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:44:02,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-02-08 06:44:02,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2025-02-08 06:44:02,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 106 states have (on average 1.2358490566037736) internal successors, (131), 123 states have internal predecessors, (131), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 06:44:02,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 141 transitions. [2025-02-08 06:44:02,523 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 141 transitions. Word has length 52 [2025-02-08 06:44:02,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:44:02,523 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 141 transitions. [2025-02-08 06:44:02,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 5.0) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 06:44:02,523 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 141 transitions. [2025-02-08 06:44:02,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-08 06:44:02,524 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:44:02,524 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:44:02,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 06:44:02,524 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-08 06:44:02,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:44:02,525 INFO L85 PathProgramCache]: Analyzing trace with hash 740097663, now seen corresponding path program 3 times [2025-02-08 06:44:02,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:44:02,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067534296] [2025-02-08 06:44:02,525 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 06:44:02,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:44:02,543 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 58 statements into 4 equivalence classes. [2025-02-08 06:44:02,556 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 48 of 58 statements. [2025-02-08 06:44:02,556 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-08 06:44:02,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:44:02,600 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-02-08 06:44:02,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:44:02,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067534296] [2025-02-08 06:44:02,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067534296] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:44:02,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203955369] [2025-02-08 06:44:02,601 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 06:44:02,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:44:02,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:44:02,603 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:44:02,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-08 06:44:02,759 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 58 statements into 4 equivalence classes. [2025-02-08 06:44:02,872 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 48 of 58 statements. [2025-02-08 06:44:02,873 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-08 06:44:02,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:44:02,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 06:44:02,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:44:02,891 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-08 06:44:02,891 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 06:44:02,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203955369] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:44:02,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 06:44:02,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-08 06:44:02,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29009905] [2025-02-08 06:44:02,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:44:02,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:44:02,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:44:02,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:44:02,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:44:02,892 INFO L87 Difference]: Start difference. First operand 132 states and 141 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 06:44:02,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:44:02,900 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2025-02-08 06:44:02,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:44:02,901 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 58 [2025-02-08 06:44:02,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:44:02,901 INFO L225 Difference]: With dead ends: 92 [2025-02-08 06:44:02,901 INFO L226 Difference]: Without dead ends: 92 [2025-02-08 06:44:02,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:44:02,902 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:44:02,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 162 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:44:02,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-02-08 06:44:02,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-02-08 06:44:02,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 73 states have (on average 1.2328767123287672) internal successors, (90), 86 states have internal predecessors, (90), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:44:02,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2025-02-08 06:44:02,905 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 58 [2025-02-08 06:44:02,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:44:02,905 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2025-02-08 06:44:02,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 06:44:02,905 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2025-02-08 06:44:02,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-08 06:44:02,905 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:44:02,905 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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-02-08 06:44:02,916 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-08 06:44:03,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:44:03,106 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-08 06:44:03,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:44:03,106 INFO L85 PathProgramCache]: Analyzing trace with hash -171665171, now seen corresponding path program 1 times [2025-02-08 06:44:03,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:44:03,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301923273] [2025-02-08 06:44:03,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:44:03,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:44:03,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 06:44:03,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 06:44:03,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:44:03,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:44:03,836 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 06:44:03,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:44:03,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301923273] [2025-02-08 06:44:03,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301923273] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:44:03,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965371691] [2025-02-08 06:44:03,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:44:03,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:44:03,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:44:03,839 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:44:03,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-08 06:44:03,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 06:44:04,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 06:44:04,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:44:04,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:44:04,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 86 conjuncts are in the unsatisfiable core [2025-02-08 06:44:04,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:44:04,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 06:44:04,152 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:44:04,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 06:44:04,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:44:04,303 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 06:44:04,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2025-02-08 06:44:04,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2025-02-08 06:44:04,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-08 06:44:04,505 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-02-08 06:44:04,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 32 [2025-02-08 06:44:04,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 8 [2025-02-08 06:44:04,524 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-02-08 06:44:04,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-02-08 06:44:04,678 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:44:04,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2025-02-08 06:44:04,801 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:44:04,803 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:44:04,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 15 [2025-02-08 06:44:04,922 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:44:04,923 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:44:05,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965371691] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:44:05,217 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:44:05,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 27] total 44 [2025-02-08 06:44:05,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935307666] [2025-02-08 06:44:05,217 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:44:05,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-02-08 06:44:05,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:44:05,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-02-08 06:44:05,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=2399, Unknown=0, NotChecked=0, Total=2550 [2025-02-08 06:44:05,219 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand has 44 states, 41 states have (on average 2.2195121951219514) internal successors, (91), 37 states have internal predecessors, (91), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-08 06:44:06,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:44:06,152 INFO L93 Difference]: Finished difference Result 92 states and 95 transitions. [2025-02-08 06:44:06,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-08 06:44:06,153 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 41 states have (on average 2.2195121951219514) internal successors, (91), 37 states have internal predecessors, (91), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 57 [2025-02-08 06:44:06,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:44:06,153 INFO L225 Difference]: With dead ends: 92 [2025-02-08 06:44:06,153 INFO L226 Difference]: Without dead ends: 92 [2025-02-08 06:44:06,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 732 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=308, Invalid=3982, Unknown=0, NotChecked=0, Total=4290 [2025-02-08 06:44:06,156 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 85 mSDsluCounter, 1240 mSDsCounter, 0 mSdLazyCounter, 1362 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 1297 SdHoareTripleChecker+Invalid, 1371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 06:44:06,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 1297 Invalid, 1371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1362 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 06:44:06,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-02-08 06:44:06,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-02-08 06:44:06,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 73 states have (on average 1.2191780821917808) internal successors, (89), 86 states have internal predecessors, (89), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:44:06,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 95 transitions. [2025-02-08 06:44:06,159 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 95 transitions. Word has length 57 [2025-02-08 06:44:06,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:44:06,159 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 95 transitions. [2025-02-08 06:44:06,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 41 states have (on average 2.2195121951219514) internal successors, (91), 37 states have internal predecessors, (91), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-08 06:44:06,159 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2025-02-08 06:44:06,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-08 06:44:06,160 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:44:06,160 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] [2025-02-08 06:44:06,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-02-08 06:44:06,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:44:06,361 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-08 06:44:06,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:44:06,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1281248403, now seen corresponding path program 1 times [2025-02-08 06:44:06,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:44:06,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260221770] [2025-02-08 06:44:06,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:44:06,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:44:06,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-08 06:44:06,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-08 06:44:06,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:44:06,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:44:07,575 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-08 06:44:07,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:44:07,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260221770] [2025-02-08 06:44:07,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260221770] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:44:07,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647078287] [2025-02-08 06:44:07,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:44:07,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:44:07,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:44:07,577 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:44:07,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-02-08 06:44:07,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-08 06:44:07,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-08 06:44:07,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:44:07,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:44:07,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 102 conjuncts are in the unsatisfiable core [2025-02-08 06:44:07,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:44:07,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 06:44:07,948 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:44:07,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 06:44:08,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:44:08,104 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 06:44:08,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-02-08 06:44:08,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 14 [2025-02-08 06:44:08,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-08 06:44:08,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:44:08,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 35 [2025-02-08 06:44:08,347 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2025-02-08 06:44:08,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2025-02-08 06:44:09,223 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:44:09,228 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2025-02-08 06:44:09,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 57 [2025-02-08 06:44:09,344 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:44:09,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 68 [2025-02-08 06:44:09,349 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:44:09,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 76 [2025-02-08 06:44:09,458 INFO L349 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2025-02-08 06:44:09,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 134 treesize of output 85 [2025-02-08 06:44:09,598 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:44:09,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 69 [2025-02-08 06:44:09,601 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:44:09,604 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:44:09,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 52 [2025-02-08 06:44:09,737 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-02-08 06:44:09,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 24 [2025-02-08 06:44:09,741 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:44:09,741 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:44:10,503 INFO L349 Elim1Store]: treesize reduction 5, result has 90.9 percent of original size [2025-02-08 06:44:10,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 58 [2025-02-08 06:44:10,508 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2108 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int)) (= (select (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_2108) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|)) is different from false [2025-02-08 06:44:10,522 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2108 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int)) (= (select (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.offset|) v_ArrVal_2108) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_sll_circular_prepend_#t~mem11#1.base|)) is different from false [2025-02-08 06:44:10,532 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2108 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int)) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (= .cse0 (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse0)) (select (select |c_#memory_$Pointer$#2.base| .cse0) (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_2108) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2025-02-08 06:44:10,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647078287] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:44:10,813 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:44:10,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 35] total 57 [2025-02-08 06:44:10,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332594494] [2025-02-08 06:44:10,813 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:44:10,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2025-02-08 06:44:10,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:44:10,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2025-02-08 06:44:10,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=4084, Unknown=124, NotChecked=396, Total=4830 [2025-02-08 06:44:10,815 INFO L87 Difference]: Start difference. First operand 92 states and 95 transitions. Second operand has 58 states, 55 states have (on average 1.9636363636363636) internal successors, (108), 51 states have internal predecessors, (108), 4 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-08 06:44:16,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-08 06:44:17,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:44:17,322 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2025-02-08 06:44:17,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-02-08 06:44:17,323 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 55 states have (on average 1.9636363636363636) internal successors, (108), 51 states have internal predecessors, (108), 4 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 63 [2025-02-08 06:44:17,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:44:17,323 INFO L225 Difference]: With dead ends: 94 [2025-02-08 06:44:17,323 INFO L226 Difference]: Without dead ends: 94 [2025-02-08 06:44:17,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1865 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=497, Invalid=7939, Unknown=132, NotChecked=552, Total=9120 [2025-02-08 06:44:17,325 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 99 mSDsluCounter, 1329 mSDsCounter, 0 mSdLazyCounter, 1799 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 1379 SdHoareTripleChecker+Invalid, 1810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1799 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-02-08 06:44:17,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 1379 Invalid, 1810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1799 Invalid, 1 Unknown, 0 Unchecked, 4.8s Time] [2025-02-08 06:44:17,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-02-08 06:44:17,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-02-08 06:44:17,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 75 states have (on average 1.2266666666666666) internal successors, (92), 88 states have internal predecessors, (92), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:44:17,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2025-02-08 06:44:17,329 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 63 [2025-02-08 06:44:17,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:44:17,329 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2025-02-08 06:44:17,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 55 states have (on average 1.9636363636363636) internal successors, (108), 51 states have internal predecessors, (108), 4 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-08 06:44:17,329 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2025-02-08 06:44:17,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-08 06:44:17,330 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:44:17,330 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] [2025-02-08 06:44:17,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-02-08 06:44:17,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-02-08 06:44:17,530 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-08 06:44:17,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:44:17,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1281248404, now seen corresponding path program 1 times [2025-02-08 06:44:17,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:44:17,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855635624] [2025-02-08 06:44:17,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:44:17,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:44:17,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-08 06:44:17,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-08 06:44:17,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:44:17,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:44:19,305 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:44:19,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:44:19,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855635624] [2025-02-08 06:44:19,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855635624] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:44:19,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326887657] [2025-02-08 06:44:19,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:44:19,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:44:19,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:44:19,307 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:44:19,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-02-08 06:44:19,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-08 06:44:19,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-08 06:44:19,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:44:19,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:44:19,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 122 conjuncts are in the unsatisfiable core [2025-02-08 06:44:19,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:44:19,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 06:44:19,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 06:44:19,728 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:44:19,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 06:44:19,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:44:19,958 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 06:44:19,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-02-08 06:44:20,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-02-08 06:44:20,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-08 06:44:20,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-08 06:44:20,422 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-02-08 06:44:20,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2025-02-08 06:44:20,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:44:20,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2025-02-08 06:44:20,446 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-02-08 06:44:20,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-02-08 06:44:21,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-02-08 06:44:21,679 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:44:21,680 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:44:21,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 42 [2025-02-08 06:44:21,853 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:44:21,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 68 [2025-02-08 06:44:21,861 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:44:21,881 INFO L349 Elim1Store]: treesize reduction 33, result has 31.3 percent of original size [2025-02-08 06:44:21,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 136 treesize of output 112 [2025-02-08 06:44:22,108 INFO L349 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2025-02-08 06:44:22,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 174 treesize of output 97 [2025-02-08 06:44:22,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 19 [2025-02-08 06:44:22,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 80 [2025-02-08 06:44:22,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 56 [2025-02-08 06:44:22,378 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-02-08 06:44:22,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 24 [2025-02-08 06:44:22,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-08 06:44:22,488 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:44:22,488 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:44:22,787 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (forall ((v_ArrVal_2273 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2273) .cse0) .cse1) 4))) (forall ((v_ArrVal_2274 (Array Int Int)) (v_ArrVal_2273 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2273) .cse0) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2274) .cse0) .cse1)))))) is different from false [2025-02-08 06:44:22,798 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (forall ((v_ArrVal_2274 (Array Int Int)) (v_ArrVal_2273 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2273) .cse0) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2274) .cse0) .cse1)))) (forall ((v_ArrVal_2273 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_2273) .cse0) .cse1)))))) is different from false [2025-02-08 06:44:22,812 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:44:22,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 86 [2025-02-08 06:44:22,822 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:44:22,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 176 treesize of output 179 [2025-02-08 06:44:22,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 62 [2025-02-08 06:44:22,856 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:44:22,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 45 [2025-02-08 06:44:22,862 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:44:22,868 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:44:22,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 30 [2025-02-08 06:44:24,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326887657] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:44:24,718 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:44:24,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 34] total 63 [2025-02-08 06:44:24,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588048926] [2025-02-08 06:44:24,719 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:44:24,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2025-02-08 06:44:24,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:44:24,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2025-02-08 06:44:24,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=5753, Unknown=2, NotChecked=306, Total=6320 [2025-02-08 06:44:24,723 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand has 64 states, 60 states have (on average 1.85) internal successors, (111), 55 states have internal predecessors, (111), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 06:44:27,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:44:27,847 INFO L93 Difference]: Finished difference Result 96 states and 99 transitions. [2025-02-08 06:44:27,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-02-08 06:44:27,847 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 60 states have (on average 1.85) internal successors, (111), 55 states have internal predecessors, (111), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 63 [2025-02-08 06:44:27,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:44:27,848 INFO L225 Difference]: With dead ends: 96 [2025-02-08 06:44:27,848 INFO L226 Difference]: Without dead ends: 96 [2025-02-08 06:44:27,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1877 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=506, Invalid=10420, Unknown=2, NotChecked=414, Total=11342 [2025-02-08 06:44:27,849 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 67 mSDsluCounter, 1890 mSDsCounter, 0 mSdLazyCounter, 2574 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 1942 SdHoareTripleChecker+Invalid, 2580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:44:27,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 1942 Invalid, 2580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2574 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-08 06:44:27,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-02-08 06:44:27,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-02-08 06:44:27,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 77 states have (on average 1.2077922077922079) internal successors, (93), 90 states have internal predecessors, (93), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:44:27,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 99 transitions. [2025-02-08 06:44:27,853 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 99 transitions. Word has length 63 [2025-02-08 06:44:27,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:44:27,853 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 99 transitions. [2025-02-08 06:44:27,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 60 states have (on average 1.85) internal successors, (111), 55 states have internal predecessors, (111), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 06:44:27,853 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 99 transitions. [2025-02-08 06:44:27,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-08 06:44:27,854 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:44:27,854 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-08 06:44:27,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-02-08 06:44:28,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-02-08 06:44:28,055 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 53 more)] === [2025-02-08 06:44:28,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:44:28,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1149716191, now seen corresponding path program 1 times [2025-02-08 06:44:28,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:44:28,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395427445] [2025-02-08 06:44:28,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:44:28,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:44:28,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-08 06:44:28,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-08 06:44:28,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:44:28,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:44:29,884 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 13 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:44:29,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:44:29,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395427445] [2025-02-08 06:44:29,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395427445] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:44:29,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947793254] [2025-02-08 06:44:29,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:44:29,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:44:29,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:44:29,886 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:44:29,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-02-08 06:44:30,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-08 06:44:30,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-08 06:44:30,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:44:30,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:44:30,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 170 conjuncts are in the unsatisfiable core [2025-02-08 06:44:30,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:44:30,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 06:44:30,432 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-08 06:44:30,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-08 06:44:30,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:44:30,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 06:44:30,688 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 06:44:30,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-02-08 06:44:30,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-02-08 06:44:30,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-02-08 06:44:30,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-08 06:44:30,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-02-08 06:44:31,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:44:31,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 32 [2025-02-08 06:44:31,345 INFO L349 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2025-02-08 06:44:31,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 52 [2025-02-08 06:44:31,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-02-08 06:44:33,509 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:44:33,509 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:44:33,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 44 [2025-02-08 06:44:33,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:44:33,517 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:44:33,518 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:44:33,530 INFO L349 Elim1Store]: treesize reduction 36, result has 25.0 percent of original size [2025-02-08 06:44:33,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 78 treesize of output 64 [2025-02-08 06:44:33,751 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:44:33,755 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:44:33,781 INFO L349 Elim1Store]: treesize reduction 20, result has 58.3 percent of original size [2025-02-08 06:44:33,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 105 treesize of output 85 [2025-02-08 06:44:33,790 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:44:33,801 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2025-02-08 06:44:33,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 62 [2025-02-08 06:44:34,792 INFO L349 Elim1Store]: treesize reduction 464, result has 28.5 percent of original size [2025-02-08 06:44:34,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 13 new quantified variables, introduced 44 case distinctions, treesize of input 547 treesize of output 569 [2025-02-08 06:44:35,172 INFO L349 Elim1Store]: treesize reduction 200, result has 69.6 percent of original size [2025-02-08 06:44:35,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 36 case distinctions, treesize of input 373 treesize of output 781