./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-crafted/LexIndexValue-Array-1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-crafted/LexIndexValue-Array-1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash d69e4513fb8989bf305d8f9ce21862e8623f2a3d0c8146e8e7fb7e8c658a7eff --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 10:45:30,208 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 10:45:30,260 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-02-06 10:45:30,268 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 10:45:30,268 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 10:45:30,284 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 10:45:30,284 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 10:45:30,284 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 10:45:30,285 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 10:45:30,285 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 10:45:30,285 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 10:45:30,285 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 10:45:30,285 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 10:45:30,285 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 10:45:30,285 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 10:45:30,285 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 10:45:30,285 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 10:45:30,285 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 10:45:30,285 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 10:45:30,285 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 10:45:30,285 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 10:45:30,285 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 10:45:30,286 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 10:45:30,286 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 10:45:30,286 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 10:45:30,286 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 10:45:30,286 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 10:45:30,286 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 10:45:30,286 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 10:45:30,286 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 10:45:30,286 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:45:30,286 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 10:45:30,286 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 10:45:30,286 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 10:45:30,286 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 10:45:30,286 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 10:45:30,286 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 10:45:30,286 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 10:45:30,286 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 10:45:30,286 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d69e4513fb8989bf305d8f9ce21862e8623f2a3d0c8146e8e7fb7e8c658a7eff [2025-02-06 10:45:30,480 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 10:45:30,487 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 10:45:30,489 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 10:45:30,490 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 10:45:30,490 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 10:45:30,491 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/LexIndexValue-Array-1.c [2025-02-06 10:45:31,588 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a13259880/173e832107ce464684b4ea1ba4f7a616/FLAG7b758ccf0 [2025-02-06 10:45:31,864 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 10:45:31,865 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-crafted/LexIndexValue-Array-1.c [2025-02-06 10:45:31,871 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a13259880/173e832107ce464684b4ea1ba4f7a616/FLAG7b758ccf0 [2025-02-06 10:45:32,146 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a13259880/173e832107ce464684b4ea1ba4f7a616 [2025-02-06 10:45:32,148 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 10:45:32,151 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 10:45:32,151 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 10:45:32,152 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 10:45:32,155 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 10:45:32,156 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:45:32" (1/1) ... [2025-02-06 10:45:32,158 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6579ce12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:45:32, skipping insertion in model container [2025-02-06 10:45:32,158 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:45:32" (1/1) ... [2025-02-06 10:45:32,167 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 10:45:32,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:45:32,266 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 10:45:32,277 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:45:32,289 INFO L204 MainTranslator]: Completed translation [2025-02-06 10:45:32,289 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:45:32 WrapperNode [2025-02-06 10:45:32,289 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 10:45:32,290 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 10:45:32,290 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 10:45:32,290 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 10:45:32,294 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:45:32" (1/1) ... [2025-02-06 10:45:32,299 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:45:32" (1/1) ... [2025-02-06 10:45:32,310 INFO L138 Inliner]: procedures = 8, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 46 [2025-02-06 10:45:32,311 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 10:45:32,312 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 10:45:32,312 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 10:45:32,312 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 10:45:32,317 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:45:32" (1/1) ... [2025-02-06 10:45:32,317 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:45:32" (1/1) ... [2025-02-06 10:45:32,322 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:45:32" (1/1) ... [2025-02-06 10:45:32,328 INFO L175 MemorySlicer]: Split 4 memory accesses to 1 slices as follows [4]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 2 writes are split as follows [2]. [2025-02-06 10:45:32,328 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:45:32" (1/1) ... [2025-02-06 10:45:32,329 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:45:32" (1/1) ... [2025-02-06 10:45:32,334 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:45:32" (1/1) ... [2025-02-06 10:45:32,336 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:45:32" (1/1) ... [2025-02-06 10:45:32,336 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:45:32" (1/1) ... [2025-02-06 10:45:32,337 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:45:32" (1/1) ... [2025-02-06 10:45:32,339 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 10:45:32,340 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 10:45:32,340 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 10:45:32,341 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 10:45:32,342 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:45:32" (1/1) ... [2025-02-06 10:45:32,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:45:32,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:45:32,373 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:45:32,384 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:45:32,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 10:45:32,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 10:45:32,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 10:45:32,401 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 10:45:32,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 10:45:32,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 10:45:32,448 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 10:45:32,450 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 10:45:32,547 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L11: call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset; [2025-02-06 10:45:32,553 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-02-06 10:45:32,553 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 10:45:32,559 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 10:45:32,559 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 10:45:32,559 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:45:32 BoogieIcfgContainer [2025-02-06 10:45:32,560 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 10:45:32,561 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 10:45:32,561 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 10:45:32,565 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 10:45:32,565 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 10:45:32" (1/3) ... [2025-02-06 10:45:32,565 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b45fc05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:45:32, skipping insertion in model container [2025-02-06 10:45:32,565 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:45:32" (2/3) ... [2025-02-06 10:45:32,566 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b45fc05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:45:32, skipping insertion in model container [2025-02-06 10:45:32,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:45:32" (3/3) ... [2025-02-06 10:45:32,566 INFO L128 eAbstractionObserver]: Analyzing ICFG LexIndexValue-Array-1.c [2025-02-06 10:45:32,576 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 10:45:32,578 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG LexIndexValue-Array-1.c that has 1 procedures, 28 locations, 1 initial locations, 2 loop locations, and 9 error locations. [2025-02-06 10:45:32,601 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 10:45:32,609 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;@35f186, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 10:45:32,609 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-02-06 10:45:32,612 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 27 states have internal predecessors, (32), 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:45:32,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-06 10:45:32,614 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:45:32,615 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-06 10:45:32,615 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-02-06 10:45:32,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:45:32,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1969150, now seen corresponding path program 1 times [2025-02-06 10:45:32,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:45:32,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326604604] [2025-02-06 10:45:32,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:45:32,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:45:32,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 10:45:32,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 10:45:32,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:45:32,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:45:32,733 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:45:32,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:45:32,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326604604] [2025-02-06 10:45:32,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326604604] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:45:32,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:45:32,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:45:32,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951771163] [2025-02-06 10:45:32,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:45:32,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:45:32,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:45:32,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:45:32,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:45:32,754 INFO L87 Difference]: Start difference. First operand has 28 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 27 states have internal predecessors, (32), 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 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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:45:32,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:45:32,784 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2025-02-06 10:45:32,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:45:32,786 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2025-02-06 10:45:32,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:45:32,789 INFO L225 Difference]: With dead ends: 24 [2025-02-06 10:45:32,790 INFO L226 Difference]: Without dead ends: 22 [2025-02-06 10:45:32,791 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:45:32,793 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 16 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:45:32,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 19 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:45:32,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-02-06 10:45:32,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-02-06 10:45:32,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 21 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:45:32,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2025-02-06 10:45:32,813 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 4 [2025-02-06 10:45:32,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:45:32,813 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2025-02-06 10:45:32,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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:45:32,813 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2025-02-06 10:45:32,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-06 10:45:32,814 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:45:32,814 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-06 10:45:32,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 10:45:32,814 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-02-06 10:45:32,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:45:32,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1969151, now seen corresponding path program 1 times [2025-02-06 10:45:32,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:45:32,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200672340] [2025-02-06 10:45:32,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:45:32,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:45:32,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 10:45:32,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 10:45:32,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:45:32,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:45:32,918 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:45:32,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:45:32,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200672340] [2025-02-06 10:45:32,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200672340] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:45:32,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:45:32,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:45:32,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258294151] [2025-02-06 10:45:32,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:45:32,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:45:32,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:45:32,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:45:32,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:45:32,920 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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:45:32,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:45:32,952 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2025-02-06 10:45:32,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:45:32,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2025-02-06 10:45:32,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:45:32,954 INFO L225 Difference]: With dead ends: 25 [2025-02-06 10:45:32,954 INFO L226 Difference]: Without dead ends: 25 [2025-02-06 10:45:32,954 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:45:32,954 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:45:32,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 34 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:45:32,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-02-06 10:45:32,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2025-02-06 10:45:32,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 23 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:45:32,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2025-02-06 10:45:32,959 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 4 [2025-02-06 10:45:32,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:45:32,959 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2025-02-06 10:45:32,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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:45:32,959 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2025-02-06 10:45:32,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 10:45:32,960 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:45:32,960 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-06 10:45:32,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 10:45:32,960 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-02-06 10:45:32,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:45:32,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1466596354, now seen corresponding path program 1 times [2025-02-06 10:45:32,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:45:32,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420870777] [2025-02-06 10:45:32,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:45:32,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:45:32,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 10:45:32,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 10:45:32,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:45:32,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:45:33,130 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:45:33,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:45:33,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420870777] [2025-02-06 10:45:33,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420870777] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:45:33,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069084898] [2025-02-06 10:45:33,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:45:33,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:45:33,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:45:33,137 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:45:33,141 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:45:33,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 10:45:33,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 10:45:33,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:45:33,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:45:33,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 10:45:33,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:45:33,245 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:45:33,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:45:33,296 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:45:33,366 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:45:33,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069084898] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:45:33,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:45:33,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-06 10:45:33,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489432937] [2025-02-06 10:45:33,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:45:33,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:45:33,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:45:33,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:45:33,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:45:33,370 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 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:45:33,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:45:33,433 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2025-02-06 10:45:33,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:45:33,433 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 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 7 [2025-02-06 10:45:33,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:45:33,435 INFO L225 Difference]: With dead ends: 33 [2025-02-06 10:45:33,435 INFO L226 Difference]: Without dead ends: 33 [2025-02-06 10:45:33,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:45:33,435 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 4 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:45:33,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 45 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:45:33,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-02-06 10:45:33,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-02-06 10:45:33,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 32 states have internal predecessors, (38), 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:45:33,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2025-02-06 10:45:33,441 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 7 [2025-02-06 10:45:33,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:45:33,441 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2025-02-06 10:45:33,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 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:45:33,441 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2025-02-06 10:45:33,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 10:45:33,442 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:45:33,442 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-06 10:45:33,448 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:45:33,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:45:33,647 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-02-06 10:45:33,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:45:33,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1493118371, now seen corresponding path program 1 times [2025-02-06 10:45:33,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:45:33,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126278740] [2025-02-06 10:45:33,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:45:33,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:45:33,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 10:45:33,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 10:45:33,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:45:33,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:45:33,803 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:45:33,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:45:33,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126278740] [2025-02-06 10:45:33,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126278740] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:45:33,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256482986] [2025-02-06 10:45:33,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:45:33,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:45:33,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:45:33,806 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:45:33,807 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:45:33,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 10:45:33,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 10:45:33,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:45:33,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:45:33,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 10:45:33,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:45:33,864 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:45:33,864 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:45:33,893 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:45:33,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256482986] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:45:33,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:45:33,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 11 [2025-02-06 10:45:33,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220587726] [2025-02-06 10:45:33,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:45:33,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 10:45:33,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:45:33,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 10:45:33,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2025-02-06 10:45:33,894 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 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:45:34,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:45:34,011 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2025-02-06 10:45:34,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 10:45:34,012 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 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 12 [2025-02-06 10:45:34,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:45:34,012 INFO L225 Difference]: With dead ends: 49 [2025-02-06 10:45:34,012 INFO L226 Difference]: Without dead ends: 49 [2025-02-06 10:45:34,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2025-02-06 10:45:34,013 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 15 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:45:34,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 64 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:45:34,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-02-06 10:45:34,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2025-02-06 10:45:34,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 47 states have internal predecessors, (55), 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:45:34,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2025-02-06 10:45:34,020 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 12 [2025-02-06 10:45:34,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:45:34,020 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2025-02-06 10:45:34,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 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:45:34,020 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2025-02-06 10:45:34,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 10:45:34,021 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:45:34,021 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1] [2025-02-06 10:45:34,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 10:45:34,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:45:34,222 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-02-06 10:45:34,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:45:34,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1618482369, now seen corresponding path program 2 times [2025-02-06 10:45:34,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:45:34,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20763408] [2025-02-06 10:45:34,222 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:45:34,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:45:34,229 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-02-06 10:45:34,234 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 10:45:34,234 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:45:34,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:45:34,373 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:45:34,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:45:34,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20763408] [2025-02-06 10:45:34,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20763408] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:45:34,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971614118] [2025-02-06 10:45:34,374 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:45:34,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:45:34,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:45:34,376 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:45:34,377 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:45:34,402 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-02-06 10:45:34,411 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 10:45:34,411 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:45:34,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:45:34,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 10:45:34,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:45:34,419 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:45:34,521 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:45:34,521 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:45:34,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971614118] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:45:34,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 10:45:34,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2025-02-06 10:45:34,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043319375] [2025-02-06 10:45:34,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:45:34,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 10:45:34,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:45:34,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 10:45:34,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:45:34,522 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 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:45:34,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:45:34,559 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2025-02-06 10:45:34,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:45:34,560 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 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 16 [2025-02-06 10:45:34,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:45:34,560 INFO L225 Difference]: With dead ends: 47 [2025-02-06 10:45:34,560 INFO L226 Difference]: Without dead ends: 47 [2025-02-06 10:45:34,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:45:34,561 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 2 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:45:34,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 32 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:45:34,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-02-06 10:45:34,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-02-06 10:45:34,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 46 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:45:34,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2025-02-06 10:45:34,563 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 16 [2025-02-06 10:45:34,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:45:34,564 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2025-02-06 10:45:34,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 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:45:34,564 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2025-02-06 10:45:34,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-06 10:45:34,564 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:45:34,564 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:45:34,570 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:45:34,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:45:34,765 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-02-06 10:45:34,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:45:34,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1960714124, now seen corresponding path program 1 times [2025-02-06 10:45:34,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:45:34,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442403501] [2025-02-06 10:45:34,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:45:34,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:45:34,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 10:45:34,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 10:45:34,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:45:34,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:45:34,829 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-02-06 10:45:34,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:45:34,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442403501] [2025-02-06 10:45:34,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442403501] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:45:34,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:45:34,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:45:34,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348953102] [2025-02-06 10:45:34,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:45:34,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:45:34,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:45:34,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:45:34,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:45:34,831 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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:45:34,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:45:34,859 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2025-02-06 10:45:34,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:45:34,860 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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:45:34,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:45:34,860 INFO L225 Difference]: With dead ends: 50 [2025-02-06 10:45:34,860 INFO L226 Difference]: Without dead ends: 50 [2025-02-06 10:45:34,860 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:45:34,862 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 13 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:45:34,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 42 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:45:34,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-02-06 10:45:34,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2025-02-06 10:45:34,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 43 states have (on average 1.2093023255813953) 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:45:34,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2025-02-06 10:45:34,866 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 26 [2025-02-06 10:45:34,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:45:34,866 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2025-02-06 10:45:34,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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:45:34,866 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2025-02-06 10:45:34,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-06 10:45:34,867 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:45:34,867 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:45:34,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 10:45:34,868 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-02-06 10:45:34,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:45:34,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1218973558, now seen corresponding path program 1 times [2025-02-06 10:45:34,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:45:34,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998281185] [2025-02-06 10:45:34,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:45:34,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:45:34,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 10:45:34,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 10:45:34,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:45:34,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:45:34,958 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:45:34,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:45:34,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998281185] [2025-02-06 10:45:34,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998281185] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:45:34,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985455116] [2025-02-06 10:45:34,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:45:34,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:45:34,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:45:34,960 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:45:34,962 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:45:34,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 10:45:34,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 10:45:34,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:45:34,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:45:34,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 10:45:35,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:45:35,025 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:45:35,025 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:45:35,106 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:45:35,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1985455116] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:45:35,106 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:45:35,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2025-02-06 10:45:35,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492471769] [2025-02-06 10:45:35,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:45:35,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-06 10:45:35,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:45:35,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-06 10:45:35,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2025-02-06 10:45:35,108 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 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:45:35,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:45:35,151 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2025-02-06 10:45:35,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 10:45:35,152 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 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) Word has length 28 [2025-02-06 10:45:35,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:45:35,152 INFO L225 Difference]: With dead ends: 71 [2025-02-06 10:45:35,152 INFO L226 Difference]: Without dead ends: 71 [2025-02-06 10:45:35,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2025-02-06 10:45:35,153 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 4 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:45:35,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 78 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:45:35,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-02-06 10:45:35,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-02-06 10:45:35,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 67 states have (on average 1.1343283582089552) internal successors, (76), 70 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:45:35,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2025-02-06 10:45:35,156 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 28 [2025-02-06 10:45:35,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:45:35,156 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2025-02-06 10:45:35,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 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:45:35,156 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2025-02-06 10:45:35,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-06 10:45:35,157 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:45:35,157 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:45:35,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 10:45:35,361 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,SelfDestructingSolverStorable6 [2025-02-06 10:45:35,361 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-02-06 10:45:35,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:45:35,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1772917258, now seen corresponding path program 2 times [2025-02-06 10:45:35,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:45:35,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771135973] [2025-02-06 10:45:35,362 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:45:35,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:45:35,370 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 52 statements into 2 equivalence classes. [2025-02-06 10:45:35,373 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 52 statements. [2025-02-06 10:45:35,373 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 10:45:35,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:45:35,400 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2025-02-06 10:45:35,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:45:35,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771135973] [2025-02-06 10:45:35,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771135973] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:45:35,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:45:35,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:45:35,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867605669] [2025-02-06 10:45:35,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:45:35,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:45:35,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:45:35,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:45:35,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:45:35,401 INFO L87 Difference]: Start difference. First operand 71 states and 76 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:45:35,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:45:35,415 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2025-02-06 10:45:35,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:45:35,416 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 52 [2025-02-06 10:45:35,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:45:35,416 INFO L225 Difference]: With dead ends: 70 [2025-02-06 10:45:35,416 INFO L226 Difference]: Without dead ends: 68 [2025-02-06 10:45:35,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:45:35,417 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 8 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:45:35,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 28 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:45:35,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-02-06 10:45:35,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-02-06 10:45:35,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 65 states have (on average 1.1076923076923078) internal successors, (72), 67 states have internal predecessors, (72), 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:45:35,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2025-02-06 10:45:35,423 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 52 [2025-02-06 10:45:35,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:45:35,424 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2025-02-06 10:45:35,424 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:45:35,424 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2025-02-06 10:45:35,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-06 10:45:35,424 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:45:35,424 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:45:35,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 10:45:35,424 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-02-06 10:45:35,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:45:35,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1329508685, now seen corresponding path program 1 times [2025-02-06 10:45:35,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:45:35,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089506001] [2025-02-06 10:45:35,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:45:35,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:45:35,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-06 10:45:35,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-06 10:45:35,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:45:35,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:45:35,668 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 10:45:35,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:45:35,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089506001] [2025-02-06 10:45:35,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089506001] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:45:35,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432683754] [2025-02-06 10:45:35,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:45:35,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:45:35,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:45:35,675 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:45:35,679 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:45:35,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-06 10:45:35,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-06 10:45:35,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:45:35,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:45:35,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 10:45:35,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:45:35,782 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 10:45:35,782 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:45:36,077 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 10:45:36,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432683754] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:45:36,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:45:36,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2025-02-06 10:45:36,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182444951] [2025-02-06 10:45:36,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:45:36,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-02-06 10:45:36,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:45:36,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-02-06 10:45:36,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2025-02-06 10:45:36,079 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 33 states, 33 states have (on average 3.0303030303030303) internal successors, (100), 33 states have internal predecessors, (100), 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:45:36,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:45:36,178 INFO L93 Difference]: Finished difference Result 116 states and 120 transitions. [2025-02-06 10:45:36,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-02-06 10:45:36,178 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.0303030303030303) internal successors, (100), 33 states have internal predecessors, (100), 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 54 [2025-02-06 10:45:36,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:45:36,179 INFO L225 Difference]: With dead ends: 116 [2025-02-06 10:45:36,179 INFO L226 Difference]: Without dead ends: 116 [2025-02-06 10:45:36,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2025-02-06 10:45:36,180 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:45:36,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 98 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:45:36,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-02-06 10:45:36,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-02-06 10:45:36,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 113 states have (on average 1.0619469026548674) internal successors, (120), 115 states have internal predecessors, (120), 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:45:36,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 120 transitions. [2025-02-06 10:45:36,183 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 120 transitions. Word has length 54 [2025-02-06 10:45:36,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:45:36,183 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 120 transitions. [2025-02-06 10:45:36,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.0303030303030303) internal successors, (100), 33 states have internal predecessors, (100), 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:45:36,184 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 120 transitions. [2025-02-06 10:45:36,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-06 10:45:36,184 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:45:36,184 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:45:36,192 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:45:36,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:45:36,385 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2025-02-06 10:45:36,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:45:36,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1052791219, now seen corresponding path program 2 times [2025-02-06 10:45:36,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:45:36,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116894819] [2025-02-06 10:45:36,386 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:45:36,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:45:36,404 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 102 statements into 2 equivalence classes. [2025-02-06 10:45:36,415 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 102 of 102 statements. [2025-02-06 10:45:36,415 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:45:36,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:45:36,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1338 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1335 trivial. 0 not checked. [2025-02-06 10:45:36,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:45:36,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116894819] [2025-02-06 10:45:36,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116894819] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:45:36,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863005029] [2025-02-06 10:45:36,760 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:45:36,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:45:36,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:45:36,762 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:45:36,763 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:45:36,812 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 102 statements into 2 equivalence classes. [2025-02-06 10:45:36,849 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 102 of 102 statements. [2025-02-06 10:45:36,849 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:45:36,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:45:36,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-06 10:45:36,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:45:37,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1338 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 10:45:37,386 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:45:38,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1338 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 10:45:38,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863005029] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:45:38,532 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:45:38,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 33, 33] total 68 [2025-02-06 10:45:38,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720898405] [2025-02-06 10:45:38,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:45:38,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2025-02-06 10:45:38,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:45:38,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2025-02-06 10:45:38,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2028, Invalid=2528, Unknown=0, NotChecked=0, Total=4556 [2025-02-06 10:45:38,556 INFO L87 Difference]: Start difference. First operand 116 states and 120 transitions. Second operand has 68 states, 68 states have (on average 3.0294117647058822) internal successors, (206), 68 states have internal predecessors, (206), 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:45:40,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:45:40,550 INFO L93 Difference]: Finished difference Result 212 states and 217 transitions. [2025-02-06 10:45:40,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2025-02-06 10:45:40,551 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 3.0294117647058822) internal successors, (206), 68 states have internal predecessors, (206), 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 102 [2025-02-06 10:45:40,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:45:40,552 INFO L225 Difference]: With dead ends: 212 [2025-02-06 10:45:40,552 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 10:45:40,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2883 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=6380, Invalid=10912, Unknown=0, NotChecked=0, Total=17292 [2025-02-06 10:45:40,557 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 45 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:45:40,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 84 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:45:40,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 10:45:40,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 10:45:40,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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:45:40,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 10:45:40,558 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 102 [2025-02-06 10:45:40,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:45:40,558 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 10:45:40,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 3.0294117647058822) internal successors, (206), 68 states have internal predecessors, (206), 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:45:40,558 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 10:45:40,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 10:45:40,562 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (8 of 9 remaining) [2025-02-06 10:45:40,562 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 9 remaining) [2025-02-06 10:45:40,562 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 9 remaining) [2025-02-06 10:45:40,562 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 9 remaining) [2025-02-06 10:45:40,562 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 9 remaining) [2025-02-06 10:45:40,562 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 9 remaining) [2025-02-06 10:45:40,562 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 9 remaining) [2025-02-06 10:45:40,562 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 9 remaining) [2025-02-06 10:45:40,562 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 9 remaining) [2025-02-06 10:45:40,570 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:45:40,762 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,SelfDestructingSolverStorable9 [2025-02-06 10:45:40,766 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1] [2025-02-06 10:45:40,767 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 10:45:40,770 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 10:45:40 BoogieIcfgContainer [2025-02-06 10:45:40,770 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 10:45:40,770 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 10:45:40,770 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 10:45:40,770 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 10:45:40,771 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:45:32" (3/4) ... [2025-02-06 10:45:40,772 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 10:45:40,778 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-02-06 10:45:40,778 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-06 10:45:40,779 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-06 10:45:40,779 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 10:45:40,831 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 10:45:40,831 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 10:45:40,831 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 10:45:40,832 INFO L158 Benchmark]: Toolchain (without parser) took 8681.01ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 122.8MB in the beginning and 152.8MB in the end (delta: -30.0MB). Peak memory consumption was 2.2MB. Max. memory is 16.1GB. [2025-02-06 10:45:40,833 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 121.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 10:45:40,833 INFO L158 Benchmark]: CACSL2BoogieTranslator took 138.08ms. Allocated memory is still 167.8MB. Free memory was 122.8MB in the beginning and 112.2MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 10:45:40,833 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.17ms. Allocated memory is still 167.8MB. Free memory was 112.2MB in the beginning and 111.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 10:45:40,833 INFO L158 Benchmark]: Boogie Preprocessor took 27.53ms. Allocated memory is still 167.8MB. Free memory was 111.0MB in the beginning and 109.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 10:45:40,833 INFO L158 Benchmark]: IcfgBuilder took 219.94ms. Allocated memory is still 167.8MB. Free memory was 109.9MB in the beginning and 96.9MB in the end (delta: 12.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 10:45:40,834 INFO L158 Benchmark]: TraceAbstraction took 8208.64ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 96.5MB in the beginning and 158.6MB in the end (delta: -62.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 10:45:40,835 INFO L158 Benchmark]: Witness Printer took 60.82ms. Allocated memory is still 201.3MB. Free memory was 158.6MB in the beginning and 152.8MB in the end (delta: 5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 10:45:40,837 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 121.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 138.08ms. Allocated memory is still 167.8MB. Free memory was 122.8MB in the beginning and 112.2MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.17ms. Allocated memory is still 167.8MB. Free memory was 112.2MB in the beginning and 111.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.53ms. Allocated memory is still 167.8MB. Free memory was 111.0MB in the beginning and 109.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 219.94ms. Allocated memory is still 167.8MB. Free memory was 109.9MB in the beginning and 96.9MB in the end (delta: 12.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8208.64ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 96.5MB in the beginning and 158.6MB in the end (delta: -62.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 60.82ms. Allocated memory is still 201.3MB. Free memory was 158.6MB in the beginning and 152.8MB in the end (delta: 5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 10]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 28 locations, 9 error locations. Started 1 CEGAR loops. OverallTime: 8.2s, OverallIterations: 10, TraceHistogramMax: 30, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 112 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 112 mSDsluCounter, 524 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 346 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 633 IncrementalHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 178 mSDtfsCounter, 633 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 538 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3011 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116occurred in iteration=9, InterpolantAutomatonStates: 153, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 5 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 524 NumberOfCodeBlocks, 482 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 706 ConstructedInterpolants, 0 QuantifiedInterpolants, 3528 SizeOfPredicates, 0 NumberOfNonLiveVariables, 940 ConjunctsInSsa, 80 ConjunctsInUnsatCore, 21 InterpolantComputations, 5 PerfectInterpolantSequences, 1724/5448 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-06 10:45:40,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE