./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2c_append_equal.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_append_equal.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 b335af75f55d322161e6a270bf4669ab290ae0e9da4bc480724c7d5e3b79fdab --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 06:42:15,306 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 06:42:15,362 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:42:15,366 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 06:42:15,366 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 06:42:15,388 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 06:42:15,390 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 06:42:15,390 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 06:42:15,390 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 06:42:15,390 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 06:42:15,391 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 06:42:15,391 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 06:42:15,391 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 06:42:15,391 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 06:42:15,392 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 06:42:15,392 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 06:42:15,392 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 06:42:15,392 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 06:42:15,392 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 06:42:15,392 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 06:42:15,393 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 06:42:15,393 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 06:42:15,393 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 06:42:15,393 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 06:42:15,393 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 06:42:15,393 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 06:42:15,393 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 06:42:15,393 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 06:42:15,393 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 06:42:15,393 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 06:42:15,393 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 06:42:15,393 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 06:42:15,394 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 06:42:15,394 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:42:15,394 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 06:42:15,394 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 06:42:15,394 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 06:42:15,394 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 06:42:15,394 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 06:42:15,394 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 06:42:15,395 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 06:42:15,395 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 06:42:15,395 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 -> b335af75f55d322161e6a270bf4669ab290ae0e9da4bc480724c7d5e3b79fdab [2025-02-08 06:42:15,601 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 06:42:15,609 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 06:42:15,610 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 06:42:15,611 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 06:42:15,611 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 06:42:15,612 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_append_equal.i [2025-02-08 06:42:16,799 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5d4f7cbb0/0db7d1cf0c3e4b3ab0870375e5743c25/FLAG4cbfc2d14 [2025-02-08 06:42:17,080 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 06:42:17,081 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_equal.i [2025-02-08 06:42:17,089 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5d4f7cbb0/0db7d1cf0c3e4b3ab0870375e5743c25/FLAG4cbfc2d14 [2025-02-08 06:42:17,373 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5d4f7cbb0/0db7d1cf0c3e4b3ab0870375e5743c25 [2025-02-08 06:42:17,375 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 06:42:17,376 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 06:42:17,377 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 06:42:17,377 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 06:42:17,380 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 06:42:17,381 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:42:17" (1/1) ... [2025-02-08 06:42:17,381 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b32d127 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:42:17, skipping insertion in model container [2025-02-08 06:42:17,381 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:42:17" (1/1) ... [2025-02-08 06:42:17,400 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 06:42:17,555 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:42:17,562 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 06:42:17,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:42:17,605 INFO L204 MainTranslator]: Completed translation [2025-02-08 06:42:17,605 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:42:17 WrapperNode [2025-02-08 06:42:17,606 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 06:42:17,606 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 06:42:17,606 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 06:42:17,606 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 06:42:17,610 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:42:17" (1/1) ... [2025-02-08 06:42:17,618 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:42:17" (1/1) ... [2025-02-08 06:42:17,631 INFO L138 Inliner]: procedures = 127, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 139 [2025-02-08 06:42:17,631 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 06:42:17,631 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 06:42:17,632 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 06:42:17,632 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 06:42:17,636 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:42:17" (1/1) ... [2025-02-08 06:42:17,636 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:42:17" (1/1) ... [2025-02-08 06:42:17,639 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:42:17" (1/1) ... [2025-02-08 06:42:17,651 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [2, 9, 13]. 54 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 8 writes are split as follows [0, 1, 7]. [2025-02-08 06:42:17,651 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:42:17" (1/1) ... [2025-02-08 06:42:17,651 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:42:17" (1/1) ... [2025-02-08 06:42:17,657 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:42:17" (1/1) ... [2025-02-08 06:42:17,657 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:42:17" (1/1) ... [2025-02-08 06:42:17,658 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:42:17" (1/1) ... [2025-02-08 06:42:17,659 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:42:17" (1/1) ... [2025-02-08 06:42:17,661 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 06:42:17,661 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 06:42:17,661 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 06:42:17,662 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 06:42:17,662 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:42:17" (1/1) ... [2025-02-08 06:42:17,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:42:17,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:42:17,684 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:42:17,686 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:42:17,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 06:42:17,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 06:42:17,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 06:42:17,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 06:42:17,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 06:42:17,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 06:42:17,702 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-02-08 06:42:17,702 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-02-08 06:42:17,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 06:42:17,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 06:42:17,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 06:42:17,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 06:42:17,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 06:42:17,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 06:42:17,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 06:42:17,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 06:42:17,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 06:42:17,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 06:42:17,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-08 06:42:17,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-08 06:42:17,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-08 06:42:17,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 06:42:17,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 06:42:17,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 06:42:17,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 06:42:17,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 06:42:17,801 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 06:42:17,803 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 06:42:18,045 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L639: 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:42:18,045 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L639-1: assume { :begin_inline_reach_error } true;havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 06:42:18,046 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L623: 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:42:18,046 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12: assume false; [2025-02-08 06:42:18,046 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12: assume !false; [2025-02-08 06:42:18,046 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-1: assume false; [2025-02-08 06:42:18,046 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-1: assume !false; [2025-02-08 06:42:18,060 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:42:18,073 INFO L? ?]: Removed 127 outVars from TransFormulas that were not future-live. [2025-02-08 06:42:18,073 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 06:42:18,080 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 06:42:18,081 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 06:42:18,081 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:42:18 BoogieIcfgContainer [2025-02-08 06:42:18,081 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 06:42:18,083 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 06:42:18,083 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 06:42:18,086 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 06:42:18,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 06:42:17" (1/3) ... [2025-02-08 06:42:18,086 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37fa7a0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:42:18, skipping insertion in model container [2025-02-08 06:42:18,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:42:17" (2/3) ... [2025-02-08 06:42:18,087 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37fa7a0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:42:18, skipping insertion in model container [2025-02-08 06:42:18,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:42:18" (3/3) ... [2025-02-08 06:42:18,088 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2c_append_equal.i [2025-02-08 06:42:18,098 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 06:42:18,099 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2c_append_equal.i that has 2 procedures, 115 locations, 1 initial locations, 4 loop locations, and 50 error locations. [2025-02-08 06:42:18,124 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 06:42:18,131 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;@68cd8918, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 06:42:18,132 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2025-02-08 06:42:18,134 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 59 states have (on average 2.016949152542373) internal successors, (119), 110 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:42:18,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 06:42:18,138 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:18,138 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 06:42:18,138 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-02-08 06:42:18,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:18,142 INFO L85 PathProgramCache]: Analyzing trace with hash 143724653, now seen corresponding path program 1 times [2025-02-08 06:42:18,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:18,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563971182] [2025-02-08 06:42:18,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:18,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:18,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 06:42:18,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 06:42:18,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:18,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:18,315 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:42:18,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:18,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563971182] [2025-02-08 06:42:18,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563971182] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:42:18,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:42:18,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:42:18,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077759168] [2025-02-08 06:42:18,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:42:18,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:42:18,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:18,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:42:18,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:42:18,339 INFO L87 Difference]: Start difference. First operand has 115 states, 59 states have (on average 2.016949152542373) internal successors, (119), 110 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) 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:42:18,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:18,448 INFO L93 Difference]: Finished difference Result 113 states and 121 transitions. [2025-02-08 06:42:18,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:42:18,450 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:42:18,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:18,454 INFO L225 Difference]: With dead ends: 113 [2025-02-08 06:42:18,454 INFO L226 Difference]: Without dead ends: 109 [2025-02-08 06:42:18,455 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:42:18,457 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 2 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 188 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:42:18,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 188 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:42:18,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-02-08 06:42:18,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-02-08 06:42:18,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 58 states have (on average 1.896551724137931) internal successors, (110), 104 states have internal predecessors, (110), 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:42:18,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2025-02-08 06:42:18,481 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 116 transitions. Word has length 5 [2025-02-08 06:42:18,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:18,481 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 116 transitions. [2025-02-08 06:42:18,481 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:42:18,481 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2025-02-08 06:42:18,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 06:42:18,482 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:18,482 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 06:42:18,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 06:42:18,482 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-02-08 06:42:18,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:18,483 INFO L85 PathProgramCache]: Analyzing trace with hash 143724652, now seen corresponding path program 1 times [2025-02-08 06:42:18,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:18,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313846329] [2025-02-08 06:42:18,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:18,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:18,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 06:42:18,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 06:42:18,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:18,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:18,527 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:42:18,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:18,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313846329] [2025-02-08 06:42:18,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313846329] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:42:18,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:42:18,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:42:18,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677339549] [2025-02-08 06:42:18,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:42:18,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:42:18,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:18,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:42:18,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:42:18,529 INFO L87 Difference]: Start difference. First operand 109 states and 116 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:42:18,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:18,586 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2025-02-08 06:42:18,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:42:18,586 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:42:18,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:18,587 INFO L225 Difference]: With dead ends: 107 [2025-02-08 06:42:18,587 INFO L226 Difference]: Without dead ends: 107 [2025-02-08 06:42:18,587 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:42:18,588 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 2 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 174 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.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:18,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 174 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:42:18,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-02-08 06:42:18,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-02-08 06:42:18,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 58 states have (on average 1.8620689655172413) 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:42:18,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 114 transitions. [2025-02-08 06:42:18,593 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 114 transitions. Word has length 5 [2025-02-08 06:42:18,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:18,593 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 114 transitions. [2025-02-08 06:42:18,593 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:42:18,594 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2025-02-08 06:42:18,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 06:42:18,594 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:18,594 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:42:18,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 06:42:18,594 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-02-08 06:42:18,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:18,595 INFO L85 PathProgramCache]: Analyzing trace with hash 581574717, now seen corresponding path program 1 times [2025-02-08 06:42:18,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:18,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457713842] [2025-02-08 06:42:18,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:18,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:18,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 06:42:18,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 06:42:18,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:18,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:18,660 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:42:18,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:18,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457713842] [2025-02-08 06:42:18,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457713842] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:42:18,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:42:18,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:42:18,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504123533] [2025-02-08 06:42:18,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:42:18,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:42:18,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:18,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:42:18,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:42:18,662 INFO L87 Difference]: Start difference. First operand 107 states and 114 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:42:18,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:18,671 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2025-02-08 06:42:18,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:42:18,671 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:42:18,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:18,672 INFO L225 Difference]: With dead ends: 108 [2025-02-08 06:42:18,672 INFO L226 Difference]: Without dead ends: 108 [2025-02-08 06:42:18,672 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:42:18,673 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 5 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:18,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 214 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:42:18,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-02-08 06:42:18,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-02-08 06:42:18,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 59 states have (on average 1.847457627118644) internal successors, (109), 103 states have internal predecessors, (109), 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:42:18,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 115 transitions. [2025-02-08 06:42:18,677 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 115 transitions. Word has length 12 [2025-02-08 06:42:18,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:18,678 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 115 transitions. [2025-02-08 06:42:18,678 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:42:18,678 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 115 transitions. [2025-02-08 06:42:18,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-08 06:42:18,679 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:18,679 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:42:18,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 06:42:18,679 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-02-08 06:42:18,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:18,679 INFO L85 PathProgramCache]: Analyzing trace with hash 830156933, now seen corresponding path program 1 times [2025-02-08 06:42:18,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:18,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998846546] [2025-02-08 06:42:18,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:18,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:18,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 06:42:18,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 06:42:18,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:18,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:18,782 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:42:18,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:18,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998846546] [2025-02-08 06:42:18,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998846546] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:42:18,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:42:18,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:42:18,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136829238] [2025-02-08 06:42:18,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:42:18,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:42:18,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:18,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:42:18,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:42:18,784 INFO L87 Difference]: Start difference. First operand 108 states and 115 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:42:18,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:18,962 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2025-02-08 06:42:18,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:42:18,962 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:42:18,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:18,963 INFO L225 Difference]: With dead ends: 107 [2025-02-08 06:42:18,963 INFO L226 Difference]: Without dead ends: 107 [2025-02-08 06:42:18,963 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:42:18,964 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 2 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:18,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 334 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:42:18,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-02-08 06:42:18,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-02-08 06:42:18,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 59 states have (on average 1.8305084745762712) 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:42:18,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 114 transitions. [2025-02-08 06:42:18,974 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 114 transitions. Word has length 21 [2025-02-08 06:42:18,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:18,974 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 114 transitions. [2025-02-08 06:42:18,974 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:42:18,974 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2025-02-08 06:42:18,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-08 06:42:18,975 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:18,975 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:42:18,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 06:42:18,979 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-02-08 06:42:18,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:18,979 INFO L85 PathProgramCache]: Analyzing trace with hash 830156934, now seen corresponding path program 1 times [2025-02-08 06:42:18,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:18,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192823527] [2025-02-08 06:42:18,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:18,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:18,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 06:42:19,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 06:42:19,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:19,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:19,249 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:42:19,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:19,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192823527] [2025-02-08 06:42:19,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192823527] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:42:19,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:42:19,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:42:19,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857234626] [2025-02-08 06:42:19,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:42:19,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:42:19,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:19,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:42:19,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:42:19,251 INFO L87 Difference]: Start difference. First operand 107 states and 114 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:42:19,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:19,380 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2025-02-08 06:42:19,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:42:19,380 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:42:19,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:19,381 INFO L225 Difference]: With dead ends: 106 [2025-02-08 06:42:19,382 INFO L226 Difference]: Without dead ends: 106 [2025-02-08 06:42:19,382 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:42:19,383 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 1 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:19,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 358 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:42:19,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-02-08 06:42:19,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-02-08 06:42:19,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 59 states have (on average 1.8135593220338984) internal successors, (107), 101 states have internal predecessors, (107), 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:42:19,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 113 transitions. [2025-02-08 06:42:19,392 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 113 transitions. Word has length 21 [2025-02-08 06:42:19,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:19,392 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 113 transitions. [2025-02-08 06:42:19,393 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:42:19,393 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2025-02-08 06:42:19,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-08 06:42:19,393 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:19,393 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:42:19,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 06:42:19,393 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-02-08 06:42:19,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:19,396 INFO L85 PathProgramCache]: Analyzing trace with hash 783580289, now seen corresponding path program 1 times [2025-02-08 06:42:19,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:19,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584762420] [2025-02-08 06:42:19,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:19,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:19,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 06:42:19,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 06:42:19,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:19,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:19,646 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:42:19,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:19,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584762420] [2025-02-08 06:42:19,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584762420] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:42:19,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174731484] [2025-02-08 06:42:19,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:19,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:42:19,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:42:19,649 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:42:19,651 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:42:19,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 06:42:19,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 06:42:19,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:19,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:19,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-08 06:42:19,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:42:19,756 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:42:19,801 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:42:19,899 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-08 06:42:19,899 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:42:19,908 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:42:19,908 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:42:19,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174731484] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:42:19,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:42:19,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 10 [2025-02-08 06:42:19,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41814057] [2025-02-08 06:42:19,956 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:42:19,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 06:42:19,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:19,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 06:42:19,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=86, Unknown=1, NotChecked=18, Total=132 [2025-02-08 06:42:19,957 INFO L87 Difference]: Start difference. First operand 106 states and 113 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:42:20,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:20,199 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2025-02-08 06:42:20,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:42:20,199 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:42:20,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:20,200 INFO L225 Difference]: With dead ends: 105 [2025-02-08 06:42:20,200 INFO L226 Difference]: Without dead ends: 105 [2025-02-08 06:42:20,200 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:42:20,201 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 1 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:20,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 486 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 372 Invalid, 0 Unknown, 105 Unchecked, 0.2s Time] [2025-02-08 06:42:20,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-02-08 06:42:20,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2025-02-08 06:42:20,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 59 states have (on average 1.7966101694915255) internal successors, (106), 100 states have internal predecessors, (106), 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:42:20,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 112 transitions. [2025-02-08 06:42:20,209 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 112 transitions. Word has length 24 [2025-02-08 06:42:20,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:20,209 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 112 transitions. [2025-02-08 06:42:20,209 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:42:20,209 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 112 transitions. [2025-02-08 06:42:20,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-08 06:42:20,209 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:20,209 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:42:20,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 06:42:20,410 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:42:20,410 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-02-08 06:42:20,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:20,410 INFO L85 PathProgramCache]: Analyzing trace with hash 783580290, now seen corresponding path program 1 times [2025-02-08 06:42:20,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:20,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655534531] [2025-02-08 06:42:20,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:20,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:20,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 06:42:20,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 06:42:20,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:20,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:20,804 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:42:20,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:20,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655534531] [2025-02-08 06:42:20,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655534531] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:42:20,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527447695] [2025-02-08 06:42:20,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:20,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:42:20,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:42:20,811 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:42:20,813 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:42:20,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 06:42:20,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 06:42:20,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:20,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:20,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-08 06:42:20,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:42:20,904 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:42:21,047 WARN L873 $PredicateComparison]: unable to prove that (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:42:21,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:42:21,087 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 16 treesize of output 11 [2025-02-08 06:42:21,092 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:42:21,092 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:42:21,125 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2025-02-08 06:42:21,125 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:42:21,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527447695] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:42:21,226 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:42:21,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2025-02-08 06:42:21,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496843350] [2025-02-08 06:42:21,226 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:42:21,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-08 06:42:21,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:21,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 06:42:21,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=289, Unknown=1, NotChecked=34, Total=380 [2025-02-08 06:42:21,227 INFO L87 Difference]: Start difference. First operand 105 states and 112 transitions. Second operand has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 15 states have internal predecessors, (39), 3 states have call successors, (3), 2 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:42:21,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:21,585 INFO L93 Difference]: Finished difference Result 112 states and 122 transitions. [2025-02-08 06:42:21,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:42:21,585 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 15 states have internal predecessors, (39), 3 states have call successors, (3), 2 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:42:21,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:21,587 INFO L225 Difference]: With dead ends: 112 [2025-02-08 06:42:21,587 INFO L226 Difference]: Without dead ends: 112 [2025-02-08 06:42:21,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=354, Unknown=1, NotChecked=38, Total=462 [2025-02-08 06:42:21,588 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 4 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 116 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:21,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 547 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 552 Invalid, 0 Unknown, 116 Unchecked, 0.3s Time] [2025-02-08 06:42:21,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-02-08 06:42:21,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2025-02-08 06:42:21,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 64 states have (on average 1.75) internal successors, (112), 105 states have internal predecessors, (112), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 06:42:21,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 120 transitions. [2025-02-08 06:42:21,592 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 120 transitions. Word has length 24 [2025-02-08 06:42:21,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:21,592 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 120 transitions. [2025-02-08 06:42:21,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 15 states have internal predecessors, (39), 3 states have call successors, (3), 2 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:42:21,593 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 120 transitions. [2025-02-08 06:42:21,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-08 06:42:21,593 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:21,593 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:42:21,600 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:42:21,798 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:42:21,798 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-02-08 06:42:21,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:21,799 INFO L85 PathProgramCache]: Analyzing trace with hash 821662817, now seen corresponding path program 1 times [2025-02-08 06:42:21,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:21,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643696735] [2025-02-08 06:42:21,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:21,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:21,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 06:42:21,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 06:42:21,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:21,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:22,342 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:42:22,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:22,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643696735] [2025-02-08 06:42:22,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643696735] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:42:22,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119539104] [2025-02-08 06:42:22,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:22,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:42:22,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:42:22,346 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:42:22,347 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:42:22,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 06:42:22,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 06:42:22,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:22,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:22,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-08 06:42:22,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:42:22,466 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:42:22,476 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:42:22,522 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 06:42:22,522 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:42:22,626 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 7 [2025-02-08 06:42:22,656 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:42:22,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:42:22,738 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:42:22,848 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2025-02-08 06:42:22,880 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-08 06:42:22,881 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 12 treesize of output 14 [2025-02-08 06:42:22,892 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 18 not checked. [2025-02-08 06:42:22,892 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:42:23,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119539104] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:42:23,100 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:42:23,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2025-02-08 06:42:23,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596183739] [2025-02-08 06:42:23,100 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:42:23,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-08 06:42:23,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:23,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-08 06:42:23,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=316, Unknown=2, NotChecked=74, Total=462 [2025-02-08 06:42:23,102 INFO L87 Difference]: Start difference. First operand 111 states and 120 transitions. Second operand has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 16 states have internal predecessors, (52), 3 states have call successors, (4), 1 states have call predecessors, (4), 6 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 06:42:23,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:23,461 INFO L93 Difference]: Finished difference Result 121 states and 131 transitions. [2025-02-08 06:42:23,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:42:23,462 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 16 states have internal predecessors, (52), 3 states have call successors, (4), 1 states have call predecessors, (4), 6 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 35 [2025-02-08 06:42:23,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:23,464 INFO L225 Difference]: With dead ends: 121 [2025-02-08 06:42:23,464 INFO L226 Difference]: Without dead ends: 121 [2025-02-08 06:42:23,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=415, Unknown=2, NotChecked=86, Total=600 [2025-02-08 06:42:23,464 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 337 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 232 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:23,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 407 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 517 Invalid, 0 Unknown, 232 Unchecked, 0.3s Time] [2025-02-08 06:42:23,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-02-08 06:42:23,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 103. [2025-02-08 06:42:23,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 64 states have (on average 1.625) internal successors, (104), 97 states have internal predecessors, (104), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 06:42:23,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 112 transitions. [2025-02-08 06:42:23,472 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 112 transitions. Word has length 35 [2025-02-08 06:42:23,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:23,472 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 112 transitions. [2025-02-08 06:42:23,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 16 states have internal predecessors, (52), 3 states have call successors, (4), 1 states have call predecessors, (4), 6 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 06:42:23,472 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 112 transitions. [2025-02-08 06:42:23,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-08 06:42:23,473 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:23,473 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:42:23,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 06:42:23,673 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:42:23,674 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-02-08 06:42:23,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:23,674 INFO L85 PathProgramCache]: Analyzing trace with hash 821662818, now seen corresponding path program 1 times [2025-02-08 06:42:23,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:23,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315604810] [2025-02-08 06:42:23,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:23,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:23,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 06:42:23,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 06:42:23,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:23,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:24,235 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:42:24,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:24,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315604810] [2025-02-08 06:42:24,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315604810] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:42:24,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055423426] [2025-02-08 06:42:24,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:24,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:42:24,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:42:24,240 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:42:24,245 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:42:24,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 06:42:24,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 06:42:24,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:24,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:24,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-08 06:42:24,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:42:24,351 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:42:24,371 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:42:24,383 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:42:24,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:42:24,419 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:42:24,437 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:42:24,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:42:24,479 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:42:24,531 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:42:24,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:42:24,585 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:42:24,605 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:42:24,605 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 06:42:24,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055423426] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:42:24,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 06:42:24,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 16 [2025-02-08 06:42:24,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213097162] [2025-02-08 06:42:24,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:42:24,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:42:24,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:24,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:42:24,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=223, Unknown=1, NotChecked=30, Total=306 [2025-02-08 06:42:24,606 INFO L87 Difference]: Start difference. First operand 103 states and 112 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:42:24,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:24,720 INFO L93 Difference]: Finished difference Result 98 states and 107 transitions. [2025-02-08 06:42:24,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:42:24,721 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:42:24,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:24,721 INFO L225 Difference]: With dead ends: 98 [2025-02-08 06:42:24,721 INFO L226 Difference]: Without dead ends: 98 [2025-02-08 06:42:24,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=249, Unknown=1, NotChecked=32, Total=342 [2025-02-08 06:42:24,722 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 24 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 126 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:24,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 255 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 160 Invalid, 0 Unknown, 126 Unchecked, 0.1s Time] [2025-02-08 06:42:24,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-02-08 06:42:24,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-02-08 06:42:24,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 64 states have (on average 1.546875) internal successors, (99), 92 states have internal predecessors, (99), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 06:42:24,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2025-02-08 06:42:24,725 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 35 [2025-02-08 06:42:24,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:24,725 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2025-02-08 06:42:24,725 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:42:24,726 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2025-02-08 06:42:24,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-08 06:42:24,726 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:24,726 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 06:42:24,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 06:42:24,926 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:42:24,927 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-02-08 06:42:24,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:24,928 INFO L85 PathProgramCache]: Analyzing trace with hash -320695610, now seen corresponding path program 2 times [2025-02-08 06:42:24,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:24,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384619319] [2025-02-08 06:42:24,928 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:42:24,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:24,940 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-02-08 06:42:24,950 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 06:42:24,950 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:42:24,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:24,990 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-08 06:42:24,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:24,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384619319] [2025-02-08 06:42:24,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384619319] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:42:24,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450952893] [2025-02-08 06:42:24,990 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:42:24,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:42:24,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:42:24,995 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:42:24,995 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:42:25,083 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-02-08 06:42:25,112 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 06:42:25,112 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:42:25,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:25,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 06:42:25,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:42:25,135 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 06:42:25,135 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 06:42:25,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450952893] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:42:25,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 06:42:25,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-02-08 06:42:25,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872074186] [2025-02-08 06:42:25,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:42:25,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:42:25,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:25,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:42:25,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:42:25,137 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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:42:25,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:25,154 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2025-02-08 06:42:25,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:42:25,154 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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 36 [2025-02-08 06:42:25,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:25,155 INFO L225 Difference]: With dead ends: 91 [2025-02-08 06:42:25,155 INFO L226 Difference]: Without dead ends: 91 [2025-02-08 06:42:25,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:42:25,156 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 184 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:42:25,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 184 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:42:25,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-02-08 06:42:25,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-02-08 06:42:25,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 59 states have (on average 1.5423728813559323) internal successors, (91), 86 states have internal predecessors, (91), 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:42:25,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2025-02-08 06:42:25,160 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 36 [2025-02-08 06:42:25,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:25,160 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2025-02-08 06:42:25,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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:42:25,160 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2025-02-08 06:42:25,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-08 06:42:25,161 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:25,161 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] [2025-02-08 06:42:25,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 06:42:25,361 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,SelfDestructingSolverStorable9 [2025-02-08 06:42:25,362 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-02-08 06:42:25,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:25,363 INFO L85 PathProgramCache]: Analyzing trace with hash -656014018, now seen corresponding path program 1 times [2025-02-08 06:42:25,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:25,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365360134] [2025-02-08 06:42:25,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:25,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:25,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-08 06:42:25,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 06:42:25,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:25,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:25,447 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:42:25,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:25,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365360134] [2025-02-08 06:42:25,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365360134] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:42:25,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:42:25,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:42:25,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634413009] [2025-02-08 06:42:25,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:42:25,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:42:25,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:25,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:42:25,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:42:25,449 INFO L87 Difference]: Start difference. First operand 91 states and 97 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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:42:25,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:25,614 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2025-02-08 06:42:25,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:42:25,615 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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 37 [2025-02-08 06:42:25,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:25,615 INFO L225 Difference]: With dead ends: 89 [2025-02-08 06:42:25,615 INFO L226 Difference]: Without dead ends: 89 [2025-02-08 06:42:25,616 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:42:25,616 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 20 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:25,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 264 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:42:25,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-02-08 06:42:25,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-02-08 06:42:25,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 59 states have (on average 1.5084745762711864) internal successors, (89), 84 states have internal predecessors, (89), 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:42:25,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2025-02-08 06:42:25,618 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 37 [2025-02-08 06:42:25,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:25,619 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2025-02-08 06:42:25,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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:42:25,619 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2025-02-08 06:42:25,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-08 06:42:25,619 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:25,620 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] [2025-02-08 06:42:25,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 06:42:25,620 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-02-08 06:42:25,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:25,620 INFO L85 PathProgramCache]: Analyzing trace with hash -656014017, now seen corresponding path program 1 times [2025-02-08 06:42:25,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:25,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549708000] [2025-02-08 06:42:25,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:25,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:25,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-08 06:42:25,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 06:42:25,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:25,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:25,762 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:42:25,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:25,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549708000] [2025-02-08 06:42:25,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549708000] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:42:25,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778512498] [2025-02-08 06:42:25,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:25,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:42:25,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:42:25,765 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:42:25,766 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:42:25,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-08 06:42:25,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 06:42:25,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:25,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:25,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-08 06:42:25,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:42:25,886 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:42:25,944 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:42:25,944 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 06:42:25,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778512498] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:42:25,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 06:42:25,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2025-02-08 06:42:25,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644164727] [2025-02-08 06:42:25,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:42:25,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:42:25,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:25,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:42:25,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-02-08 06:42:25,945 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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:42:26,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:26,034 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2025-02-08 06:42:26,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:42:26,034 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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 37 [2025-02-08 06:42:26,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:26,035 INFO L225 Difference]: With dead ends: 87 [2025-02-08 06:42:26,035 INFO L226 Difference]: Without dead ends: 87 [2025-02-08 06:42:26,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-02-08 06:42:26,035 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 19 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:26,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 276 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:42:26,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-02-08 06:42:26,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-02-08 06:42:26,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 59 states have (on average 1.4745762711864407) internal successors, (87), 82 states have internal predecessors, (87), 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:42:26,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2025-02-08 06:42:26,037 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 37 [2025-02-08 06:42:26,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:26,037 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2025-02-08 06:42:26,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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:42:26,038 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2025-02-08 06:42:26,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-08 06:42:26,038 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:26,038 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:42:26,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-08 06:42:26,239 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,SelfDestructingSolverStorable11 [2025-02-08 06:42:26,239 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-02-08 06:42:26,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:26,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1184701919, now seen corresponding path program 1 times [2025-02-08 06:42:26,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:26,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307742573] [2025-02-08 06:42:26,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:26,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:26,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 06:42:26,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 06:42:26,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:26,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:26,485 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:42:26,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:26,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307742573] [2025-02-08 06:42:26,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307742573] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:42:26,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234772805] [2025-02-08 06:42:26,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:26,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:42:26,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:42:26,488 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:42:26,497 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:42:26,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 06:42:26,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 06:42:26,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:26,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:26,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-02-08 06:42:26,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:42:26,708 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:42:26,712 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2025-02-08 06:42:26,732 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-02-08 06:42:26,733 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 16 treesize of output 18 [2025-02-08 06:42:26,761 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:42:26,765 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:42:26,765 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 06:42:26,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234772805] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:42:26,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 06:42:26,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 18 [2025-02-08 06:42:26,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489489329] [2025-02-08 06:42:26,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:42:26,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 06:42:26,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:26,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 06:42:26,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=264, Unknown=1, NotChecked=32, Total=342 [2025-02-08 06:42:26,766 INFO L87 Difference]: Start difference. First operand 87 states and 93 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:42:26,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:26,919 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2025-02-08 06:42:26,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 06:42:26,920 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:42:26,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:26,921 INFO L225 Difference]: With dead ends: 87 [2025-02-08 06:42:26,921 INFO L226 Difference]: Without dead ends: 87 [2025-02-08 06:42:26,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=363, Unknown=1, NotChecked=38, Total=462 [2025-02-08 06:42:26,921 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 24 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 144 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:26,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 361 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 266 Invalid, 0 Unknown, 144 Unchecked, 0.1s Time] [2025-02-08 06:42:26,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-02-08 06:42:26,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-02-08 06:42:26,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 61 states have (on average 1.4426229508196722) internal successors, (88), 82 states have internal predecessors, (88), 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:42:26,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2025-02-08 06:42:26,924 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 40 [2025-02-08 06:42:26,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:26,925 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2025-02-08 06:42:26,925 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:42:26,925 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2025-02-08 06:42:26,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-08 06:42:26,926 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:26,926 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:42:26,934 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:42:27,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:42:27,128 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-02-08 06:42:27,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:27,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1184701918, now seen corresponding path program 1 times [2025-02-08 06:42:27,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:27,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652376300] [2025-02-08 06:42:27,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:27,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:27,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 06:42:27,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 06:42:27,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:27,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:27,458 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:42:27,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:27,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652376300] [2025-02-08 06:42:27,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652376300] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:42:27,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127525936] [2025-02-08 06:42:27,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:27,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:42:27,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:42:27,461 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:42:27,465 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:42:27,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 06:42:27,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 06:42:27,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:27,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:27,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 70 conjuncts are in the unsatisfiable core [2025-02-08 06:42:27,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:42:27,618 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:42:27,648 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:42:27,654 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:42:27,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:42:27,687 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:42:27,707 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:42:27,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:42:27,813 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:42:28,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:42:28,036 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:42:28,039 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:42:28,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:42:28,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:42:28,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:42:28,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 23 treesize of output 21 [2025-02-08 06:42:28,213 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-02-08 06:42:28,213 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:42:28,395 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:42:28,395 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 53 treesize of output 37 [2025-02-08 06:42:28,402 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-08 06:42:28,402 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:42:28,482 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 12 not checked. [2025-02-08 06:42:28,483 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:42:28,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127525936] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:42:28,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:42:28,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 28 [2025-02-08 06:42:28,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578667623] [2025-02-08 06:42:28,739 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:42:28,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-08 06:42:28,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:28,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-08 06:42:28,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=956, Unknown=1, NotChecked=62, Total=1122 [2025-02-08 06:42:28,740 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand has 29 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 25 states have internal predecessors, (68), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-08 06:42:29,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:29,826 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2025-02-08 06:42:29,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-08 06:42:29,827 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 25 states have internal predecessors, (68), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2025-02-08 06:42:29,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:29,827 INFO L225 Difference]: With dead ends: 98 [2025-02-08 06:42:29,827 INFO L226 Difference]: Without dead ends: 98 [2025-02-08 06:42:29,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=183, Invalid=1542, Unknown=1, NotChecked=80, Total=1806 [2025-02-08 06:42:29,828 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 97 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:29,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 811 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 917 Invalid, 0 Unknown, 92 Unchecked, 0.6s Time] [2025-02-08 06:42:29,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-02-08 06:42:29,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-02-08 06:42:29,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 71 states have (on average 1.380281690140845) internal successors, (98), 92 states have internal predecessors, (98), 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:42:29,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2025-02-08 06:42:29,832 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 40 [2025-02-08 06:42:29,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:29,833 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2025-02-08 06:42:29,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 25 states have internal predecessors, (68), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-08 06:42:29,833 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2025-02-08 06:42:29,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-08 06:42:29,834 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:29,834 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:42:29,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-08 06:42:30,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:42:30,034 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-02-08 06:42:30,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:30,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1212378717, now seen corresponding path program 1 times [2025-02-08 06:42:30,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:30,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580974935] [2025-02-08 06:42:30,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:30,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:30,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 06:42:30,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 06:42:30,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:30,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:30,209 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:42:30,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:30,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580974935] [2025-02-08 06:42:30,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580974935] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:42:30,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080690565] [2025-02-08 06:42:30,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:30,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:42:30,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:42:30,215 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:42:30,216 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:42:30,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 06:42:30,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 06:42:30,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:30,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:30,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-08 06:42:30,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:42:30,355 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:42:30,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:42:30,391 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:42:30,393 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:42:30,443 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:42:30,444 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:42:30,450 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:42:30,499 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:42:30,513 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:42:30,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:42:30,535 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:42:30,564 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:42:30,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:42:30,589 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:42:30,617 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 12 not checked. [2025-02-08 06:42:30,618 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:42:30,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080690565] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:42:30,704 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:42:30,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2025-02-08 06:42:30,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442229104] [2025-02-08 06:42:30,704 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:42:30,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-08 06:42:30,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:30,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 06:42:30,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=294, Unknown=1, NotChecked=34, Total=380 [2025-02-08 06:42:30,705 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand has 18 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 14 states have internal predecessors, (56), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-08 06:42:31,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:31,042 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2025-02-08 06:42:31,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 06:42:31,042 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 14 states have internal predecessors, (56), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2025-02-08 06:42:31,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:31,043 INFO L225 Difference]: With dead ends: 93 [2025-02-08 06:42:31,043 INFO L226 Difference]: Without dead ends: 93 [2025-02-08 06:42:31,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=598, Unknown=1, NotChecked=50, Total=756 [2025-02-08 06:42:31,044 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 51 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 79 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:31,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 570 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 494 Invalid, 0 Unknown, 79 Unchecked, 0.2s Time] [2025-02-08 06:42:31,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-02-08 06:42:31,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-02-08 06:42:31,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 69 states have (on average 1.3333333333333333) internal successors, (92), 87 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:42:31,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 98 transitions. [2025-02-08 06:42:31,048 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 98 transitions. Word has length 40 [2025-02-08 06:42:31,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:31,049 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 98 transitions. [2025-02-08 06:42:31,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 14 states have internal predecessors, (56), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-08 06:42:31,049 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2025-02-08 06:42:31,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-08 06:42:31,050 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:31,051 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:42:31,057 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:42:31,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:42:31,255 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-02-08 06:42:31,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:31,256 INFO L85 PathProgramCache]: Analyzing trace with hash 537272443, now seen corresponding path program 1 times [2025-02-08 06:42:31,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:31,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092311388] [2025-02-08 06:42:31,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:31,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:31,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 06:42:31,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 06:42:31,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:31,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:31,916 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:42:31,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:31,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092311388] [2025-02-08 06:42:31,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092311388] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:42:31,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161541655] [2025-02-08 06:42:31,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:31,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:42:31,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:42:31,924 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:42:31,928 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:42:32,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 06:42:32,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 06:42:32,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:32,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:32,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 90 conjuncts are in the unsatisfiable core [2025-02-08 06:42:32,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:42:32,095 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:42:32,216 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:42:32,216 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:42:32,273 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:42:32,376 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 06:42:32,377 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:42:32,469 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:42:32,473 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:42:32,634 WARN L873 $PredicateComparison]: unable to prove that (and (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|) (= |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|)))) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_6|) 0) 0))) is different from true [2025-02-08 06:42:32,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:42:32,666 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:42:32,688 INFO L349 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2025-02-08 06:42:32,688 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 36 treesize of output 52 [2025-02-08 06:42:32,762 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 7 treesize of output 3 [2025-02-08 06:42:32,862 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 46 treesize of output 26 [2025-02-08 06:42:32,908 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:42:32,987 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:42:32,987 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:42:33,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1161541655] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:42:33,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:42:33,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 44 [2025-02-08 06:42:33,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49882306] [2025-02-08 06:42:33,075 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:42:33,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-02-08 06:42:33,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:33,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-02-08 06:42:33,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1849, Unknown=1, NotChecked=86, Total=2070 [2025-02-08 06:42:33,076 INFO L87 Difference]: Start difference. First operand 93 states and 98 transitions. Second operand has 45 states, 42 states have (on average 1.8333333333333333) internal successors, (77), 38 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:42:34,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:34,086 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2025-02-08 06:42:34,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-08 06:42:34,087 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 42 states have (on average 1.8333333333333333) internal successors, (77), 38 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:42:34,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:34,087 INFO L225 Difference]: With dead ends: 96 [2025-02-08 06:42:34,088 INFO L226 Difference]: Without dead ends: 96 [2025-02-08 06:42:34,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 700 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=254, Invalid=3055, Unknown=1, NotChecked=112, Total=3422 [2025-02-08 06:42:34,089 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 83 mSDsluCounter, 1177 mSDsCounter, 0 mSdLazyCounter, 1483 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 1592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 99 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:34,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 1235 Invalid, 1592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1483 Invalid, 0 Unknown, 99 Unchecked, 0.6s Time] [2025-02-08 06:42:34,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-02-08 06:42:34,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-02-08 06:42:34,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 72 states have (on average 1.3333333333333333) internal successors, (96), 90 states have internal predecessors, (96), 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:42:34,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2025-02-08 06:42:34,092 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 46 [2025-02-08 06:42:34,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:34,093 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2025-02-08 06:42:34,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 42 states have (on average 1.8333333333333333) internal successors, (77), 38 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:42:34,093 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2025-02-08 06:42:34,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-08 06:42:34,093 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:34,093 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:42:34,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-08 06:42:34,294 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,SelfDestructingSolverStorable15 [2025-02-08 06:42:34,294 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-02-08 06:42:34,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:34,295 INFO L85 PathProgramCache]: Analyzing trace with hash 537272444, now seen corresponding path program 1 times [2025-02-08 06:42:34,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:34,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892791441] [2025-02-08 06:42:34,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:34,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:34,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 06:42:34,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 06:42:34,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:34,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:35,428 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:42:35,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:35,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892791441] [2025-02-08 06:42:35,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892791441] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:42:35,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880495358] [2025-02-08 06:42:35,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:35,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:42:35,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:42:35,430 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:42:35,436 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:42:35,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 06:42:35,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 06:42:35,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:35,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:35,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 104 conjuncts are in the unsatisfiable core [2025-02-08 06:42:35,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:42:35,640 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:42:35,643 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:42:35,822 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:42:35,822 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:42:35,828 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:42:35,890 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:42:35,894 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:42:35,994 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 06:42:35,994 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:42:35,997 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:42:36,127 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 55 treesize of output 19 [2025-02-08 06:42:36,131 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 15 treesize of output 3 [2025-02-08 06:42:36,135 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:42:36,137 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:42:36,246 WARN L873 $PredicateComparison]: unable to prove that (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:42:36,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:42:36,272 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 63 treesize of output 46 [2025-02-08 06:42:36,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:42:36,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 21 [2025-02-08 06:42:36,293 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2025-02-08 06:42:36,294 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:42:36,297 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 19 [2025-02-08 06:42:36,368 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 60 treesize of output 44 [2025-02-08 06:42:36,477 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:42:36,522 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:42:36,525 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:42:36,531 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:42:36,531 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:42:36,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880495358] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:42:36,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:42:36,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 44 [2025-02-08 06:42:36,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467007297] [2025-02-08 06:42:36,842 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:42:36,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-02-08 06:42:36,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:36,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-02-08 06:42:36,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=2305, Unknown=1, NotChecked=96, Total=2550 [2025-02-08 06:42:36,844 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand has 45 states, 41 states have (on average 1.829268292682927) internal successors, (75), 39 states have internal predecessors, (75), 6 states have call successors, (6), 3 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:42:38,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:38,217 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2025-02-08 06:42:38,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-08 06:42:38,218 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 41 states have (on average 1.829268292682927) internal successors, (75), 39 states have internal predecessors, (75), 6 states have call successors, (6), 3 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:42:38,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:38,219 INFO L225 Difference]: With dead ends: 100 [2025-02-08 06:42:38,219 INFO L226 Difference]: Without dead ends: 100 [2025-02-08 06:42:38,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 919 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=291, Invalid=4134, Unknown=1, NotChecked=130, Total=4556 [2025-02-08 06:42:38,220 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 135 mSDsluCounter, 1208 mSDsCounter, 0 mSdLazyCounter, 1600 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1268 SdHoareTripleChecker+Invalid, 1705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 97 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:38,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1268 Invalid, 1705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1600 Invalid, 0 Unknown, 97 Unchecked, 0.8s Time] [2025-02-08 06:42:38,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-02-08 06:42:38,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2025-02-08 06:42:38,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 75 states have (on average 1.32) internal successors, (99), 93 states have internal predecessors, (99), 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:42:38,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2025-02-08 06:42:38,223 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 46 [2025-02-08 06:42:38,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:38,223 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions. [2025-02-08 06:42:38,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 41 states have (on average 1.829268292682927) internal successors, (75), 39 states have internal predecessors, (75), 6 states have call successors, (6), 3 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:42:38,224 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2025-02-08 06:42:38,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-08 06:42:38,224 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:38,224 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] [2025-02-08 06:42:38,232 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:42:38,425 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,SelfDestructingSolverStorable16 [2025-02-08 06:42:38,425 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-02-08 06:42:38,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:38,426 INFO L85 PathProgramCache]: Analyzing trace with hash 524375778, now seen corresponding path program 1 times [2025-02-08 06:42:38,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:38,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86489517] [2025-02-08 06:42:38,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:38,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:38,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-08 06:42:38,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-08 06:42:38,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:38,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:38,602 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:42:38,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:38,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86489517] [2025-02-08 06:42:38,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86489517] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:42:38,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:42:38,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 06:42:38,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845828338] [2025-02-08 06:42:38,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:42:38,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 06:42:38,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:38,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 06:42:38,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-08 06:42:38,604 INFO L87 Difference]: Start difference. First operand 99 states and 105 transitions. Second operand has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 10 states have internal predecessors, (33), 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:42:38,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:38,730 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2025-02-08 06:42:38,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 06:42:38,730 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 10 states have internal predecessors, (33), 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 51 [2025-02-08 06:42:38,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:38,731 INFO L225 Difference]: With dead ends: 101 [2025-02-08 06:42:38,731 INFO L226 Difference]: Without dead ends: 101 [2025-02-08 06:42:38,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-02-08 06:42:38,731 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 63 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:38,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 261 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:42:38,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-02-08 06:42:38,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2025-02-08 06:42:38,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 77 states have (on average 1.3116883116883118) internal successors, (101), 94 states have internal predecessors, (101), 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:42:38,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 107 transitions. [2025-02-08 06:42:38,735 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 107 transitions. Word has length 51 [2025-02-08 06:42:38,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:38,735 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 107 transitions. [2025-02-08 06:42:38,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 10 states have internal predecessors, (33), 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:42:38,735 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 107 transitions. [2025-02-08 06:42:38,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-08 06:42:38,735 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:38,735 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] [2025-02-08 06:42:38,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 06:42:38,736 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-02-08 06:42:38,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:38,736 INFO L85 PathProgramCache]: Analyzing trace with hash 524375779, now seen corresponding path program 1 times [2025-02-08 06:42:38,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:38,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59396431] [2025-02-08 06:42:38,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:38,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:38,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-08 06:42:38,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-08 06:42:38,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:38,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:39,232 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:42:39,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:39,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59396431] [2025-02-08 06:42:39,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59396431] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:42:39,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441298122] [2025-02-08 06:42:39,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:39,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:42:39,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:42:39,235 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:42:39,236 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:42:39,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-08 06:42:39,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-08 06:42:39,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:39,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:39,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-02-08 06:42:39,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:42:39,386 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:42:39,537 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:42:39,539 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:42:39,568 WARN L873 $PredicateComparison]: unable to prove that (and (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|)))) (exists ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_10|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_14|) 0))) is different from true [2025-02-08 06:42:39,596 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-02-08 06:42:39,596 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:42:39,599 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:42:39,651 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:42:39,658 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:42:39,658 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:42:39,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441298122] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:42:39,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:42:39,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 27 [2025-02-08 06:42:39,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845920603] [2025-02-08 06:42:39,837 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:42:39,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-08 06:42:39,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:39,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-08 06:42:39,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=834, Unknown=1, NotChecked=58, Total=992 [2025-02-08 06:42:39,838 INFO L87 Difference]: Start difference. First operand 100 states and 107 transitions. Second operand has 28 states, 25 states have (on average 2.96) internal successors, (74), 24 states have internal predecessors, (74), 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:42:40,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:40,506 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2025-02-08 06:42:40,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-08 06:42:40,507 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 2.96) internal successors, (74), 24 states have internal predecessors, (74), 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 51 [2025-02-08 06:42:40,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:40,511 INFO L225 Difference]: With dead ends: 103 [2025-02-08 06:42:40,511 INFO L226 Difference]: Without dead ends: 103 [2025-02-08 06:42:40,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=151, Invalid=1258, Unknown=1, NotChecked=72, Total=1482 [2025-02-08 06:42:40,511 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 43 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:40,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 805 Invalid, 1000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 900 Invalid, 0 Unknown, 95 Unchecked, 0.5s Time] [2025-02-08 06:42:40,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-02-08 06:42:40,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2025-02-08 06:42:40,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 79 states have (on average 1.2911392405063291) internal successors, (102), 96 states have internal predecessors, (102), 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:42:40,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 108 transitions. [2025-02-08 06:42:40,514 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 108 transitions. Word has length 51 [2025-02-08 06:42:40,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:40,514 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 108 transitions. [2025-02-08 06:42:40,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 2.96) internal successors, (74), 24 states have internal predecessors, (74), 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:42:40,514 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2025-02-08 06:42:40,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-08 06:42:40,514 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:40,514 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:42:40,525 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:42:40,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:42:40,716 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-02-08 06:42:40,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:40,716 INFO L85 PathProgramCache]: Analyzing trace with hash 464761685, now seen corresponding path program 2 times [2025-02-08 06:42:40,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:40,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505908286] [2025-02-08 06:42:40,716 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:42:40,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:40,737 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 52 statements into 2 equivalence classes. [2025-02-08 06:42:40,754 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 06:42:40,758 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:42:40,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:41,630 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:42:41,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:41,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505908286] [2025-02-08 06:42:41,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505908286] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:42:41,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015022402] [2025-02-08 06:42:41,630 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:42:41,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:42:41,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:42:41,632 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:42:41,633 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:42:41,740 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 52 statements into 2 equivalence classes. [2025-02-08 06:42:41,791 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 06:42:41,792 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:42:41,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:41,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 131 conjuncts are in the unsatisfiable core [2025-02-08 06:42:41,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:42:41,818 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:42:42,013 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:42:42,014 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:42:42,096 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:42:42,101 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 1 [2025-02-08 06:42:42,220 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-02-08 06:42:42,220 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:42:42,223 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:42:42,350 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-02-08 06:42:42,351 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:42:42,354 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:42:42,357 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:42:42,525 WARN L873 $PredicateComparison]: unable to prove that (and (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|) (= |c_#memory_$Pointer$#2.offset| (store |c_old(#memory_$Pointer$#2.offset)| |node_create_~temp~0#1.base| (store (store (select |c_old(#memory_$Pointer$#2.offset)| |node_create_~temp~0#1.base|) 0 0) 4 (select (select |c_#memory_$Pointer$#2.offset| |node_create_~temp~0#1.base|) 4)))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (exists ((|v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_8| Int)) (<= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_append_~head#1.base_BEFORE_CALL_8|) 0) 0))) is different from true [2025-02-08 06:42:42,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:42:42,559 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-02-08 06:42:42,559 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:42:42,575 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-02-08 06:42:42,576 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:42:42,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 40 [2025-02-08 06:42:43,466 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-02-08 06:42:43,467 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 33 [2025-02-08 06:42:43,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2025-02-08 06:42:43,530 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:42:43,567 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2025-02-08 06:42:43,567 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:42:44,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015022402] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:42:44,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:42:44,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28] total 52 [2025-02-08 06:42:44,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373360396] [2025-02-08 06:42:44,105 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:42:44,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-02-08 06:42:44,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:44,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-02-08 06:42:44,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=3128, Unknown=1, NotChecked=112, Total=3422 [2025-02-08 06:42:44,110 INFO L87 Difference]: Start difference. First operand 102 states and 108 transitions. Second operand has 52 states, 49 states have (on average 1.7959183673469388) internal successors, (88), 45 states have internal predecessors, (88), 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:42:45,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:45,914 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2025-02-08 06:42:45,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-02-08 06:42:45,914 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 49 states have (on average 1.7959183673469388) internal successors, (88), 45 states have internal predecessors, (88), 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:42:45,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:45,915 INFO L225 Difference]: With dead ends: 91 [2025-02-08 06:42:45,915 INFO L226 Difference]: Without dead ends: 91 [2025-02-08 06:42:45,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1265 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=373, Invalid=5792, Unknown=1, NotChecked=154, Total=6320 [2025-02-08 06:42:45,916 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 60 mSDsluCounter, 1739 mSDsCounter, 0 mSdLazyCounter, 1631 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1797 SdHoareTripleChecker+Invalid, 1726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 88 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:45,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1797 Invalid, 1726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1631 Invalid, 0 Unknown, 88 Unchecked, 0.8s Time] [2025-02-08 06:42:45,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-02-08 06:42:45,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2025-02-08 06:42:45,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 71 states have (on average 1.2394366197183098) internal successors, (88), 84 states have internal predecessors, (88), 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:42:45,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2025-02-08 06:42:45,918 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 52 [2025-02-08 06:42:45,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:45,918 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2025-02-08 06:42:45,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 49 states have (on average 1.7959183673469388) internal successors, (88), 45 states have internal predecessors, (88), 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:42:45,918 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2025-02-08 06:42:45,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-08 06:42:45,919 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:45,919 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:42:45,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-02-08 06:42:46,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:42:46,123 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 47 more)] === [2025-02-08 06:42:46,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:46,124 INFO L85 PathProgramCache]: Analyzing trace with hash -696134224, now seen corresponding path program 1 times [2025-02-08 06:42:46,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:46,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538292961] [2025-02-08 06:42:46,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:46,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:46,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-08 06:42:46,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-08 06:42:46,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:46,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:47,438 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:42:47,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:47,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538292961] [2025-02-08 06:42:47,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538292961] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:42:47,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967371522] [2025-02-08 06:42:47,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:47,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:42:47,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:42:47,441 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:42:47,443 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:42:47,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-08 06:42:47,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-08 06:42:47,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:47,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:47,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 85 conjuncts are in the unsatisfiable core [2025-02-08 06:42:47,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:42:47,611 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:42:47,676 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:42:47,676 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:42:47,728 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:42:47,796 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 06:42:47,796 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:42:47,864 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:42:47,866 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:42:48,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:42:48,009 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:42:48,033 INFO L349 Elim1Store]: treesize reduction 88, result has 36.7 percent of original size [2025-02-08 06:42:48,034 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 40 treesize of output 60 [2025-02-08 06:42:48,488 INFO L349 Elim1Store]: treesize reduction 81, result has 15.6 percent of original size [2025-02-08 06:42:48,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 2 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 51 [2025-02-08 06:42:48,666 INFO L349 Elim1Store]: treesize reduction 68, result has 28.4 percent of original size [2025-02-08 06:42:48,666 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 102 treesize of output 88 [2025-02-08 06:42:48,676 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 38 treesize of output 32 [2025-02-08 06:43:20,863 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:43:20,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 129 treesize of output 113 [2025-02-08 06:43:20,869 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 76 treesize of output 56 [2025-02-08 06:43:20,970 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:21,089 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:43:21,090 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:43:21,107 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1881 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1881) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2025-02-08 06:43:21,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967371522] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:43:21,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:43:21,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 58 [2025-02-08 06:43:21,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773565582] [2025-02-08 06:43:21,911 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:43:21,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2025-02-08 06:43:21,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:43:21,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2025-02-08 06:43:21,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=4244, Unknown=30, NotChecked=132, Total=4692 [2025-02-08 06:43:21,913 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand has 59 states, 56 states have (on average 1.75) internal successors, (98), 51 states have internal predecessors, (98), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-08 06:43:26,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-08 06:43:34,526 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]