./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i -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 1ae4a3f744c0a8577333c2c3dfb4ecaabbd2cf6e1675b06577194a98b8d1aee1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 06:18:49,870 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 06:18:49,928 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-02-08 06:18:49,933 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 06:18:49,933 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 06:18:49,946 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 06:18:49,947 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 06:18:49,947 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 06:18:49,948 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 06:18:49,948 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 06:18:49,948 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 06:18:49,949 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 06:18:49,949 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 06:18:49,949 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 06:18:49,949 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 06:18:49,949 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 06:18:49,949 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 06:18:49,950 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 06:18:49,950 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 06:18:49,950 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 06:18:49,950 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 06:18:49,950 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 06:18:49,950 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 06:18:49,950 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 06:18:49,950 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 06:18:49,950 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 06:18:49,950 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 06:18:49,951 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 06:18:49,951 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 06:18:49,951 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 06:18:49,951 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:18:49,951 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 06:18:49,951 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 06:18:49,951 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 06:18:49,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 06:18:49,952 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 06:18:49,952 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 06:18:49,952 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 06:18:49,952 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 06:18:49,952 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 -> 1ae4a3f744c0a8577333c2c3dfb4ecaabbd2cf6e1675b06577194a98b8d1aee1 [2025-02-08 06:18:50,179 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 06:18:50,186 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 06:18:50,187 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 06:18:50,188 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 06:18:50,188 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 06:18:50,190 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i [2025-02-08 06:18:51,278 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7b03eb489/34243008472e41aaafea2b4a17309031/FLAGefa045fc1 [2025-02-08 06:18:51,498 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 06:18:51,498 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i [2025-02-08 06:18:51,503 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7b03eb489/34243008472e41aaafea2b4a17309031/FLAGefa045fc1 [2025-02-08 06:18:51,862 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7b03eb489/34243008472e41aaafea2b4a17309031 [2025-02-08 06:18:51,864 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 06:18:51,865 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 06:18:51,866 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 06:18:51,866 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 06:18:51,868 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 06:18:51,870 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:18:51" (1/1) ... [2025-02-08 06:18:51,871 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@760e8a27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:18:51, skipping insertion in model container [2025-02-08 06:18:51,871 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:18:51" (1/1) ... [2025-02-08 06:18:51,881 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 06:18:51,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:18:51,991 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 06:18:52,006 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:18:52,018 INFO L204 MainTranslator]: Completed translation [2025-02-08 06:18:52,019 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:18:52 WrapperNode [2025-02-08 06:18:52,020 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 06:18:52,020 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 06:18:52,020 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 06:18:52,021 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 06:18:52,026 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:18:52" (1/1) ... [2025-02-08 06:18:52,033 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:18:52" (1/1) ... [2025-02-08 06:18:52,044 INFO L138 Inliner]: procedures = 11, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 29 [2025-02-08 06:18:52,046 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 06:18:52,047 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 06:18:52,047 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 06:18:52,048 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 06:18:52,055 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:18:52" (1/1) ... [2025-02-08 06:18:52,056 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:18:52" (1/1) ... [2025-02-08 06:18:52,060 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:18:52" (1/1) ... [2025-02-08 06:18:52,073 INFO L175 MemorySlicer]: Split 6 memory accesses to 1 slices as follows [6]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 3 writes are split as follows [3]. [2025-02-08 06:18:52,073 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:18:52" (1/1) ... [2025-02-08 06:18:52,074 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:18:52" (1/1) ... [2025-02-08 06:18:52,079 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:18:52" (1/1) ... [2025-02-08 06:18:52,082 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:18:52" (1/1) ... [2025-02-08 06:18:52,083 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:18:52" (1/1) ... [2025-02-08 06:18:52,083 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:18:52" (1/1) ... [2025-02-08 06:18:52,084 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 06:18:52,087 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 06:18:52,087 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 06:18:52,087 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 06:18:52,088 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:18:52" (1/1) ... [2025-02-08 06:18:52,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:18:52,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:18:52,116 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 06:18:52,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 06:18:52,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 06:18:52,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 06:18:52,146 INFO L130 BoogieDeclarations]: Found specification of procedure insertionSort [2025-02-08 06:18:52,146 INFO L138 BoogieDeclarations]: Found implementation of procedure insertionSort [2025-02-08 06:18:52,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 06:18:52,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 06:18:52,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 06:18:52,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 06:18:52,197 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 06:18:52,198 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 06:18:52,350 INFO L? ?]: Removed 44 outVars from TransFormulas that were not future-live. [2025-02-08 06:18:52,351 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 06:18:52,357 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 06:18:52,357 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 06:18:52,357 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:18:52 BoogieIcfgContainer [2025-02-08 06:18:52,357 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 06:18:52,359 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 06:18:52,360 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 06:18:52,363 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 06:18:52,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 06:18:51" (1/3) ... [2025-02-08 06:18:52,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4812baa0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:18:52, skipping insertion in model container [2025-02-08 06:18:52,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:18:52" (2/3) ... [2025-02-08 06:18:52,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4812baa0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:18:52, skipping insertion in model container [2025-02-08 06:18:52,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:18:52" (3/3) ... [2025-02-08 06:18:52,366 INFO L128 eAbstractionObserver]: Analyzing ICFG insertionSort_recursive.i [2025-02-08 06:18:52,378 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 06:18:52,381 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG insertionSort_recursive.i that has 2 procedures, 47 locations, 1 initial locations, 2 loop locations, and 16 error locations. [2025-02-08 06:18:52,422 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 06:18:52,431 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;@1826506e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 06:18:52,432 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-02-08 06:18:52,435 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 43 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:18:52,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 06:18:52,440 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:18:52,441 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 06:18:52,442 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insertionSortErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-02-08 06:18:52,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:18:52,448 INFO L85 PathProgramCache]: Analyzing trace with hash 2492350, now seen corresponding path program 1 times [2025-02-08 06:18:52,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:18:52,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864138579] [2025-02-08 06:18:52,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:18:52,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:18:52,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 06:18:52,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 06:18:52,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:18:52,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:18:52,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:18:52,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:18:52,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864138579] [2025-02-08 06:18:52,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864138579] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:18:52,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:18:52,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:18:52,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465898695] [2025-02-08 06:18:52,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:18:52,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:18:52,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:18:52,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:18:52,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:18:52,646 INFO L87 Difference]: Start difference. First operand has 47 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 43 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 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-08 06:18:52,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:18:52,698 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2025-02-08 06:18:52,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:18:52,700 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-08 06:18:52,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:18:52,703 INFO L225 Difference]: With dead ends: 45 [2025-02-08 06:18:52,704 INFO L226 Difference]: Without dead ends: 42 [2025-02-08 06:18:52,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:18:52,709 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 6 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:18:52,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 67 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:18:52,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-02-08 06:18:52,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-02-08 06:18:52,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 25 states have (on average 1.68) internal successors, (42), 38 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:18:52,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2025-02-08 06:18:52,735 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 4 [2025-02-08 06:18:52,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:18:52,735 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2025-02-08 06:18:52,735 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-08 06:18:52,736 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2025-02-08 06:18:52,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 06:18:52,736 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:18:52,736 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 06:18:52,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 06:18:52,736 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insertionSortErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-02-08 06:18:52,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:18:52,737 INFO L85 PathProgramCache]: Analyzing trace with hash 2492351, now seen corresponding path program 1 times [2025-02-08 06:18:52,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:18:52,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717739112] [2025-02-08 06:18:52,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:18:52,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:18:52,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 06:18:52,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 06:18:52,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:18:52,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:18:52,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:18:52,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:18:52,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717739112] [2025-02-08 06:18:52,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717739112] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:18:52,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:18:52,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:18:52,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316510183] [2025-02-08 06:18:52,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:18:52,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:18:52,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:18:52,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:18:52,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:18:52,926 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 5 states, 4 states have (on average 1.0) internal successors, (4), 4 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-08 06:18:53,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:18:53,003 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2025-02-08 06:18:53,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:18:53,003 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 4 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-08 06:18:53,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:18:53,004 INFO L225 Difference]: With dead ends: 45 [2025-02-08 06:18:53,004 INFO L226 Difference]: Without dead ends: 45 [2025-02-08 06:18:53,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:18:53,004 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 14 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:18:53,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 120 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:18:53,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-02-08 06:18:53,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2025-02-08 06:18:53,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 40 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:18:53,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2025-02-08 06:18:53,009 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 4 [2025-02-08 06:18:53,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:18:53,009 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2025-02-08 06:18:53,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 4 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-08 06:18:53,009 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2025-02-08 06:18:53,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 06:18:53,009 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:18:53,010 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-08 06:18:53,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 06:18:53,010 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insertionSortErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-02-08 06:18:53,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:18:53,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1235165867, now seen corresponding path program 1 times [2025-02-08 06:18:53,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:18:53,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922631882] [2025-02-08 06:18:53,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:18:53,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:18:53,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 06:18:53,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 06:18:53,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:18:53,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:18:53,235 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-08 06:18:53,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:18:53,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922631882] [2025-02-08 06:18:53,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922631882] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:18:53,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732438138] [2025-02-08 06:18:53,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:18:53,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:18:53,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:18:53,238 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:18:53,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 06:18:53,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 06:18:53,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 06:18:53,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:18:53,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:18:53,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-08 06:18:53,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:18:53,318 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 10 treesize of output 9 [2025-02-08 06:18:53,513 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:18:53,514 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:18:53,680 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-08 06:18:53,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732438138] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:18:53,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:18:53,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2025-02-08 06:18:53,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138782324] [2025-02-08 06:18:53,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:18:53,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-08 06:18:53,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:18:53,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-08 06:18:53,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2025-02-08 06:18:53,681 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:18:53,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:18:53,822 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2025-02-08 06:18:53,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:18:53,823 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-08 06:18:53,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:18:53,824 INFO L225 Difference]: With dead ends: 44 [2025-02-08 06:18:53,824 INFO L226 Difference]: Without dead ends: 44 [2025-02-08 06:18:53,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2025-02-08 06:18:53,824 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 13 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:18:53,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 230 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:18:53,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-02-08 06:18:53,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2025-02-08 06:18:53,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 38 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:18:53,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2025-02-08 06:18:53,830 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 7 [2025-02-08 06:18:53,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:18:53,830 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2025-02-08 06:18:53,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:18:53,830 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2025-02-08 06:18:53,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 06:18:53,830 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:18:53,830 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:18:53,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 06:18:54,031 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-08 06:18:54,031 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting insertionSortErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insertionSortErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-02-08 06:18:54,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:18:54,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1837257792, now seen corresponding path program 1 times [2025-02-08 06:18:54,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:18:54,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136228993] [2025-02-08 06:18:54,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:18:54,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:18:54,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 06:18:54,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 06:18:54,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:18:54,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:18:54,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:18:54,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:18:54,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136228993] [2025-02-08 06:18:54,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136228993] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:18:54,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:18:54,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:18:54,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089075396] [2025-02-08 06:18:54,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:18:54,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:18:54,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:18:54,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:18:54,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:18:54,102 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:18:54,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:18:54,160 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2025-02-08 06:18:54,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:18:54,160 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-08 06:18:54,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:18:54,160 INFO L225 Difference]: With dead ends: 37 [2025-02-08 06:18:54,160 INFO L226 Difference]: Without dead ends: 37 [2025-02-08 06:18:54,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:18:54,161 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 45 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:18:54,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 46 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:18:54,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-02-08 06:18:54,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-02-08 06:18:54,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 33 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:18:54,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2025-02-08 06:18:54,163 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 10 [2025-02-08 06:18:54,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:18:54,163 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2025-02-08 06:18:54,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:18:54,166 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2025-02-08 06:18:54,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 06:18:54,166 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:18:54,166 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:18:54,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 06:18:54,167 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting insertionSortErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insertionSortErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-02-08 06:18:54,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:18:54,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1837257793, now seen corresponding path program 1 times [2025-02-08 06:18:54,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:18:54,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151078057] [2025-02-08 06:18:54,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:18:54,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:18:54,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 06:18:54,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 06:18:54,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:18:54,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:18:54,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:18:54,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:18:54,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151078057] [2025-02-08 06:18:54,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151078057] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:18:54,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468449429] [2025-02-08 06:18:54,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:18:54,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:18:54,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:18:54,310 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:18:54,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 06:18:54,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 06:18:54,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 06:18:54,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:18:54,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:18:54,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-08 06:18:54,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:18:54,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:18:54,413 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:18:54,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-02-08 06:18:54,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:18:54,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468449429] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:18:54,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:18:54,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2025-02-08 06:18:54,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027022264] [2025-02-08 06:18:54,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:18:54,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 06:18:54,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:18:54,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 06:18:54,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-02-08 06:18:54,493 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 10 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:18:54,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:18:54,675 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2025-02-08 06:18:54,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 06:18:54,676 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 10 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-08 06:18:54,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:18:54,677 INFO L225 Difference]: With dead ends: 60 [2025-02-08 06:18:54,677 INFO L226 Difference]: Without dead ends: 60 [2025-02-08 06:18:54,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-02-08 06:18:54,678 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 52 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:18:54,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 151 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:18:54,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-02-08 06:18:54,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2025-02-08 06:18:54,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 48 states have internal predecessors, (59), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:18:54,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2025-02-08 06:18:54,682 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 10 [2025-02-08 06:18:54,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:18:54,682 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2025-02-08 06:18:54,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 10 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:18:54,682 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2025-02-08 06:18:54,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-08 06:18:54,683 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:18:54,683 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:18:54,688 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-08 06:18:54,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:18:54,887 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [insertionSortErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-02-08 06:18:54,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:18:54,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1315211277, now seen corresponding path program 1 times [2025-02-08 06:18:54,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:18:54,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890133460] [2025-02-08 06:18:54,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:18:54,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:18:54,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 06:18:54,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 06:18:54,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:18:54,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:18:54,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:18:54,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:18:54,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890133460] [2025-02-08 06:18:54,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890133460] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:18:54,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:18:54,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:18:54,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925257696] [2025-02-08 06:18:54,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:18:54,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:18:54,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:18:54,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:18:54,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:18:54,910 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:18:54,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:18:54,918 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2025-02-08 06:18:54,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:18:54,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2025-02-08 06:18:54,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:18:54,919 INFO L225 Difference]: With dead ends: 53 [2025-02-08 06:18:54,919 INFO L226 Difference]: Without dead ends: 53 [2025-02-08 06:18:54,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:18:54,920 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:18:54,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 62 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:18:54,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-02-08 06:18:54,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-02-08 06:18:54,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 42 states have (on average 1.380952380952381) internal successors, (58), 47 states have internal predecessors, (58), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:18:54,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 64 transitions. [2025-02-08 06:18:54,927 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 64 transitions. Word has length 13 [2025-02-08 06:18:54,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:18:54,927 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 64 transitions. [2025-02-08 06:18:54,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:18:54,929 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2025-02-08 06:18:54,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-08 06:18:54,929 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:18:54,929 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:18:54,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 06:18:54,929 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting insertionSortErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insertionSortErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-02-08 06:18:54,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:18:54,929 INFO L85 PathProgramCache]: Analyzing trace with hash 2142954108, now seen corresponding path program 1 times [2025-02-08 06:18:54,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:18:54,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552139520] [2025-02-08 06:18:54,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:18:54,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:18:54,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 06:18:54,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 06:18:54,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:18:54,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:18:54,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:18:54,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:18:54,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552139520] [2025-02-08 06:18:54,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552139520] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:18:54,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:18:54,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 06:18:54,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707857182] [2025-02-08 06:18:54,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:18:54,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:18:54,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:18:54,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:18:54,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:18:54,982 INFO L87 Difference]: Start difference. First operand 53 states and 64 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:18:55,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:18:55,040 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2025-02-08 06:18:55,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:18:55,041 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-02-08 06:18:55,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:18:55,042 INFO L225 Difference]: With dead ends: 50 [2025-02-08 06:18:55,042 INFO L226 Difference]: Without dead ends: 50 [2025-02-08 06:18:55,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-02-08 06:18:55,042 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 23 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:18:55,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 127 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:18:55,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-02-08 06:18:55,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2025-02-08 06:18:55,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 43 states have internal predecessors, (49), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:18:55,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2025-02-08 06:18:55,050 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 14 [2025-02-08 06:18:55,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:18:55,050 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2025-02-08 06:18:55,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:18:55,050 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2025-02-08 06:18:55,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-08 06:18:55,050 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:18:55,050 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:18:55,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 06:18:55,051 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting insertionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insertionSortErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-02-08 06:18:55,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:18:55,051 INFO L85 PathProgramCache]: Analyzing trace with hash 2007068750, now seen corresponding path program 1 times [2025-02-08 06:18:55,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:18:55,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404473796] [2025-02-08 06:18:55,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:18:55,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:18:55,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 06:18:55,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 06:18:55,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:18:55,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:18:55,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:18:55,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:18:55,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404473796] [2025-02-08 06:18:55,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404473796] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:18:55,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751905622] [2025-02-08 06:18:55,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:18:55,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:18:55,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:18:55,221 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:18:55,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 06:18:55,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 06:18:55,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 06:18:55,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:18:55,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:18:55,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-08 06:18:55,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:18:55,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:18:55,341 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 06:18:55,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751905622] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:18:55,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 06:18:55,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2025-02-08 06:18:55,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671194393] [2025-02-08 06:18:55,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:18:55,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:18:55,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:18:55,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:18:55,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-02-08 06:18:55,342 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:18:55,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:18:55,422 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2025-02-08 06:18:55,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:18:55,423 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-02-08 06:18:55,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:18:55,423 INFO L225 Difference]: With dead ends: 49 [2025-02-08 06:18:55,423 INFO L226 Difference]: Without dead ends: 49 [2025-02-08 06:18:55,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2025-02-08 06:18:55,424 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 22 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:18:55,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 114 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:18:55,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-02-08 06:18:55,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-02-08 06:18:55,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 38 states have (on average 1.263157894736842) internal successors, (48), 43 states have internal predecessors, (48), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:18:55,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2025-02-08 06:18:55,427 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 15 [2025-02-08 06:18:55,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:18:55,427 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2025-02-08 06:18:55,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:18:55,427 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2025-02-08 06:18:55,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-08 06:18:55,427 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:18:55,427 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:18:55,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 06:18:55,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:18:55,628 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [insertionSortErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-02-08 06:18:55,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:18:55,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1197652079, now seen corresponding path program 1 times [2025-02-08 06:18:55,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:18:55,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386413247] [2025-02-08 06:18:55,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:18:55,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:18:55,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 06:18:55,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 06:18:55,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:18:55,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:18:55,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:18:55,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:18:55,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386413247] [2025-02-08 06:18:55,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386413247] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:18:55,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:18:55,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:18:55,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327020306] [2025-02-08 06:18:55,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:18:55,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:18:55,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:18:55,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:18:55,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:18:55,685 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:18:55,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:18:55,710 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2025-02-08 06:18:55,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:18:55,710 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-02-08 06:18:55,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:18:55,712 INFO L225 Difference]: With dead ends: 53 [2025-02-08 06:18:55,712 INFO L226 Difference]: Without dead ends: 51 [2025-02-08 06:18:55,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:18:55,713 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 22 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:18:55,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 86 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:18:55,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-02-08 06:18:55,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2025-02-08 06:18:55,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 38 states have (on average 1.236842105263158) internal successors, (47), 43 states have internal predecessors, (47), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:18:55,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2025-02-08 06:18:55,719 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 15 [2025-02-08 06:18:55,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:18:55,719 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2025-02-08 06:18:55,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:18:55,719 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2025-02-08 06:18:55,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-08 06:18:55,719 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:18:55,719 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:18:55,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 06:18:55,719 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting insertionSortErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insertionSortErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-02-08 06:18:55,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:18:55,720 INFO L85 PathProgramCache]: Analyzing trace with hash -978741731, now seen corresponding path program 1 times [2025-02-08 06:18:55,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:18:55,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867603154] [2025-02-08 06:18:55,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:18:55,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:18:55,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 06:18:55,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 06:18:55,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:18:55,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:18:55,823 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:18:55,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:18:55,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867603154] [2025-02-08 06:18:55,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867603154] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:18:55,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487169999] [2025-02-08 06:18:55,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:18:55,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:18:55,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:18:55,825 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:18:55,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 06:18:55,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 06:18:55,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 06:18:55,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:18:55,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:18:55,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-08 06:18:55,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:18:55,965 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:18:55,965 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:18:56,039 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:18:56,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487169999] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:18:56,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:18:56,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2025-02-08 06:18:56,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629056977] [2025-02-08 06:18:56,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:18:56,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-08 06:18:56,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:18:56,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 06:18:56,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2025-02-08 06:18:56,040 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand has 18 states, 15 states have (on average 2.8) internal successors, (42), 13 states have internal predecessors, (42), 3 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:18:56,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:18:56,147 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2025-02-08 06:18:56,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 06:18:56,149 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 2.8) internal successors, (42), 13 states have internal predecessors, (42), 3 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-02-08 06:18:56,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:18:56,149 INFO L225 Difference]: With dead ends: 77 [2025-02-08 06:18:56,149 INFO L226 Difference]: Without dead ends: 77 [2025-02-08 06:18:56,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 27 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2025-02-08 06:18:56,150 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 51 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:18:56,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 289 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:18:56,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-02-08 06:18:56,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 70. [2025-02-08 06:18:56,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 55 states have (on average 1.1818181818181819) internal successors, (65), 61 states have internal predecessors, (65), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 06:18:56,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2025-02-08 06:18:56,156 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 20 [2025-02-08 06:18:56,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:18:56,156 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2025-02-08 06:18:56,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 2.8) internal successors, (42), 13 states have internal predecessors, (42), 3 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:18:56,157 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2025-02-08 06:18:56,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-08 06:18:56,157 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:18:56,157 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:18:56,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-08 06:18:56,358 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,SelfDestructingSolverStorable9 [2025-02-08 06:18:56,360 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting insertionSortErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insertionSortErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-02-08 06:18:56,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:18:56,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1706600183, now seen corresponding path program 2 times [2025-02-08 06:18:56,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:18:56,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148305280] [2025-02-08 06:18:56,360 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:18:56,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:18:56,365 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-02-08 06:18:56,374 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 06:18:56,375 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:18:56,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:18:56,691 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:18:56,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:18:56,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148305280] [2025-02-08 06:18:56,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148305280] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:18:56,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377814973] [2025-02-08 06:18:56,692 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:18:56,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:18:56,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:18:56,694 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:18:56,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 06:18:56,719 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-02-08 06:18:56,730 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 06:18:56,730 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:18:56,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:18:56,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-08 06:18:56,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:18:56,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 06:18:56,948 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:18:56,948 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:18:57,221 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:18:57,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [377814973] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:18:57,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:18:57,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 27 [2025-02-08 06:18:57,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464431729] [2025-02-08 06:18:57,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:18:57,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-08 06:18:57,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:18:57,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-08 06:18:57,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=682, Unknown=0, NotChecked=0, Total=756 [2025-02-08 06:18:57,223 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand has 28 states, 24 states have (on average 2.5833333333333335) internal successors, (62), 22 states have internal predecessors, (62), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:18:57,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:18:57,974 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2025-02-08 06:18:57,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-08 06:18:57,975 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 24 states have (on average 2.5833333333333335) internal successors, (62), 22 states have internal predecessors, (62), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-02-08 06:18:57,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:18:57,976 INFO L225 Difference]: With dead ends: 93 [2025-02-08 06:18:57,976 INFO L226 Difference]: Without dead ends: 93 [2025-02-08 06:18:57,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=202, Invalid=1690, Unknown=0, NotChecked=0, Total=1892 [2025-02-08 06:18:57,977 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 227 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 06:18:57,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 365 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 06:18:57,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-02-08 06:18:57,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 88. [2025-02-08 06:18:57,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 72 states have (on average 1.2222222222222223) internal successors, (88), 77 states have internal predecessors, (88), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 06:18:57,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 100 transitions. [2025-02-08 06:18:57,987 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 100 transitions. Word has length 23 [2025-02-08 06:18:57,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:18:57,987 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 100 transitions. [2025-02-08 06:18:57,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 24 states have (on average 2.5833333333333335) internal successors, (62), 22 states have internal predecessors, (62), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:18:57,988 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 100 transitions. [2025-02-08 06:18:57,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-08 06:18:57,988 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:18:57,988 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:18:57,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 06:18:58,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-08 06:18:58,189 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting insertionSortErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insertionSortErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-02-08 06:18:58,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:18:58,190 INFO L85 PathProgramCache]: Analyzing trace with hash 90194756, now seen corresponding path program 1 times [2025-02-08 06:18:58,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:18:58,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309683615] [2025-02-08 06:18:58,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:18:58,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:18:58,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 06:18:58,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 06:18:58,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:18:58,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:18:58,305 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-08 06:18:58,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:18:58,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309683615] [2025-02-08 06:18:58,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309683615] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:18:58,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708924614] [2025-02-08 06:18:58,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:18:58,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:18:58,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:18:58,307 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:18:58,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 06:18:58,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 06:18:58,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 06:18:58,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:18:58,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:18:58,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 06:18:58,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:18:58,458 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-08 06:18:58,459 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 06:18:58,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [708924614] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:18:58,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 06:18:58,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 15 [2025-02-08 06:18:58,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461988131] [2025-02-08 06:18:58,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:18:58,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 06:18:58,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:18:58,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 06:18:58,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2025-02-08 06:18:58,460 INFO L87 Difference]: Start difference. First operand 88 states and 100 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:18:58,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:18:58,562 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2025-02-08 06:18:58,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 06:18:58,563 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-02-08 06:18:58,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:18:58,563 INFO L225 Difference]: With dead ends: 87 [2025-02-08 06:18:58,563 INFO L226 Difference]: Without dead ends: 87 [2025-02-08 06:18:58,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2025-02-08 06:18:58,564 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 57 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:18:58,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 59 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:18:58,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-02-08 06:18:58,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-02-08 06:18:58,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 74 states have (on average 1.135135135135135) internal successors, (84), 76 states have internal predecessors, (84), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 06:18:58,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 96 transitions. [2025-02-08 06:18:58,571 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 96 transitions. Word has length 27 [2025-02-08 06:18:58,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:18:58,571 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 96 transitions. [2025-02-08 06:18:58,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:18:58,571 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 96 transitions. [2025-02-08 06:18:58,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-08 06:18:58,571 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:18:58,571 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:18:58,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-08 06:18:58,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-08 06:18:58,772 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [insertionSortErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-02-08 06:18:58,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:18:58,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1453763937, now seen corresponding path program 1 times [2025-02-08 06:18:58,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:18:58,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951198707] [2025-02-08 06:18:58,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:18:58,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:18:58,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 06:18:58,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 06:18:58,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:18:58,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:18:58,824 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-08 06:18:58,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:18:58,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951198707] [2025-02-08 06:18:58,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951198707] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:18:58,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:18:58,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:18:58,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856694533] [2025-02-08 06:18:58,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:18:58,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:18:58,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:18:58,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:18:58,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:18:58,827 INFO L87 Difference]: Start difference. First operand 87 states and 96 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:18:58,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:18:58,843 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2025-02-08 06:18:58,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:18:58,844 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2025-02-08 06:18:58,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:18:58,844 INFO L225 Difference]: With dead ends: 86 [2025-02-08 06:18:58,844 INFO L226 Difference]: Without dead ends: 55 [2025-02-08 06:18:58,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-08 06:18:58,845 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 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-08 06:18:58,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:18:58,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-02-08 06:18:58,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 35. [2025-02-08 06:18:58,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:18:58,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2025-02-08 06:18:58,851 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 28 [2025-02-08 06:18:58,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:18:58,851 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2025-02-08 06:18:58,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:18:58,851 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2025-02-08 06:18:58,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-08 06:18:58,852 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:18:58,852 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:18:58,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 06:18:58,852 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting insertionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insertionSortErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-02-08 06:18:58,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:18:58,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1498929018, now seen corresponding path program 1 times [2025-02-08 06:18:58,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:18:58,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921126190] [2025-02-08 06:18:58,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:18:58,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:18:58,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 06:18:58,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 06:18:58,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:18:58,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:18:58,922 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-08 06:18:58,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:18:58,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921126190] [2025-02-08 06:18:58,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921126190] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:18:58,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567984322] [2025-02-08 06:18:58,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:18:58,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:18:58,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:18:58,925 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:18:58,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 06:18:58,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 06:18:58,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 06:18:58,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:18:58,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:18:58,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 06:18:58,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:18:58,992 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-08 06:18:58,992 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:18:59,034 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-08 06:18:59,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567984322] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:18:59,034 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:18:59,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 11 [2025-02-08 06:18:59,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988861813] [2025-02-08 06:18:59,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:18:59,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 06:18:59,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:18:59,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 06:18:59,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-08 06:18:59,035 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:18:59,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:18:59,121 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2025-02-08 06:18:59,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 06:18:59,122 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-02-08 06:18:59,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:18:59,122 INFO L225 Difference]: With dead ends: 47 [2025-02-08 06:18:59,122 INFO L226 Difference]: Without dead ends: 47 [2025-02-08 06:18:59,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 48 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2025-02-08 06:18:59,122 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 76 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:18:59,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 108 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:18:59,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-02-08 06:18:59,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 37. [2025-02-08 06:18:59,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:18:59,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2025-02-08 06:18:59,124 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 28 [2025-02-08 06:18:59,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:18:59,124 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2025-02-08 06:18:59,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:18:59,124 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2025-02-08 06:18:59,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-08 06:18:59,124 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:18:59,124 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:18:59,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-08 06:18:59,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:18:59,329 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting insertionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insertionSortErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insertionSortErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2025-02-08 06:18:59,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:18:59,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1307226591, now seen corresponding path program 1 times [2025-02-08 06:18:59,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:18:59,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233595048] [2025-02-08 06:18:59,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:18:59,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:18:59,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 06:18:59,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 06:18:59,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:18:59,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:18:59,598 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-08 06:18:59,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:18:59,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233595048] [2025-02-08 06:18:59,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233595048] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:18:59,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189284449] [2025-02-08 06:18:59,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:18:59,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:18:59,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:18:59,601 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:18:59,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 06:18:59,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 06:18:59,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 06:18:59,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:18:59,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:18:59,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-08 06:18:59,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:18:59,815 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-08 06:18:59,816 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:18:59,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-02-08 06:19:00,023 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-08 06:19:00,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189284449] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:19:00,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:19:00,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 24 [2025-02-08 06:19:00,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522360280] [2025-02-08 06:19:00,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:19:00,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-08 06:19:00,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:19:00,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-08 06:19:00,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2025-02-08 06:19:00,025 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 25 states, 24 states have (on average 3.0) internal successors, (72), 23 states have internal predecessors, (72), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:19:00,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:19:00,335 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2025-02-08 06:19:00,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 06:19:00,335 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.0) internal successors, (72), 23 states have internal predecessors, (72), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-02-08 06:19:00,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:19:00,336 INFO L225 Difference]: With dead ends: 45 [2025-02-08 06:19:00,336 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 06:19:00,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 55 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=222, Invalid=900, Unknown=0, NotChecked=0, Total=1122 [2025-02-08 06:19:00,336 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 69 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:19:00,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 43 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:19:00,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 06:19:00,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 06:19:00,337 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-08 06:19:00,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 06:19:00,337 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2025-02-08 06:19:00,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:19:00,337 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 06:19:00,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.0) internal successors, (72), 23 states have internal predecessors, (72), 4 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:19:00,337 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 06:19:00,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 06:19:00,341 INFO L782 garLoopResultBuilder]: Registering result SAFE for location insertionSortErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 16 remaining) [2025-02-08 06:19:00,342 INFO L782 garLoopResultBuilder]: Registering result SAFE for location insertionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 16 remaining) [2025-02-08 06:19:00,342 INFO L782 garLoopResultBuilder]: Registering result SAFE for location insertionSortErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2025-02-08 06:19:00,342 INFO L782 garLoopResultBuilder]: Registering result SAFE for location insertionSortErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2025-02-08 06:19:00,342 INFO L782 garLoopResultBuilder]: Registering result SAFE for location insertionSortErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2025-02-08 06:19:00,342 INFO L782 garLoopResultBuilder]: Registering result SAFE for location insertionSortErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2025-02-08 06:19:00,342 INFO L782 garLoopResultBuilder]: Registering result SAFE for location insertionSortErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2025-02-08 06:19:00,342 INFO L782 garLoopResultBuilder]: Registering result SAFE for location insertionSortErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2025-02-08 06:19:00,342 INFO L782 garLoopResultBuilder]: Registering result SAFE for location insertionSortErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2025-02-08 06:19:00,342 INFO L782 garLoopResultBuilder]: Registering result SAFE for location insertionSortErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2025-02-08 06:19:00,342 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2025-02-08 06:19:00,342 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (4 of 16 remaining) [2025-02-08 06:19:00,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (3 of 16 remaining) [2025-02-08 06:19:00,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (2 of 16 remaining) [2025-02-08 06:19:00,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 16 remaining) [2025-02-08 06:19:00,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 16 remaining) [2025-02-08 06:19:00,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-08 06:19:00,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-08 06:19:00,549 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:19:00,551 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 06:19:00,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 06:19:00 BoogieIcfgContainer [2025-02-08 06:19:00,552 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 06:19:00,553 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 06:19:00,553 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 06:19:00,553 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 06:19:00,553 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:18:52" (3/4) ... [2025-02-08 06:19:00,555 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 06:19:00,558 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure insertionSort [2025-02-08 06:19:00,560 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-02-08 06:19:00,561 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-02-08 06:19:00,561 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-08 06:19:00,561 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 06:19:00,614 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 06:19:00,615 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 06:19:00,615 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 06:19:00,615 INFO L158 Benchmark]: Toolchain (without parser) took 8750.54ms. Allocated memory is still 201.3MB. Free memory was 154.9MB in the beginning and 94.8MB in the end (delta: 60.1MB). Peak memory consumption was 56.4MB. Max. memory is 16.1GB. [2025-02-08 06:19:00,616 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 192.9MB. Free memory is still 109.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:19:00,616 INFO L158 Benchmark]: CACSL2BoogieTranslator took 154.37ms. Allocated memory is still 201.3MB. Free memory was 154.9MB in the beginning and 144.4MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 06:19:00,616 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.75ms. Allocated memory is still 201.3MB. Free memory was 144.4MB in the beginning and 143.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:19:00,616 INFO L158 Benchmark]: Boogie Preprocessor took 37.59ms. Allocated memory is still 201.3MB. Free memory was 143.2MB in the beginning and 142.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:19:00,617 INFO L158 Benchmark]: IcfgBuilder took 270.89ms. Allocated memory is still 201.3MB. Free memory was 142.0MB in the beginning and 127.3MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 06:19:00,617 INFO L158 Benchmark]: TraceAbstraction took 8192.90ms. Allocated memory is still 201.3MB. Free memory was 126.5MB in the beginning and 101.1MB in the end (delta: 25.4MB). Peak memory consumption was 31.2MB. Max. memory is 16.1GB. [2025-02-08 06:19:00,618 INFO L158 Benchmark]: Witness Printer took 61.88ms. Allocated memory is still 201.3MB. Free memory was 101.1MB in the beginning and 94.8MB in the end (delta: 6.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:19:00,618 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.22ms. Allocated memory is still 192.9MB. Free memory is still 109.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 154.37ms. Allocated memory is still 201.3MB. Free memory was 154.9MB in the beginning and 144.4MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.75ms. Allocated memory is still 201.3MB. Free memory was 144.4MB in the beginning and 143.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.59ms. Allocated memory is still 201.3MB. Free memory was 143.2MB in the beginning and 142.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 270.89ms. Allocated memory is still 201.3MB. Free memory was 142.0MB in the beginning and 127.3MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8192.90ms. Allocated memory is still 201.3MB. Free memory was 126.5MB in the beginning and 101.1MB in the end (delta: 25.4MB). Peak memory consumption was 31.2MB. Max. memory is 16.1GB. * Witness Printer took 61.88ms. Allocated memory is still 201.3MB. Free memory was 101.1MB in the beginning and 94.8MB in the end (delta: 6.3MB). There was no memory consumed. 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: -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 - 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: 23]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 39]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 39]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 39]: free always succeeds For all program executions holds that free 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 2 procedures, 47 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 8.1s, OverallIterations: 15, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 691 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 678 mSDsluCounter, 1934 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1519 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2146 IncrementalHoareTripleChecker+Invalid, 2203 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 415 mSDtfsCounter, 2146 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 422 GetRequests, 215 SyntacticMatches, 16 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=11, InterpolantAutomatonStates: 119, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 54 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 420 NumberOfCodeBlocks, 420 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 515 ConstructedInterpolants, 0 QuantifiedInterpolants, 4150 SizeOfPredicates, 37 NumberOfNonLiveVariables, 788 ConjunctsInSsa, 111 ConjunctsInUnsatCore, 29 InterpolantComputations, 9 PerfectInterpolantSequences, 113/174 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 16 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 06:19:00,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE