./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext/dll_extends_pointer.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/memsafety-ext/dll_extends_pointer.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 b19ed65fc9d9f8e19f4d644b05d37e3da28cb107a90eedb15c652c094a7f23f1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 10:18:09,085 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 10:18:09,163 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:18:09,171 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 10:18:09,175 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 10:18:09,198 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 10:18:09,199 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 10:18:09,199 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 10:18:09,200 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 10:18:09,200 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 10:18:09,200 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 10:18:09,200 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 10:18:09,201 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 10:18:09,201 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 10:18:09,201 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 10:18:09,201 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 10:18:09,201 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 10:18:09,201 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 10:18:09,201 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 10:18:09,201 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 10:18:09,201 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 10:18:09,201 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 10:18:09,201 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 10:18:09,201 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 10:18:09,201 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 10:18:09,202 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 10:18:09,202 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 10:18:09,202 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 10:18:09,202 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 10:18:09,202 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 10:18:09,202 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 10:18:09,202 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 10:18:09,202 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 10:18:09,202 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:18:09,202 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 10:18:09,202 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 10:18:09,202 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 10:18:09,202 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 10:18:09,202 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 10:18:09,203 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 10:18:09,203 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 10:18:09,203 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 10:18:09,203 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 -> b19ed65fc9d9f8e19f4d644b05d37e3da28cb107a90eedb15c652c094a7f23f1 [2025-02-06 10:18:09,468 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 10:18:09,476 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 10:18:09,478 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 10:18:09,479 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 10:18:09,479 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 10:18:09,480 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/dll_extends_pointer.i [2025-02-06 10:18:10,699 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5072bd9de/7fc094858d2947e69d163fcc1439441c/FLAGaf4a607c2 [2025-02-06 10:18:10,997 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 10:18:10,998 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety-ext/dll_extends_pointer.i [2025-02-06 10:18:11,013 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5072bd9de/7fc094858d2947e69d163fcc1439441c/FLAGaf4a607c2 [2025-02-06 10:18:11,032 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5072bd9de/7fc094858d2947e69d163fcc1439441c [2025-02-06 10:18:11,035 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 10:18:11,037 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 10:18:11,038 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 10:18:11,039 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 10:18:11,046 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 10:18:11,047 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:18:11" (1/1) ... [2025-02-06 10:18:11,048 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ef3eaba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:18:11, skipping insertion in model container [2025-02-06 10:18:11,048 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:18:11" (1/1) ... [2025-02-06 10:18:11,078 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 10:18:11,345 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:18:11,354 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 10:18:11,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:18:11,408 INFO L204 MainTranslator]: Completed translation [2025-02-06 10:18:11,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:18:11 WrapperNode [2025-02-06 10:18:11,408 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 10:18:11,409 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 10:18:11,409 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 10:18:11,409 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 10:18:11,413 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:18:11" (1/1) ... [2025-02-06 10:18:11,421 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:18:11" (1/1) ... [2025-02-06 10:18:11,439 INFO L138 Inliner]: procedures = 123, calls = 21, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 60 [2025-02-06 10:18:11,439 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 10:18:11,440 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 10:18:11,440 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 10:18:11,440 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 10:18:11,448 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:18:11" (1/1) ... [2025-02-06 10:18:11,449 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:18:11" (1/1) ... [2025-02-06 10:18:11,453 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:18:11" (1/1) ... [2025-02-06 10:18:11,464 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 7 writes are split as follows [0, 7]. [2025-02-06 10:18:11,464 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:18:11" (1/1) ... [2025-02-06 10:18:11,464 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:18:11" (1/1) ... [2025-02-06 10:18:11,469 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:18:11" (1/1) ... [2025-02-06 10:18:11,470 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:18:11" (1/1) ... [2025-02-06 10:18:11,471 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:18:11" (1/1) ... [2025-02-06 10:18:11,471 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:18:11" (1/1) ... [2025-02-06 10:18:11,473 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 10:18:11,474 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 10:18:11,474 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 10:18:11,474 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 10:18:11,475 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:18:11" (1/1) ... [2025-02-06 10:18:11,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:18:11,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:18:11,504 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:18:11,507 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:18:11,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 10:18:11,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 10:18:11,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 10:18:11,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 10:18:11,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 10:18:11,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 10:18:11,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 10:18:11,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 10:18:11,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 10:18:11,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 10:18:11,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 10:18:11,648 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 10:18:11,650 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 10:18:11,899 INFO L? ?]: Removed 57 outVars from TransFormulas that were not future-live. [2025-02-06 10:18:11,899 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 10:18:11,909 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 10:18:11,909 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 10:18:11,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:18:11 BoogieIcfgContainer [2025-02-06 10:18:11,910 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 10:18:11,912 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 10:18:11,912 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 10:18:11,917 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 10:18:11,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 10:18:11" (1/3) ... [2025-02-06 10:18:11,918 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2850fc05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:18:11, skipping insertion in model container [2025-02-06 10:18:11,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:18:11" (2/3) ... [2025-02-06 10:18:11,919 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2850fc05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:18:11, skipping insertion in model container [2025-02-06 10:18:11,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:18:11" (3/3) ... [2025-02-06 10:18:11,921 INFO L128 eAbstractionObserver]: Analyzing ICFG dll_extends_pointer.i [2025-02-06 10:18:11,932 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 10:18:11,933 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll_extends_pointer.i that has 1 procedures, 58 locations, 1 initial locations, 2 loop locations, and 27 error locations. [2025-02-06 10:18:11,971 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 10:18:11,985 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;@5eec2740, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 10:18:11,986 INFO L334 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2025-02-06 10:18:11,990 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 30 states have (on average 2.066666666666667) internal successors, (62), 57 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:11,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-06 10:18:11,995 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:11,995 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-06 10:18:11,996 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-02-06 10:18:12,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:12,002 INFO L85 PathProgramCache]: Analyzing trace with hash 92316, now seen corresponding path program 1 times [2025-02-06 10:18:12,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:12,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216678842] [2025-02-06 10:18:12,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:12,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:12,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 10:18:12,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 10:18:12,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:12,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:12,215 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:18:12,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:12,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216678842] [2025-02-06 10:18:12,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216678842] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:18:12,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:18:12,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:18:12,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318911459] [2025-02-06 10:18:12,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:18:12,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:18:12,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:12,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:18:12,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:18:12,249 INFO L87 Difference]: Start difference. First operand has 58 states, 30 states have (on average 2.066666666666667) internal successors, (62), 57 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:12,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:12,357 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2025-02-06 10:18:12,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:18:12,359 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-02-06 10:18:12,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:12,365 INFO L225 Difference]: With dead ends: 55 [2025-02-06 10:18:12,365 INFO L226 Difference]: Without dead ends: 53 [2025-02-06 10:18:12,366 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:18:12,370 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 23 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:12,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 36 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:18:12,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-02-06 10:18:12,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2025-02-06 10:18:12,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 32 states have (on average 1.78125) internal successors, (57), 51 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:12,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2025-02-06 10:18:12,405 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 3 [2025-02-06 10:18:12,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:12,406 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2025-02-06 10:18:12,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:12,406 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2025-02-06 10:18:12,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-06 10:18:12,406 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:12,406 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-06 10:18:12,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 10:18:12,407 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-02-06 10:18:12,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:12,407 INFO L85 PathProgramCache]: Analyzing trace with hash 92317, now seen corresponding path program 1 times [2025-02-06 10:18:12,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:12,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653962064] [2025-02-06 10:18:12,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:12,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:12,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 10:18:12,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 10:18:12,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:12,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:12,516 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:18:12,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:12,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653962064] [2025-02-06 10:18:12,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653962064] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:18:12,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:18:12,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:18:12,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815387761] [2025-02-06 10:18:12,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:18:12,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:18:12,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:12,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:18:12,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:18:12,518 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:12,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:12,589 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2025-02-06 10:18:12,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:18:12,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-02-06 10:18:12,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:12,590 INFO L225 Difference]: With dead ends: 48 [2025-02-06 10:18:12,592 INFO L226 Difference]: Without dead ends: 48 [2025-02-06 10:18:12,592 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:18:12,593 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 10 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:12,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 50 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:18:12,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-02-06 10:18:12,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2025-02-06 10:18:12,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 32 states have (on average 1.625) internal successors, (52), 46 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:12,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2025-02-06 10:18:12,601 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 3 [2025-02-06 10:18:12,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:12,601 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2025-02-06 10:18:12,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:12,601 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2025-02-06 10:18:12,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-06 10:18:12,602 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:12,602 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:18:12,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 10:18:12,603 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-02-06 10:18:12,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:12,604 INFO L85 PathProgramCache]: Analyzing trace with hash 2083637112, now seen corresponding path program 1 times [2025-02-06 10:18:12,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:12,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053153281] [2025-02-06 10:18:12,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:12,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:12,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 10:18:12,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 10:18:12,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:12,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:12,736 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:18:12,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:12,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053153281] [2025-02-06 10:18:12,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053153281] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:18:12,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:18:12,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:18:12,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211621101] [2025-02-06 10:18:12,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:18:12,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:18:12,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:12,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:18:12,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:18:12,740 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:12,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:12,851 INFO L93 Difference]: Finished difference Result 68 states and 81 transitions. [2025-02-06 10:18:12,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:18:12,852 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-06 10:18:12,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:12,854 INFO L225 Difference]: With dead ends: 68 [2025-02-06 10:18:12,854 INFO L226 Difference]: Without dead ends: 68 [2025-02-06 10:18:12,854 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:18:12,855 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 30 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:12,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 52 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:18:12,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-02-06 10:18:12,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 48. [2025-02-06 10:18:12,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 33 states have (on average 1.606060606060606) internal successors, (53), 47 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:12,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2025-02-06 10:18:12,864 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 10 [2025-02-06 10:18:12,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:12,865 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2025-02-06 10:18:12,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:12,865 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2025-02-06 10:18:12,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-06 10:18:12,865 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:12,865 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:18:12,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 10:18:12,865 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-02-06 10:18:12,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:12,866 INFO L85 PathProgramCache]: Analyzing trace with hash 2083637912, now seen corresponding path program 1 times [2025-02-06 10:18:12,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:12,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258099658] [2025-02-06 10:18:12,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:12,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:12,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 10:18:12,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 10:18:12,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:12,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:12,994 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:18:12,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:12,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258099658] [2025-02-06 10:18:12,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258099658] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:18:12,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:18:12,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:18:12,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729027045] [2025-02-06 10:18:12,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:18:12,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:18:12,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:12,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:18:12,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:18:12,997 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:13,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:13,096 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2025-02-06 10:18:13,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:18:13,097 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-06 10:18:13,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:13,098 INFO L225 Difference]: With dead ends: 52 [2025-02-06 10:18:13,098 INFO L226 Difference]: Without dead ends: 52 [2025-02-06 10:18:13,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:18:13,099 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 24 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:13,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 35 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:18:13,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-02-06 10:18:13,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2025-02-06 10:18:13,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 49 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:13,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2025-02-06 10:18:13,108 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 10 [2025-02-06 10:18:13,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:13,108 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2025-02-06 10:18:13,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:13,108 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2025-02-06 10:18:13,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-06 10:18:13,109 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:13,109 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:18:13,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 10:18:13,109 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-02-06 10:18:13,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:13,109 INFO L85 PathProgramCache]: Analyzing trace with hash 2083637913, now seen corresponding path program 1 times [2025-02-06 10:18:13,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:13,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737030096] [2025-02-06 10:18:13,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:13,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:13,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 10:18:13,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 10:18:13,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:13,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:13,311 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:18:13,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:13,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737030096] [2025-02-06 10:18:13,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737030096] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:18:13,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:18:13,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:18:13,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057767753] [2025-02-06 10:18:13,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:18:13,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:18:13,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:13,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:18:13,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:18:13,314 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:13,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:13,411 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2025-02-06 10:18:13,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:18:13,412 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-06 10:18:13,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:13,412 INFO L225 Difference]: With dead ends: 69 [2025-02-06 10:18:13,413 INFO L226 Difference]: Without dead ends: 69 [2025-02-06 10:18:13,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:18:13,414 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 21 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:13,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 59 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:18:13,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-02-06 10:18:13,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2025-02-06 10:18:13,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 52 states have (on average 1.5) internal successors, (78), 65 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:13,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2025-02-06 10:18:13,420 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 10 [2025-02-06 10:18:13,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:13,420 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2025-02-06 10:18:13,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:13,423 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2025-02-06 10:18:13,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-06 10:18:13,423 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:13,423 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:18:13,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 10:18:13,424 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-02-06 10:18:13,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:13,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1462355090, now seen corresponding path program 1 times [2025-02-06 10:18:13,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:13,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021227586] [2025-02-06 10:18:13,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:13,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:13,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 10:18:13,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 10:18:13,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:13,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:13,623 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:18:13,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:13,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021227586] [2025-02-06 10:18:13,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021227586] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:18:13,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:18:13,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:18:13,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10728029] [2025-02-06 10:18:13,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:18:13,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:18:13,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:13,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:18:13,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:18:13,624 INFO L87 Difference]: Start difference. First operand 66 states and 78 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:13,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:13,671 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2025-02-06 10:18:13,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:18:13,672 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-02-06 10:18:13,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:13,672 INFO L225 Difference]: With dead ends: 65 [2025-02-06 10:18:13,673 INFO L226 Difference]: Without dead ends: 65 [2025-02-06 10:18:13,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:18:13,674 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 16 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:13,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 46 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:18:13,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-02-06 10:18:13,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-02-06 10:18:13,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 52 states have (on average 1.4807692307692308) internal successors, (77), 64 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:13,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2025-02-06 10:18:13,678 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 13 [2025-02-06 10:18:13,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:13,679 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2025-02-06 10:18:13,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:13,680 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2025-02-06 10:18:13,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-06 10:18:13,680 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:13,680 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:18:13,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 10:18:13,680 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-02-06 10:18:13,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:13,681 INFO L85 PathProgramCache]: Analyzing trace with hash 811877630, now seen corresponding path program 1 times [2025-02-06 10:18:13,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:13,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569166305] [2025-02-06 10:18:13,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:13,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:13,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 10:18:13,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 10:18:13,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:13,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:14,023 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:18:14,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:14,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569166305] [2025-02-06 10:18:14,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569166305] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:18:14,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:18:14,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 10:18:14,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844659475] [2025-02-06 10:18:14,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:18:14,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:18:14,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:14,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:18:14,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:18:14,025 INFO L87 Difference]: Start difference. First operand 65 states and 77 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:14,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:14,165 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2025-02-06 10:18:14,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:18:14,165 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-02-06 10:18:14,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:14,166 INFO L225 Difference]: With dead ends: 60 [2025-02-06 10:18:14,166 INFO L226 Difference]: Without dead ends: 60 [2025-02-06 10:18:14,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-02-06 10:18:14,167 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 16 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:14,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 87 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:18:14,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-02-06 10:18:14,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-02-06 10:18:14,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 47 states have (on average 1.446808510638298) internal successors, (68), 59 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:14,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2025-02-06 10:18:14,175 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 15 [2025-02-06 10:18:14,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:14,175 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2025-02-06 10:18:14,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:14,175 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2025-02-06 10:18:14,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-06 10:18:14,175 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:14,175 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:18:14,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 10:18:14,176 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-02-06 10:18:14,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:14,176 INFO L85 PathProgramCache]: Analyzing trace with hash 811878335, now seen corresponding path program 1 times [2025-02-06 10:18:14,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:14,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448910427] [2025-02-06 10:18:14,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:14,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:14,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 10:18:14,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 10:18:14,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:14,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:14,248 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:18:14,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:14,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448910427] [2025-02-06 10:18:14,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448910427] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:18:14,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:18:14,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:18:14,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108652447] [2025-02-06 10:18:14,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:18:14,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:18:14,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:14,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:18:14,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:18:14,250 INFO L87 Difference]: Start difference. First operand 60 states and 68 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:14,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:14,331 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2025-02-06 10:18:14,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:18:14,331 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-02-06 10:18:14,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:14,332 INFO L225 Difference]: With dead ends: 74 [2025-02-06 10:18:14,332 INFO L226 Difference]: Without dead ends: 74 [2025-02-06 10:18:14,332 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:18:14,333 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 23 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:14,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 65 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:18:14,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-02-06 10:18:14,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 69. [2025-02-06 10:18:14,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 56 states have (on average 1.5) internal successors, (84), 68 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:14,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 84 transitions. [2025-02-06 10:18:14,338 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 84 transitions. Word has length 15 [2025-02-06 10:18:14,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:14,340 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 84 transitions. [2025-02-06 10:18:14,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:14,340 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2025-02-06 10:18:14,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-06 10:18:14,341 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:14,341 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:18:14,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 10:18:14,341 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-02-06 10:18:14,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:14,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1706608356, now seen corresponding path program 1 times [2025-02-06 10:18:14,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:14,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73064787] [2025-02-06 10:18:14,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:14,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:14,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 10:18:14,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 10:18:14,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:14,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:14,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:14,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:14,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73064787] [2025-02-06 10:18:14,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73064787] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:18:14,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824242697] [2025-02-06 10:18:14,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:14,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:18:14,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:18:14,469 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:18:14,472 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:18:14,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 10:18:14,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 10:18:14,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:14,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:14,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 10:18:14,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:18:14,636 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 13 treesize of output 9 [2025-02-06 10:18:14,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:14,673 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:18:14,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:14,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1824242697] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:18:14,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:18:14,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-02-06 10:18:14,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941564708] [2025-02-06 10:18:14,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:18:14,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:18:14,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:14,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:18:14,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:18:14,716 INFO L87 Difference]: Start difference. First operand 69 states and 84 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:14,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:14,855 INFO L93 Difference]: Finished difference Result 102 states and 119 transitions. [2025-02-06 10:18:14,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:18:14,856 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-02-06 10:18:14,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:14,857 INFO L225 Difference]: With dead ends: 102 [2025-02-06 10:18:14,857 INFO L226 Difference]: Without dead ends: 101 [2025-02-06 10:18:14,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:18:14,857 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 22 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 107 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:18:14,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 107 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:18:14,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-02-06 10:18:14,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 80. [2025-02-06 10:18:14,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 67 states have (on average 1.4328358208955223) internal successors, (96), 79 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:14,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 96 transitions. [2025-02-06 10:18:14,862 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 96 transitions. Word has length 18 [2025-02-06 10:18:14,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:14,862 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 96 transitions. [2025-02-06 10:18:14,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:14,863 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 96 transitions. [2025-02-06 10:18:14,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-06 10:18:14,863 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:14,863 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:18:14,875 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:18:15,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:18:15,068 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-02-06 10:18:15,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:15,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1706609156, now seen corresponding path program 1 times [2025-02-06 10:18:15,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:15,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817606132] [2025-02-06 10:18:15,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:15,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:15,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 10:18:15,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 10:18:15,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:15,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:15,270 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:15,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:15,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817606132] [2025-02-06 10:18:15,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817606132] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:18:15,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722430905] [2025-02-06 10:18:15,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:15,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:18:15,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:18:15,273 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:18:15,275 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:18:15,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 10:18:15,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 10:18:15,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:15,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:15,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-06 10:18:15,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:18:15,382 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:18:15,388 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:18:15,419 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 19 treesize of output 18 [2025-02-06 10:18:15,429 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 19 treesize of output 18 [2025-02-06 10:18:15,483 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:18:15,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2025-02-06 10:18:15,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2025-02-06 10:18:15,689 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:15,690 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:18:15,920 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 10 treesize of output 8 [2025-02-06 10:18:15,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-02-06 10:18:15,938 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 10 treesize of output 8 [2025-02-06 10:18:15,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:18:15,957 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:15,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [722430905] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:18:15,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:18:15,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 7] total 14 [2025-02-06 10:18:15,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958927532] [2025-02-06 10:18:15,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:18:15,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 10:18:15,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:15,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 10:18:15,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-02-06 10:18:15,959 INFO L87 Difference]: Start difference. First operand 80 states and 96 transitions. Second operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:16,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:16,273 INFO L93 Difference]: Finished difference Result 81 states and 96 transitions. [2025-02-06 10:18:16,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 10:18:16,274 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-02-06 10:18:16,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:16,275 INFO L225 Difference]: With dead ends: 81 [2025-02-06 10:18:16,275 INFO L226 Difference]: Without dead ends: 72 [2025-02-06 10:18:16,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2025-02-06 10:18:16,275 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 24 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:16,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 232 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:18:16,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-02-06 10:18:16,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2025-02-06 10:18:16,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 58 states have (on average 1.4827586206896552) internal successors, (86), 70 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:16,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 86 transitions. [2025-02-06 10:18:16,284 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 86 transitions. Word has length 18 [2025-02-06 10:18:16,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:16,284 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 86 transitions. [2025-02-06 10:18:16,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:16,286 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 86 transitions. [2025-02-06 10:18:16,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-06 10:18:16,286 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:16,286 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:18:16,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 10:18:16,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:18:16,487 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-02-06 10:18:16,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:16,488 INFO L85 PathProgramCache]: Analyzing trace with hash -973047576, now seen corresponding path program 1 times [2025-02-06 10:18:16,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:16,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557559341] [2025-02-06 10:18:16,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:16,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:16,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 10:18:16,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 10:18:16,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:16,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:16,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:16,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:16,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557559341] [2025-02-06 10:18:16,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557559341] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:18:16,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:18:16,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:18:16,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552668632] [2025-02-06 10:18:16,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:18:16,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:18:16,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:16,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:18:16,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:18:16,612 INFO L87 Difference]: Start difference. First operand 71 states and 86 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:16,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:16,692 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2025-02-06 10:18:16,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:18:16,693 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-02-06 10:18:16,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:16,693 INFO L225 Difference]: With dead ends: 73 [2025-02-06 10:18:16,693 INFO L226 Difference]: Without dead ends: 73 [2025-02-06 10:18:16,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:18:16,694 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 21 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:16,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 74 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:18:16,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-02-06 10:18:16,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67. [2025-02-06 10:18:16,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 55 states have (on average 1.4) internal successors, (77), 66 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:16,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 77 transitions. [2025-02-06 10:18:16,696 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 77 transitions. Word has length 19 [2025-02-06 10:18:16,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:16,696 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 77 transitions. [2025-02-06 10:18:16,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:16,697 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 77 transitions. [2025-02-06 10:18:16,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 10:18:16,697 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:16,698 INFO L218 NwaCegarLoop]: trace histogram [2, 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:18:16,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 10:18:16,698 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-02-06 10:18:16,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:16,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1231106063, now seen corresponding path program 1 times [2025-02-06 10:18:16,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:16,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236565390] [2025-02-06 10:18:16,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:16,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:16,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 10:18:16,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 10:18:16,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:16,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:16,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:16,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:16,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236565390] [2025-02-06 10:18:16,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236565390] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:18:16,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:18:16,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 10:18:16,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535826581] [2025-02-06 10:18:16,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:18:16,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:18:16,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:16,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:18:16,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:18:16,971 INFO L87 Difference]: Start difference. First operand 67 states and 77 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:17,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:17,107 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2025-02-06 10:18:17,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 10:18:17,107 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-02-06 10:18:17,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:17,108 INFO L225 Difference]: With dead ends: 72 [2025-02-06 10:18:17,108 INFO L226 Difference]: Without dead ends: 72 [2025-02-06 10:18:17,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:18:17,109 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 11 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:17,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 159 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:18:17,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-02-06 10:18:17,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 67. [2025-02-06 10:18:17,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 55 states have (on average 1.3818181818181818) internal successors, (76), 66 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:17,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2025-02-06 10:18:17,111 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 76 transitions. Word has length 24 [2025-02-06 10:18:17,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:17,112 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 76 transitions. [2025-02-06 10:18:17,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:17,112 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2025-02-06 10:18:17,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-06 10:18:17,112 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:17,112 INFO L218 NwaCegarLoop]: trace histogram [2, 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:18:17,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 10:18:17,112 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-02-06 10:18:17,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:17,113 INFO L85 PathProgramCache]: Analyzing trace with hash -490417729, now seen corresponding path program 1 times [2025-02-06 10:18:17,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:17,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560826882] [2025-02-06 10:18:17,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:17,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:17,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 10:18:17,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 10:18:17,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:17,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:17,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:17,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:17,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560826882] [2025-02-06 10:18:17,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560826882] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:18:17,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:18:17,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 10:18:17,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383776951] [2025-02-06 10:18:17,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:18:17,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:18:17,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:17,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:18:17,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:18:17,433 INFO L87 Difference]: Start difference. First operand 67 states and 76 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:17,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:17,586 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2025-02-06 10:18:17,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 10:18:17,586 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-02-06 10:18:17,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:17,587 INFO L225 Difference]: With dead ends: 71 [2025-02-06 10:18:17,587 INFO L226 Difference]: Without dead ends: 71 [2025-02-06 10:18:17,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:18:17,588 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 11 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:17,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 112 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:18:17,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-02-06 10:18:17,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. [2025-02-06 10:18:17,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 66 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:17,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2025-02-06 10:18:17,592 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 75 transitions. Word has length 25 [2025-02-06 10:18:17,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:17,593 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 75 transitions. [2025-02-06 10:18:17,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:17,593 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2025-02-06 10:18:17,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-06 10:18:17,593 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:17,593 INFO L218 NwaCegarLoop]: trace histogram [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:18:17,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 10:18:17,593 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-02-06 10:18:17,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:17,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1976919565, now seen corresponding path program 1 times [2025-02-06 10:18:17,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:17,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273519602] [2025-02-06 10:18:17,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:17,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:17,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 10:18:17,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 10:18:17,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:17,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:17,914 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:17,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:17,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273519602] [2025-02-06 10:18:17,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273519602] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:18:17,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:18:17,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 10:18:17,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016962060] [2025-02-06 10:18:17,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:18:17,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:18:17,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:17,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:18:17,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:18:17,917 INFO L87 Difference]: Start difference. First operand 67 states and 75 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:18,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:18,046 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2025-02-06 10:18:18,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 10:18:18,046 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-02-06 10:18:18,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:18,047 INFO L225 Difference]: With dead ends: 67 [2025-02-06 10:18:18,047 INFO L226 Difference]: Without dead ends: 67 [2025-02-06 10:18:18,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:18:18,048 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 12 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:18,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 85 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:18:18,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-02-06 10:18:18,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-02-06 10:18:18,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 66 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:18,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2025-02-06 10:18:18,053 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 26 [2025-02-06 10:18:18,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:18,053 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2025-02-06 10:18:18,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:18,053 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2025-02-06 10:18:18,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-06 10:18:18,054 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:18,054 INFO L218 NwaCegarLoop]: trace histogram [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:18:18,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 10:18:18,055 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-02-06 10:18:18,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:18,056 INFO L85 PathProgramCache]: Analyzing trace with hash 311282361, now seen corresponding path program 1 times [2025-02-06 10:18:18,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:18,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798777952] [2025-02-06 10:18:18,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:18,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:18,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 10:18:18,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 10:18:18,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:18,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:18,323 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:18,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:18,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798777952] [2025-02-06 10:18:18,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798777952] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:18:18,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296094067] [2025-02-06 10:18:18,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:18,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:18:18,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:18:18,326 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:18:18,328 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:18:18,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 10:18:18,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 10:18:18,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:18,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:18,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-06 10:18:18,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:18:18,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-02-06 10:18:18,477 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:18:18,477 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 11 treesize of output 11 [2025-02-06 10:18:18,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:18:18,542 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:18:18,542 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 33 treesize of output 32 [2025-02-06 10:18:18,589 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:18:18,689 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:18:18,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 15 [2025-02-06 10:18:18,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:18,701 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:18:18,882 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:18:18,882 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 19 treesize of output 20 [2025-02-06 10:18:18,890 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:18:18,890 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 33 treesize of output 33 [2025-02-06 10:18:18,895 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 20 treesize of output 18 [2025-02-06 10:18:19,035 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:19,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296094067] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:18:19,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:18:19,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 22 [2025-02-06 10:18:19,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802546258] [2025-02-06 10:18:19,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:18:19,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-06 10:18:19,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:19,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-06 10:18:19,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=389, Unknown=7, NotChecked=0, Total=462 [2025-02-06 10:18:19,037 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:19,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:19,786 INFO L93 Difference]: Finished difference Result 97 states and 111 transitions. [2025-02-06 10:18:19,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-06 10:18:19,787 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-02-06 10:18:19,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:19,788 INFO L225 Difference]: With dead ends: 97 [2025-02-06 10:18:19,788 INFO L226 Difference]: Without dead ends: 97 [2025-02-06 10:18:19,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=331, Invalid=1302, Unknown=7, NotChecked=0, Total=1640 [2025-02-06 10:18:19,791 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 122 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:19,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 195 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:18:19,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-02-06 10:18:19,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 70. [2025-02-06 10:18:19,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 69 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:19,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2025-02-06 10:18:19,797 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 26 [2025-02-06 10:18:19,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:19,797 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2025-02-06 10:18:19,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 22 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:19,798 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2025-02-06 10:18:19,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-06 10:18:19,798 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:19,798 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 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:18:19,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 10:18:19,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:18:19,999 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-02-06 10:18:19,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:19,999 INFO L85 PathProgramCache]: Analyzing trace with hash 311283161, now seen corresponding path program 1 times [2025-02-06 10:18:20,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:20,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924242572] [2025-02-06 10:18:20,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:20,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:20,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 10:18:20,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 10:18:20,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:20,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:20,228 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:20,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:20,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924242572] [2025-02-06 10:18:20,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924242572] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:18:20,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419300998] [2025-02-06 10:18:20,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:20,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:18:20,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:18:20,230 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:18:20,233 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:18:20,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 10:18:20,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 10:18:20,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:20,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:20,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-06 10:18:20,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:18:20,335 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:18:20,351 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:18:20,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 10:18:20,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:18:20,403 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:18:20,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-02-06 10:18:20,437 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 29 treesize of output 24 [2025-02-06 10:18:20,547 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:18:20,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 16 [2025-02-06 10:18:20,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-06 10:18:20,603 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:20,604 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:18:20,860 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:18:20,860 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 45 treesize of output 49 [2025-02-06 10:18:20,983 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:18:20,984 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 19 treesize of output 20 [2025-02-06 10:18:20,993 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:18:20,994 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 33 treesize of output 33 [2025-02-06 10:18:21,000 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 20 treesize of output 18 [2025-02-06 10:18:21,029 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-06 10:18:21,029 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 18 treesize of output 1 [2025-02-06 10:18:21,095 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:21,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419300998] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:18:21,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:18:21,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 23 [2025-02-06 10:18:21,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113651294] [2025-02-06 10:18:21,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:18:21,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-06 10:18:21,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:21,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-06 10:18:21,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=481, Unknown=2, NotChecked=0, Total=552 [2025-02-06 10:18:21,097 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand has 24 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 24 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:21,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:21,898 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2025-02-06 10:18:21,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-06 10:18:21,898 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 24 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-02-06 10:18:21,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:21,899 INFO L225 Difference]: With dead ends: 81 [2025-02-06 10:18:21,899 INFO L226 Difference]: Without dead ends: 81 [2025-02-06 10:18:21,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=320, Invalid=1400, Unknown=2, NotChecked=0, Total=1722 [2025-02-06 10:18:21,901 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 112 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:21,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 173 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 10:18:21,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-06 10:18:21,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 74. [2025-02-06 10:18:21,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 62 states have (on average 1.3548387096774193) internal successors, (84), 73 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:21,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2025-02-06 10:18:21,903 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 26 [2025-02-06 10:18:21,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:21,903 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2025-02-06 10:18:21,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 24 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:21,903 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2025-02-06 10:18:21,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-06 10:18:21,904 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:21,904 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 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:18:21,912 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:18:22,104 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,SelfDestructingSolverStorable15 [2025-02-06 10:18:22,105 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-02-06 10:18:22,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:22,105 INFO L85 PathProgramCache]: Analyzing trace with hash 311283162, now seen corresponding path program 1 times [2025-02-06 10:18:22,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:22,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589323574] [2025-02-06 10:18:22,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:22,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:22,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 10:18:22,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 10:18:22,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:22,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:22,440 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:22,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:22,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589323574] [2025-02-06 10:18:22,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589323574] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:18:22,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352661007] [2025-02-06 10:18:22,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:22,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:18:22,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:18:22,443 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:18:22,447 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:18:22,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 10:18:22,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 10:18:22,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:22,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:22,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-02-06 10:18:22,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:18:22,561 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:18:22,566 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:18:22,637 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 10:18:22,637 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:18:22,648 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:18:22,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 10:18:22,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:18:22,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:18:22,733 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:18:22,734 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 50 treesize of output 45 [2025-02-06 10:18:22,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-02-06 10:18:22,787 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 23 treesize of output 11 [2025-02-06 10:18:22,793 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 29 treesize of output 24 [2025-02-06 10:18:22,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2025-02-06 10:18:22,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-06 10:18:22,961 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:22,961 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:18:23,292 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:18:23,293 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 37 treesize of output 38 [2025-02-06 10:18:23,298 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:18:23,298 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 29 treesize of output 30 [2025-02-06 10:18:23,307 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:18:23,308 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 52 treesize of output 52 [2025-02-06 10:18:23,318 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:18:23,319 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 82 treesize of output 78 [2025-02-06 10:18:23,325 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 15 treesize of output 13 [2025-02-06 10:18:23,331 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 13 treesize of output 11 [2025-02-06 10:18:23,365 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:18:23,366 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 20 treesize of output 21 [2025-02-06 10:18:23,368 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:18:23,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:18:23,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-02-06 10:18:23,558 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:23,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352661007] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:18:23,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:18:23,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 27 [2025-02-06 10:18:23,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989418788] [2025-02-06 10:18:23,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:18:23,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-06 10:18:23,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:23,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-06 10:18:23,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=668, Unknown=2, NotChecked=0, Total=756 [2025-02-06 10:18:23,561 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand has 28 states, 27 states have (on average 2.814814814814815) internal successors, (76), 28 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:24,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:24,222 INFO L93 Difference]: Finished difference Result 93 states and 104 transitions. [2025-02-06 10:18:24,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 10:18:24,223 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.814814814814815) internal successors, (76), 28 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-02-06 10:18:24,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:24,223 INFO L225 Difference]: With dead ends: 93 [2025-02-06 10:18:24,223 INFO L226 Difference]: Without dead ends: 93 [2025-02-06 10:18:24,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=287, Invalid=1271, Unknown=2, NotChecked=0, Total=1560 [2025-02-06 10:18:24,224 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 72 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:24,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 268 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:18:24,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-02-06 10:18:24,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 88. [2025-02-06 10:18:24,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 76 states have (on average 1.3421052631578947) internal successors, (102), 87 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:24,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 102 transitions. [2025-02-06 10:18:24,227 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 102 transitions. Word has length 26 [2025-02-06 10:18:24,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:24,227 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 102 transitions. [2025-02-06 10:18:24,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.814814814814815) internal successors, (76), 28 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:24,228 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 102 transitions. [2025-02-06 10:18:24,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 10:18:24,228 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:24,228 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-06 10:18:24,236 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:18:24,429 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,SelfDestructingSolverStorable16 [2025-02-06 10:18:24,429 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-02-06 10:18:24,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:24,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1175959892, now seen corresponding path program 1 times [2025-02-06 10:18:24,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:24,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375735067] [2025-02-06 10:18:24,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:24,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:24,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 10:18:24,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 10:18:24,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:24,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:24,777 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:24,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:24,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375735067] [2025-02-06 10:18:24,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375735067] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:18:24,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233099860] [2025-02-06 10:18:24,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:24,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:18:24,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:18:24,780 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:18:24,782 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:18:24,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 10:18:24,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 10:18:24,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:24,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:24,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 10:18:24,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:18:24,927 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:18:24,969 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:18:24,969 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 15 [2025-02-06 10:18:24,998 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:24,998 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:18:24,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233099860] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:18:24,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 10:18:24,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 18 [2025-02-06 10:18:24,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405512241] [2025-02-06 10:18:24,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:18:24,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 10:18:24,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:24,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 10:18:24,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2025-02-06 10:18:25,000 INFO L87 Difference]: Start difference. First operand 88 states and 102 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:25,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:25,154 INFO L93 Difference]: Finished difference Result 84 states and 95 transitions. [2025-02-06 10:18:25,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 10:18:25,154 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-02-06 10:18:25,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:25,155 INFO L225 Difference]: With dead ends: 84 [2025-02-06 10:18:25,155 INFO L226 Difference]: Without dead ends: 83 [2025-02-06 10:18:25,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2025-02-06 10:18:25,155 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 18 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:25,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 160 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:18:25,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-02-06 10:18:25,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2025-02-06 10:18:25,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 69 states have (on average 1.3333333333333333) internal successors, (92), 80 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:25,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 92 transitions. [2025-02-06 10:18:25,158 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 92 transitions. Word has length 27 [2025-02-06 10:18:25,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:25,158 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 92 transitions. [2025-02-06 10:18:25,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:25,159 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 92 transitions. [2025-02-06 10:18:25,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-06 10:18:25,159 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:25,159 INFO L218 NwaCegarLoop]: trace histogram [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:18:25,167 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:18:25,363 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,SelfDestructingSolverStorable17 [2025-02-06 10:18:25,363 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-02-06 10:18:25,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:25,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1819176251, now seen corresponding path program 1 times [2025-02-06 10:18:25,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:25,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165099605] [2025-02-06 10:18:25,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:25,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:25,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 10:18:25,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 10:18:25,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:25,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:25,657 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:25,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:25,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165099605] [2025-02-06 10:18:25,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165099605] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:18:25,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:18:25,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 10:18:25,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723639110] [2025-02-06 10:18:25,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:18:25,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 10:18:25,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:25,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 10:18:25,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-06 10:18:25,659 INFO L87 Difference]: Start difference. First operand 81 states and 92 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:25,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:25,825 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2025-02-06 10:18:25,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 10:18:25,825 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-02-06 10:18:25,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:25,826 INFO L225 Difference]: With dead ends: 84 [2025-02-06 10:18:25,826 INFO L226 Difference]: Without dead ends: 84 [2025-02-06 10:18:25,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-02-06 10:18:25,826 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 21 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:25,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 109 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:18:25,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-02-06 10:18:25,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2025-02-06 10:18:25,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 69 states have (on average 1.318840579710145) internal successors, (91), 80 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:25,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2025-02-06 10:18:25,829 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 29 [2025-02-06 10:18:25,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:25,829 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2025-02-06 10:18:25,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:25,829 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2025-02-06 10:18:25,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-06 10:18:25,829 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:25,829 INFO L218 NwaCegarLoop]: trace histogram [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:18:25,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 10:18:25,830 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-02-06 10:18:25,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:25,830 INFO L85 PathProgramCache]: Analyzing trace with hash 176687672, now seen corresponding path program 1 times [2025-02-06 10:18:25,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:25,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272988690] [2025-02-06 10:18:25,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:25,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:25,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 10:18:25,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 10:18:25,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:25,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:26,333 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:26,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:26,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272988690] [2025-02-06 10:18:26,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272988690] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:18:26,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032962766] [2025-02-06 10:18:26,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:26,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:18:26,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:18:26,337 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:18:26,338 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:18:26,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 10:18:26,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 10:18:26,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:26,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:26,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-02-06 10:18:26,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:18:26,438 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:18:26,460 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:18:26,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 10:18:26,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:18:26,481 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:18:26,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-02-06 10:18:26,509 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2025-02-06 10:18:26,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2025-02-06 10:18:26,519 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 45 treesize of output 25 [2025-02-06 10:18:26,662 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:18:26,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 46 treesize of output 38 [2025-02-06 10:18:26,738 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 10:18:26,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-02-06 10:18:26,773 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:18:26,778 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:26,778 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:18:27,317 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:18:27,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 406 treesize of output 456 [2025-02-06 10:18:27,661 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:18:27,662 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 18 treesize of output 19 [2025-02-06 10:18:27,669 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:18:27,669 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 30 treesize of output 30 [2025-02-06 10:18:27,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2025-02-06 10:18:27,689 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-06 10:18:27,689 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 19 treesize of output 1 [2025-02-06 10:18:27,695 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-06 10:18:27,695 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 1 [2025-02-06 10:18:27,768 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:27,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032962766] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:18:27,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:18:27,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 16] total 36 [2025-02-06 10:18:27,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254770834] [2025-02-06 10:18:27,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:18:27,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-02-06 10:18:27,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:27,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-02-06 10:18:27,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1175, Unknown=0, NotChecked=0, Total=1332 [2025-02-06 10:18:27,769 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand has 37 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 37 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:28,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:28,448 INFO L93 Difference]: Finished difference Result 88 states and 98 transitions. [2025-02-06 10:18:28,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-06 10:18:28,449 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 37 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-02-06 10:18:28,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:28,449 INFO L225 Difference]: With dead ends: 88 [2025-02-06 10:18:28,449 INFO L226 Difference]: Without dead ends: 88 [2025-02-06 10:18:28,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 719 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=416, Invalid=2236, Unknown=0, NotChecked=0, Total=2652 [2025-02-06 10:18:28,450 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 116 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:28,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 191 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:18:28,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-02-06 10:18:28,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2025-02-06 10:18:28,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 72 states have (on average 1.3333333333333333) internal successors, (96), 83 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:28,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 96 transitions. [2025-02-06 10:18:28,452 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 96 transitions. Word has length 31 [2025-02-06 10:18:28,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:28,452 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 96 transitions. [2025-02-06 10:18:28,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 37 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:28,453 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 96 transitions. [2025-02-06 10:18:28,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-06 10:18:28,453 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:28,453 INFO L218 NwaCegarLoop]: trace histogram [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:18:28,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-06 10:18:28,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:18:28,654 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-02-06 10:18:28,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:28,654 INFO L85 PathProgramCache]: Analyzing trace with hash 176687673, now seen corresponding path program 1 times [2025-02-06 10:18:28,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:28,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214596877] [2025-02-06 10:18:28,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:28,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:28,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 10:18:28,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 10:18:28,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:28,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:29,074 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:29,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:29,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214596877] [2025-02-06 10:18:29,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214596877] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:18:29,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244962656] [2025-02-06 10:18:29,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:29,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:18:29,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:18:29,078 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:18:29,080 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:18:29,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 10:18:29,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 10:18:29,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:29,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:29,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-02-06 10:18:29,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:18:29,207 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:18:29,209 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:18:29,246 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 10:18:29,247 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:18:29,258 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:18:29,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 10:18:29,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:18:29,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:18:29,327 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:18:29,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 52 [2025-02-06 10:18:29,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-02-06 10:18:29,379 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-02-06 10:18:29,379 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:18:29,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-02-06 10:18:29,419 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 23 treesize of output 11 [2025-02-06 10:18:29,426 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 45 treesize of output 25 [2025-02-06 10:18:29,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2025-02-06 10:18:29,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-06 10:18:29,563 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:29,564 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:18:29,921 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:18:29,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 88 [2025-02-06 10:18:30,149 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:18:30,149 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2025-02-06 10:18:30,162 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:18:30,162 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 74 treesize of output 74 [2025-02-06 10:18:30,171 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:18:30,172 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 62 treesize of output 54 [2025-02-06 10:18:30,181 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:18:30,181 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 94 treesize of output 90 [2025-02-06 10:18:30,187 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 18 treesize of output 16 [2025-02-06 10:18:30,192 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 16 treesize of output 14 [2025-02-06 10:18:30,229 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:18:30,229 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 20 treesize of output 21 [2025-02-06 10:18:30,231 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:18:30,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:18:30,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-02-06 10:18:30,411 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:30,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244962656] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:18:30,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:18:30,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 26 [2025-02-06 10:18:30,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798904773] [2025-02-06 10:18:30,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:18:30,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-06 10:18:30,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:30,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-06 10:18:30,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=620, Unknown=2, NotChecked=0, Total=702 [2025-02-06 10:18:30,413 INFO L87 Difference]: Start difference. First operand 84 states and 96 transitions. Second operand has 27 states, 26 states have (on average 2.8846153846153846) internal successors, (75), 27 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:31,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:31,076 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2025-02-06 10:18:31,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-06 10:18:31,077 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.8846153846153846) internal successors, (75), 27 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-02-06 10:18:31,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:31,077 INFO L225 Difference]: With dead ends: 96 [2025-02-06 10:18:31,077 INFO L226 Difference]: Without dead ends: 96 [2025-02-06 10:18:31,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=261, Invalid=1297, Unknown=2, NotChecked=0, Total=1560 [2025-02-06 10:18:31,080 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 94 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:31,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 232 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:18:31,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-02-06 10:18:31,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 77. [2025-02-06 10:18:31,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 76 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:31,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2025-02-06 10:18:31,083 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 31 [2025-02-06 10:18:31,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:31,084 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2025-02-06 10:18:31,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.8846153846153846) internal successors, (75), 27 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:31,084 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2025-02-06 10:18:31,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-06 10:18:31,084 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:31,084 INFO L218 NwaCegarLoop]: trace histogram [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:18:31,092 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:18:31,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:18:31,285 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-02-06 10:18:31,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:31,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1057152419, now seen corresponding path program 1 times [2025-02-06 10:18:31,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:31,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445968057] [2025-02-06 10:18:31,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:31,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:31,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 10:18:31,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 10:18:31,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:31,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:31,886 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:31,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:31,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445968057] [2025-02-06 10:18:31,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445968057] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:18:31,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555160729] [2025-02-06 10:18:31,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:31,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:18:31,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:18:31,889 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:18:31,891 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:18:31,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 10:18:32,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 10:18:32,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:32,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:32,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-02-06 10:18:32,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:18:32,032 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:18:32,048 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:18:32,052 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:18:32,076 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:18:32,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 10:18:32,100 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 19 treesize of output 18 [2025-02-06 10:18:32,107 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 19 treesize of output 18 [2025-02-06 10:18:32,137 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:18:32,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 54 [2025-02-06 10:18:32,140 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 0 case distinctions, treesize of input 38 treesize of output 36 [2025-02-06 10:18:32,199 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-02-06 10:18:32,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 46 [2025-02-06 10:18:32,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2025-02-06 10:18:32,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2025-02-06 10:18:32,593 INFO L349 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2025-02-06 10:18:32,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 23 [2025-02-06 10:18:32,596 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:32,597 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:18:49,985 INFO L349 Elim1Store]: treesize reduction 862, result has 10.9 percent of original size [2025-02-06 10:18:49,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 1061 treesize of output 681 [2025-02-06 10:18:50,046 INFO L349 Elim1Store]: treesize reduction 187, result has 2.1 percent of original size [2025-02-06 10:18:50,046 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 1157 treesize of output 997 [2025-02-06 10:18:50,104 INFO L349 Elim1Store]: treesize reduction 31, result has 40.4 percent of original size [2025-02-06 10:18:50,104 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 436 treesize of output 328 [2025-02-06 10:18:50,116 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:18:50,122 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:18:50,125 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:18:50,145 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2025-02-06 10:18:50,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 182 treesize of output 152 [2025-02-06 10:18:50,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 68 [2025-02-06 10:18:50,170 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-02-06 10:18:50,170 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 86 treesize of output 76 [2025-02-06 10:18:50,320 INFO L349 Elim1Store]: treesize reduction 1684, result has 2.5 percent of original size [2025-02-06 10:18:50,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 3208 treesize of output 2246 [2025-02-06 10:18:50,362 INFO L349 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2025-02-06 10:18:50,363 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 2 case distinctions, treesize of input 707 treesize of output 417 [2025-02-06 10:18:50,374 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 89 treesize of output 81 [2025-02-06 10:18:50,377 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:18:50,384 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-02-06 10:18:50,384 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 71 treesize of output 61 [2025-02-06 10:18:50,388 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:18:50,408 INFO L349 Elim1Store]: treesize reduction 16, result has 44.8 percent of original size [2025-02-06 10:18:50,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 89 [2025-02-06 10:18:50,418 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 12 treesize of output 6 [2025-02-06 10:18:51,138 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:51,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555160729] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:18:51,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:18:51,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 35 [2025-02-06 10:18:51,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821026063] [2025-02-06 10:18:51,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:18:51,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-02-06 10:18:51,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:51,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-02-06 10:18:51,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1059, Unknown=3, NotChecked=0, Total=1190 [2025-02-06 10:18:51,140 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand has 35 states, 35 states have (on average 2.342857142857143) internal successors, (82), 35 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:53,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:53,771 INFO L93 Difference]: Finished difference Result 128 states and 141 transitions. [2025-02-06 10:18:53,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-02-06 10:18:53,772 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.342857142857143) internal successors, (82), 35 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-02-06 10:18:53,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:53,773 INFO L225 Difference]: With dead ends: 128 [2025-02-06 10:18:53,773 INFO L226 Difference]: Without dead ends: 128 [2025-02-06 10:18:53,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 755 ImplicationChecksByTransitivity, 19.4s TimeCoverageRelationStatistics Valid=454, Invalid=2849, Unknown=3, NotChecked=0, Total=3306 [2025-02-06 10:18:53,775 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 122 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:53,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 323 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-06 10:18:53,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-02-06 10:18:53,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 112. [2025-02-06 10:18:53,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 100 states have (on average 1.25) internal successors, (125), 111 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:53,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 125 transitions. [2025-02-06 10:18:53,779 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 125 transitions. Word has length 31 [2025-02-06 10:18:53,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:53,779 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 125 transitions. [2025-02-06 10:18:53,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.342857142857143) internal successors, (82), 35 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:53,779 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 125 transitions. [2025-02-06 10:18:53,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-06 10:18:53,780 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:53,780 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:18:53,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-06 10:18:53,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:18:53,984 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-02-06 10:18:53,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:53,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1057151714, now seen corresponding path program 1 times [2025-02-06 10:18:53,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:53,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024324530] [2025-02-06 10:18:53,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:53,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:53,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 10:18:54,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 10:18:54,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:54,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:54,244 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:54,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:54,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024324530] [2025-02-06 10:18:54,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024324530] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:18:54,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413795514] [2025-02-06 10:18:54,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:54,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:18:54,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:18:54,248 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:18:54,249 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:18:54,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 10:18:54,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 10:18:54,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:54,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:54,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-06 10:18:54,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:18:54,381 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:18:54,425 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:18:54,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 10:18:54,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:18:54,502 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:18:54,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-02-06 10:18:54,553 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 29 treesize of output 24 [2025-02-06 10:18:54,658 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:18:54,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 16 [2025-02-06 10:18:54,686 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:54,687 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:18:54,941 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:18:54,941 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 18 treesize of output 19 [2025-02-06 10:18:54,954 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:18:54,955 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 30 treesize of output 30 [2025-02-06 10:18:54,961 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 9 [2025-02-06 10:18:55,163 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:55,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413795514] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:18:55,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:18:55,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 21 [2025-02-06 10:18:55,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109317313] [2025-02-06 10:18:55,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:18:55,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-06 10:18:55,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:55,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-06 10:18:55,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=394, Unknown=2, NotChecked=0, Total=462 [2025-02-06 10:18:55,165 INFO L87 Difference]: Start difference. First operand 112 states and 125 transitions. Second operand has 22 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 22 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:56,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:56,173 INFO L93 Difference]: Finished difference Result 126 states and 136 transitions. [2025-02-06 10:18:56,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-06 10:18:56,174 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 22 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-02-06 10:18:56,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:56,174 INFO L225 Difference]: With dead ends: 126 [2025-02-06 10:18:56,174 INFO L226 Difference]: Without dead ends: 126 [2025-02-06 10:18:56,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=331, Invalid=1305, Unknown=4, NotChecked=0, Total=1640 [2025-02-06 10:18:56,175 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 92 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 20 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:56,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 209 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 514 Invalid, 3 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 10:18:56,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-02-06 10:18:56,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 114. [2025-02-06 10:18:56,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 102 states have (on average 1.2450980392156863) internal successors, (127), 113 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:56,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 127 transitions. [2025-02-06 10:18:56,179 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 127 transitions. Word has length 31 [2025-02-06 10:18:56,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:56,179 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 127 transitions. [2025-02-06 10:18:56,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.9047619047619047) internal successors, (61), 22 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:56,179 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 127 transitions. [2025-02-06 10:18:56,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-06 10:18:56,180 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:56,180 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-06 10:18:56,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-06 10:18:56,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-02-06 10:18:56,380 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-02-06 10:18:56,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:56,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1388443941, now seen corresponding path program 2 times [2025-02-06 10:18:56,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:56,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875330879] [2025-02-06 10:18:56,381 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:18:56,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:56,391 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-02-06 10:18:56,397 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 10:18:56,398 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:18:56,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:56,887 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:56,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:56,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875330879] [2025-02-06 10:18:56,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875330879] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:18:56,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070875603] [2025-02-06 10:18:56,888 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:18:56,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:18:56,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:18:56,890 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:18:56,892 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:18:56,993 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-02-06 10:18:57,026 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 10:18:57,026 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:18:57,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:57,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-02-06 10:18:57,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:18:57,095 INFO L349 Elim1Store]: treesize reduction 34, result has 30.6 percent of original size [2025-02-06 10:18:57,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 39 [2025-02-06 10:18:57,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:18:57,220 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:18:57,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 44 [2025-02-06 10:18:57,292 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 42 treesize of output 33 [2025-02-06 10:18:57,496 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:18:57,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 25 [2025-02-06 10:18:57,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 21 treesize of output 37 [2025-02-06 10:18:57,880 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:57,880 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:18:58,037 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~list~0#1.offset_89| Int)) (or (= (store (store |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base| 0) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~y~0#1.base|) |v_ULTIMATE.start_main_~list~0#1.offset_89|) 0) |c_ULTIMATE.start_main_old_#valid#1|) (< |v_ULTIMATE.start_main_~list~0#1.offset_89| 0) (< |c_ULTIMATE.start_main_~y~0#1.offset| |v_ULTIMATE.start_main_~list~0#1.offset_89|))) is different from false [2025-02-06 10:18:58,085 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1262 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_89| Int)) (or (< |v_ULTIMATE.start_main_~list~0#1.offset_89| 0) (< |c_ULTIMATE.start_main_~y~0#1.offset| |v_ULTIMATE.start_main_~list~0#1.offset_89|) (= (store (store |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base| 0) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1262) |c_ULTIMATE.start_main_~y~0#1.base|) |v_ULTIMATE.start_main_~list~0#1.offset_89|) 0) |c_ULTIMATE.start_main_old_#valid#1|))) is different from false [2025-02-06 10:18:58,099 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:18:58,099 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 28 treesize of output 29 [2025-02-06 10:18:58,111 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:18:58,112 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 50 treesize of output 50 [2025-02-06 10:18:58,119 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 19 treesize of output 17 [2025-02-06 10:19:02,595 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:02,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070875603] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:19:02,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:19:02,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 13] total 32 [2025-02-06 10:19:02,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010209581] [2025-02-06 10:19:02,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:19:02,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-02-06 10:19:02,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:02,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-02-06 10:19:02,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=833, Unknown=3, NotChecked=118, Total=1056 [2025-02-06 10:19:02,597 INFO L87 Difference]: Start difference. First operand 114 states and 127 transitions. Second operand has 33 states, 32 states have (on average 2.6875) internal successors, (86), 33 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:04,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:04,118 INFO L93 Difference]: Finished difference Result 161 states and 177 transitions. [2025-02-06 10:19:04,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 10:19:04,119 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.6875) internal successors, (86), 33 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-02-06 10:19:04,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:04,120 INFO L225 Difference]: With dead ends: 161 [2025-02-06 10:19:04,120 INFO L226 Difference]: Without dead ends: 160 [2025-02-06 10:19:04,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=142, Invalid=1123, Unknown=3, NotChecked=138, Total=1406 [2025-02-06 10:19:04,121 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 29 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 957 mSolverCounterSat, 3 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 1129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 957 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 166 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:04,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 413 Invalid, 1129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 957 Invalid, 3 Unknown, 166 Unchecked, 1.2s Time] [2025-02-06 10:19:04,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-02-06 10:19:04,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 139. [2025-02-06 10:19:04,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 127 states have (on average 1.2125984251968505) internal successors, (154), 138 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:04,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 154 transitions. [2025-02-06 10:19:04,124 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 154 transitions. Word has length 34 [2025-02-06 10:19:04,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:04,124 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 154 transitions. [2025-02-06 10:19:04,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.6875) internal successors, (86), 33 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:04,124 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 154 transitions. [2025-02-06 10:19:04,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-06 10:19:04,124 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:04,124 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 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:19:04,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-02-06 10:19:04,329 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,SelfDestructingSolverStorable23 [2025-02-06 10:19:04,329 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-02-06 10:19:04,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:04,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1388444741, now seen corresponding path program 2 times [2025-02-06 10:19:04,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:04,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793136151] [2025-02-06 10:19:04,330 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:19:04,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:04,337 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-02-06 10:19:04,343 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 10:19:04,343 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:19:04,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:04,965 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:04,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:04,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793136151] [2025-02-06 10:19:04,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793136151] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:19:04,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789955574] [2025-02-06 10:19:04,965 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:19:04,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:19:04,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:19:04,967 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:19:04,968 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:19:05,057 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-02-06 10:19:05,082 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 10:19:05,082 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:19:05,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:05,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-02-06 10:19:05,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:19:05,090 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:19:05,116 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:19:05,121 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:19:05,131 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 19 treesize of output 18 [2025-02-06 10:19:05,144 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 19 treesize of output 18 [2025-02-06 10:19:05,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2025-02-06 10:19:05,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-02-06 10:19:05,356 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:19:05,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 10:19:05,442 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 0 case distinctions, treesize of input 26 treesize of output 28 [2025-02-06 10:19:05,457 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 30 treesize of output 21 [2025-02-06 10:19:05,516 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-06 10:19:05,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 110 treesize of output 71 [2025-02-06 10:19:05,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 43 [2025-02-06 10:19:05,599 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-06 10:19:05,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 53 [2025-02-06 10:19:05,608 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 42 treesize of output 25 [2025-02-06 10:19:06,093 INFO L349 Elim1Store]: treesize reduction 33, result has 19.5 percent of original size [2025-02-06 10:19:06,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 82 treesize of output 53 [2025-02-06 10:19:06,115 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:19:06,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2025-02-06 10:19:06,238 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:06,238 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:19:07,032 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset| |c_ULTIMATE.start_main_~list~0#1.base|)))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse0 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (and (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1363 Int) (v_ArrVal_1364 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_98| Int)) (or (< |v_ULTIMATE.start_main_~list~0#1.offset_98| 0) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~list~0#1.base| (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~y~0#1.base| v_ArrVal_1359) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0 |c_ULTIMATE.start_main_~y~0#1.offset|)) |c_ULTIMATE.start_main_~y~0#1.base| v_ArrVal_1364) (select (select (store .cse1 |c_ULTIMATE.start_main_~list~0#1.base| (store .cse2 .cse0 v_ArrVal_1363)) |c_ULTIMATE.start_main_~y~0#1.base|) |v_ULTIMATE.start_main_~list~0#1.offset_98|)) 0) 0) (< |c_ULTIMATE.start_main_~y~0#1.offset| |v_ULTIMATE.start_main_~list~0#1.offset_98|))) (forall ((v_ArrVal_1363 Int) (|v_ULTIMATE.start_main_~list~0#1.offset_98| Int)) (or (< |v_ULTIMATE.start_main_~list~0#1.offset_98| 0) (< |c_ULTIMATE.start_main_~y~0#1.offset| |v_ULTIMATE.start_main_~list~0#1.offset_98|) (= (select (let ((.cse3 (store .cse1 |c_ULTIMATE.start_main_~list~0#1.base| (store .cse2 .cse0 v_ArrVal_1363)))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~y~0#1.base|) |v_ULTIMATE.start_main_~list~0#1.offset_98|))) 0) 0)))))) is different from false [2025-02-06 10:19:08,118 INFO L349 Elim1Store]: treesize reduction 1018, result has 18.4 percent of original size [2025-02-06 10:19:08,118 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 4 case distinctions, treesize of input 670 treesize of output 790 [2025-02-06 10:19:08,193 INFO L349 Elim1Store]: treesize reduction 63, result has 49.2 percent of original size [2025-02-06 10:19:08,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 518 treesize of output 270 [2025-02-06 10:19:08,216 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:19:08,216 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 248 treesize of output 234 [2025-02-06 10:19:08,238 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:19:08,238 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 174 treesize of output 170 [2025-02-06 10:19:08,252 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 91 treesize of output 89 [2025-02-06 10:19:08,268 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 130 treesize of output 126 [2025-02-06 10:19:08,352 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 6 treesize of output 4 [2025-02-06 10:19:08,405 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 6 treesize of output 4 [2025-02-06 10:19:08,503 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:19:08,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 64 [2025-02-06 10:19:08,542 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:19:08,543 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 37 treesize of output 47 [2025-02-06 10:19:08,576 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:19:08,578 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:19:08,592 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:19:08,592 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 122 treesize of output 70 [2025-02-06 10:19:08,598 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:19:08,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 50 [2025-02-06 10:19:08,622 INFO L349 Elim1Store]: treesize reduction 5, result has 73.7 percent of original size [2025-02-06 10:19:08,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 71 [2025-02-06 10:19:08,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-02-06 10:19:08,776 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:08,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789955574] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:19:08,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:19:08,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 18] total 43 [2025-02-06 10:19:08,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94521337] [2025-02-06 10:19:08,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:19:08,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-02-06 10:19:08,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:08,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-02-06 10:19:08,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1560, Unknown=15, NotChecked=80, Total=1806 [2025-02-06 10:19:08,778 INFO L87 Difference]: Start difference. First operand 139 states and 154 transitions. Second operand has 43 states, 43 states have (on average 2.13953488372093) internal successors, (92), 43 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:12,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:12,136 INFO L93 Difference]: Finished difference Result 167 states and 182 transitions. [2025-02-06 10:19:12,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-02-06 10:19:12,137 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.13953488372093) internal successors, (92), 43 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-02-06 10:19:12,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:12,137 INFO L225 Difference]: With dead ends: 167 [2025-02-06 10:19:12,138 INFO L226 Difference]: Without dead ends: 150 [2025-02-06 10:19:12,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 786 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=326, Invalid=3320, Unknown=18, NotChecked=118, Total=3782 [2025-02-06 10:19:12,139 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 92 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 959 mSolverCounterSat, 32 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 1087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 959 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 88 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:12,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 601 Invalid, 1087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 959 Invalid, 8 Unknown, 88 Unchecked, 1.8s Time] [2025-02-06 10:19:12,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-02-06 10:19:12,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2025-02-06 10:19:12,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 136 states have (on average 1.1985294117647058) internal successors, (163), 147 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:12,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 163 transitions. [2025-02-06 10:19:12,145 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 163 transitions. Word has length 34 [2025-02-06 10:19:12,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:12,145 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 163 transitions. [2025-02-06 10:19:12,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.13953488372093) internal successors, (92), 43 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:19:12,145 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 163 transitions. [2025-02-06 10:19:12,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-06 10:19:12,146 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:12,146 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2025-02-06 10:19:12,154 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:19:12,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:19:12,346 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 24 more)] === [2025-02-06 10:19:12,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:12,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1071290748, now seen corresponding path program 1 times [2025-02-06 10:19:12,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:12,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333888020] [2025-02-06 10:19:12,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:12,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:12,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 10:19:12,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 10:19:12,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:12,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:13,306 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:13,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:13,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333888020] [2025-02-06 10:19:13,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333888020] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:19:13,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969988712] [2025-02-06 10:19:13,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:13,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:19:13,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:19:13,309 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:19:13,310 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:19:13,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 10:19:13,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 10:19:13,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:13,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:13,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-02-06 10:19:13,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:19:13,501 INFO L349 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2025-02-06 10:19:13,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 44 [2025-02-06 10:19:13,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:19:13,602 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:19:13,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 51 [2025-02-06 10:19:13,666 INFO L349 Elim1Store]: treesize reduction 90, result has 26.2 percent of original size [2025-02-06 10:19:13,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 81 [2025-02-06 10:19:13,739 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 65 treesize of output 41 [2025-02-06 10:19:14,122 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:19:14,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 74 treesize of output 54 [2025-02-06 10:19:14,358 INFO L349 Elim1Store]: treesize reduction 80, result has 26.6 percent of original size [2025-02-06 10:19:14,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 64 treesize of output 153 [2025-02-06 10:19:14,454 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:19:14,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:19:14,457 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:19:14,467 INFO L349 Elim1Store]: treesize reduction 59, result has 1.7 percent of original size [2025-02-06 10:19:14,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 10 [2025-02-06 10:19:14,533 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:19:14,541 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2025-02-06 10:19:14,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 10 [2025-02-06 10:19:15,700 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:15,700 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:19:16,224 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~list~0#1.offset_105| Int)) (or (< |c_ULTIMATE.start_main_~y~0#1.offset| |v_ULTIMATE.start_main_~list~0#1.offset_105|) (< |v_ULTIMATE.start_main_~list~0#1.offset_105| 0) (= (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~y~0#1.base|))) (store (store (store |c_#valid| (select .cse0 8) 0) |c_ULTIMATE.start_main_~y~0#1.base| 0) (select .cse0 |v_ULTIMATE.start_main_~list~0#1.offset_105|) 0)) |c_ULTIMATE.start_main_old_#valid#1|))) is different from false [2025-02-06 10:19:16,268 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~list~0#1.offset_105| Int)) (or (< |c_ULTIMATE.start_main_~y~0#1.offset| |v_ULTIMATE.start_main_~list~0#1.offset_105|) (= |c_ULTIMATE.start_main_old_#valid#1| (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~y~0#1.base|))) (store (store (store |c_#valid| (select (store .cse0 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) |c_ULTIMATE.start_main_#t~malloc8#1.base|) 8) 0) |c_ULTIMATE.start_main_~y~0#1.base| 0) (select .cse0 |v_ULTIMATE.start_main_~list~0#1.offset_105|) 0))) (< |v_ULTIMATE.start_main_~list~0#1.offset_105| 0))) is different from false [2025-02-06 10:19:16,684 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:19:16,684 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 54 treesize of output 47 [2025-02-06 10:19:16,690 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 78 treesize of output 72 [2025-02-06 10:19:16,705 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:19:16,706 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 55 treesize of output 58 [2025-02-06 10:19:16,745 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:19:16,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 79 [2025-02-06 10:19:27,680 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:27,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969988712] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:19:27,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:19:27,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 19] total 48 [2025-02-06 10:19:27,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650441398] [2025-02-06 10:19:27,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:19:27,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-02-06 10:19:27,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:27,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-02-06 10:19:27,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=2005, Unknown=3, NotChecked=182, Total=2352 [2025-02-06 10:19:27,682 INFO L87 Difference]: Start difference. First operand 148 states and 163 transitions. Second operand has 49 states, 48 states have (on average 2.1458333333333335) internal successors, (103), 49 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)