./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2n_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/sll2n_insert_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 43bf83586090da08f52ccb7b612d2451c8f1efe9c820d873134ac51350c022e3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 10:40:37,425 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 10:40:37,472 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 10:40:37,478 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 10:40:37,479 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 10:40:37,502 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 10:40:37,503 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 10:40:37,503 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 10:40:37,504 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 10:40:37,504 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 10:40:37,505 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 10:40:37,505 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 10:40:37,505 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 10:40:37,505 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 10:40:37,505 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 10:40:37,506 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 10:40:37,506 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 10:40:37,506 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 10:40:37,506 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 10:40:37,506 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 10:40:37,506 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 10:40:37,506 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 10:40:37,507 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 10:40:37,507 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 10:40:37,507 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 10:40:37,507 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 10:40:37,507 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 10:40:37,507 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 10:40:37,507 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 10:40:37,507 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 10:40:37,507 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 10:40:37,507 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 10:40:37,507 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 10:40:37,507 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:40:37,508 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 10:40:37,508 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 10:40:37,508 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 10:40:37,508 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 10:40:37,508 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 10:40:37,509 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 10:40:37,509 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 10:40:37,509 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 10:40:37,509 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 -> 43bf83586090da08f52ccb7b612d2451c8f1efe9c820d873134ac51350c022e3 [2025-02-06 10:40:37,752 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 10:40:37,760 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 10:40:37,761 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 10:40:37,762 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 10:40:37,762 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 10:40:37,763 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_insert_equal.i [2025-02-06 10:40:38,979 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8c8426e15/8ff8c2ed86524afbb4112af727c271f6/FLAGabdcb0d45 [2025-02-06 10:40:39,254 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 10:40:39,255 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_equal.i [2025-02-06 10:40:39,262 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8c8426e15/8ff8c2ed86524afbb4112af727c271f6/FLAGabdcb0d45 [2025-02-06 10:40:39,271 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8c8426e15/8ff8c2ed86524afbb4112af727c271f6 [2025-02-06 10:40:39,273 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 10:40:39,274 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 10:40:39,275 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 10:40:39,275 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 10:40:39,277 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 10:40:39,278 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:40:39" (1/1) ... [2025-02-06 10:40:39,278 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2913649e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:40:39, skipping insertion in model container [2025-02-06 10:40:39,278 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:40:39" (1/1) ... [2025-02-06 10:40:39,297 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 10:40:39,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:40:39,444 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 10:40:39,468 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:40:39,487 INFO L204 MainTranslator]: Completed translation [2025-02-06 10:40:39,487 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:40:39 WrapperNode [2025-02-06 10:40:39,487 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 10:40:39,488 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 10:40:39,488 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 10:40:39,488 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 10:40:39,492 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:40:39" (1/1) ... [2025-02-06 10:40:39,499 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:40:39" (1/1) ... [2025-02-06 10:40:39,510 INFO L138 Inliner]: procedures = 127, calls = 33, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 114 [2025-02-06 10:40:39,510 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 10:40:39,511 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 10:40:39,511 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 10:40:39,511 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 10:40:39,515 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:40:39" (1/1) ... [2025-02-06 10:40:39,515 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:40:39" (1/1) ... [2025-02-06 10:40:39,517 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:40:39" (1/1) ... [2025-02-06 10:40:39,527 INFO L175 MemorySlicer]: Split 16 memory accesses to 3 slices as follows [2, 9, 5]. 56 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 6 writes are split as follows [0, 5, 1]. [2025-02-06 10:40:39,527 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:40:39" (1/1) ... [2025-02-06 10:40:39,527 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:40:39" (1/1) ... [2025-02-06 10:40:39,531 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:40:39" (1/1) ... [2025-02-06 10:40:39,532 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:40:39" (1/1) ... [2025-02-06 10:40:39,533 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:40:39" (1/1) ... [2025-02-06 10:40:39,533 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:40:39" (1/1) ... [2025-02-06 10:40:39,535 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 10:40:39,536 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 10:40:39,536 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 10:40:39,536 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 10:40:39,536 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:40:39" (1/1) ... [2025-02-06 10:40:39,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:40:39,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:40:39,573 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-06 10:40:39,578 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-06 10:40:39,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 10:40:39,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 10:40:39,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 10:40:39,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 10:40:39,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 10:40:39,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 10:40:39,597 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-02-06 10:40:39,597 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-02-06 10:40:39,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 10:40:39,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 10:40:39,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 10:40:39,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 10:40:39,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 10:40:39,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 10:40:39,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 10:40:39,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 10:40:39,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 10:40:39,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 10:40:39,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-06 10:40:39,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-06 10:40:39,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-06 10:40:39,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 10:40:39,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 10:40:39,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 10:40:39,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 10:40:39,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 10:40:39,711 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 10:40:39,713 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 10:40:39,893 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L618: 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-06 10:40:39,918 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint myexit_returnLabel#1: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-02-06 10:40:39,940 INFO L? ?]: Removed 96 outVars from TransFormulas that were not future-live. [2025-02-06 10:40:39,940 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 10:40:39,951 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 10:40:39,951 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 10:40:39,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:40:39 BoogieIcfgContainer [2025-02-06 10:40:39,951 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 10:40:39,953 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 10:40:39,953 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 10:40:39,957 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 10:40:39,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 10:40:39" (1/3) ... [2025-02-06 10:40:39,958 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c6cfe2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:40:39, skipping insertion in model container [2025-02-06 10:40:39,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:40:39" (2/3) ... [2025-02-06 10:40:39,958 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c6cfe2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:40:39, skipping insertion in model container [2025-02-06 10:40:39,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:40:39" (3/3) ... [2025-02-06 10:40:39,959 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2n_insert_equal.i [2025-02-06 10:40:39,977 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 10:40:39,978 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2n_insert_equal.i that has 2 procedures, 83 locations, 1 initial locations, 4 loop locations, and 31 error locations. [2025-02-06 10:40:40,009 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 10:40:40,016 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;@1f85041a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 10:40:40,017 INFO L334 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2025-02-06 10:40:40,019 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 48 states have (on average 1.8333333333333333) internal successors, (88), 79 states have internal predecessors, (88), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:40:40,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 10:40:40,023 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:40:40,023 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:40:40,024 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 28 more)] === [2025-02-06 10:40:40,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:40:40,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1438791432, now seen corresponding path program 1 times [2025-02-06 10:40:40,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:40:40,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168859061] [2025-02-06 10:40:40,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:40,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:40:40,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 10:40:40,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 10:40:40,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:40,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:40,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:40:40,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:40:40,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168859061] [2025-02-06 10:40:40,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168859061] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:40:40,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:40:40,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:40:40,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553661428] [2025-02-06 10:40:40,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:40:40,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:40:40,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:40:40,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:40:40,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:40:40,246 INFO L87 Difference]: Start difference. First operand has 83 states, 48 states have (on average 1.8333333333333333) internal successors, (88), 79 states have internal predecessors, (88), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-06 10:40:40,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:40:40,322 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2025-02-06 10:40:40,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:40:40,323 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2025-02-06 10:40:40,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:40:40,327 INFO L225 Difference]: With dead ends: 80 [2025-02-06 10:40:40,327 INFO L226 Difference]: Without dead ends: 77 [2025-02-06 10:40:40,328 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-06 10:40:40,330 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 2 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:40:40,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 130 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:40:40,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-02-06 10:40:40,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-02-06 10:40:40,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 45 states have (on average 1.7555555555555555) internal successors, (79), 73 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:40:40,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2025-02-06 10:40:40,352 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 7 [2025-02-06 10:40:40,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:40:40,352 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2025-02-06 10:40:40,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-06 10:40:40,353 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2025-02-06 10:40:40,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 10:40:40,353 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:40:40,353 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:40:40,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 10:40:40,353 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 28 more)] === [2025-02-06 10:40:40,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:40:40,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1438791433, now seen corresponding path program 1 times [2025-02-06 10:40:40,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:40:40,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872605618] [2025-02-06 10:40:40,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:40,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:40:40,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 10:40:40,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 10:40:40,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:40,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:40,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:40:40,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:40:40,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872605618] [2025-02-06 10:40:40,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872605618] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:40:40,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:40:40,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:40:40,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121036760] [2025-02-06 10:40:40,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:40:40,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:40:40,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:40:40,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:40:40,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:40:40,504 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-06 10:40:40,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:40:40,561 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2025-02-06 10:40:40,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:40:40,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2025-02-06 10:40:40,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:40:40,562 INFO L225 Difference]: With dead ends: 75 [2025-02-06 10:40:40,562 INFO L226 Difference]: Without dead ends: 75 [2025-02-06 10:40:40,562 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-06 10:40:40,562 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 2 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:40:40,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 129 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:40:40,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-02-06 10:40:40,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-02-06 10:40:40,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 45 states have (on average 1.711111111111111) internal successors, (77), 71 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:40:40,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2025-02-06 10:40:40,569 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 7 [2025-02-06 10:40:40,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:40:40,570 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2025-02-06 10:40:40,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-06 10:40:40,570 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2025-02-06 10:40:40,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-06 10:40:40,571 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:40:40,571 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:40:40,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 10:40:40,571 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 28 more)] === [2025-02-06 10:40:40,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:40:40,572 INFO L85 PathProgramCache]: Analyzing trace with hash -22531543, now seen corresponding path program 1 times [2025-02-06 10:40:40,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:40:40,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672056610] [2025-02-06 10:40:40,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:40,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:40:40,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 10:40:40,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 10:40:40,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:40,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:40,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:40:40,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:40:40,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672056610] [2025-02-06 10:40:40,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672056610] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:40:40,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:40:40,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:40:40,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300340037] [2025-02-06 10:40:40,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:40:40,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:40:40,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:40:40,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:40:40,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:40:40,657 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-06 10:40:40,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:40:40,747 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2025-02-06 10:40:40,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:40:40,747 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 13 [2025-02-06 10:40:40,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:40:40,748 INFO L225 Difference]: With dead ends: 74 [2025-02-06 10:40:40,748 INFO L226 Difference]: Without dead ends: 74 [2025-02-06 10:40:40,748 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-06 10:40:40,749 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 2 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:40:40,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 241 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:40:40,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-02-06 10:40:40,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-02-06 10:40:40,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 45 states have (on average 1.6888888888888889) internal successors, (76), 70 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:40:40,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2025-02-06 10:40:40,752 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 13 [2025-02-06 10:40:40,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:40:40,753 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2025-02-06 10:40:40,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-06 10:40:40,753 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2025-02-06 10:40:40,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-06 10:40:40,754 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:40:40,754 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:40:40,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 10:40:40,754 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 28 more)] === [2025-02-06 10:40:40,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:40:40,754 INFO L85 PathProgramCache]: Analyzing trace with hash -22531542, now seen corresponding path program 1 times [2025-02-06 10:40:40,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:40:40,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626846737] [2025-02-06 10:40:40,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:40,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:40:40,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 10:40:40,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 10:40:40,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:40,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:40,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:40:40,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:40:40,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626846737] [2025-02-06 10:40:40,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626846737] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:40:40,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:40:40,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:40:40,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839204357] [2025-02-06 10:40:40,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:40:40,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:40:40,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:40:40,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:40:40,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:40:40,874 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-06 10:40:40,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:40:40,955 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2025-02-06 10:40:40,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:40:40,956 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 13 [2025-02-06 10:40:40,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:40:40,956 INFO L225 Difference]: With dead ends: 73 [2025-02-06 10:40:40,956 INFO L226 Difference]: Without dead ends: 73 [2025-02-06 10:40:40,957 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-06 10:40:40,958 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 1 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:40:40,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 257 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:40:40,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-02-06 10:40:40,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-02-06 10:40:40,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 45 states have (on average 1.6666666666666667) internal successors, (75), 69 states have internal predecessors, (75), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:40:40,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2025-02-06 10:40:40,964 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 13 [2025-02-06 10:40:40,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:40:40,964 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2025-02-06 10:40:40,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-06 10:40:40,964 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2025-02-06 10:40:40,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-06 10:40:40,965 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:40:40,965 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:40:40,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 10:40:40,965 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 28 more)] === [2025-02-06 10:40:40,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:40:40,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1119786453, now seen corresponding path program 1 times [2025-02-06 10:40:40,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:40:40,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187637025] [2025-02-06 10:40:40,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:40,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:40:40,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 10:40:40,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 10:40:40,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:40,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:41,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:40:41,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:40:41,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187637025] [2025-02-06 10:40:41,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187637025] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:40:41,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:40:41,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:40:41,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326931813] [2025-02-06 10:40:41,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:40:41,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:40:41,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:40:41,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:40:41,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:40:41,042 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-06 10:40:41,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:40:41,048 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2025-02-06 10:40:41,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:40:41,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 14 [2025-02-06 10:40:41,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:40:41,049 INFO L225 Difference]: With dead ends: 78 [2025-02-06 10:40:41,049 INFO L226 Difference]: Without dead ends: 78 [2025-02-06 10:40:41,049 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-06 10:40:41,049 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 3 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:40:41,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 151 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:40:41,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-02-06 10:40:41,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2025-02-06 10:40:41,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 46 states have (on average 1.6521739130434783) internal successors, (76), 70 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:40:41,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2025-02-06 10:40:41,053 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 14 [2025-02-06 10:40:41,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:40:41,053 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2025-02-06 10:40:41,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-06 10:40:41,053 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2025-02-06 10:40:41,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-06 10:40:41,054 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:40:41,054 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:40:41,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 10:40:41,054 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 28 more)] === [2025-02-06 10:40:41,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:40:41,054 INFO L85 PathProgramCache]: Analyzing trace with hash -186096455, now seen corresponding path program 1 times [2025-02-06 10:40:41,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:40:41,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842841514] [2025-02-06 10:40:41,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:41,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:40:41,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 10:40:41,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 10:40:41,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:41,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:41,124 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-06 10:40:41,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:40:41,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842841514] [2025-02-06 10:40:41,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842841514] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:40:41,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592301311] [2025-02-06 10:40:41,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:41,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:40:41,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:40:41,128 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-06 10:40:41,129 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-06 10:40:41,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 10:40:41,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 10:40:41,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:41,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:41,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 10:40:41,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:40:41,250 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:40:41,250 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:40:41,282 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-06 10:40:41,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592301311] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:40:41,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:40:41,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-02-06 10:40:41,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889382153] [2025-02-06 10:40:41,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:40:41,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:40:41,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:40:41,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:40:41,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:40:41,284 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 10:40:41,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:40:41,295 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2025-02-06 10:40:41,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:40:41,296 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2025-02-06 10:40:41,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:40:41,296 INFO L225 Difference]: With dead ends: 79 [2025-02-06 10:40:41,296 INFO L226 Difference]: Without dead ends: 79 [2025-02-06 10:40:41,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:40:41,297 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 3 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:40:41,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 152 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:40:41,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-02-06 10:40:41,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-02-06 10:40:41,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 50 states have (on average 1.6) internal successors, (80), 74 states have internal predecessors, (80), 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-06 10:40:41,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2025-02-06 10:40:41,307 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 26 [2025-02-06 10:40:41,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:40:41,308 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2025-02-06 10:40:41,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 10:40:41,308 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2025-02-06 10:40:41,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-06 10:40:41,308 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:40:41,308 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:40:41,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 10:40:41,512 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-06 10:40:41,513 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 28 more)] === [2025-02-06 10:40:41,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:40:41,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1921057379, now seen corresponding path program 2 times [2025-02-06 10:40:41,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:40:41,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999772456] [2025-02-06 10:40:41,513 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:40:41,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:40:41,544 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-02-06 10:40:41,558 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 10:40:41,558 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:40:41,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:41,965 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:40:41,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:40:41,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999772456] [2025-02-06 10:40:41,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999772456] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:40:41,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902850277] [2025-02-06 10:40:41,966 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:40:41,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:40:41,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:40:41,970 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-06 10:40:41,971 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-06 10:40:42,055 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-02-06 10:40:42,095 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 10:40:42,095 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:40:42,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:42,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-06 10:40:42,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:40:42,115 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-06 10:40:42,126 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-06 10:40:42,161 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-06 10:40:42,161 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-06 10:40:42,204 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-06 10:40:42,205 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-06 10:40:42,262 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-06 10:40:42,263 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-06 10:40:42,278 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 6 not checked. [2025-02-06 10:40:42,278 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:40:42,617 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 10:40:42,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1902850277] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:40:42,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:40:42,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 5] total 15 [2025-02-06 10:40:42,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046524666] [2025-02-06 10:40:42,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:40:42,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 10:40:42,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:40:42,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 10:40:42,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=160, Unknown=1, NotChecked=26, Total=240 [2025-02-06 10:40:42,619 INFO L87 Difference]: Start difference. First operand 79 states and 86 transitions. Second operand has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 3 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-06 10:40:42,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:40:42,851 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2025-02-06 10:40:42,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:40:42,851 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 3 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 38 [2025-02-06 10:40:42,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:40:42,852 INFO L225 Difference]: With dead ends: 91 [2025-02-06 10:40:42,852 INFO L226 Difference]: Without dead ends: 91 [2025-02-06 10:40:42,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 64 SyntacticMatches, 11 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=232, Unknown=1, NotChecked=32, Total=342 [2025-02-06 10:40:42,853 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 131 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 86 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:40:42,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 288 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 287 Invalid, 0 Unknown, 86 Unchecked, 0.2s Time] [2025-02-06 10:40:42,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-02-06 10:40:42,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 75. [2025-02-06 10:40:42,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 50 states have (on average 1.52) internal successors, (76), 70 states have internal predecessors, (76), 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-06 10:40:42,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2025-02-06 10:40:42,857 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 38 [2025-02-06 10:40:42,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:40:42,857 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2025-02-06 10:40:42,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 3 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-06 10:40:42,857 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2025-02-06 10:40:42,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-06 10:40:42,858 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:40:42,858 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:40:42,864 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 10:40:43,062 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-06 10:40:43,062 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 28 more)] === [2025-02-06 10:40:43,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:40:43,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1921057378, now seen corresponding path program 1 times [2025-02-06 10:40:43,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:40:43,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918796432] [2025-02-06 10:40:43,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:43,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:40:43,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-06 10:40:43,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 10:40:43,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:43,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:43,718 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:40:43,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:40:43,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918796432] [2025-02-06 10:40:43,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918796432] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:40:43,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496976975] [2025-02-06 10:40:43,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:43,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:40:43,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:40:43,721 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-06 10:40:43,723 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-06 10:40:43,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-06 10:40:43,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 10:40:43,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:43,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:43,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-06 10:40:43,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:40:43,854 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-06 10:40:43,879 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-06 10:40:43,888 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-06 10:40:43,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:40:43,929 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-06 10:40:43,955 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-06 10:40:43,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:40:43,993 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-06 10:40:44,044 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-06 10:40:44,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:40:44,079 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-06 10:40:44,084 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-06 10:40:44,084 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:40:44,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496976975] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:40:44,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 10:40:44,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 17 [2025-02-06 10:40:44,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514110255] [2025-02-06 10:40:44,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:40:44,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:40:44,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:40:44,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:40:44,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=225, Unknown=1, NotChecked=30, Total=306 [2025-02-06 10:40:44,085 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand has 7 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:40:44,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:40:44,172 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2025-02-06 10:40:44,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:40:44,173 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2025-02-06 10:40:44,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:40:44,173 INFO L225 Difference]: With dead ends: 77 [2025-02-06 10:40:44,173 INFO L226 Difference]: Without dead ends: 77 [2025-02-06 10:40:44,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=254, Unknown=1, NotChecked=32, Total=342 [2025-02-06 10:40:44,174 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 17 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 101 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:40:44,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 202 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 101 Unchecked, 0.1s Time] [2025-02-06 10:40:44,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-02-06 10:40:44,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2025-02-06 10:40:44,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 50 states have (on average 1.48) internal successors, (74), 68 states have internal predecessors, (74), 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-06 10:40:44,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2025-02-06 10:40:44,178 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 38 [2025-02-06 10:40:44,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:40:44,179 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2025-02-06 10:40:44,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:40:44,180 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2025-02-06 10:40:44,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-06 10:40:44,181 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:40:44,181 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:40:44,187 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-06 10:40:44,381 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-06 10:40:44,382 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 28 more)] === [2025-02-06 10:40:44,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:40:44,383 INFO L85 PathProgramCache]: Analyzing trace with hash 218878086, now seen corresponding path program 1 times [2025-02-06 10:40:44,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:40:44,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353145995] [2025-02-06 10:40:44,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:44,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:40:44,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-06 10:40:44,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-06 10:40:44,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:44,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:44,793 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 10:40:44,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:40:44,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353145995] [2025-02-06 10:40:44,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353145995] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:40:44,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549871659] [2025-02-06 10:40:44,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:44,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:40:44,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:40:44,795 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-06 10:40:44,797 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-06 10:40:44,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-06 10:40:44,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-06 10:40:44,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:44,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:44,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-02-06 10:40:44,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:40:45,025 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-06 10:40:45,261 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-06 10:40:45,263 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-06 10:40:45,301 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_4| Int)) (= 0 (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_insert_~head#1.base_BEFORE_CALL_4|) 0))) (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) is different from true [2025-02-06 10:40:45,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:40:45,340 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-06 10:40:45,349 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-02-06 10:40:45,349 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-06 10:40:45,394 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-06 10:40:45,403 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 6 not checked. [2025-02-06 10:40:45,404 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:40:45,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1549871659] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:40:45,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:40:45,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 24 [2025-02-06 10:40:45,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730005312] [2025-02-06 10:40:45,550 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:40:45,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-06 10:40:45,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:40:45,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-06 10:40:45,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=679, Unknown=1, NotChecked=52, Total=812 [2025-02-06 10:40:45,551 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand has 25 states, 23 states have (on average 2.391304347826087) internal successors, (55), 21 states have internal predecessors, (55), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-06 10:40:46,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:40:46,058 INFO L93 Difference]: Finished difference Result 97 states and 106 transitions. [2025-02-06 10:40:46,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-06 10:40:46,059 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.391304347826087) internal successors, (55), 21 states have internal predecessors, (55), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2025-02-06 10:40:46,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:40:46,059 INFO L225 Difference]: With dead ends: 97 [2025-02-06 10:40:46,060 INFO L226 Difference]: Without dead ends: 97 [2025-02-06 10:40:46,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=153, Invalid=1332, Unknown=1, NotChecked=74, Total=1560 [2025-02-06 10:40:46,061 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 100 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 98 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:40:46,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 597 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 635 Invalid, 0 Unknown, 98 Unchecked, 0.3s Time] [2025-02-06 10:40:46,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-02-06 10:40:46,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 82. [2025-02-06 10:40:46,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 76 states have internal predecessors, (84), 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-06 10:40:46,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2025-02-06 10:40:46,069 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 41 [2025-02-06 10:40:46,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:40:46,069 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2025-02-06 10:40:46,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.391304347826087) internal successors, (55), 21 states have internal predecessors, (55), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-06 10:40:46,069 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2025-02-06 10:40:46,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-06 10:40:46,069 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:40:46,069 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:40:46,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 10:40:46,270 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-06 10:40:46,270 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 28 more)] === [2025-02-06 10:40:46,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:40:46,270 INFO L85 PathProgramCache]: Analyzing trace with hash 218878085, now seen corresponding path program 1 times [2025-02-06 10:40:46,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:40:46,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753661785] [2025-02-06 10:40:46,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:46,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:40:46,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-06 10:40:46,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-06 10:40:46,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:46,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:46,635 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 10:40:46,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:40:46,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753661785] [2025-02-06 10:40:46,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753661785] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:40:46,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247875124] [2025-02-06 10:40:46,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:46,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:40:46,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:40:46,637 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-06 10:40:46,641 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-06 10:40:46,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-06 10:40:46,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-06 10:40:46,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:46,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:46,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-02-06 10:40:46,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:40:46,931 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-06 10:40:46,941 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-06 10:40:46,978 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-02-06 10:40:46,978 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-06 10:40:47,024 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-06 10:40:47,033 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-06 10:40:47,033 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:40:47,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247875124] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:40:47,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 10:40:47,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 20 [2025-02-06 10:40:47,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821684497] [2025-02-06 10:40:47,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:40:47,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 10:40:47,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:40:47,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 10:40:47,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=332, Unknown=1, NotChecked=36, Total=420 [2025-02-06 10:40:47,034 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:40:47,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:40:47,206 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2025-02-06 10:40:47,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 10:40:47,206 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2025-02-06 10:40:47,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:40:47,207 INFO L225 Difference]: With dead ends: 97 [2025-02-06 10:40:47,207 INFO L226 Difference]: Without dead ends: 97 [2025-02-06 10:40:47,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=443, Unknown=1, NotChecked=42, Total=552 [2025-02-06 10:40:47,208 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 40 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 154 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:40:47,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 276 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 188 Invalid, 0 Unknown, 154 Unchecked, 0.1s Time] [2025-02-06 10:40:47,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-02-06 10:40:47,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 82. [2025-02-06 10:40:47,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 76 states have internal predecessors, (83), 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-06 10:40:47,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2025-02-06 10:40:47,214 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 41 [2025-02-06 10:40:47,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:40:47,215 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2025-02-06 10:40:47,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:40:47,215 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2025-02-06 10:40:47,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-06 10:40:47,217 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:40:47,217 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:40:47,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 10:40:47,417 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-06 10:40:47,418 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 28 more)] === [2025-02-06 10:40:47,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:40:47,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1804713066, now seen corresponding path program 1 times [2025-02-06 10:40:47,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:40:47,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376720565] [2025-02-06 10:40:47,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:47,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:40:47,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 10:40:47,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 10:40:47,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:47,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:47,463 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-06 10:40:47,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:40:47,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376720565] [2025-02-06 10:40:47,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376720565] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:40:47,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:40:47,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:40:47,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425241284] [2025-02-06 10:40:47,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:40:47,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:40:47,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:40:47,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:40:47,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:40:47,466 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:40:47,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:40:47,475 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2025-02-06 10:40:47,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:40:47,475 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2025-02-06 10:40:47,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:40:47,477 INFO L225 Difference]: With dead ends: 83 [2025-02-06 10:40:47,477 INFO L226 Difference]: Without dead ends: 83 [2025-02-06 10:40:47,477 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-06 10:40:47,478 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 134 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-06 10:40:47,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:40:47,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-02-06 10:40:47,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-02-06 10:40:47,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 59 states have (on average 1.423728813559322) internal successors, (84), 77 states have internal predecessors, (84), 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-06 10:40:47,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2025-02-06 10:40:47,480 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 42 [2025-02-06 10:40:47,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:40:47,480 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2025-02-06 10:40:47,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:40:47,480 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2025-02-06 10:40:47,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-06 10:40:47,481 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:40:47,481 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:40:47,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 10:40:47,481 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 28 more)] === [2025-02-06 10:40:47,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:40:47,481 INFO L85 PathProgramCache]: Analyzing trace with hash -111529124, now seen corresponding path program 1 times [2025-02-06 10:40:47,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:40:47,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994644988] [2025-02-06 10:40:47,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:47,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:40:47,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 10:40:47,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 10:40:47,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:47,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:47,544 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-06 10:40:47,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:40:47,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994644988] [2025-02-06 10:40:47,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994644988] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:40:47,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:40:47,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:40:47,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985156386] [2025-02-06 10:40:47,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:40:47,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:40:47,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:40:47,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:40:47,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:40:47,546 INFO L87 Difference]: Start difference. First operand 83 states and 90 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, (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-06 10:40:47,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:40:47,609 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2025-02-06 10:40:47,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:40:47,610 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, (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 43 [2025-02-06 10:40:47,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:40:47,610 INFO L225 Difference]: With dead ends: 82 [2025-02-06 10:40:47,610 INFO L226 Difference]: Without dead ends: 82 [2025-02-06 10:40:47,610 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-06 10:40:47,611 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 10 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:40:47,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 210 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:40:47,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-02-06 10:40:47,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-02-06 10:40:47,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 76 states have internal predecessors, (83), 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-06 10:40:47,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2025-02-06 10:40:47,613 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 43 [2025-02-06 10:40:47,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:40:47,613 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2025-02-06 10:40:47,613 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, (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-06 10:40:47,614 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2025-02-06 10:40:47,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-06 10:40:47,614 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:40:47,614 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:40:47,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 10:40:47,614 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 28 more)] === [2025-02-06 10:40:47,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:40:47,615 INFO L85 PathProgramCache]: Analyzing trace with hash -111529123, now seen corresponding path program 1 times [2025-02-06 10:40:47,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:40:47,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118747088] [2025-02-06 10:40:47,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:47,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:40:47,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 10:40:47,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 10:40:47,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:47,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:47,706 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-06 10:40:47,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:40:47,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118747088] [2025-02-06 10:40:47,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118747088] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:40:47,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:40:47,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:40:47,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396948329] [2025-02-06 10:40:47,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:40:47,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:40:47,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:40:47,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:40:47,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:40:47,708 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:40:47,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:40:47,721 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2025-02-06 10:40:47,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:40:47,722 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2025-02-06 10:40:47,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:40:47,722 INFO L225 Difference]: With dead ends: 85 [2025-02-06 10:40:47,722 INFO L226 Difference]: Without dead ends: 85 [2025-02-06 10:40:47,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-06 10:40:47,723 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 41 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:40:47,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 160 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:40:47,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-02-06 10:40:47,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2025-02-06 10:40:47,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 58 states have (on average 1.396551724137931) internal successors, (81), 75 states have internal predecessors, (81), 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-06 10:40:47,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2025-02-06 10:40:47,726 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 43 [2025-02-06 10:40:47,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:40:47,726 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2025-02-06 10:40:47,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:40:47,726 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2025-02-06 10:40:47,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-06 10:40:47,726 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:40:47,726 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:40:47,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 10:40:47,729 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 28 more)] === [2025-02-06 10:40:47,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:40:47,730 INFO L85 PathProgramCache]: Analyzing trace with hash 836705816, now seen corresponding path program 1 times [2025-02-06 10:40:47,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:40:47,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270053343] [2025-02-06 10:40:47,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:47,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:40:47,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-06 10:40:47,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 10:40:47,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:47,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:47,850 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 10:40:47,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:40:47,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270053343] [2025-02-06 10:40:47,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270053343] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:40:47,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213367825] [2025-02-06 10:40:47,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:47,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:40:47,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:40:47,854 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-06 10:40:47,860 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-06 10:40:47,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-06 10:40:47,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 10:40:47,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:47,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:47,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 10:40:47,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:40:48,004 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-06 10:40:48,004 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:40:48,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213367825] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:40:48,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 10:40:48,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2025-02-06 10:40:48,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112093780] [2025-02-06 10:40:48,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:40:48,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:40:48,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:40:48,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:40:48,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:40:48,006 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:40:48,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:40:48,024 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2025-02-06 10:40:48,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:40:48,025 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2025-02-06 10:40:48,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:40:48,025 INFO L225 Difference]: With dead ends: 82 [2025-02-06 10:40:48,025 INFO L226 Difference]: Without dead ends: 82 [2025-02-06 10:40:48,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:40:48,026 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 34 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:40:48,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 161 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:40:48,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-02-06 10:40:48,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2025-02-06 10:40:48,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 57 states have (on average 1.3508771929824561) internal successors, (77), 72 states have internal predecessors, (77), 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-06 10:40:48,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2025-02-06 10:40:48,027 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 44 [2025-02-06 10:40:48,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:40:48,028 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2025-02-06 10:40:48,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:40:48,028 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2025-02-06 10:40:48,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-06 10:40:48,028 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:40:48,028 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:40:48,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 10:40:48,234 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,SelfDestructingSolverStorable13 [2025-02-06 10:40:48,234 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 28 more)] === [2025-02-06 10:40:48,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:40:48,235 INFO L85 PathProgramCache]: Analyzing trace with hash 168077380, now seen corresponding path program 1 times [2025-02-06 10:40:48,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:40:48,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319460426] [2025-02-06 10:40:48,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:48,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:40:48,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-06 10:40:48,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-06 10:40:48,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:48,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:48,297 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-06 10:40:48,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:40:48,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319460426] [2025-02-06 10:40:48,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319460426] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:40:48,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:40:48,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:40:48,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724421337] [2025-02-06 10:40:48,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:40:48,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:40:48,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:40:48,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:40:48,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:40:48,299 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:40:48,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:40:48,372 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2025-02-06 10:40:48,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:40:48,375 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2025-02-06 10:40:48,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:40:48,375 INFO L225 Difference]: With dead ends: 77 [2025-02-06 10:40:48,375 INFO L226 Difference]: Without dead ends: 77 [2025-02-06 10:40:48,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:40:48,377 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:40:48,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:40:48,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-02-06 10:40:48,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-02-06 10:40:48,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 57 states have (on average 1.3333333333333333) internal successors, (76), 71 states have internal predecessors, (76), 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-06 10:40:48,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2025-02-06 10:40:48,380 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 45 [2025-02-06 10:40:48,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:40:48,380 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2025-02-06 10:40:48,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 10:40:48,381 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2025-02-06 10:40:48,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-06 10:40:48,381 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:40:48,381 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:40:48,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 10:40:48,381 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 28 more)] === [2025-02-06 10:40:48,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:40:48,382 INFO L85 PathProgramCache]: Analyzing trace with hash 168077381, now seen corresponding path program 1 times [2025-02-06 10:40:48,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:40:48,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208791508] [2025-02-06 10:40:48,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:48,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:40:48,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-06 10:40:48,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-06 10:40:48,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:48,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:48,657 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-06 10:40:48,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:40:48,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208791508] [2025-02-06 10:40:48,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208791508] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:40:48,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257714154] [2025-02-06 10:40:48,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:48,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:40:48,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:40:48,661 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-06 10:40:48,667 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-06 10:40:48,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-06 10:40:48,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-06 10:40:48,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:48,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:48,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-06 10:40:48,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:40:48,904 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-06 10:40:48,947 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-06 10:40:48,948 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:40:48,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257714154] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:40:48,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 10:40:48,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 16 [2025-02-06 10:40:48,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125764484] [2025-02-06 10:40:48,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:40:48,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:40:48,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:40:48,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:40:48,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2025-02-06 10:40:48,949 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:40:49,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:40:49,024 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2025-02-06 10:40:49,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:40:49,024 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2025-02-06 10:40:49,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:40:49,025 INFO L225 Difference]: With dead ends: 79 [2025-02-06 10:40:49,025 INFO L226 Difference]: Without dead ends: 79 [2025-02-06 10:40:49,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2025-02-06 10:40:49,026 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 47 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:40:49,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 219 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:40:49,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-02-06 10:40:49,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2025-02-06 10:40:49,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 57 states have (on average 1.3157894736842106) internal successors, (75), 70 states have internal predecessors, (75), 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-06 10:40:49,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2025-02-06 10:40:49,029 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 45 [2025-02-06 10:40:49,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:40:49,029 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2025-02-06 10:40:49,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:40:49,029 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2025-02-06 10:40:49,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-06 10:40:49,031 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:40:49,031 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:40:49,038 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-06 10:40:49,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:40:49,235 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 28 more)] === [2025-02-06 10:40:49,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:40:49,236 INFO L85 PathProgramCache]: Analyzing trace with hash 915431505, now seen corresponding path program 1 times [2025-02-06 10:40:49,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:40:49,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997450876] [2025-02-06 10:40:49,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:49,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:40:49,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-06 10:40:49,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 10:40:49,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:49,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:49,356 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-06 10:40:49,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:40:49,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997450876] [2025-02-06 10:40:49,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997450876] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:40:49,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:40:49,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 10:40:49,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722568983] [2025-02-06 10:40:49,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:40:49,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:40:49,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:40:49,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:40:49,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:40:49,358 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 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-06 10:40:49,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:40:49,419 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2025-02-06 10:40:49,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:40:49,420 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 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 46 [2025-02-06 10:40:49,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:40:49,420 INFO L225 Difference]: With dead ends: 75 [2025-02-06 10:40:49,421 INFO L226 Difference]: Without dead ends: 75 [2025-02-06 10:40:49,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:40:49,421 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 3 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:40:49,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 266 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:40:49,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-02-06 10:40:49,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-02-06 10:40:49,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 69 states have internal predecessors, (74), 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-06 10:40:49,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2025-02-06 10:40:49,425 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 46 [2025-02-06 10:40:49,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:40:49,425 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2025-02-06 10:40:49,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 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-06 10:40:49,425 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2025-02-06 10:40:49,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-06 10:40:49,425 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:40:49,425 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:40:49,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 10:40:49,427 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 28 more)] === [2025-02-06 10:40:49,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:40:49,427 INFO L85 PathProgramCache]: Analyzing trace with hash -738619730, now seen corresponding path program 1 times [2025-02-06 10:40:49,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:40:49,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402443738] [2025-02-06 10:40:49,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:49,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:40:49,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 10:40:49,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 10:40:49,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:49,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:49,536 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-02-06 10:40:49,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:40:49,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402443738] [2025-02-06 10:40:49,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402443738] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:40:49,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:40:49,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:40:49,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791389726] [2025-02-06 10:40:49,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:40:49,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:40:49,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:40:49,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:40:49,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:40:49,538 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand has 6 states, 4 states have (on average 6.5) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:40:49,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:40:49,574 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2025-02-06 10:40:49,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:40:49,574 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 6.5) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 48 [2025-02-06 10:40:49,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:40:49,575 INFO L225 Difference]: With dead ends: 75 [2025-02-06 10:40:49,575 INFO L226 Difference]: Without dead ends: 75 [2025-02-06 10:40:49,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:40:49,575 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 61 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:40:49,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 114 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:40:49,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-02-06 10:40:49,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2025-02-06 10:40:49,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 57 states have (on average 1.263157894736842) internal successors, (72), 67 states have internal predecessors, (72), 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-06 10:40:49,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2025-02-06 10:40:49,578 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 48 [2025-02-06 10:40:49,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:40:49,578 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2025-02-06 10:40:49,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 6.5) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:40:49,578 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2025-02-06 10:40:49,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-06 10:40:49,579 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:40:49,579 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:40:49,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 10:40:49,579 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 28 more)] === [2025-02-06 10:40:49,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:40:49,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1102933985, now seen corresponding path program 1 times [2025-02-06 10:40:49,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:40:49,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263173831] [2025-02-06 10:40:49,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:49,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:40:49,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-06 10:40:49,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-06 10:40:49,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:49,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:49,731 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-06 10:40:49,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:40:49,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263173831] [2025-02-06 10:40:49,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263173831] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:40:49,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726086939] [2025-02-06 10:40:49,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:49,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:40:49,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:40:49,735 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-06 10:40:49,738 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-06 10:40:49,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-06 10:40:49,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-06 10:40:49,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:49,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:49,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-06 10:40:49,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:40:49,910 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-06 10:40:49,924 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-06 10:40:49,954 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2025-02-06 10:40:49,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2025-02-06 10:40:49,975 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-06 10:40:49,979 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 10:40:49,979 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:40:49,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726086939] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:40:49,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 10:40:49,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 12 [2025-02-06 10:40:49,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309341872] [2025-02-06 10:40:49,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:40:49,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 10:40:49,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:40:49,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 10:40:49,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=112, Unknown=1, NotChecked=20, Total=156 [2025-02-06 10:40:49,981 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:40:50,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:40:50,103 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2025-02-06 10:40:50,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 10:40:50,103 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 51 [2025-02-06 10:40:50,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:40:50,104 INFO L225 Difference]: With dead ends: 92 [2025-02-06 10:40:50,104 INFO L226 Difference]: Without dead ends: 92 [2025-02-06 10:40:50,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=154, Unknown=1, NotChecked=24, Total=210 [2025-02-06 10:40:50,104 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 26 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 144 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:40:50,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 240 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 224 Invalid, 0 Unknown, 144 Unchecked, 0.1s Time] [2025-02-06 10:40:50,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-02-06 10:40:50,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 78. [2025-02-06 10:40:50,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 63 states have (on average 1.253968253968254) internal successors, (79), 72 states have internal predecessors, (79), 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-06 10:40:50,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2025-02-06 10:40:50,106 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 51 [2025-02-06 10:40:50,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:40:50,108 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2025-02-06 10:40:50,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 10:40:50,109 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2025-02-06 10:40:50,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-06 10:40:50,109 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:40:50,109 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:40:50,119 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-06 10:40:50,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:40:50,310 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 28 more)] === [2025-02-06 10:40:50,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:40:50,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1102933984, now seen corresponding path program 1 times [2025-02-06 10:40:50,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:40:50,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896118416] [2025-02-06 10:40:50,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:50,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:40:50,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-06 10:40:50,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-06 10:40:50,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:50,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:50,650 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-06 10:40:50,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:40:50,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896118416] [2025-02-06 10:40:50,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896118416] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:40:50,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050676476] [2025-02-06 10:40:50,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:50,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:40:50,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:40:50,657 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-06 10:40:50,658 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-06 10:40:50,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-06 10:40:50,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-06 10:40:50,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:50,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:50,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-02-06 10:40:50,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:40:50,812 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-06 10:40:50,988 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-06 10:40:50,991 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-06 10:40:51,033 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8| Int)) (= 0 (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_10|))) (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-06 10:40:51,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:40:51,072 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-06 10:40:51,076 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-02-06 10:40:51,076 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-06 10:40:51,158 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-06 10:40:51,164 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 6 not checked. [2025-02-06 10:40:51,164 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:40:51,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2050676476] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:40:51,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:40:51,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 25 [2025-02-06 10:40:51,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570633485] [2025-02-06 10:40:51,348 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:40:51,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-06 10:40:51,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:40:51,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-06 10:40:51,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=743, Unknown=1, NotChecked=54, Total=870 [2025-02-06 10:40:51,349 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand has 26 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 23 states have internal predecessors, (64), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-06 10:40:51,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:40:51,863 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2025-02-06 10:40:51,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-06 10:40:51,863 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 23 states have internal predecessors, (64), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 51 [2025-02-06 10:40:51,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:40:51,864 INFO L225 Difference]: With dead ends: 94 [2025-02-06 10:40:51,864 INFO L226 Difference]: Without dead ends: 94 [2025-02-06 10:40:51,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=153, Invalid=1490, Unknown=1, NotChecked=78, Total=1722 [2025-02-06 10:40:51,865 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 68 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:40:51,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 657 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 728 Invalid, 0 Unknown, 92 Unchecked, 0.3s Time] [2025-02-06 10:40:51,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-02-06 10:40:51,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 80. [2025-02-06 10:40:51,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 65 states have (on average 1.2307692307692308) internal successors, (80), 74 states have internal predecessors, (80), 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-06 10:40:51,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2025-02-06 10:40:51,867 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 51 [2025-02-06 10:40:51,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:40:51,867 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2025-02-06 10:40:51,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 23 states have internal predecessors, (64), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-06 10:40:51,867 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2025-02-06 10:40:51,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-06 10:40:51,868 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:40:51,868 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:40:51,874 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-06 10:40:52,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:40:52,068 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 28 more)] === [2025-02-06 10:40:52,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:40:52,068 INFO L85 PathProgramCache]: Analyzing trace with hash -992579903, now seen corresponding path program 1 times [2025-02-06 10:40:52,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:40:52,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11239996] [2025-02-06 10:40:52,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:52,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:40:52,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-06 10:40:52,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-06 10:40:52,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:52,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:52,293 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-06 10:40:52,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:40:52,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11239996] [2025-02-06 10:40:52,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11239996] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:40:52,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27072618] [2025-02-06 10:40:52,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:40:52,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:40:52,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:40:52,296 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-06 10:40:52,297 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-06 10:40:52,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-06 10:40:52,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-06 10:40:52,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:40:52,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:40:52,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-06 10:40:52,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:40:52,642 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:40:52,643 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:40:52,644 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 16 treesize of output 11 [2025-02-06 10:40:52,686 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 10:40:52,686 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:40:52,726 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:40:52,727 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 17 treesize of output 17 [2025-02-06 10:40:52,849 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-06 10:40:52,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27072618] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:40:52,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:40:52,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 13] total 27 [2025-02-06 10:40:52,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443680249] [2025-02-06 10:40:52,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:40:52,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-06 10:40:52,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:40:52,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-06 10:40:52,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=629, Unknown=0, NotChecked=0, Total=702 [2025-02-06 10:40:52,850 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand has 27 states, 27 states have (on average 2.5555555555555554) internal successors, (69), 24 states have internal predecessors, (69), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2025-02-06 10:40:56,872 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-06 10:41:00,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 10:41:04,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 10:41:08,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 10:41:09,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:41:09,316 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2025-02-06 10:41:09,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 10:41:09,317 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.5555555555555554) internal successors, (69), 24 states have internal predecessors, (69), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) Word has length 51 [2025-02-06 10:41:09,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:41:09,317 INFO L225 Difference]: With dead ends: 75 [2025-02-06 10:41:09,317 INFO L226 Difference]: Without dead ends: 75 [2025-02-06 10:41:09,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=159, Invalid=1173, Unknown=0, NotChecked=0, Total=1332 [2025-02-06 10:41:09,318 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 96 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 2 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:41:09,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 969 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 513 Invalid, 4 Unknown, 0 Unchecked, 16.3s Time] [2025-02-06 10:41:09,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-02-06 10:41:09,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-02-06 10:41:09,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 69 states have internal predecessors, (74), 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-06 10:41:09,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2025-02-06 10:41:09,320 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 51 [2025-02-06 10:41:09,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:41:09,320 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2025-02-06 10:41:09,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.5555555555555554) internal successors, (69), 24 states have internal predecessors, (69), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2025-02-06 10:41:09,320 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2025-02-06 10:41:09,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-06 10:41:09,320 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:41:09,320 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:41:09,327 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-06 10:41:09,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:41:09,525 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 28 more)] === [2025-02-06 10:41:09,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:41:09,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1005957803, now seen corresponding path program 1 times [2025-02-06 10:41:09,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:41:09,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325495371] [2025-02-06 10:41:09,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:41:09,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:41:09,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-06 10:41:09,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-06 10:41:09,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:41:09,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:41:09,629 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 10:41:09,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:41:09,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325495371] [2025-02-06 10:41:09,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325495371] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:41:09,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733047945] [2025-02-06 10:41:09,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:41:09,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:41:09,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:41:09,633 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-06 10:41:09,639 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-06 10:41:09,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-06 10:41:09,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-06 10:41:09,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:41:09,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:41:09,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-06 10:41:09,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:41:09,856 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 16 treesize of output 8 [2025-02-06 10:41:09,858 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 10:41:09,858 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:41:09,899 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 10:41:09,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733047945] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:41:09,899 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:41:09,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 12 [2025-02-06 10:41:09,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36881656] [2025-02-06 10:41:09,900 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:41:09,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 10:41:09,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:41:09,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 10:41:09,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-02-06 10:41:09,900 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 10:41:13,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 10:41:17,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 10:41:21,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 10:41:25,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 10:41:26,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:41:26,051 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2025-02-06 10:41:26,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 10:41:26,051 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 54 [2025-02-06 10:41:26,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:41:26,052 INFO L225 Difference]: With dead ends: 75 [2025-02-06 10:41:26,052 INFO L226 Difference]: Without dead ends: 75 [2025-02-06 10:41:26,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2025-02-06 10:41:26,053 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 42 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:41:26,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 466 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 225 Invalid, 4 Unknown, 0 Unchecked, 16.1s Time] [2025-02-06 10:41:26,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-02-06 10:41:26,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-02-06 10:41:26,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 60 states have (on average 1.2166666666666666) internal successors, (73), 69 states have internal predecessors, (73), 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-06 10:41:26,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2025-02-06 10:41:26,055 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 54 [2025-02-06 10:41:26,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:41:26,055 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2025-02-06 10:41:26,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 10:41:26,055 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2025-02-06 10:41:26,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-06 10:41:26,056 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:41:26,056 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:41:26,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-06 10:41:26,256 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,SelfDestructingSolverStorable21 [2025-02-06 10:41:26,256 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 28 more)] === [2025-02-06 10:41:26,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:41:26,257 INFO L85 PathProgramCache]: Analyzing trace with hash -901821082, now seen corresponding path program 1 times [2025-02-06 10:41:26,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:41:26,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251599529] [2025-02-06 10:41:26,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:41:26,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:41:26,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-06 10:41:26,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-06 10:41:26,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:41:26,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:41:27,157 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 19 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 10:41:27,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:41:27,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251599529] [2025-02-06 10:41:27,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251599529] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:41:27,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007376871] [2025-02-06 10:41:27,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:41:27,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:41:27,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:41:27,163 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-06 10:41:27,166 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-06 10:41:27,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-06 10:41:27,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-06 10:41:27,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:41:27,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:41:27,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 77 conjuncts are in the unsatisfiable core [2025-02-06 10:41:27,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:41:27,341 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-06 10:41:27,493 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 10:41:27,494 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-06 10:41:27,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 10:41:27,686 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 19 treesize of output 5 [2025-02-06 10:41:27,690 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-02-06 10:41:27,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 10:41:27,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:41:27,828 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 28 treesize of output 23 [2025-02-06 10:41:27,851 INFO L349 Elim1Store]: treesize reduction 116, result has 32.2 percent of original size [2025-02-06 10:41:27,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 40 treesize of output 69 [2025-02-06 10:41:28,082 INFO L349 Elim1Store]: treesize reduction 35, result has 48.5 percent of original size [2025-02-06 10:41:28,082 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 1 case distinctions, treesize of input 51 treesize of output 52 [2025-02-06 10:41:28,211 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2025-02-06 10:41:28,211 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 84 treesize of output 74 [2025-02-06 10:41:28,231 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 7 treesize of output 3 [2025-02-06 10:41:28,377 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 134 treesize of output 98 [2025-02-06 10:41:28,380 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 97 treesize of output 73 [2025-02-06 10:41:28,588 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 79 treesize of output 43 [2025-02-06 10:41:28,875 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:41:28,875 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:41:29,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007376871] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:41:29,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:41:29,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 28] total 52 [2025-02-06 10:41:29,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438812897] [2025-02-06 10:41:29,374 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:41:29,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-02-06 10:41:29,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:41:29,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-02-06 10:41:29,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=3467, Unknown=2, NotChecked=0, Total=3660 [2025-02-06 10:41:29,376 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand has 53 states, 50 states have (on average 1.92) internal successors, (96), 46 states have internal predecessors, (96), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-06 10:41:31,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:41:31,389 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2025-02-06 10:41:31,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-02-06 10:41:31,390 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 50 states have (on average 1.92) internal successors, (96), 46 states have internal predecessors, (96), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 56 [2025-02-06 10:41:31,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:41:31,391 INFO L225 Difference]: With dead ends: 85 [2025-02-06 10:41:31,391 INFO L226 Difference]: Without dead ends: 85 [2025-02-06 10:41:31,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1317 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=499, Invalid=6981, Unknown=2, NotChecked=0, Total=7482 [2025-02-06 10:41:31,393 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 137 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 1597 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 1610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 10:41:31,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 797 Invalid, 1610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1597 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 10:41:31,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-02-06 10:41:31,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 78. [2025-02-06 10:41:31,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 63 states have (on average 1.253968253968254) internal successors, (79), 72 states have internal predecessors, (79), 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-06 10:41:31,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2025-02-06 10:41:31,395 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 56 [2025-02-06 10:41:31,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:41:31,395 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2025-02-06 10:41:31,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 50 states have (on average 1.92) internal successors, (96), 46 states have internal predecessors, (96), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-06 10:41:31,395 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2025-02-06 10:41:31,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-06 10:41:31,396 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:41:31,396 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:41:31,410 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-06 10:41:31,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:41:31,596 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 28 more)] === [2025-02-06 10:41:31,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:41:31,596 INFO L85 PathProgramCache]: Analyzing trace with hash -901821081, now seen corresponding path program 1 times [2025-02-06 10:41:31,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:41:31,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068448077] [2025-02-06 10:41:31,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:41:31,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:41:31,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-06 10:41:31,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-06 10:41:31,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:41:31,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:41:33,397 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:41:33,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:41:33,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068448077] [2025-02-06 10:41:33,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068448077] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:41:33,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738282652] [2025-02-06 10:41:33,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:41:33,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:41:33,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:41:33,400 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-06 10:41:33,401 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-06 10:41:33,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-06 10:41:33,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-06 10:41:33,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:41:33,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:41:33,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 114 conjuncts are in the unsatisfiable core [2025-02-06 10:41:33,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:41:33,894 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-06 10:41:33,894 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-06 10:41:33,899 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-06 10:41:33,995 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 19 treesize of output 1 [2025-02-06 10:41:34,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 10:41:34,200 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 61 treesize of output 19 [2025-02-06 10:41:34,203 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 17 treesize of output 3 [2025-02-06 10:41:34,210 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-06 10:41:34,212 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-06 10:41:34,419 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-02-06 10:41:34,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 29 [2025-02-06 10:41:34,441 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 11 treesize of output 3 [2025-02-06 10:41:34,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:41:34,451 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 69 treesize of output 52 [2025-02-06 10:41:34,474 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2025-02-06 10:41:34,475 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 34 treesize of output 36 [2025-02-06 10:41:34,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2025-02-06 10:41:34,693 INFO L349 Elim1Store]: treesize reduction 35, result has 48.5 percent of original size [2025-02-06 10:41:34,693 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 1 case distinctions, treesize of input 73 treesize of output 60 [2025-02-06 10:41:34,722 INFO L349 Elim1Store]: treesize reduction 51, result has 25.0 percent of original size [2025-02-06 10:41:34,723 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 1 case distinctions, treesize of input 31 treesize of output 30 [2025-02-06 10:41:34,872 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2025-02-06 10:41:34,872 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 123 treesize of output 107 [2025-02-06 10:41:34,890 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2025-02-06 10:41:34,890 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 138 treesize of output 140 [2025-02-06 10:41:34,939 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 7 treesize of output 3 [2025-02-06 10:41:35,130 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 172 treesize of output 124 [2025-02-06 10:41:35,133 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 128 treesize of output 96 [2025-02-06 10:41:35,378 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 93 treesize of output 51 [2025-02-06 10:41:35,381 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 9 treesize of output 3 [2025-02-06 10:41:35,633 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:41:35,633 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:41:35,971 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (and (forall ((v_ArrVal_2035 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2035) .cse0) .cse1) 4))) (forall ((v_ArrVal_2036 (Array Int Int)) (v_ArrVal_2035 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2035) .cse0) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2036) .cse0) .cse1)))))) is different from false [2025-02-06 10:41:38,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738282652] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:41:38,764 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:41:38,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 29] total 61 [2025-02-06 10:41:38,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836819301] [2025-02-06 10:41:38,764 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:41:38,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2025-02-06 10:41:38,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:41:38,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2025-02-06 10:41:38,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=4705, Unknown=46, NotChecked=138, Total=5112 [2025-02-06 10:41:38,766 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand has 62 states, 59 states have (on average 1.6440677966101696) internal successors, (97), 54 states have internal predecessors, (97), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-06 10:41:42,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:41:42,759 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2025-02-06 10:41:42,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-02-06 10:41:42,760 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 59 states have (on average 1.6440677966101696) internal successors, (97), 54 states have internal predecessors, (97), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 56 [2025-02-06 10:41:42,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:41:42,760 INFO L225 Difference]: With dead ends: 87 [2025-02-06 10:41:42,760 INFO L226 Difference]: Without dead ends: 87 [2025-02-06 10:41:42,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1550 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=516, Invalid=8754, Unknown=46, NotChecked=190, Total=9506 [2025-02-06 10:41:42,762 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 114 mSDsluCounter, 1114 mSDsCounter, 0 mSdLazyCounter, 2048 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 2063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:41:42,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 1151 Invalid, 2063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2048 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-06 10:41:42,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-02-06 10:41:42,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 80. [2025-02-06 10:41:42,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 65 states have (on average 1.2307692307692308) internal successors, (80), 74 states have internal predecessors, (80), 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-06 10:41:42,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2025-02-06 10:41:42,765 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 56 [2025-02-06 10:41:42,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:41:42,765 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2025-02-06 10:41:42,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 59 states have (on average 1.6440677966101696) internal successors, (97), 54 states have internal predecessors, (97), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-06 10:41:42,765 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2025-02-06 10:41:42,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-06 10:41:42,765 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:41:42,765 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:41:42,773 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-06 10:41:42,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:41:42,966 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 28 more)] === [2025-02-06 10:41:42,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:41:42,967 INFO L85 PathProgramCache]: Analyzing trace with hash 2108224257, now seen corresponding path program 1 times [2025-02-06 10:41:42,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:41:42,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85243618] [2025-02-06 10:41:42,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:41:42,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:41:42,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-06 10:41:42,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-06 10:41:42,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:41:42,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:41:43,857 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 10:41:43,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:41:43,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85243618] [2025-02-06 10:41:43,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85243618] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:41:43,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694417193] [2025-02-06 10:41:43,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:41:43,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:41:43,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:41:43,863 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-06 10:41:43,866 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-06 10:41:43,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-06 10:41:44,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-06 10:41:44,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:41:44,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:41:44,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 86 conjuncts are in the unsatisfiable core [2025-02-06 10:41:44,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:41:44,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:41:44,324 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-02-06 10:41:44,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 17 [2025-02-06 10:41:44,548 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 29 treesize of output 21 [2025-02-06 10:41:44,551 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-06 10:41:44,836 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-02-06 10:41:44,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 41 [2025-02-06 10:41:44,863 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-02-06 10:41:44,864 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-06 10:41:45,516 INFO L349 Elim1Store]: treesize reduction 29, result has 37.0 percent of original size [2025-02-06 10:41:45,516 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 1 case distinctions, treesize of input 61 treesize of output 39 [2025-02-06 10:41:45,613 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 33 [2025-02-06 10:41:45,703 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 37 treesize of output 29 [2025-02-06 10:41:45,715 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:41:45,715 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 50 treesize of output 54 [2025-02-06 10:41:45,899 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 10:41:45,899 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:41:46,184 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2192 (Array Int Int)) (v_ArrVal_2191 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_22| Int)) (or (< (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_22|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_2191) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2192) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |v_ULTIMATE.start_main_~ptr~0#1.offset_22|)) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_22| 0) (not (= v_ArrVal_2191 (let ((.cse0 (+ |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) .cse0 (select v_ArrVal_2191 .cse0))))))) is different from false [2025-02-06 10:41:46,247 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2192 (Array Int Int)) (v_ArrVal_2191 (Array Int Int)) (|v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_36| Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_22| Int)) (or (< (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_22|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_2191) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2192) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |v_ULTIMATE.start_main_~ptr~0#1.offset_22|)) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_22| 0) (< |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_36| |c_ULTIMATE.start_sll_insert_~last~0#1.offset|) (not (= (let ((.cse0 (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_36| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base|) .cse0 (select v_ArrVal_2191 .cse0))) v_ArrVal_2191)))) is different from false [2025-02-06 10:41:46,264 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2192 (Array Int Int)) (v_ArrVal_2191 (Array Int Int)) (|v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_36| Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_22| Int)) (or (< (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_22|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base| v_ArrVal_2191) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2192) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |v_ULTIMATE.start_main_~ptr~0#1.offset_22|)) (< |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_36| |c_ULTIMATE.start_sll_insert_#t~mem8#1.offset|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_22| 0) (not (= (let ((.cse0 (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_36| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_#t~mem8#1.base|) .cse0 (select v_ArrVal_2191 .cse0))) v_ArrVal_2191)))) is different from false [2025-02-06 10:41:46,279 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2192 (Array Int Int)) (v_ArrVal_2191 (Array Int Int)) (|v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_36| Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_22| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (< (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_22|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| .cse0 v_ArrVal_2191) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_2192) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |v_ULTIMATE.start_main_~ptr~0#1.offset_22|)) (not (= v_ArrVal_2191 (let ((.cse1 (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_36| 4))) (store (select |c_#memory_int#1| .cse0) .cse1 (select v_ArrVal_2191 .cse1))))) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_22| 0) (< |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_36| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))))) is different from false [2025-02-06 10:41:46,295 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2192 (Array Int Int)) (v_ArrVal_2191 (Array Int Int)) (|v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_36| Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_22| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (< (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_22|) (not (= v_ArrVal_2191 (let ((.cse1 (+ |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_36| 4))) (store (select |c_#memory_int#1| .cse0) .cse1 (select v_ArrVal_2191 .cse1))))) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_22| 0) (< |v_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset_36| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| .cse0 v_ArrVal_2191) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_2192) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |v_ULTIMATE.start_main_~ptr~0#1.offset_22|))))) is different from false [2025-02-06 10:41:46,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694417193] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:41:46,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:41:46,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 49 [2025-02-06 10:41:46,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648346970] [2025-02-06 10:41:46,441 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:41:46,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-02-06 10:41:46,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:41:46,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-02-06 10:41:46,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=2701, Unknown=6, NotChecked=540, Total=3422 [2025-02-06 10:41:46,443 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand has 49 states, 47 states have (on average 1.872340425531915) internal successors, (88), 43 states have internal predecessors, (88), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-06 10:41:48,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:41:48,329 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2025-02-06 10:41:48,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-02-06 10:41:48,330 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 47 states have (on average 1.872340425531915) internal successors, (88), 43 states have internal predecessors, (88), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 57 [2025-02-06 10:41:48,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:41:48,330 INFO L225 Difference]: With dead ends: 84 [2025-02-06 10:41:48,330 INFO L226 Difference]: Without dead ends: 84 [2025-02-06 10:41:48,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 755 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=393, Invalid=5627, Unknown=6, NotChecked=780, Total=6806 [2025-02-06 10:41:48,332 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 69 mSDsluCounter, 943 mSDsCounter, 0 mSdLazyCounter, 1231 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 1243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 10:41:48,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 980 Invalid, 1243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1231 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 10:41:48,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-02-06 10:41:48,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 80. [2025-02-06 10:41:48,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 74 states have internal predecessors, (79), 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-06 10:41:48,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2025-02-06 10:41:48,334 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 57 [2025-02-06 10:41:48,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:41:48,334 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2025-02-06 10:41:48,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 47 states have (on average 1.872340425531915) internal successors, (88), 43 states have internal predecessors, (88), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-06 10:41:48,334 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2025-02-06 10:41:48,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-06 10:41:48,335 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:41:48,335 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:41:48,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-02-06 10:41:48,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-02-06 10:41:48,536 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 28 more)] === [2025-02-06 10:41:48,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:41:48,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1130842450, now seen corresponding path program 1 times [2025-02-06 10:41:48,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:41:48,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670378436] [2025-02-06 10:41:48,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:41:48,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:41:48,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-06 10:41:48,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-06 10:41:48,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:41:48,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:41:49,535 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:41:49,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:41:49,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670378436] [2025-02-06 10:41:49,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670378436] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:41:49,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165627434] [2025-02-06 10:41:49,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:41:49,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:41:49,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:41:49,537 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:41:49,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-02-06 10:41:49,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-06 10:41:49,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-06 10:41:49,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:41:49,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:41:49,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-02-06 10:41:49,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:41:49,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 10:41:50,005 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 18 treesize of output 4 [2025-02-06 10:41:50,007 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-06 10:41:50,231 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-02-06 10:41:50,232 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 1 case distinctions, treesize of input 15 treesize of output 15 [2025-02-06 10:41:50,239 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 27 treesize of output 22 [2025-02-06 10:41:50,426 INFO L349 Elim1Store]: treesize reduction 35, result has 48.5 percent of original size [2025-02-06 10:41:50,427 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 1 case distinctions, treesize of input 32 treesize of output 47 [2025-02-06 10:41:50,541 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2025-02-06 10:41:50,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 51 [2025-02-06 10:41:50,556 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 7 treesize of output 3 [2025-02-06 10:41:50,621 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 26 treesize of output 18 [2025-02-06 10:41:50,629 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:41:50,629 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 36 treesize of output 32 [2025-02-06 10:41:50,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2025-02-06 10:41:50,789 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 10:41:50,789 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:41:51,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1165627434] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:41:51,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:41:51,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 29] total 54 [2025-02-06 10:41:51,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128720531] [2025-02-06 10:41:51,414 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:41:51,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-02-06 10:41:51,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:41:51,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-02-06 10:41:51,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=3799, Unknown=6, NotChecked=0, Total=4032 [2025-02-06 10:41:51,417 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand has 54 states, 52 states have (on average 1.6730769230769231) internal successors, (87), 47 states have internal predecessors, (87), 4 states have call successors, (4), 3 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-06 10:41:53,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:41:53,082 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2025-02-06 10:41:53,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-02-06 10:41:53,083 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 52 states have (on average 1.6730769230769231) internal successors, (87), 47 states have internal predecessors, (87), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 59 [2025-02-06 10:41:53,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:41:53,084 INFO L225 Difference]: With dead ends: 81 [2025-02-06 10:41:53,085 INFO L226 Difference]: Without dead ends: 81 [2025-02-06 10:41:53,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1508 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=473, Invalid=7003, Unknown=6, NotChecked=0, Total=7482 [2025-02-06 10:41:53,086 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 84 mSDsluCounter, 1169 mSDsCounter, 0 mSdLazyCounter, 1520 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 1209 SdHoareTripleChecker+Invalid, 1530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 10:41:53,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 1209 Invalid, 1530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1520 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 10:41:53,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-06 10:41:53,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2025-02-06 10:41:53,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 65 states have (on average 1.2) internal successors, (78), 74 states have internal predecessors, (78), 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-06 10:41:53,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2025-02-06 10:41:53,089 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 59 [2025-02-06 10:41:53,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:41:53,089 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2025-02-06 10:41:53,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 52 states have (on average 1.6730769230769231) internal successors, (87), 47 states have internal predecessors, (87), 4 states have call successors, (4), 3 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-06 10:41:53,089 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2025-02-06 10:41:53,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-06 10:41:53,089 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:41:53,089 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:41:53,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-02-06 10:41:53,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-02-06 10:41:53,294 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 28 more)] === [2025-02-06 10:41:53,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:41:53,294 INFO L85 PathProgramCache]: Analyzing trace with hash -656882561, now seen corresponding path program 2 times [2025-02-06 10:41:53,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:41:53,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195066169] [2025-02-06 10:41:53,294 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:41:53,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:41:53,307 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 61 statements into 2 equivalence classes. [2025-02-06 10:41:53,318 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 61 of 61 statements. [2025-02-06 10:41:53,318 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:41:53,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:41:55,015 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 22 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:41:55,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:41:55,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195066169] [2025-02-06 10:41:55,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195066169] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:41:55,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79180377] [2025-02-06 10:41:55,016 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:41:55,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:41:55,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:41:55,018 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:41:55,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-02-06 10:41:55,161 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 61 statements into 2 equivalence classes. [2025-02-06 10:41:55,225 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 61 of 61 statements. [2025-02-06 10:41:55,226 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:41:55,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:41:55,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 136 conjuncts are in the unsatisfiable core [2025-02-06 10:41:55,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:41:55,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 10:41:55,623 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 13 treesize of output 5 [2025-02-06 10:41:55,626 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-02-06 10:41:55,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 10:41:55,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:41:55,964 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 22 treesize of output 17 [2025-02-06 10:41:55,988 INFO L349 Elim1Store]: treesize reduction 96, result has 30.9 percent of original size [2025-02-06 10:41:55,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 36 treesize of output 52 [2025-02-06 10:41:56,761 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 19 treesize of output 11 [2025-02-06 10:41:56,771 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 56 treesize of output 24 [2025-02-06 10:41:56,906 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2025-02-06 10:41:56,906 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 134 treesize of output 64 [2025-02-06 10:41:56,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:41:56,942 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 36 treesize of output 15 [2025-02-06 10:41:57,050 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 82 treesize of output 54 [2025-02-06 10:41:57,206 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-06 10:41:57,498 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:41:57,498 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 50 treesize of output 25 [2025-02-06 10:41:57,753 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 22 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:41:57,753 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:41:58,294 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:41:58,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 113 [2025-02-06 10:41:58,304 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:41:58,305 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 220 treesize of output 219 [2025-02-06 10:41:58,308 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 93 treesize of output 85