./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-recursive-malloc/selectionSort_recursive.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/termination-recursive-malloc/selectionSort_recursive.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 ff7f98b41a2da3578e790df894a867e943a0857e97661a8032b524a76ca3b438 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:32:43,955 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:32:43,997 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-03-04 07:32:44,001 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:32:44,001 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:32:44,015 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:32:44,016 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:32:44,016 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:32:44,017 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:32:44,017 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:32:44,018 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:32:44,018 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:32:44,018 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:32:44,018 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:32:44,018 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:32:44,019 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:32:44,019 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:32:44,019 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:32:44,019 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:32:44,019 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:32:44,019 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 07:32:44,019 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:32:44,019 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:32:44,019 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:32:44,019 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:32:44,020 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:32:44,020 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:32:44,020 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:32:44,020 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:32:44,020 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:32:44,020 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:32:44,020 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:32:44,020 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:32:44,021 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:32:44,021 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:32:44,021 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:32:44,021 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:32:44,021 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:32:44,021 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:32:44,021 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/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 -> ff7f98b41a2da3578e790df894a867e943a0857e97661a8032b524a76ca3b438 [2025-03-04 07:32:44,234 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:32:44,238 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:32:44,240 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:32:44,241 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:32:44,241 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:32:44,242 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-recursive-malloc/selectionSort_recursive.i [2025-03-04 07:32:45,363 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/541146276/65eb3a96355c473f8cdc68449b8dd4ac/FLAGb035b4eca [2025-03-04 07:32:45,579 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:32:45,580 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/selectionSort_recursive.i [2025-03-04 07:32:45,585 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/541146276/65eb3a96355c473f8cdc68449b8dd4ac/FLAGb035b4eca [2025-03-04 07:32:45,598 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/541146276/65eb3a96355c473f8cdc68449b8dd4ac [2025-03-04 07:32:45,599 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:32:45,600 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:32:45,601 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:32:45,601 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:32:45,604 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:32:45,605 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:32:45" (1/1) ... [2025-03-04 07:32:45,605 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cad595b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:32:45, skipping insertion in model container [2025-03-04 07:32:45,605 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:32:45" (1/1) ... [2025-03-04 07:32:45,616 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:32:45,715 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:32:45,722 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:32:45,733 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:32:45,745 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:32:45,746 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:32:45 WrapperNode [2025-03-04 07:32:45,746 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:32:45,747 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:32:45,747 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:32:45,747 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:32:45,752 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:32:45" (1/1) ... [2025-03-04 07:32:45,760 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:32:45" (1/1) ... [2025-03-04 07:32:45,772 INFO L138 Inliner]: procedures = 11, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 31 [2025-03-04 07:32:45,773 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:32:45,773 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:32:45,773 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:32:45,774 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:32:45,779 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:32:45" (1/1) ... [2025-03-04 07:32:45,780 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:32:45" (1/1) ... [2025-03-04 07:32:45,781 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:32:45" (1/1) ... [2025-03-04 07:32:45,793 INFO L175 MemorySlicer]: Split 7 memory accesses to 1 slices as follows [7]. 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-03-04 07:32:45,793 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:32:45" (1/1) ... [2025-03-04 07:32:45,794 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:32:45" (1/1) ... [2025-03-04 07:32:45,798 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:32:45" (1/1) ... [2025-03-04 07:32:45,802 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:32:45" (1/1) ... [2025-03-04 07:32:45,803 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:32:45" (1/1) ... [2025-03-04 07:32:45,804 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:32:45" (1/1) ... [2025-03-04 07:32:45,806 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:32:45,807 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:32:45,807 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:32:45,808 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:32:45,809 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:32:45" (1/1) ... [2025-03-04 07:32:45,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:32:45,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:32:45,836 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 07:32:45,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 07:32:45,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 07:32:45,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 07:32:45,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:32:45,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:32:45,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 07:32:45,854 INFO L130 BoogieDeclarations]: Found specification of procedure selectionSort [2025-03-04 07:32:45,854 INFO L138 BoogieDeclarations]: Found implementation of procedure selectionSort [2025-03-04 07:32:45,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:32:45,900 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:32:45,901 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:32:46,067 INFO L? ?]: Removed 44 outVars from TransFormulas that were not future-live. [2025-03-04 07:32:46,067 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:32:46,074 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:32:46,075 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:32:46,075 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:32:46 BoogieIcfgContainer [2025-03-04 07:32:46,075 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:32:46,076 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:32:46,077 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:32:46,080 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:32:46,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:32:45" (1/3) ... [2025-03-04 07:32:46,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@124103bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:32:46, skipping insertion in model container [2025-03-04 07:32:46,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:32:45" (2/3) ... [2025-03-04 07:32:46,081 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@124103bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:32:46, skipping insertion in model container [2025-03-04 07:32:46,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:32:46" (3/3) ... [2025-03-04 07:32:46,082 INFO L128 eAbstractionObserver]: Analyzing ICFG selectionSort_recursive.i [2025-03-04 07:32:46,093 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:32:46,094 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG selectionSort_recursive.i that has 2 procedures, 47 locations, 1 initial locations, 2 loop locations, and 18 error locations. [2025-03-04 07:32:46,122 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:32:46,134 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;@59ad74d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:32:46,134 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-04 07:32:46,138 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 25 states have (on average 1.92) internal successors, (48), 44 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-03-04 07:32:46,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 07:32:46,142 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:32:46,143 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 07:32:46,143 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 15 more)] === [2025-03-04 07:32:46,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:32:46,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1599663, now seen corresponding path program 1 times [2025-03-04 07:32:46,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:32:46,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853036655] [2025-03-04 07:32:46,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:46,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:32:46,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 07:32:46,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 07:32:46,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:46,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:46,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:32:46,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:32:46,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853036655] [2025-03-04 07:32:46,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853036655] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:32:46,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:32:46,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:32:46,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066440588] [2025-03-04 07:32:46,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:32:46,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:32:46,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:32:46,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:32:46,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:32:46,272 INFO L87 Difference]: Start difference. First operand has 47 states, 25 states have (on average 1.92) internal successors, (48), 44 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-03-04 07:32:46,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:32:46,323 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2025-03-04 07:32:46,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:32:46,326 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-03-04 07:32:46,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:32:46,329 INFO L225 Difference]: With dead ends: 48 [2025-03-04 07:32:46,329 INFO L226 Difference]: Without dead ends: 45 [2025-03-04 07:32:46,330 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-03-04 07:32:46,332 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 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-03-04 07:32:46,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:32:46,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-04 07:32:46,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-03-04 07:32:46,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 24 states have (on average 1.875) internal successors, (45), 42 states have internal predecessors, (45), 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-03-04 07:32:46,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2025-03-04 07:32:46,356 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 4 [2025-03-04 07:32:46,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:32:46,357 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2025-03-04 07:32:46,357 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-03-04 07:32:46,357 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2025-03-04 07:32:46,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 07:32:46,357 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:32:46,357 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 07:32:46,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 07:32:46,358 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 15 more)] === [2025-03-04 07:32:46,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:32:46,358 INFO L85 PathProgramCache]: Analyzing trace with hash 49591922, now seen corresponding path program 1 times [2025-03-04 07:32:46,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:32:46,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773921886] [2025-03-04 07:32:46,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:46,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:32:46,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 07:32:46,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 07:32:46,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:46,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:46,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:32:46,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:32:46,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773921886] [2025-03-04 07:32:46,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773921886] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:32:46,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:32:46,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:32:46,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337810740] [2025-03-04 07:32:46,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:32:46,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:32:46,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:32:46,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:32:46,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:32:46,407 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-03-04 07:32:46,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:32:46,447 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2025-03-04 07:32:46,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:32:46,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2025-03-04 07:32:46,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:32:46,448 INFO L225 Difference]: With dead ends: 43 [2025-03-04 07:32:46,448 INFO L226 Difference]: Without dead ends: 43 [2025-03-04 07:32:46,448 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-03-04 07:32:46,449 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:32:46,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 61 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:32:46,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-04 07:32:46,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-03-04 07:32:46,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 40 states have internal predecessors, (43), 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-03-04 07:32:46,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2025-03-04 07:32:46,453 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 5 [2025-03-04 07:32:46,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:32:46,453 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2025-03-04 07:32:46,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-03-04 07:32:46,453 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2025-03-04 07:32:46,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 07:32:46,453 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:32:46,453 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 07:32:46,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 07:32:46,453 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 15 more)] === [2025-03-04 07:32:46,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:32:46,454 INFO L85 PathProgramCache]: Analyzing trace with hash 49591923, now seen corresponding path program 1 times [2025-03-04 07:32:46,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:32:46,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28423932] [2025-03-04 07:32:46,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:46,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:32:46,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 07:32:46,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 07:32:46,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:46,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:46,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:32:46,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:32:46,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28423932] [2025-03-04 07:32:46,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28423932] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:32:46,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:32:46,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:32:46,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8839624] [2025-03-04 07:32:46,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:32:46,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:32:46,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:32:46,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:32:46,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:32:46,661 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 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-03-04 07:32:46,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:32:46,728 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2025-03-04 07:32:46,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:32:46,729 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 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 5 [2025-03-04 07:32:46,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:32:46,729 INFO L225 Difference]: With dead ends: 46 [2025-03-04 07:32:46,730 INFO L226 Difference]: Without dead ends: 46 [2025-03-04 07:32:46,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-03-04 07:32:46,731 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 14 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:32:46,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 120 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:32:46,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-04 07:32:46,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2025-03-04 07:32:46,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 42 states have internal predecessors, (45), 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-03-04 07:32:46,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2025-03-04 07:32:46,738 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 5 [2025-03-04 07:32:46,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:32:46,738 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2025-03-04 07:32:46,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 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-03-04 07:32:46,738 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2025-03-04 07:32:46,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 07:32:46,738 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:32:46,738 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-04 07:32:46,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 07:32:46,739 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 15 more)] === [2025-03-04 07:32:46,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:32:46,740 INFO L85 PathProgramCache]: Analyzing trace with hash -75820263, now seen corresponding path program 1 times [2025-03-04 07:32:46,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:32:46,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399225845] [2025-03-04 07:32:46,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:46,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:32:46,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 07:32:46,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 07:32:46,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:46,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:46,989 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:32:46,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:32:46,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399225845] [2025-03-04 07:32:46,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399225845] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:32:46,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461277951] [2025-03-04 07:32:46,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:46,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:32:46,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:32:46,992 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:32:46,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 07:32:47,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 07:32:47,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 07:32:47,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:47,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:47,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 07:32:47,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:32:47,078 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-03-04 07:32:47,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:32:47,290 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:32:47,474 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:32:47,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [461277951] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:32:47,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:32:47,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2025-03-04 07:32:47,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543020711] [2025-03-04 07:32:47,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:32:47,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 07:32:47,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:32:47,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 07:32:47,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2025-03-04 07:32:47,476 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 17 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 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-03-04 07:32:47,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:32:47,643 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2025-03-04 07:32:47,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:32:47,644 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 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 8 [2025-03-04 07:32:47,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:32:47,644 INFO L225 Difference]: With dead ends: 45 [2025-03-04 07:32:47,645 INFO L226 Difference]: Without dead ends: 45 [2025-03-04 07:32:47,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-04 07:32:47,646 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 14 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:32:47,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 242 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:32:47,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-04 07:32:47,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2025-03-04 07:32:47,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 25 states have (on average 1.72) internal successors, (43), 40 states have internal predecessors, (43), 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-03-04 07:32:47,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2025-03-04 07:32:47,651 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 8 [2025-03-04 07:32:47,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:32:47,651 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2025-03-04 07:32:47,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 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-03-04 07:32:47,651 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2025-03-04 07:32:47,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 07:32:47,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:32:47,651 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:32:47,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 07:32:47,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:32:47,855 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting selectionSortErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 15 more)] === [2025-03-04 07:32:47,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:32:47,855 INFO L85 PathProgramCache]: Analyzing trace with hash -855975994, now seen corresponding path program 1 times [2025-03-04 07:32:47,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:32:47,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565287800] [2025-03-04 07:32:47,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:47,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:32:47,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 07:32:47,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 07:32:47,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:47,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:47,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:32:47,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:32:47,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565287800] [2025-03-04 07:32:47,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565287800] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:32:47,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151711371] [2025-03-04 07:32:47,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:47,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:32:47,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:32:47,935 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:32:47,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 07:32:47,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 07:32:47,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 07:32:47,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:47,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:47,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 07:32:47,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:32:48,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:32:48,010 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:32:48,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:32:48,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151711371] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:32:48,053 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:32:48,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-03-04 07:32:48,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547155764] [2025-03-04 07:32:48,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:32:48,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 07:32:48,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:32:48,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 07:32:48,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-04 07:32:48,054 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 9 states have internal predecessors, (19), 1 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-03-04 07:32:48,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:32:48,111 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2025-03-04 07:32:48,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:32:48,111 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 9 states have internal predecessors, (19), 1 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 12 [2025-03-04 07:32:48,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:32:48,112 INFO L225 Difference]: With dead ends: 60 [2025-03-04 07:32:48,112 INFO L226 Difference]: Without dead ends: 60 [2025-03-04 07:32:48,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-04 07:32:48,113 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 11 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:32:48,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 254 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:32:48,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-04 07:32:48,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 51. [2025-03-04 07:32:48,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 31 states have (on average 1.6129032258064515) internal successors, (50), 47 states have internal predecessors, (50), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:32:48,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2025-03-04 07:32:48,121 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 12 [2025-03-04 07:32:48,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:32:48,121 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2025-03-04 07:32:48,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 9 states have internal predecessors, (19), 1 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-03-04 07:32:48,122 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2025-03-04 07:32:48,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 07:32:48,122 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:32:48,122 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:32:48,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 07:32:48,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:32:48,323 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 15 more)] === [2025-03-04 07:32:48,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:32:48,323 INFO L85 PathProgramCache]: Analyzing trace with hash -765505567, now seen corresponding path program 1 times [2025-03-04 07:32:48,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:32:48,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220689080] [2025-03-04 07:32:48,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:48,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:32:48,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 07:32:48,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 07:32:48,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:48,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:48,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:32:48,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:32:48,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220689080] [2025-03-04 07:32:48,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220689080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:32:48,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:32:48,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:32:48,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948102083] [2025-03-04 07:32:48,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:32:48,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:32:48,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:32:48,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:32:48,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:32:48,345 INFO L87 Difference]: Start difference. First operand 51 states and 56 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-03-04 07:32:48,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:32:48,351 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2025-03-04 07:32:48,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:32:48,351 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-03-04 07:32:48,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:32:48,352 INFO L225 Difference]: With dead ends: 50 [2025-03-04 07:32:48,352 INFO L226 Difference]: Without dead ends: 50 [2025-03-04 07:32:48,352 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-03-04 07:32:48,353 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:32:48,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:32:48,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-04 07:32:48,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-04 07:32:48,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 46 states have internal predecessors, (49), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:32:48,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2025-03-04 07:32:48,356 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 13 [2025-03-04 07:32:48,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:32:48,356 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2025-03-04 07:32:48,356 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-03-04 07:32:48,356 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2025-03-04 07:32:48,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 07:32:48,357 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:32:48,357 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:32:48,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 07:32:48,357 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 15 more)] === [2025-03-04 07:32:48,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:32:48,357 INFO L85 PathProgramCache]: Analyzing trace with hash 2039131174, now seen corresponding path program 1 times [2025-03-04 07:32:48,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:32:48,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457444663] [2025-03-04 07:32:48,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:48,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:32:48,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 07:32:48,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 07:32:48,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:48,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:48,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:32:48,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:32:48,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457444663] [2025-03-04 07:32:48,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457444663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:32:48,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:32:48,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:32:48,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144722328] [2025-03-04 07:32:48,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:32:48,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:32:48,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:32:48,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:32:48,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:32:48,384 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:32:48,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:32:48,393 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2025-03-04 07:32:48,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:32:48,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2025-03-04 07:32:48,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:32:48,395 INFO L225 Difference]: With dead ends: 49 [2025-03-04 07:32:48,395 INFO L226 Difference]: Without dead ends: 49 [2025-03-04 07:32:48,395 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-03-04 07:32:48,395 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 1 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:32:48,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 73 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:32:48,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-04 07:32:48,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-04 07:32:48,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 45 states have internal predecessors, (48), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:32:48,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2025-03-04 07:32:48,400 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 14 [2025-03-04 07:32:48,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:32:48,400 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2025-03-04 07:32:48,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:32:48,401 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2025-03-04 07:32:48,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 07:32:48,401 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:32:48,401 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:32:48,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 07:32:48,401 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting selectionSortErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 15 more)] === [2025-03-04 07:32:48,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:32:48,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1713892256, now seen corresponding path program 2 times [2025-03-04 07:32:48,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:32:48,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932166514] [2025-03-04 07:32:48,402 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:32:48,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:32:48,408 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-04 07:32:48,415 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 15 statements. [2025-03-04 07:32:48,415 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 07:32:48,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:48,574 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 07:32:48,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:32:48,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932166514] [2025-03-04 07:32:48,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932166514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:32:48,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:32:48,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:32:48,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941322013] [2025-03-04 07:32:48,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:32:48,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:32:48,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:32:48,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:32:48,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:32:48,575 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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-03-04 07:32:48,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:32:48,726 INFO L93 Difference]: Finished difference Result 84 states and 97 transitions. [2025-03-04 07:32:48,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:32:48,727 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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-03-04 07:32:48,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:32:48,728 INFO L225 Difference]: With dead ends: 84 [2025-03-04 07:32:48,728 INFO L226 Difference]: Without dead ends: 84 [2025-03-04 07:32:48,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:32:48,729 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 69 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:32:48,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 70 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:32:48,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-04 07:32:48,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 67. [2025-03-04 07:32:48,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 47 states have (on average 1.7234042553191489) internal successors, (81), 62 states have internal predecessors, (81), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 07:32:48,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 89 transitions. [2025-03-04 07:32:48,733 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 89 transitions. Word has length 15 [2025-03-04 07:32:48,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:32:48,733 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 89 transitions. [2025-03-04 07:32:48,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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-03-04 07:32:48,733 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 89 transitions. [2025-03-04 07:32:48,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 07:32:48,733 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:32:48,734 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:32:48,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 07:32:48,734 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting selectionSortErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 15 more)] === [2025-03-04 07:32:48,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:32:48,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1713892257, now seen corresponding path program 1 times [2025-03-04 07:32:48,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:32:48,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480047774] [2025-03-04 07:32:48,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:48,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:32:48,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 07:32:48,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 07:32:48,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:48,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:48,781 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:32:48,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:32:48,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480047774] [2025-03-04 07:32:48,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480047774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:32:48,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:32:48,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:32:48,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220563701] [2025-03-04 07:32:48,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:32:48,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:32:48,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:32:48,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:32:48,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:32:48,783 INFO L87 Difference]: Start difference. First operand 67 states and 89 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 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-03-04 07:32:48,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:32:48,834 INFO L93 Difference]: Finished difference Result 61 states and 76 transitions. [2025-03-04 07:32:48,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:32:48,835 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 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 15 [2025-03-04 07:32:48,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:32:48,835 INFO L225 Difference]: With dead ends: 61 [2025-03-04 07:32:48,835 INFO L226 Difference]: Without dead ends: 61 [2025-03-04 07:32:48,836 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-03-04 07:32:48,836 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 39 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:32:48,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 38 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:32:48,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-04 07:32:48,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-03-04 07:32:48,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 47 states have (on average 1.446808510638298) internal successors, (68), 56 states have internal predecessors, (68), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 07:32:48,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 76 transitions. [2025-03-04 07:32:48,842 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 76 transitions. Word has length 15 [2025-03-04 07:32:48,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:32:48,842 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 76 transitions. [2025-03-04 07:32:48,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 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-03-04 07:32:48,842 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 76 transitions. [2025-03-04 07:32:48,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 07:32:48,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:32:48,842 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:32:48,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 07:32:48,843 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting selectionSortErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 15 more)] === [2025-03-04 07:32:48,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:32:48,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1713892576, now seen corresponding path program 1 times [2025-03-04 07:32:48,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:32:48,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789880016] [2025-03-04 07:32:48,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:48,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:32:48,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 07:32:48,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 07:32:48,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:48,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:48,938 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:32:48,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:32:48,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789880016] [2025-03-04 07:32:48,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789880016] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:32:48,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419904513] [2025-03-04 07:32:48,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:48,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:32:48,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:32:48,942 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:32:48,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 07:32:48,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 07:32:48,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 07:32:48,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:48,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:48,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 07:32:48,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:32:49,038 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:32:49,040 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:32:49,104 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:32:49,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419904513] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:32:49,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:32:49,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-03-04 07:32:49,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915560599] [2025-03-04 07:32:49,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:32:49,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 07:32:49,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:32:49,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 07:32:49,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-03-04 07:32:49,106 INFO L87 Difference]: Start difference. First operand 61 states and 76 transitions. Second operand has 15 states, 15 states have (on average 1.6) internal successors, (24), 12 states have internal predecessors, (24), 1 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-03-04 07:32:49,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:32:49,257 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2025-03-04 07:32:49,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 07:32:49,257 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6) internal successors, (24), 12 states have internal predecessors, (24), 1 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 15 [2025-03-04 07:32:49,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:32:49,258 INFO L225 Difference]: With dead ends: 79 [2025-03-04 07:32:49,258 INFO L226 Difference]: Without dead ends: 79 [2025-03-04 07:32:49,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2025-03-04 07:32:49,258 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 189 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:32:49,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 209 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:32:49,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-04 07:32:49,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 62. [2025-03-04 07:32:49,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 56 states have internal predecessors, (67), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 07:32:49,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2025-03-04 07:32:49,267 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 75 transitions. Word has length 15 [2025-03-04 07:32:49,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:32:49,268 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 75 transitions. [2025-03-04 07:32:49,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.6) internal successors, (24), 12 states have internal predecessors, (24), 1 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-03-04 07:32:49,268 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2025-03-04 07:32:49,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 07:32:49,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:32:49,268 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:32:49,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 07:32:49,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:32:49,469 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 15 more)] === [2025-03-04 07:32:49,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:32:49,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1099970371, now seen corresponding path program 1 times [2025-03-04 07:32:49,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:32:49,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079295774] [2025-03-04 07:32:49,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:49,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:32:49,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 07:32:49,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 07:32:49,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:49,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:49,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:32:49,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:32:49,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079295774] [2025-03-04 07:32:49,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079295774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:32:49,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:32:49,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:32:49,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564700210] [2025-03-04 07:32:49,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:32:49,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:32:49,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:32:49,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:32:49,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:32:49,512 INFO L87 Difference]: Start difference. First operand 62 states and 75 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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-03-04 07:32:49,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:32:49,530 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2025-03-04 07:32:49,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:32:49,530 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 16 [2025-03-04 07:32:49,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:32:49,530 INFO L225 Difference]: With dead ends: 61 [2025-03-04 07:32:49,530 INFO L226 Difference]: Without dead ends: 48 [2025-03-04 07:32:49,531 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-03-04 07:32:49,531 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:32:49,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:32:49,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-04 07:32:49,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 36. [2025-03-04 07:32:49,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 33 states have internal predecessors, (37), 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-03-04 07:32:49,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2025-03-04 07:32:49,533 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 16 [2025-03-04 07:32:49,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:32:49,533 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2025-03-04 07:32:49,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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-03-04 07:32:49,533 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2025-03-04 07:32:49,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 07:32:49,533 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:32:49,533 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:32:49,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 07:32:49,534 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting selectionSortErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 15 more)] === [2025-03-04 07:32:49,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:32:49,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1591052401, now seen corresponding path program 1 times [2025-03-04 07:32:49,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:32:49,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601068676] [2025-03-04 07:32:49,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:49,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:32:49,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 07:32:49,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 07:32:49,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:49,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:49,624 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 07:32:49,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:32:49,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601068676] [2025-03-04 07:32:49,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601068676] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:32:49,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:32:49,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:32:49,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007627061] [2025-03-04 07:32:49,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:32:49,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:32:49,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:32:49,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:32:49,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:32:49,626 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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-03-04 07:32:49,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:32:49,702 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2025-03-04 07:32:49,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:32:49,703 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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 16 [2025-03-04 07:32:49,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:32:49,703 INFO L225 Difference]: With dead ends: 65 [2025-03-04 07:32:49,703 INFO L226 Difference]: Without dead ends: 65 [2025-03-04 07:32:49,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:32:49,704 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 64 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:32:49,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 88 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:32:49,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-04 07:32:49,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 47. [2025-03-04 07:32:49,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 44 states have internal predecessors, (51), 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-03-04 07:32:49,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2025-03-04 07:32:49,710 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 16 [2025-03-04 07:32:49,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:32:49,710 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2025-03-04 07:32:49,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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-03-04 07:32:49,710 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2025-03-04 07:32:49,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-04 07:32:49,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:32:49,711 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:32:49,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 07:32:49,711 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting selectionSortErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 15 more)] === [2025-03-04 07:32:49,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:32:49,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1863505781, now seen corresponding path program 1 times [2025-03-04 07:32:49,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:32:49,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559058272] [2025-03-04 07:32:49,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:49,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:32:49,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 07:32:49,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 07:32:49,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:49,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:49,793 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:32:49,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:32:49,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559058272] [2025-03-04 07:32:49,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559058272] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:32:49,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541734003] [2025-03-04 07:32:49,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:49,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:32:49,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:32:49,796 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:32:49,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 07:32:49,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 07:32:49,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 07:32:49,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:49,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:49,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 07:32:49,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:32:49,919 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:32:49,920 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:32:49,984 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:32:49,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541734003] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:32:49,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:32:49,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 17 [2025-03-04 07:32:49,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497347268] [2025-03-04 07:32:49,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:32:49,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 07:32:49,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:32:49,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 07:32:49,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2025-03-04 07:32:49,987 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 17 states, 16 states have (on average 2.0625) internal successors, (33), 14 states have internal predecessors, (33), 1 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-03-04 07:32:50,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:32:50,150 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2025-03-04 07:32:50,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 07:32:50,150 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.0625) internal successors, (33), 14 states have internal predecessors, (33), 1 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 20 [2025-03-04 07:32:50,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:32:50,151 INFO L225 Difference]: With dead ends: 101 [2025-03-04 07:32:50,151 INFO L226 Difference]: Without dead ends: 101 [2025-03-04 07:32:50,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 28 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2025-03-04 07:32:50,153 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 149 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:32:50,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 182 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:32:50,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-04 07:32:50,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 80. [2025-03-04 07:32:50,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 70 states have (on average 1.3) internal successors, (91), 75 states have internal predecessors, (91), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:32:50,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 95 transitions. [2025-03-04 07:32:50,157 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 95 transitions. Word has length 20 [2025-03-04 07:32:50,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:32:50,157 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 95 transitions. [2025-03-04 07:32:50,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.0625) internal successors, (33), 14 states have internal predecessors, (33), 1 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-03-04 07:32:50,157 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 95 transitions. [2025-03-04 07:32:50,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-04 07:32:50,158 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:32:50,158 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:32:50,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 07:32:50,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:32:50,358 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting selectionSortErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 15 more)] === [2025-03-04 07:32:50,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:32:50,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1863506101, now seen corresponding path program 1 times [2025-03-04 07:32:50,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:32:50,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083386169] [2025-03-04 07:32:50,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:50,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:32:50,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 07:32:50,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 07:32:50,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:50,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:50,439 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 07:32:50,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:32:50,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083386169] [2025-03-04 07:32:50,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083386169] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:32:50,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:32:50,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:32:50,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225204923] [2025-03-04 07:32:50,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:32:50,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:32:50,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:32:50,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:32:50,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:32:50,440 INFO L87 Difference]: Start difference. First operand 80 states and 95 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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-03-04 07:32:50,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:32:50,488 INFO L93 Difference]: Finished difference Result 105 states and 124 transitions. [2025-03-04 07:32:50,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:32:50,488 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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 20 [2025-03-04 07:32:50,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:32:50,489 INFO L225 Difference]: With dead ends: 105 [2025-03-04 07:32:50,489 INFO L226 Difference]: Without dead ends: 105 [2025-03-04 07:32:50,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:32:50,489 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 34 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:32:50,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 71 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:32:50,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-04 07:32:50,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 95. [2025-03-04 07:32:50,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 85 states have (on average 1.3176470588235294) internal successors, (112), 90 states have internal predecessors, (112), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:32:50,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 116 transitions. [2025-03-04 07:32:50,495 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 116 transitions. Word has length 20 [2025-03-04 07:32:50,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:32:50,495 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 116 transitions. [2025-03-04 07:32:50,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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-03-04 07:32:50,496 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 116 transitions. [2025-03-04 07:32:50,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 07:32:50,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:32:50,496 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:32:50,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 07:32:50,496 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting selectionSortErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 15 more)] === [2025-03-04 07:32:50,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:32:50,497 INFO L85 PathProgramCache]: Analyzing trace with hash 171998568, now seen corresponding path program 1 times [2025-03-04 07:32:50,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:32:50,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75741424] [2025-03-04 07:32:50,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:50,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:32:50,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 07:32:50,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 07:32:50,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:50,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:50,636 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 07:32:50,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:32:50,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75741424] [2025-03-04 07:32:50,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75741424] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:32:50,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459604113] [2025-03-04 07:32:50,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:50,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:32:50,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:32:50,640 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:32:50,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 07:32:50,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 07:32:50,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 07:32:50,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:50,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:50,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 07:32:50,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:32:50,775 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 07:32:50,776 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:32:50,825 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 10 treesize of output 8 [2025-03-04 07:32:50,879 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 07:32:50,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459604113] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:32:50,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:32:50,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2025-03-04 07:32:50,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937137248] [2025-03-04 07:32:50,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:32:50,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 07:32:50,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:32:50,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 07:32:50,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2025-03-04 07:32:50,881 INFO L87 Difference]: Start difference. First operand 95 states and 116 transitions. Second operand has 21 states, 20 states have (on average 2.5) internal successors, (50), 18 states have internal predecessors, (50), 3 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-03-04 07:32:51,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:32:51,280 INFO L93 Difference]: Finished difference Result 122 states and 145 transitions. [2025-03-04 07:32:51,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 07:32:51,281 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.5) internal successors, (50), 18 states have internal predecessors, (50), 3 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 22 [2025-03-04 07:32:51,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:32:51,281 INFO L225 Difference]: With dead ends: 122 [2025-03-04 07:32:51,282 INFO L226 Difference]: Without dead ends: 122 [2025-03-04 07:32:51,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=360, Invalid=1122, Unknown=0, NotChecked=0, Total=1482 [2025-03-04 07:32:51,282 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 159 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:32:51,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 108 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:32:51,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-04 07:32:51,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 76. [2025-03-04 07:32:51,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 68 states have (on average 1.2647058823529411) internal successors, (86), 71 states have internal predecessors, (86), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:32:51,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 90 transitions. [2025-03-04 07:32:51,287 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 90 transitions. Word has length 22 [2025-03-04 07:32:51,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:32:51,287 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 90 transitions. [2025-03-04 07:32:51,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.5) internal successors, (50), 18 states have internal predecessors, (50), 3 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-03-04 07:32:51,287 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 90 transitions. [2025-03-04 07:32:51,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-04 07:32:51,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:32:51,288 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:32:51,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 07:32:51,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 07:32:51,489 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting selectionSortErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 15 more)] === [2025-03-04 07:32:51,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:32:51,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1811491621, now seen corresponding path program 2 times [2025-03-04 07:32:51,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:32:51,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437686685] [2025-03-04 07:32:51,489 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:32:51,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:32:51,494 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-04 07:32:51,502 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 07:32:51,503 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:32:51,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:51,685 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 07:32:51,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:32:51,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437686685] [2025-03-04 07:32:51,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437686685] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:32:51,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020501211] [2025-03-04 07:32:51,685 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:32:51,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:32:51,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:32:51,687 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:32:51,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 07:32:51,715 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-04 07:32:51,726 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 07:32:51,726 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:32:51,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:51,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 07:32:51,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:32:51,735 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-03-04 07:32:51,888 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:32:51,888 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:32:52,118 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:32:52,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020501211] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:32:52,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:32:52,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 24 [2025-03-04 07:32:52,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083368829] [2025-03-04 07:32:52,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:32:52,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 07:32:52,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:32:52,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 07:32:52,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=526, Unknown=0, NotChecked=0, Total=600 [2025-03-04 07:32:52,120 INFO L87 Difference]: Start difference. First operand 76 states and 90 transitions. Second operand has 25 states, 24 states have (on average 2.375) internal successors, (57), 22 states have internal predecessors, (57), 3 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-03-04 07:32:52,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:32:52,701 INFO L93 Difference]: Finished difference Result 90 states and 106 transitions. [2025-03-04 07:32:52,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 07:32:52,701 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.375) internal successors, (57), 22 states have internal predecessors, (57), 3 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 23 [2025-03-04 07:32:52,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:32:52,702 INFO L225 Difference]: With dead ends: 90 [2025-03-04 07:32:52,702 INFO L226 Difference]: Without dead ends: 90 [2025-03-04 07:32:52,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=227, Invalid=1255, Unknown=0, NotChecked=0, Total=1482 [2025-03-04 07:32:52,703 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 119 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:32:52,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 126 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:32:52,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-04 07:32:52,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 75. [2025-03-04 07:32:52,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 67 states have (on average 1.2537313432835822) internal successors, (84), 70 states have internal predecessors, (84), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:32:52,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 88 transitions. [2025-03-04 07:32:52,711 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 88 transitions. Word has length 23 [2025-03-04 07:32:52,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:32:52,712 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 88 transitions. [2025-03-04 07:32:52,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.375) internal successors, (57), 22 states have internal predecessors, (57), 3 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-03-04 07:32:52,712 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 88 transitions. [2025-03-04 07:32:52,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 07:32:52,712 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:32:52,712 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:32:52,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 07:32:52,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 07:32:52,913 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting selectionSortErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 15 more)] === [2025-03-04 07:32:52,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:32:52,914 INFO L85 PathProgramCache]: Analyzing trace with hash 56368036, now seen corresponding path program 1 times [2025-03-04 07:32:52,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:32:52,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267663150] [2025-03-04 07:32:52,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:52,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:32:52,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 07:32:52,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 07:32:52,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:52,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:53,008 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:32:53,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:32:53,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267663150] [2025-03-04 07:32:53,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267663150] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:32:53,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172427275] [2025-03-04 07:32:53,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:53,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:32:53,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:32:53,011 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:32:53,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 07:32:53,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 07:32:53,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 07:32:53,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:53,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:53,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 07:32:53,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:32:53,156 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:32:53,157 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:32:53,228 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:32:53,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172427275] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:32:53,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:32:53,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 17 [2025-03-04 07:32:53,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455718203] [2025-03-04 07:32:53,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:32:53,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 07:32:53,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:32:53,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 07:32:53,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2025-03-04 07:32:53,229 INFO L87 Difference]: Start difference. First operand 75 states and 88 transitions. Second operand has 17 states, 16 states have (on average 3.875) internal successors, (62), 12 states have internal predecessors, (62), 4 states have call successors, (6), 5 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:32:53,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:32:53,308 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2025-03-04 07:32:53,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:32:53,308 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.875) internal successors, (62), 12 states have internal predecessors, (62), 4 states have call successors, (6), 5 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 30 [2025-03-04 07:32:53,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:32:53,309 INFO L225 Difference]: With dead ends: 67 [2025-03-04 07:32:53,309 INFO L226 Difference]: Without dead ends: 49 [2025-03-04 07:32:53,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 48 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2025-03-04 07:32:53,309 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 36 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:32:53,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 175 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:32:53,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-04 07:32:53,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2025-03-04 07:32:53,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 44 states have internal predecessors, (51), 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-03-04 07:32:53,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2025-03-04 07:32:53,311 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 30 [2025-03-04 07:32:53,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:32:53,311 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2025-03-04 07:32:53,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.875) internal successors, (62), 12 states have internal predecessors, (62), 4 states have call successors, (6), 5 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:32:53,312 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2025-03-04 07:32:53,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-04 07:32:53,312 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:32:53,312 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:32:53,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 07:32:53,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:32:53,513 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting selectionSortErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 15 more)] === [2025-03-04 07:32:53,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:32:53,513 INFO L85 PathProgramCache]: Analyzing trace with hash -631167554, now seen corresponding path program 2 times [2025-03-04 07:32:53,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:32:53,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77442070] [2025-03-04 07:32:53,513 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:32:53,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:32:53,523 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-04 07:32:53,532 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 07:32:53,532 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:32:53,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:53,627 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:32:53,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:32:53,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77442070] [2025-03-04 07:32:53,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77442070] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:32:53,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370478931] [2025-03-04 07:32:53,628 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:32:53,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:32:53,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:32:53,630 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:32:53,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 07:32:53,660 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-04 07:32:53,674 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 07:32:53,674 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:32:53,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:53,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 07:32:53,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:32:53,754 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:32:53,755 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:32:53,831 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:32:53,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370478931] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:32:53,832 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:32:53,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2025-03-04 07:32:53,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127405595] [2025-03-04 07:32:53,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:32:53,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 07:32:53,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:32:53,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 07:32:53,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2025-03-04 07:32:53,833 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 16 states have internal predecessors, (51), 2 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:32:53,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:32:53,973 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2025-03-04 07:32:53,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 07:32:53,973 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 16 states have internal predecessors, (51), 2 states have call successors, (4), 4 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 33 [2025-03-04 07:32:53,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:32:53,974 INFO L225 Difference]: With dead ends: 59 [2025-03-04 07:32:53,974 INFO L226 Difference]: Without dead ends: 59 [2025-03-04 07:32:53,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 54 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2025-03-04 07:32:53,974 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 141 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:32:53,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 107 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:32:53,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-04 07:32:53,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 52. [2025-03-04 07:32:53,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 49 states have internal predecessors, (57), 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-03-04 07:32:53,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2025-03-04 07:32:53,976 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 33 [2025-03-04 07:32:53,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:32:53,976 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2025-03-04 07:32:53,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 16 states have internal predecessors, (51), 2 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:32:53,976 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2025-03-04 07:32:53,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-04 07:32:53,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:32:53,976 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:32:53,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 07:32:54,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 07:32:54,182 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting selectionSortErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 15 more)] === [2025-03-04 07:32:54,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:32:54,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1452539329, now seen corresponding path program 3 times [2025-03-04 07:32:54,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:32:54,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985112858] [2025-03-04 07:32:54,182 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:32:54,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:32:54,188 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 4 equivalence classes. [2025-03-04 07:32:54,191 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 38 statements. [2025-03-04 07:32:54,191 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 07:32:54,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:54,386 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-04 07:32:54,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:32:54,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985112858] [2025-03-04 07:32:54,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985112858] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:32:54,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733216004] [2025-03-04 07:32:54,387 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:32:54,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:32:54,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:32:54,389 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:32:54,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 07:32:54,420 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 4 equivalence classes. [2025-03-04 07:32:54,431 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 38 statements. [2025-03-04 07:32:54,431 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 07:32:54,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:54,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-04 07:32:54,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:32:54,437 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-03-04 07:32:54,642 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-04 07:32:54,643 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:32:55,022 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-04 07:32:55,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733216004] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:32:55,022 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:32:55,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2025-03-04 07:32:55,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207571970] [2025-03-04 07:32:55,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:32:55,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-04 07:32:55,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:32:55,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-04 07:32:55,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=696, Unknown=0, NotChecked=0, Total=812 [2025-03-04 07:32:55,023 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 29 states, 25 states have (on average 3.08) internal successors, (77), 23 states have internal predecessors, (77), 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-03-04 07:32:55,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:32:55,303 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2025-03-04 07:32:55,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 07:32:55,304 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 3.08) internal successors, (77), 23 states have internal predecessors, (77), 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 38 [2025-03-04 07:32:55,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:32:55,304 INFO L225 Difference]: With dead ends: 57 [2025-03-04 07:32:55,304 INFO L226 Difference]: Without dead ends: 57 [2025-03-04 07:32:55,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=191, Invalid=999, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 07:32:55,304 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 187 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:32:55,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 85 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:32:55,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-04 07:32:55,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 52. [2025-03-04 07:32:55,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 49 states have internal predecessors, (56), 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-03-04 07:32:55,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2025-03-04 07:32:55,306 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 38 [2025-03-04 07:32:55,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:32:55,306 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2025-03-04 07:32:55,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 3.08) internal successors, (77), 23 states have internal predecessors, (77), 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-03-04 07:32:55,306 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2025-03-04 07:32:55,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-04 07:32:55,306 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:32:55,306 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:32:55,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 07:32:55,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:32:55,507 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting selectionSortErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 15 more)] === [2025-03-04 07:32:55,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:32:55,507 INFO L85 PathProgramCache]: Analyzing trace with hash -2079046256, now seen corresponding path program 1 times [2025-03-04 07:32:55,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:32:55,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337841555] [2025-03-04 07:32:55,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:55,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:32:55,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 07:32:55,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 07:32:55,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:55,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:55,636 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-04 07:32:55,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:32:55,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337841555] [2025-03-04 07:32:55,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337841555] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:32:55,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155998211] [2025-03-04 07:32:55,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:55,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:32:55,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:32:55,639 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:32:55,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 07:32:55,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 07:32:55,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 07:32:55,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:55,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:55,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 07:32:55,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:32:55,801 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-04 07:32:55,801 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:32:55,823 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 29 treesize of output 25 [2025-03-04 07:32:55,935 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-04 07:32:55,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155998211] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:32:55,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:32:55,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2025-03-04 07:32:55,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845972174] [2025-03-04 07:32:55,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:32:55,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 07:32:55,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:32:55,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 07:32:55,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2025-03-04 07:32:55,937 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand has 23 states, 22 states have (on average 3.3636363636363638) internal successors, (74), 17 states have internal predecessors, (74), 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-03-04 07:32:56,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:32:56,227 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2025-03-04 07:32:56,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 07:32:56,228 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.3636363636363638) internal successors, (74), 17 states have internal predecessors, (74), 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 39 [2025-03-04 07:32:56,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:32:56,228 INFO L225 Difference]: With dead ends: 79 [2025-03-04 07:32:56,228 INFO L226 Difference]: Without dead ends: 79 [2025-03-04 07:32:56,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=242, Invalid=880, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 07:32:56,229 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 189 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:32:56,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 157 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:32:56,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-04 07:32:56,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 50. [2025-03-04 07:32:56,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.2) internal successors, (54), 47 states have internal predecessors, (54), 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-03-04 07:32:56,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2025-03-04 07:32:56,231 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 39 [2025-03-04 07:32:56,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:32:56,231 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2025-03-04 07:32:56,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.3636363636363638) internal successors, (74), 17 states have internal predecessors, (74), 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-03-04 07:32:56,231 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2025-03-04 07:32:56,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-04 07:32:56,231 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:32:56,231 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:32:56,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 07:32:56,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:32:56,434 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting selectionSortErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 15 more)] === [2025-03-04 07:32:56,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:32:56,434 INFO L85 PathProgramCache]: Analyzing trace with hash 776867340, now seen corresponding path program 4 times [2025-03-04 07:32:56,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:32:56,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484469327] [2025-03-04 07:32:56,435 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 07:32:56,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:32:56,440 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 43 statements into 2 equivalence classes. [2025-03-04 07:32:56,444 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 38 of 43 statements. [2025-03-04 07:32:56,444 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 07:32:56,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:56,520 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 07:32:56,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:32:56,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484469327] [2025-03-04 07:32:56,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484469327] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:32:56,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981361172] [2025-03-04 07:32:56,521 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 07:32:56,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:32:56,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:32:56,523 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:32:56,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 07:32:56,560 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 43 statements into 2 equivalence classes. [2025-03-04 07:32:56,575 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 38 of 43 statements. [2025-03-04 07:32:56,575 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 07:32:56,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:56,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 07:32:56,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:32:56,611 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 07:32:56,611 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:32:56,664 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 07:32:56,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1981361172] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:32:56,665 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:32:56,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 10 [2025-03-04 07:32:56,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593937844] [2025-03-04 07:32:56,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:32:56,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:32:56,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:32:56,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:32:56,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:32:56,666 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 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-03-04 07:32:56,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:32:56,755 INFO L93 Difference]: Finished difference Result 107 states and 128 transitions. [2025-03-04 07:32:56,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 07:32:56,756 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 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) Word has length 43 [2025-03-04 07:32:56,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:32:56,756 INFO L225 Difference]: With dead ends: 107 [2025-03-04 07:32:56,756 INFO L226 Difference]: Without dead ends: 107 [2025-03-04 07:32:56,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 80 SyntacticMatches, 7 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-03-04 07:32:56,757 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 45 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:32:56,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 169 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:32:56,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-04 07:32:56,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 83. [2025-03-04 07:32:56,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 77 states have (on average 1.2467532467532467) internal successors, (96), 79 states have internal predecessors, (96), 3 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-03-04 07:32:56,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 99 transitions. [2025-03-04 07:32:56,759 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 99 transitions. Word has length 43 [2025-03-04 07:32:56,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:32:56,759 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 99 transitions. [2025-03-04 07:32:56,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 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-03-04 07:32:56,759 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 99 transitions. [2025-03-04 07:32:56,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-04 07:32:56,759 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:32:56,759 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:32:56,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 07:32:56,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-04 07:32:56,964 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting selectionSortErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 15 more)] === [2025-03-04 07:32:56,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:32:56,964 INFO L85 PathProgramCache]: Analyzing trace with hash 776867020, now seen corresponding path program 1 times [2025-03-04 07:32:56,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:32:56,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745239621] [2025-03-04 07:32:56,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:56,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:32:56,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 07:32:56,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 07:32:56,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:56,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:57,095 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-04 07:32:57,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:32:57,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745239621] [2025-03-04 07:32:57,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745239621] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:32:57,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249380415] [2025-03-04 07:32:57,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:32:57,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:32:57,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:32:57,097 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:32:57,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 07:32:57,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 07:32:57,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 07:32:57,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:32:57,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:57,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 07:32:57,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:32:57,285 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-04 07:32:57,285 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:32:57,312 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 29 treesize of output 25 [2025-03-04 07:32:57,410 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-04 07:32:57,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249380415] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:32:57,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:32:57,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2025-03-04 07:32:57,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384211844] [2025-03-04 07:32:57,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:32:57,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 07:32:57,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:32:57,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 07:32:57,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2025-03-04 07:32:57,411 INFO L87 Difference]: Start difference. First operand 83 states and 99 transitions. Second operand has 23 states, 22 states have (on average 3.909090909090909) internal successors, (86), 17 states have internal predecessors, (86), 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-03-04 07:32:57,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:32:57,586 INFO L93 Difference]: Finished difference Result 87 states and 101 transitions. [2025-03-04 07:32:57,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 07:32:57,587 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.909090909090909) internal successors, (86), 17 states have internal predecessors, (86), 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 43 [2025-03-04 07:32:57,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:32:57,587 INFO L225 Difference]: With dead ends: 87 [2025-03-04 07:32:57,587 INFO L226 Difference]: Without dead ends: 65 [2025-03-04 07:32:57,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=214, Invalid=716, Unknown=0, NotChecked=0, Total=930 [2025-03-04 07:32:57,592 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 125 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:32:57,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 111 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:32:57,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-04 07:32:57,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 58. [2025-03-04 07:32:57,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 55 states have (on average 1.2) internal successors, (66), 55 states have internal predecessors, (66), 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-03-04 07:32:57,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2025-03-04 07:32:57,596 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 43 [2025-03-04 07:32:57,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:32:57,596 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2025-03-04 07:32:57,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.909090909090909) internal successors, (86), 17 states have internal predecessors, (86), 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-03-04 07:32:57,596 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2025-03-04 07:32:57,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-04 07:32:57,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:32:57,596 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:32:57,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 07:32:57,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-04 07:32:57,797 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting selectionSortErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 15 more)] === [2025-03-04 07:32:57,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:32:57,797 INFO L85 PathProgramCache]: Analyzing trace with hash -910951091, now seen corresponding path program 5 times [2025-03-04 07:32:57,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:32:57,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280743858] [2025-03-04 07:32:57,797 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 07:32:57,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:32:57,802 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 48 statements into 5 equivalence classes. [2025-03-04 07:32:57,813 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 07:32:57,813 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-04 07:32:57,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:57,914 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 07:32:57,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:32:57,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280743858] [2025-03-04 07:32:57,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280743858] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:32:57,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000364792] [2025-03-04 07:32:57,914 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 07:32:57,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:32:57,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:32:57,916 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:32:57,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 07:32:57,950 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 48 statements into 5 equivalence classes. [2025-03-04 07:32:57,975 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 07:32:57,975 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-04 07:32:57,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:57,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 07:32:57,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:32:58,055 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 07:32:58,055 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:32:58,105 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 07:32:58,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000364792] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:32:58,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:32:58,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 17 [2025-03-04 07:32:58,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749198776] [2025-03-04 07:32:58,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:32:58,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 07:32:58,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:32:58,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 07:32:58,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2025-03-04 07:32:58,106 INFO L87 Difference]: Start difference. First operand 58 states and 68 transitions. Second operand has 17 states, 16 states have (on average 3.375) internal successors, (54), 15 states have internal predecessors, (54), 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-03-04 07:32:58,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:32:58,183 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2025-03-04 07:32:58,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 07:32:58,183 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.375) internal successors, (54), 15 states have internal predecessors, (54), 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 48 [2025-03-04 07:32:58,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:32:58,184 INFO L225 Difference]: With dead ends: 77 [2025-03-04 07:32:58,184 INFO L226 Difference]: Without dead ends: 63 [2025-03-04 07:32:58,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 82 SyntacticMatches, 9 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2025-03-04 07:32:58,184 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 28 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:32:58,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 149 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:32:58,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-04 07:32:58,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2025-03-04 07:32:58,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 58 states have internal predecessors, (69), 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-03-04 07:32:58,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2025-03-04 07:32:58,186 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 48 [2025-03-04 07:32:58,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:32:58,186 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2025-03-04 07:32:58,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.375) internal successors, (54), 15 states have internal predecessors, (54), 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-03-04 07:32:58,186 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2025-03-04 07:32:58,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-04 07:32:58,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:32:58,187 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:32:58,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 07:32:58,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-04 07:32:58,388 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting selectionSortErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 15 more)] === [2025-03-04 07:32:58,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:32:58,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1419277543, now seen corresponding path program 6 times [2025-03-04 07:32:58,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:32:58,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173344220] [2025-03-04 07:32:58,388 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 07:32:58,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:32:58,393 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 51 statements into 5 equivalence classes. [2025-03-04 07:32:58,399 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 35 of 51 statements. [2025-03-04 07:32:58,399 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-04 07:32:58,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:58,655 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 8 proven. 26 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 07:32:58,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:32:58,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173344220] [2025-03-04 07:32:58,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173344220] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:32:58,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007261439] [2025-03-04 07:32:58,656 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 07:32:58,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:32:58,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:32:58,658 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:32:58,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 07:32:58,693 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 51 statements into 5 equivalence classes. [2025-03-04 07:32:58,707 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 35 of 51 statements. [2025-03-04 07:32:58,708 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-04 07:32:58,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:32:58,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 07:32:58,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:32:58,715 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-03-04 07:32:58,854 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 30 proven. 4 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 07:32:58,854 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:32:59,228 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 7 proven. 27 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 07:32:59,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007261439] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:32:59,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:32:59,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 29 [2025-03-04 07:32:59,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154998655] [2025-03-04 07:32:59,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:32:59,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-04 07:32:59,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:32:59,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-04 07:32:59,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=760, Unknown=0, NotChecked=0, Total=870 [2025-03-04 07:32:59,229 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand has 30 states, 26 states have (on average 3.0384615384615383) internal successors, (79), 25 states have internal predecessors, (79), 6 states have call successors, (6), 5 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:32:59,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:32:59,473 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2025-03-04 07:32:59,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 07:32:59,474 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 26 states have (on average 3.0384615384615383) internal successors, (79), 25 states have internal predecessors, (79), 6 states have call successors, (6), 5 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 51 [2025-03-04 07:32:59,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:32:59,474 INFO L225 Difference]: With dead ends: 67 [2025-03-04 07:32:59,474 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 07:32:59,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=229, Invalid=1177, Unknown=0, NotChecked=0, Total=1406 [2025-03-04 07:32:59,475 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 114 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:32:59,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 90 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:32:59,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 07:32:59,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 07:32:59,475 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-03-04 07:32:59,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 07:32:59,475 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2025-03-04 07:32:59,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:32:59,475 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 07:32:59,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 26 states have (on average 3.0384615384615383) internal successors, (79), 25 states have internal predecessors, (79), 6 states have call successors, (6), 5 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:32:59,475 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 07:32:59,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 07:32:59,477 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (17 of 18 remaining) [2025-03-04 07:32:59,477 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (16 of 18 remaining) [2025-03-04 07:32:59,477 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (15 of 18 remaining) [2025-03-04 07:32:59,477 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (14 of 18 remaining) [2025-03-04 07:32:59,477 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 18 remaining) [2025-03-04 07:32:59,477 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 18 remaining) [2025-03-04 07:32:59,478 INFO L782 garLoopResultBuilder]: Registering result SAFE for location selectionSortErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 18 remaining) [2025-03-04 07:32:59,478 INFO L782 garLoopResultBuilder]: Registering result SAFE for location selectionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 18 remaining) [2025-03-04 07:32:59,478 INFO L782 garLoopResultBuilder]: Registering result SAFE for location selectionSortErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 18 remaining) [2025-03-04 07:32:59,478 INFO L782 garLoopResultBuilder]: Registering result SAFE for location selectionSortErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 18 remaining) [2025-03-04 07:32:59,478 INFO L782 garLoopResultBuilder]: Registering result SAFE for location selectionSortErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 18 remaining) [2025-03-04 07:32:59,478 INFO L782 garLoopResultBuilder]: Registering result SAFE for location selectionSortErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 18 remaining) [2025-03-04 07:32:59,478 INFO L782 garLoopResultBuilder]: Registering result SAFE for location selectionSortErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 18 remaining) [2025-03-04 07:32:59,478 INFO L782 garLoopResultBuilder]: Registering result SAFE for location selectionSortErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 18 remaining) [2025-03-04 07:32:59,478 INFO L782 garLoopResultBuilder]: Registering result SAFE for location selectionSortErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 18 remaining) [2025-03-04 07:32:59,478 INFO L782 garLoopResultBuilder]: Registering result SAFE for location selectionSortErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 18 remaining) [2025-03-04 07:32:59,478 INFO L782 garLoopResultBuilder]: Registering result SAFE for location selectionSortErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 18 remaining) [2025-03-04 07:32:59,478 INFO L782 garLoopResultBuilder]: Registering result SAFE for location selectionSortErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 18 remaining) [2025-03-04 07:32:59,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-04 07:32:59,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:32:59,681 INFO L422 BasicCegarLoop]: Path program histogram: [6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:32:59,682 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 07:32:59,684 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 07:32:59 BoogieIcfgContainer [2025-03-04 07:32:59,684 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 07:32:59,685 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 07:32:59,685 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 07:32:59,685 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 07:32:59,685 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:32:46" (3/4) ... [2025-03-04 07:32:59,686 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 07:32:59,691 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure selectionSort [2025-03-04 07:32:59,693 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-03-04 07:32:59,693 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-04 07:32:59,693 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-04 07:32:59,693 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 07:32:59,749 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 07:32:59,750 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 07:32:59,750 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 07:32:59,751 INFO L158 Benchmark]: Toolchain (without parser) took 14149.65ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 155.2MB in the beginning and 154.3MB in the end (delta: 875.8kB). Peak memory consumption was 40.2MB. Max. memory is 16.1GB. [2025-03-04 07:32:59,751 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 117.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:32:59,751 INFO L158 Benchmark]: CACSL2BoogieTranslator took 145.48ms. Allocated memory is still 201.3MB. Free memory was 154.8MB in the beginning and 144.4MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 07:32:59,751 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.71ms. Allocated memory is still 201.3MB. Free memory was 144.4MB in the beginning and 143.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:32:59,751 INFO L158 Benchmark]: Boogie Preprocessor took 33.03ms. Allocated memory is still 201.3MB. Free memory was 143.1MB in the beginning and 141.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:32:59,752 INFO L158 Benchmark]: IcfgBuilder took 268.18ms. Allocated memory is still 201.3MB. Free memory was 141.9MB in the beginning and 127.0MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 07:32:59,752 INFO L158 Benchmark]: TraceAbstraction took 13607.66ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 126.6MB in the beginning and 159.6MB in the end (delta: -33.0MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. [2025-03-04 07:32:59,752 INFO L158 Benchmark]: Witness Printer took 65.05ms. Allocated memory is still 243.3MB. Free memory was 159.6MB in the beginning and 154.3MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 07:32:59,752 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.21ms. Allocated memory is still 201.3MB. Free memory is still 117.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 145.48ms. Allocated memory is still 201.3MB. Free memory was 154.8MB in the beginning and 144.4MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.71ms. Allocated memory is still 201.3MB. Free memory was 144.4MB in the beginning and 143.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.03ms. Allocated memory is still 201.3MB. Free memory was 143.1MB in the beginning and 141.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 268.18ms. Allocated memory is still 201.3MB. Free memory was 141.9MB in the beginning and 127.0MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 13607.66ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 126.6MB in the beginning and 159.6MB in the end (delta: -33.0MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. * Witness Printer took 65.05ms. Allocated memory is still 243.3MB. Free memory was 159.6MB in the beginning and 154.3MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 26]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 42]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 42]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 42]: 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 - 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: -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, 18 error locations. Started 1 CEGAR loops. OverallTime: 13.6s, OverallIterations: 24, TraceHistogramMax: 5, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1741 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1733 mSDsluCounter, 2920 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2312 mSDsCounter, 93 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3951 IncrementalHoareTripleChecker+Invalid, 4044 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 93 mSolverCounterUnsat, 608 mSDtfsCounter, 3951 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1090 GetRequests, 679 SyntacticMatches, 36 SemanticMatches, 375 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1994 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=14, InterpolantAutomatonStates: 231, 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, 24 MinimizatonAttempts, 244 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 973 NumberOfCodeBlocks, 893 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 1346 ConstructedInterpolants, 0 QuantifiedInterpolants, 10337 SizeOfPredicates, 88 NumberOfNonLiveVariables, 1836 ConjunctsInSsa, 208 ConjunctsInUnsatCore, 52 InterpolantComputations, 10 PerfectInterpolantSequences, 662/978 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 18 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 07:32:59,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE