./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/termination-recursive-malloc/selectionSort_recursive.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version da043454 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 ../../../trunk/examples/svcomp/termination-recursive-malloc/selectionSort_recursive.c -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 dee8338f6988c2e2d08556898f50487126a4a501d98cd3fde93e2425120ab378 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:29:18,031 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:29:18,084 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-04-29 11:29:18,091 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:29:18,092 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:29:18,110 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:29:18,111 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:29:18,111 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:29:18,111 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:29:18,111 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:29:18,111 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:29:18,112 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:29:18,112 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:29:18,112 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:29:18,112 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:29:18,112 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:29:18,112 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:29:18,112 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:29:18,112 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-29 11:29:18,112 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-29 11:29:18,113 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-29 11:29:18,113 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:29:18,113 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-29 11:29:18,113 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:29:18,113 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:29:18,113 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:29:18,113 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:29:18,113 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:29:18,113 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:29:18,113 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:29:18,113 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:29:18,114 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:29:18,114 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:29:18,114 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:29:18,114 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:29:18,114 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:29:18,114 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:29:18,114 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:29:18,114 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:29:18,114 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:29:18,114 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:29:18,115 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:29:18,115 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:29:18,115 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 -> dee8338f6988c2e2d08556898f50487126a4a501d98cd3fde93e2425120ab378 [2025-04-29 11:29:18,353 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:29:18,361 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:29:18,362 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:29:18,363 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:29:18,363 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:29:18,364 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/termination-recursive-malloc/selectionSort_recursive.c [2025-04-29 11:29:19,647 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70221d18d/739b338e8ca4442f84fb373c048ca6e6/FLAG4119a85a9 [2025-04-29 11:29:19,848 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:29:19,849 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/termination-recursive-malloc/selectionSort_recursive.c [2025-04-29 11:29:19,850 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:29:19,854 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70221d18d/739b338e8ca4442f84fb373c048ca6e6/FLAG4119a85a9 [2025-04-29 11:29:20,647 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70221d18d/739b338e8ca4442f84fb373c048ca6e6 [2025-04-29 11:29:20,649 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:29:20,650 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:29:20,651 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:29:20,651 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:29:20,654 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:29:20,654 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:29:20" (1/1) ... [2025-04-29 11:29:20,655 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b1644d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:29:20, skipping insertion in model container [2025-04-29 11:29:20,655 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:29:20" (1/1) ... [2025-04-29 11:29:20,666 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:29:20,818 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:29:20,826 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:29:20,853 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:29:20,864 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:29:20,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:29:20 WrapperNode [2025-04-29 11:29:20,865 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:29:20,866 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:29:20,866 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:29:20,866 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:29:20,870 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:29:20" (1/1) ... [2025-04-29 11:29:20,881 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:29:20" (1/1) ... [2025-04-29 11:29:20,893 INFO L138 Inliner]: procedures = 9, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 31 [2025-04-29 11:29:20,893 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:29:20,894 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:29:20,894 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:29:20,894 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:29:20,901 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:29:20" (1/1) ... [2025-04-29 11:29:20,901 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:29:20" (1/1) ... [2025-04-29 11:29:20,903 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:29:20" (1/1) ... [2025-04-29 11:29:20,918 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-04-29 11:29:20,919 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:29:20" (1/1) ... [2025-04-29 11:29:20,919 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:29:20" (1/1) ... [2025-04-29 11:29:20,922 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:29:20" (1/1) ... [2025-04-29 11:29:20,923 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:29:20" (1/1) ... [2025-04-29 11:29:20,927 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:29:20" (1/1) ... [2025-04-29 11:29:20,928 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:29:20" (1/1) ... [2025-04-29 11:29:20,929 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:29:20" (1/1) ... [2025-04-29 11:29:20,931 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:29:20,936 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:29:20,936 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:29:20,936 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:29:20,937 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:29:20" (1/1) ... [2025-04-29 11:29:20,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:29:20,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:29:20,959 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-04-29 11:29:20,960 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-04-29 11:29:20,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 11:29:20,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:29:20,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:29:20,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:29:20,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-29 11:29:20,975 INFO L130 BoogieDeclarations]: Found specification of procedure selectionSort [2025-04-29 11:29:20,975 INFO L138 BoogieDeclarations]: Found implementation of procedure selectionSort [2025-04-29 11:29:20,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:29:21,019 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:29:21,020 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:29:21,184 INFO L? ?]: Removed 44 outVars from TransFormulas that were not future-live. [2025-04-29 11:29:21,184 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:29:21,195 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:29:21,196 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:29:21,196 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:29:21 BoogieIcfgContainer [2025-04-29 11:29:21,196 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:29:21,199 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:29:21,199 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:29:21,202 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:29:21,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:29:20" (1/3) ... [2025-04-29 11:29:21,204 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fcfa7fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:29:21, skipping insertion in model container [2025-04-29 11:29:21,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:29:20" (2/3) ... [2025-04-29 11:29:21,204 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fcfa7fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:29:21, skipping insertion in model container [2025-04-29 11:29:21,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:29:21" (3/3) ... [2025-04-29 11:29:21,206 INFO L128 eAbstractionObserver]: Analyzing ICFG selectionSort_recursive.c [2025-04-29 11:29:21,218 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:29:21,219 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG selectionSort_recursive.c that has 2 procedures, 47 locations, 54 edges, 1 initial locations, 2 loop locations, and 18 error locations. [2025-04-29 11:29:21,253 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:29:21,262 INFO L340 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;@18dd402a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:29:21,264 INFO L341 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-04-29 11:29:21,267 INFO L278 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-04-29 11:29:21,270 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-04-29 11:29:21,270 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:29:21,270 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-04-29 11:29:21,270 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 15 more)] === [2025-04-29 11:29:21,274 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:29:21,275 INFO L85 PathProgramCache]: Analyzing trace with hash 925624, now seen corresponding path program 1 times [2025-04-29 11:29:21,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:29:21,281 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084803041] [2025-04-29 11:29:21,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:29:21,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:29:21,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-29 11:29:21,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-29 11:29:21,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:29:21,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:29:21,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:29:21,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:29:21,380 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084803041] [2025-04-29 11:29:21,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084803041] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:29:21,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:29:21,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:29:21,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075556202] [2025-04-29 11:29:21,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:29:21,387 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:29:21,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:29:21,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:29:21,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:29:21,405 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-04-29 11:29:21,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:29:21,445 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2025-04-29 11:29:21,446 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:29:21,447 INFO L79 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-04-29 11:29:21,447 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:29:21,450 INFO L225 Difference]: With dead ends: 48 [2025-04-29 11:29:21,450 INFO L226 Difference]: Without dead ends: 45 [2025-04-29 11:29:21,451 INFO L436 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-04-29 11:29:21,453 INFO L437 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-04-29 11:29:21,453 INFO L438 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-04-29 11:29:21,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-04-29 11:29:21,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-04-29 11:29:21,473 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-04-29 11:29:21,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2025-04-29 11:29:21,477 INFO L79 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 4 [2025-04-29 11:29:21,477 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:29:21,477 INFO L485 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2025-04-29 11:29:21,477 INFO L486 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-04-29 11:29:21,478 INFO L278 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2025-04-29 11:29:21,478 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-29 11:29:21,478 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:29:21,478 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-29 11:29:21,478 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:29:21,478 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 15 more)] === [2025-04-29 11:29:21,479 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:29:21,479 INFO L85 PathProgramCache]: Analyzing trace with hash 28695814, now seen corresponding path program 1 times [2025-04-29 11:29:21,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:29:21,479 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112381212] [2025-04-29 11:29:21,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:29:21,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:29:21,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-29 11:29:21,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-29 11:29:21,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:29:21,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:29:21,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:29:21,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:29:21,554 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112381212] [2025-04-29 11:29:21,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112381212] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:29:21,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:29:21,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:29:21,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384417805] [2025-04-29 11:29:21,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:29:21,554 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:29:21,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:29:21,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:29:21,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:29:21,555 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-04-29 11:29:21,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:29:21,586 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2025-04-29 11:29:21,586 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:29:21,586 INFO L79 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-04-29 11:29:21,587 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:29:21,587 INFO L225 Difference]: With dead ends: 43 [2025-04-29 11:29:21,587 INFO L226 Difference]: Without dead ends: 43 [2025-04-29 11:29:21,587 INFO L436 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-04-29 11:29:21,588 INFO L437 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-04-29 11:29:21,588 INFO L438 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-04-29 11:29:21,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-04-29 11:29:21,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-04-29 11:29:21,590 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-04-29 11:29:21,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2025-04-29 11:29:21,591 INFO L79 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 5 [2025-04-29 11:29:21,591 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:29:21,591 INFO L485 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2025-04-29 11:29:21,591 INFO L486 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-04-29 11:29:21,592 INFO L278 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2025-04-29 11:29:21,592 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-29 11:29:21,592 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:29:21,592 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-29 11:29:21,592 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:29:21,592 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 15 more)] === [2025-04-29 11:29:21,592 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:29:21,593 INFO L85 PathProgramCache]: Analyzing trace with hash 28695815, now seen corresponding path program 1 times [2025-04-29 11:29:21,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:29:21,593 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058082220] [2025-04-29 11:29:21,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:29:21,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:29:21,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-29 11:29:21,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-29 11:29:21,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:29:21,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:29:21,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:29:21,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:29:21,777 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058082220] [2025-04-29 11:29:21,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058082220] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:29:21,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:29:21,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:29:21,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799684190] [2025-04-29 11:29:21,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:29:21,778 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:29:21,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:29:21,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:29:21,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:29:21,779 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-04-29 11:29:21,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:29:21,854 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2025-04-29 11:29:21,855 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:29:21,855 INFO L79 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-04-29 11:29:21,855 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:29:21,855 INFO L225 Difference]: With dead ends: 46 [2025-04-29 11:29:21,855 INFO L226 Difference]: Without dead ends: 46 [2025-04-29 11:29:21,855 INFO L436 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-04-29 11:29:21,856 INFO L437 NwaCegarLoop]: 42 mSDtfsCounter, 15 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:29:21,856 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 120 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:29:21,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-04-29 11:29:21,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2025-04-29 11:29:21,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 26 states have (on average 1.7692307692307692) internal successors, (46), 42 states have internal predecessors, (46), 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-04-29 11:29:21,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2025-04-29 11:29:21,865 INFO L79 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 5 [2025-04-29 11:29:21,865 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:29:21,865 INFO L485 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2025-04-29 11:29:21,865 INFO L486 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-04-29 11:29:21,865 INFO L278 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2025-04-29 11:29:21,867 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-29 11:29:21,867 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:29:21,867 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:29:21,867 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:29:21,867 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting selectionSortErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 15 more)] === [2025-04-29 11:29:21,867 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:29:21,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1463014174, now seen corresponding path program 1 times [2025-04-29 11:29:21,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:29:21,867 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286120044] [2025-04-29 11:29:21,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:29:21,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:29:21,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-29 11:29:21,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-29 11:29:21,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:29:21,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:29:21,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:29:21,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:29:21,913 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286120044] [2025-04-29 11:29:21,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286120044] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:29:21,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:29:21,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:29:21,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407745370] [2025-04-29 11:29:21,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:29:21,914 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:29:21,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:29:21,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:29:21,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:29:21,914 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-04-29 11:29:21,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:29:21,930 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2025-04-29 11:29:21,930 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:29:21,930 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 9 [2025-04-29 11:29:21,930 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:29:21,931 INFO L225 Difference]: With dead ends: 46 [2025-04-29 11:29:21,931 INFO L226 Difference]: Without dead ends: 46 [2025-04-29 11:29:21,931 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:29:21,932 INFO L437 NwaCegarLoop]: 44 mSDtfsCounter, 2 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:29:21,932 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 84 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:29:21,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-04-29 11:29:21,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2025-04-29 11:29:21,934 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-04-29 11:29:21,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2025-04-29 11:29:21,935 INFO L79 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 9 [2025-04-29 11:29:21,935 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:29:21,935 INFO L485 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2025-04-29 11:29:21,935 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-04-29 11:29:21,935 INFO L278 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2025-04-29 11:29:21,935 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-29 11:29:21,935 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:29:21,935 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-04-29 11:29:21,935 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:29:21,935 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 15 more)] === [2025-04-29 11:29:21,936 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:29:21,936 INFO L85 PathProgramCache]: Analyzing trace with hash 178487949, now seen corresponding path program 1 times [2025-04-29 11:29:21,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:29:21,936 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772764950] [2025-04-29 11:29:21,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:29:21,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:29:21,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-29 11:29:21,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-29 11:29:21,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:29:21,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:29:22,174 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:29:22,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:29:22,174 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772764950] [2025-04-29 11:29:22,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772764950] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:29:22,174 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137981658] [2025-04-29 11:29:22,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:29:22,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:29:22,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:29:22,177 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-04-29 11:29:22,178 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-04-29 11:29:22,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-29 11:29:22,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-29 11:29:22,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:29:22,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:29:22,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-29 11:29:22,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:29:22,254 INFO L354 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-04-29 11:29:22,403 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:29:22,404 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:29:22,588 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:29:22,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137981658] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:29:22,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:29:22,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 15 [2025-04-29 11:29:22,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262530347] [2025-04-29 11:29:22,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:29:22,589 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-29 11:29:22,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:29:22,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-29 11:29:22,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2025-04-29 11:29:22,591 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 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-04-29 11:29:22,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:29:22,756 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2025-04-29 11:29:22,756 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:29:22,756 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 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-04-29 11:29:22,756 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:29:22,757 INFO L225 Difference]: With dead ends: 45 [2025-04-29 11:29:22,757 INFO L226 Difference]: Without dead ends: 45 [2025-04-29 11:29:22,757 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2025-04-29 11:29:22,758 INFO L437 NwaCegarLoop]: 41 mSDtfsCounter, 11 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:29:22,758 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 220 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:29:22,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-04-29 11:29:22,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2025-04-29 11:29:22,764 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-04-29 11:29:22,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2025-04-29 11:29:22,765 INFO L79 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 8 [2025-04-29 11:29:22,765 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:29:22,765 INFO L485 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2025-04-29 11:29:22,765 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 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-04-29 11:29:22,765 INFO L278 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2025-04-29 11:29:22,765 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-29 11:29:22,765 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:29:22,765 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:29:22,772 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-04-29 11:29:22,965 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:29:22,966 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting selectionSortErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 15 more)] === [2025-04-29 11:29:22,966 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:29:22,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1042761124, now seen corresponding path program 1 times [2025-04-29 11:29:22,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:29:22,966 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834601861] [2025-04-29 11:29:22,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:29:22,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:29:22,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-29 11:29:22,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-29 11:29:22,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:29:22,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:29:23,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:29:23,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:29:23,023 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834601861] [2025-04-29 11:29:23,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834601861] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:29:23,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:29:23,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:29:23,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399009815] [2025-04-29 11:29:23,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:29:23,025 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:29:23,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:29:23,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:29:23,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:29:23,026 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 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-04-29 11:29:23,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:29:23,081 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2025-04-29 11:29:23,082 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:29:23,082 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 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 12 [2025-04-29 11:29:23,082 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:29:23,082 INFO L225 Difference]: With dead ends: 37 [2025-04-29 11:29:23,082 INFO L226 Difference]: Without dead ends: 37 [2025-04-29 11:29:23,083 INFO L436 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-04-29 11:29:23,083 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 41 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:29:23,083 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 41 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:29:23,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-04-29 11:29:23,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-04-29 11:29:23,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 25 states have (on average 1.48) internal successors, (37), 34 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:29:23,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2025-04-29 11:29:23,087 INFO L79 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 12 [2025-04-29 11:29:23,087 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:29:23,087 INFO L485 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2025-04-29 11:29:23,087 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 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-04-29 11:29:23,087 INFO L278 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2025-04-29 11:29:23,087 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-29 11:29:23,087 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:29:23,087 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:29:23,088 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:29:23,088 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting selectionSortErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 15 more)] === [2025-04-29 11:29:23,088 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:29:23,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1042761125, now seen corresponding path program 1 times [2025-04-29 11:29:23,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:29:23,088 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22670743] [2025-04-29 11:29:23,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:29:23,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:29:23,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-29 11:29:23,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-29 11:29:23,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:29:23,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:29:23,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:29:23,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:29:23,166 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22670743] [2025-04-29 11:29:23,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22670743] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:29:23,166 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824257601] [2025-04-29 11:29:23,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:29:23,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:29:23,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:29:23,168 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-04-29 11:29:23,169 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-04-29 11:29:23,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-29 11:29:23,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-29 11:29:23,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:29:23,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:29:23,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-29 11:29:23,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:29:23,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:29:23,236 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:29:23,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:29:23,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [824257601] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:29:23,290 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:29:23,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-04-29 11:29:23,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789576723] [2025-04-29 11:29:23,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:29:23,290 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-29 11:29:23,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:29:23,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-29 11:29:23,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:29:23,291 INFO L87 Difference]: Start difference. First operand 37 states and 41 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-04-29 11:29:23,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:29:23,341 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2025-04-29 11:29:23,341 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:29:23,341 INFO L79 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-04-29 11:29:23,341 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:29:23,342 INFO L225 Difference]: With dead ends: 54 [2025-04-29 11:29:23,342 INFO L226 Difference]: Without dead ends: 54 [2025-04-29 11:29:23,342 INFO L436 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-04-29 11:29:23,342 INFO L437 NwaCegarLoop]: 33 mSDtfsCounter, 17 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:29:23,342 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 185 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:29:23,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-04-29 11:29:23,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2025-04-29 11:29:23,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 41 states have internal predecessors, (44), 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-04-29 11:29:23,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2025-04-29 11:29:23,346 INFO L79 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 12 [2025-04-29 11:29:23,346 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:29:23,346 INFO L485 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2025-04-29 11:29:23,346 INFO L486 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-04-29 11:29:23,346 INFO L278 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2025-04-29 11:29:23,346 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-29 11:29:23,346 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:29:23,346 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:29:23,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-29 11:29:23,547 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-04-29 11:29:23,547 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 15 more)] === [2025-04-29 11:29:23,547 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:29:23,547 INFO L85 PathProgramCache]: Analyzing trace with hash -2034157424, now seen corresponding path program 1 times [2025-04-29 11:29:23,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:29:23,548 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008375025] [2025-04-29 11:29:23,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:29:23,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:29:23,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-29 11:29:23,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-29 11:29:23,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:29:23,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:29:23,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:29:23,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:29:23,566 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008375025] [2025-04-29 11:29:23,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008375025] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:29:23,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:29:23,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:29:23,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047783210] [2025-04-29 11:29:23,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:29:23,567 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:29:23,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:29:23,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:29:23,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:29:23,568 INFO L87 Difference]: Start difference. First operand 45 states and 50 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-04-29 11:29:23,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:29:23,572 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2025-04-29 11:29:23,573 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:29:23,573 INFO L79 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-04-29 11:29:23,573 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:29:23,574 INFO L225 Difference]: With dead ends: 44 [2025-04-29 11:29:23,574 INFO L226 Difference]: Without dead ends: 44 [2025-04-29 11:29:23,574 INFO L436 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-04-29 11:29:23,575 INFO L437 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 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-04-29 11:29:23,575 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:29:23,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-04-29 11:29:23,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-04-29 11:29:23,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 40 states have internal predecessors, (43), 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-04-29 11:29:23,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2025-04-29 11:29:23,577 INFO L79 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 13 [2025-04-29 11:29:23,577 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:29:23,577 INFO L485 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2025-04-29 11:29:23,577 INFO L486 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-04-29 11:29:23,578 INFO L278 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2025-04-29 11:29:23,578 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-29 11:29:23,578 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:29:23,578 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:29:23,578 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:29:23,578 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 15 more)] === [2025-04-29 11:29:23,578 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:29:23,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1365629348, now seen corresponding path program 1 times [2025-04-29 11:29:23,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:29:23,579 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222911045] [2025-04-29 11:29:23,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:29:23,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:29:23,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-29 11:29:23,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 11:29:23,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:29:23,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:29:23,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:29:23,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:29:23,593 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222911045] [2025-04-29 11:29:23,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222911045] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:29:23,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:29:23,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:29:23,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198051271] [2025-04-29 11:29:23,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:29:23,594 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:29:23,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:29:23,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:29:23,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:29:23,594 INFO L87 Difference]: Start difference. First operand 44 states and 49 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-04-29 11:29:23,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:29:23,606 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2025-04-29 11:29:23,607 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:29:23,607 INFO L79 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-04-29 11:29:23,607 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:29:23,607 INFO L225 Difference]: With dead ends: 43 [2025-04-29 11:29:23,607 INFO L226 Difference]: Without dead ends: 43 [2025-04-29 11:29:23,607 INFO L436 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-04-29 11:29:23,608 INFO L437 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 61 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-04-29 11:29:23,608 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 61 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:29:23,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-04-29 11:29:23,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-04-29 11:29:23,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 39 states have internal predecessors, (42), 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-04-29 11:29:23,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2025-04-29 11:29:23,610 INFO L79 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 14 [2025-04-29 11:29:23,611 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:29:23,611 INFO L485 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2025-04-29 11:29:23,611 INFO L486 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-04-29 11:29:23,611 INFO L278 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2025-04-29 11:29:23,611 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-29 11:29:23,611 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:29:23,611 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:29:23,611 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:29:23,611 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting selectionSortErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 15 more)] === [2025-04-29 11:29:23,612 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:29:23,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1113816415, now seen corresponding path program 2 times [2025-04-29 11:29:23,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:29:23,612 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644945664] [2025-04-29 11:29:23,612 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:29:23,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:29:23,616 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-29 11:29:23,619 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 15 statements. [2025-04-29 11:29:23,619 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:29:23,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:29:23,630 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:29:23,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:29:23,630 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644945664] [2025-04-29 11:29:23,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644945664] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:29:23,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:29:23,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:29:23,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118926601] [2025-04-29 11:29:23,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:29:23,631 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:29:23,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:29:23,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:29:23,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:29:23,631 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-04-29 11:29:23,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:29:23,642 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2025-04-29 11:29:23,642 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:29:23,642 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-04-29 11:29:23,642 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:29:23,643 INFO L225 Difference]: With dead ends: 44 [2025-04-29 11:29:23,643 INFO L226 Difference]: Without dead ends: 44 [2025-04-29 11:29:23,643 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:29:23,643 INFO L437 NwaCegarLoop]: 33 mSDtfsCounter, 6 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:29:23,643 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 59 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:29:23,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-04-29 11:29:23,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-04-29 11:29:23,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 32 states have (on average 1.34375) internal successors, (43), 40 states have internal predecessors, (43), 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-04-29 11:29:23,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2025-04-29 11:29:23,646 INFO L79 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 15 [2025-04-29 11:29:23,647 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:29:23,647 INFO L485 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2025-04-29 11:29:23,647 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-04-29 11:29:23,647 INFO L278 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2025-04-29 11:29:23,647 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-29 11:29:23,647 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:29:23,647 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:29:23,647 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:29:23,647 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting selectionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 15 more)] === [2025-04-29 11:29:23,648 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:29:23,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1113815935, now seen corresponding path program 1 times [2025-04-29 11:29:23,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:29:23,648 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122704056] [2025-04-29 11:29:23,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:29:23,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:29:23,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-29 11:29:23,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-29 11:29:23,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:29:23,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:29:23,856 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:29:23,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:29:23,856 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122704056] [2025-04-29 11:29:23,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122704056] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:29:23,857 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177475817] [2025-04-29 11:29:23,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:29:23,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:29:23,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:29:23,858 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-04-29 11:29:23,860 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-04-29 11:29:23,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-29 11:29:23,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-29 11:29:23,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:29:23,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:29:23,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-29 11:29:23,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:29:24,028 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:29:24,028 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:29:24,129 INFO L354 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 24 treesize of output 20 [2025-04-29 11:29:24,181 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:29:24,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177475817] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:29:24,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:29:24,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2025-04-29 11:29:24,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189552268] [2025-04-29 11:29:24,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:29:24,182 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-29 11:29:24,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:29:24,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-29 11:29:24,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2025-04-29 11:29:24,183 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 20 states, 19 states have (on average 2.0) internal successors, (38), 17 states have internal predecessors, (38), 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-04-29 11:29:24,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:29:24,474 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2025-04-29 11:29:24,474 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 11:29:24,474 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.0) internal successors, (38), 17 states have internal predecessors, (38), 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 15 [2025-04-29 11:29:24,475 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:29:24,475 INFO L225 Difference]: With dead ends: 73 [2025-04-29 11:29:24,475 INFO L226 Difference]: Without dead ends: 73 [2025-04-29 11:29:24,475 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2025-04-29 11:29:24,476 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 88 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:29:24,477 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 176 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:29:24,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-04-29 11:29:24,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 62. [2025-04-29 11:29:24,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 48 states have (on average 1.375) internal successors, (66), 57 states have internal predecessors, (66), 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-04-29 11:29:24,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 74 transitions. [2025-04-29 11:29:24,480 INFO L79 Accepts]: Start accepts. Automaton has 62 states and 74 transitions. Word has length 15 [2025-04-29 11:29:24,483 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:29:24,483 INFO L485 AbstractCegarLoop]: Abstraction has 62 states and 74 transitions. [2025-04-29 11:29:24,483 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0) internal successors, (38), 17 states have internal predecessors, (38), 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-04-29 11:29:24,484 INFO L278 IsEmpty]: Start isEmpty. Operand 62 states and 74 transitions. [2025-04-29 11:29:24,485 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-29 11:29:24,485 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:29:24,485 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:29:24,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-29 11:29:24,689 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:29:24,690 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 15 more)] === [2025-04-29 11:29:24,690 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:29:24,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1890187417, now seen corresponding path program 1 times [2025-04-29 11:29:24,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:29:24,690 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482030028] [2025-04-29 11:29:24,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:29:24,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:29:24,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-29 11:29:24,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-29 11:29:24,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:29:24,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:29:24,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:29:24,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:29:24,744 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482030028] [2025-04-29 11:29:24,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482030028] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:29:24,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:29:24,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:29:24,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385206558] [2025-04-29 11:29:24,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:29:24,745 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:29:24,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:29:24,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:29:24,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:29:24,745 INFO L87 Difference]: Start difference. First operand 62 states and 74 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-04-29 11:29:24,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:29:24,766 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2025-04-29 11:29:24,766 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:29:24,767 INFO L79 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-04-29 11:29:24,767 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:29:24,767 INFO L225 Difference]: With dead ends: 61 [2025-04-29 11:29:24,767 INFO L226 Difference]: Without dead ends: 48 [2025-04-29 11:29:24,767 INFO L436 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-04-29 11:29:24,768 INFO L437 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-04-29 11:29:24,768 INFO L438 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-04-29 11:29:24,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-04-29 11:29:24,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2025-04-29 11:29:24,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 42 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-04-29 11:29:24,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2025-04-29 11:29:24,770 INFO L79 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 16 [2025-04-29 11:29:24,770 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:29:24,770 INFO L485 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2025-04-29 11:29:24,770 INFO L486 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-04-29 11:29:24,770 INFO L278 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2025-04-29 11:29:24,770 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-29 11:29:24,770 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:29:24,770 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:29:24,771 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 11:29:24,771 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting selectionSortErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 15 more)] === [2025-04-29 11:29:24,771 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:29:24,771 INFO L85 PathProgramCache]: Analyzing trace with hash 168555598, now seen corresponding path program 1 times [2025-04-29 11:29:24,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:29:24,771 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942130297] [2025-04-29 11:29:24,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:29:24,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:29:24,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-29 11:29:24,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-29 11:29:24,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:29:24,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:29:24,857 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:29:24,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:29:24,857 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942130297] [2025-04-29 11:29:24,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942130297] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:29:24,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:29:24,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:29:24,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045963923] [2025-04-29 11:29:24,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:29:24,857 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:29:24,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:29:24,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:29:24,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:29:24,858 INFO L87 Difference]: Start difference. First operand 45 states and 53 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-04-29 11:29:24,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:29:24,938 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2025-04-29 11:29:24,939 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:29:24,939 INFO L79 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-04-29 11:29:24,939 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:29:24,939 INFO L225 Difference]: With dead ends: 63 [2025-04-29 11:29:24,939 INFO L226 Difference]: Without dead ends: 63 [2025-04-29 11:29:24,940 INFO L436 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-04-29 11:29:24,940 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 79 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:29:24,940 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 84 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:29:24,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-04-29 11:29:24,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 56. [2025-04-29 11:29:24,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 53 states have internal predecessors, (65), 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-04-29 11:29:24,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2025-04-29 11:29:24,943 INFO L79 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 16 [2025-04-29 11:29:24,943 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:29:24,943 INFO L485 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2025-04-29 11:29:24,943 INFO L486 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-04-29 11:29:24,943 INFO L278 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2025-04-29 11:29:24,943 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-29 11:29:24,943 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:29:24,943 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:29:24,944 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-29 11:29:24,944 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting selectionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 15 more)] === [2025-04-29 11:29:24,946 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:29:24,946 INFO L85 PathProgramCache]: Analyzing trace with hash 2134343793, now seen corresponding path program 1 times [2025-04-29 11:29:24,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:29:24,946 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666735306] [2025-04-29 11:29:24,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:29:24,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:29:24,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-29 11:29:24,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 11:29:24,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:29:24,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:29:25,059 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:29:25,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:29:25,060 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666735306] [2025-04-29 11:29:25,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666735306] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:29:25,060 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783740978] [2025-04-29 11:29:25,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:29:25,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:29:25,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:29:25,062 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-04-29 11:29:25,064 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-04-29 11:29:25,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-29 11:29:25,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 11:29:25,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:29:25,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:29:25,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-29 11:29:25,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:29:25,183 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:29:25,183 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:29:25,258 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:29:25,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783740978] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:29:25,259 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:29:25,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 17 [2025-04-29 11:29:25,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704795202] [2025-04-29 11:29:25,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:29:25,259 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-29 11:29:25,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:29:25,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-29 11:29:25,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2025-04-29 11:29:25,260 INFO L87 Difference]: Start difference. First operand 56 states and 67 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-04-29 11:29:25,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:29:25,436 INFO L93 Difference]: Finished difference Result 108 states and 122 transitions. [2025-04-29 11:29:25,436 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-29 11:29:25,436 INFO L79 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-04-29 11:29:25,436 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:29:25,437 INFO L225 Difference]: With dead ends: 108 [2025-04-29 11:29:25,437 INFO L226 Difference]: Without dead ends: 108 [2025-04-29 11:29:25,437 INFO L436 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-04-29 11:29:25,438 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 113 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:29:25,438 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 192 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:29:25,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-04-29 11:29:25,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 95. [2025-04-29 11:29:25,444 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-04-29 11:29:25,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 116 transitions. [2025-04-29 11:29:25,445 INFO L79 Accepts]: Start accepts. Automaton has 95 states and 116 transitions. Word has length 20 [2025-04-29 11:29:25,445 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:29:25,445 INFO L485 AbstractCegarLoop]: Abstraction has 95 states and 116 transitions. [2025-04-29 11:29:25,445 INFO L486 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-04-29 11:29:25,445 INFO L278 IsEmpty]: Start isEmpty. Operand 95 states and 116 transitions. [2025-04-29 11:29:25,445 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-29 11:29:25,445 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:29:25,445 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-04-29 11:29:25,451 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-04-29 11:29:25,645 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:29:25,646 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting selectionSortErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 15 more)] === [2025-04-29 11:29:25,646 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:29:25,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1946779564, now seen corresponding path program 1 times [2025-04-29 11:29:25,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:29:25,646 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309389259] [2025-04-29 11:29:25,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:29:25,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:29:25,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-29 11:29:25,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-29 11:29:25,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:29:25,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:29:25,780 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:29:25,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:29:25,781 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309389259] [2025-04-29 11:29:25,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309389259] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:29:25,781 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555013107] [2025-04-29 11:29:25,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:29:25,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:29:25,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:29:25,783 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-04-29 11:29:25,785 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-04-29 11:29:25,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-29 11:29:25,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-29 11:29:25,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:29:25,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:29:25,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-29 11:29:25,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:29:25,917 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:29:25,917 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:29:25,966 INFO L354 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-04-29 11:29:26,026 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:29:26,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1555013107] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:29:26,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:29:26,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2025-04-29 11:29:26,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777817533] [2025-04-29 11:29:26,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:29:26,027 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-29 11:29:26,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:29:26,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-29 11:29:26,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2025-04-29 11:29:26,027 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-04-29 11:29:26,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:29:26,484 INFO L93 Difference]: Finished difference Result 122 states and 145 transitions. [2025-04-29 11:29:26,484 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-29 11:29:26,485 INFO L79 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-04-29 11:29:26,485 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:29:26,486 INFO L225 Difference]: With dead ends: 122 [2025-04-29 11:29:26,486 INFO L226 Difference]: Without dead ends: 122 [2025-04-29 11:29:26,486 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=360, Invalid=1122, Unknown=0, NotChecked=0, Total=1482 [2025-04-29 11:29:26,488 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 127 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:29:26,488 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 136 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:29:26,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-04-29 11:29:26,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 76. [2025-04-29 11:29:26,490 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-04-29 11:29:26,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 90 transitions. [2025-04-29 11:29:26,491 INFO L79 Accepts]: Start accepts. Automaton has 76 states and 90 transitions. Word has length 22 [2025-04-29 11:29:26,491 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:29:26,491 INFO L485 AbstractCegarLoop]: Abstraction has 76 states and 90 transitions. [2025-04-29 11:29:26,491 INFO L486 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-04-29 11:29:26,491 INFO L278 IsEmpty]: Start isEmpty. Operand 76 states and 90 transitions. [2025-04-29 11:29:26,491 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-29 11:29:26,491 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:29:26,491 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:29:26,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-29 11:29:26,694 WARN L466 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-04-29 11:29:26,695 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting selectionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 15 more)] === [2025-04-29 11:29:26,695 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:29:26,695 INFO L85 PathProgramCache]: Analyzing trace with hash -184197589, now seen corresponding path program 2 times [2025-04-29 11:29:26,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:29:26,695 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756389747] [2025-04-29 11:29:26,695 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:29:26,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:29:26,703 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-29 11:29:26,710 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-29 11:29:26,710 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:29:26,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:29:26,863 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-29 11:29:26,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:29:26,864 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756389747] [2025-04-29 11:29:26,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756389747] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:29:26,864 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597384866] [2025-04-29 11:29:26,864 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:29:26,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:29:26,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:29:26,866 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-04-29 11:29:26,866 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-04-29 11:29:26,890 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-29 11:29:26,903 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-29 11:29:26,903 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:29:26,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:29:26,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-04-29 11:29:26,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:29:27,073 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:29:27,073 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:29:27,192 INFO L354 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 24 treesize of output 20 [2025-04-29 11:29:27,286 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:29:27,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597384866] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:29:27,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:29:27,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 24 [2025-04-29 11:29:27,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73365263] [2025-04-29 11:29:27,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:29:27,287 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-29 11:29:27,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:29:27,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-29 11:29:27,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2025-04-29 11:29:27,287 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-04-29 11:29:27,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:29:27,860 INFO L93 Difference]: Finished difference Result 90 states and 106 transitions. [2025-04-29 11:29:27,860 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-29 11:29:27,860 INFO L79 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-04-29 11:29:27,860 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:29:27,861 INFO L225 Difference]: With dead ends: 90 [2025-04-29 11:29:27,861 INFO L226 Difference]: Without dead ends: 90 [2025-04-29 11:29:27,861 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=226, Invalid=1256, Unknown=0, NotChecked=0, Total=1482 [2025-04-29 11:29:27,862 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 102 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:29:27,862 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 155 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 11:29:27,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-04-29 11:29:27,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 75. [2025-04-29 11:29:27,867 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-04-29 11:29:27,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 88 transitions. [2025-04-29 11:29:27,867 INFO L79 Accepts]: Start accepts. Automaton has 75 states and 88 transitions. Word has length 23 [2025-04-29 11:29:27,867 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:29:27,867 INFO L485 AbstractCegarLoop]: Abstraction has 75 states and 88 transitions. [2025-04-29 11:29:27,867 INFO L486 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-04-29 11:29:27,867 INFO L278 IsEmpty]: Start isEmpty. Operand 75 states and 88 transitions. [2025-04-29 11:29:27,868 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-29 11:29:27,868 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:29:27,868 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-04-29 11:29:27,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-29 11:29:28,068 WARN L466 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-04-29 11:29:28,068 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting selectionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 15 more)] === [2025-04-29 11:29:28,069 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:29:28,069 INFO L85 PathProgramCache]: Analyzing trace with hash 2109281953, now seen corresponding path program 1 times [2025-04-29 11:29:28,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:29:28,069 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584356349] [2025-04-29 11:29:28,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:29:28,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:29:28,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:29:28,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:29:28,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:29:28,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:29:28,180 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:29:28,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:29:28,180 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584356349] [2025-04-29 11:29:28,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584356349] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:29:28,180 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774573191] [2025-04-29 11:29:28,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:29:28,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:29:28,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:29:28,182 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-04-29 11:29:28,184 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-04-29 11:29:28,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:29:28,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:29:28,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:29:28,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:29:28,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-29 11:29:28,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:29:28,313 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:29:28,313 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:29:28,383 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:29:28,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774573191] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:29:28,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:29:28,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 18 [2025-04-29 11:29:28,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291409646] [2025-04-29 11:29:28,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:29:28,383 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-29 11:29:28,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:29:28,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-29 11:29:28,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2025-04-29 11:29:28,384 INFO L87 Difference]: Start difference. First operand 75 states and 88 transitions. Second operand has 18 states, 17 states have (on average 3.764705882352941) internal successors, (64), 13 states have internal predecessors, (64), 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-04-29 11:29:28,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:29:28,465 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2025-04-29 11:29:28,465 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:29:28,465 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.764705882352941) internal successors, (64), 13 states have internal predecessors, (64), 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-04-29 11:29:28,465 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:29:28,465 INFO L225 Difference]: With dead ends: 67 [2025-04-29 11:29:28,465 INFO L226 Difference]: Without dead ends: 49 [2025-04-29 11:29:28,466 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 48 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2025-04-29 11:29:28,466 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 19 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:29:28,466 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 194 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:29:28,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-04-29 11:29:28,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2025-04-29 11:29:28,467 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-04-29 11:29:28,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2025-04-29 11:29:28,468 INFO L79 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 30 [2025-04-29 11:29:28,468 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:29:28,468 INFO L485 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2025-04-29 11:29:28,468 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.764705882352941) internal successors, (64), 13 states have internal predecessors, (64), 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-04-29 11:29:28,468 INFO L278 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2025-04-29 11:29:28,468 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-29 11:29:28,468 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:29:28,468 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-04-29 11:29:28,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-29 11:29:28,669 WARN L466 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-04-29 11:29:28,669 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting selectionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 15 more)] === [2025-04-29 11:29:28,669 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:29:28,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1942000603, now seen corresponding path program 2 times [2025-04-29 11:29:28,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:29:28,670 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025416848] [2025-04-29 11:29:28,670 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:29:28,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:29:28,679 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-29 11:29:28,688 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-29 11:29:28,690 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:29:28,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:29:28,785 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:29:28,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:29:28,785 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025416848] [2025-04-29 11:29:28,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025416848] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:29:28,785 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456423504] [2025-04-29 11:29:28,785 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:29:28,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:29:28,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:29:28,787 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-04-29 11:29:28,789 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-04-29 11:29:28,815 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-29 11:29:28,829 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-29 11:29:28,829 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:29:28,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:29:28,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-29 11:29:28,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:29:28,894 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:29:28,895 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:29:28,964 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:29:28,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456423504] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:29:28,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:29:28,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2025-04-29 11:29:28,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022642995] [2025-04-29 11:29:28,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:29:28,965 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-29 11:29:28,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:29:28,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-29 11:29:28,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2025-04-29 11:29:28,966 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-04-29 11:29:29,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:29:29,108 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2025-04-29 11:29:29,108 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-29 11:29:29,109 INFO L79 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-04-29 11:29:29,109 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:29:29,109 INFO L225 Difference]: With dead ends: 59 [2025-04-29 11:29:29,109 INFO L226 Difference]: Without dead ends: 59 [2025-04-29 11:29:29,109 INFO L436 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-04-29 11:29:29,109 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 114 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:29:29,110 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 145 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:29:29,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-04-29 11:29:29,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 52. [2025-04-29 11:29:29,111 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-04-29 11:29:29,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2025-04-29 11:29:29,111 INFO L79 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 33 [2025-04-29 11:29:29,111 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:29:29,111 INFO L485 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2025-04-29 11:29:29,111 INFO L486 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-04-29 11:29:29,111 INFO L278 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2025-04-29 11:29:29,112 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-29 11:29:29,112 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:29:29,112 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-04-29 11:29:29,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-29 11:29:29,312 WARN L466 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-04-29 11:29:29,313 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting selectionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 15 more)] === [2025-04-29 11:29:29,313 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:29:29,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1758987893, now seen corresponding path program 3 times [2025-04-29 11:29:29,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:29:29,313 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805267422] [2025-04-29 11:29:29,313 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:29:29,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:29:29,319 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 4 equivalence classes. [2025-04-29 11:29:29,323 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 38 statements. [2025-04-29 11:29:29,323 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-29 11:29:29,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:29:29,493 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-04-29 11:29:29,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:29:29,493 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805267422] [2025-04-29 11:29:29,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805267422] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:29:29,493 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524852324] [2025-04-29 11:29:29,493 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:29:29,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:29:29,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:29:29,495 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-04-29 11:29:29,496 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-04-29 11:29:29,526 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 4 equivalence classes. [2025-04-29 11:29:29,537 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 38 statements. [2025-04-29 11:29:29,538 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-29 11:29:29,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:29:29,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-29 11:29:29,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:29:29,732 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-04-29 11:29:29,732 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:29:30,076 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-04-29 11:29:30,115 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-04-29 11:29:30,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524852324] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:29:30,115 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:29:30,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2025-04-29 11:29:30,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598400303] [2025-04-29 11:29:30,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:29:30,115 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-29 11:29:30,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:29:30,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-29 11:29:30,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=696, Unknown=0, NotChecked=0, Total=812 [2025-04-29 11:29:30,116 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-04-29 11:29:30,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:29:30,340 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2025-04-29 11:29:30,340 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-29 11:29:30,340 INFO L79 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-04-29 11:29:30,340 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:29:30,340 INFO L225 Difference]: With dead ends: 57 [2025-04-29 11:29:30,340 INFO L226 Difference]: Without dead ends: 57 [2025-04-29 11:29:30,341 INFO L436 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-04-29 11:29:30,341 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 110 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:29:30,341 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 81 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:29:30,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-04-29 11:29:30,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 52. [2025-04-29 11:29:30,342 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-04-29 11:29:30,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2025-04-29 11:29:30,342 INFO L79 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 38 [2025-04-29 11:29:30,342 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:29:30,343 INFO L485 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2025-04-29 11:29:30,343 INFO L486 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-04-29 11:29:30,343 INFO L278 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2025-04-29 11:29:30,343 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-29 11:29:30,343 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:29:30,343 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-04-29 11:29:30,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-29 11:29:30,548 WARN L466 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-04-29 11:29:30,548 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting selectionSortErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 15 more)] === [2025-04-29 11:29:30,548 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:29:30,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1305950184, now seen corresponding path program 1 times [2025-04-29 11:29:30,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:29:30,548 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549068562] [2025-04-29 11:29:30,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:29:30,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:29:30,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-29 11:29:30,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-29 11:29:30,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:29:30,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:29:30,664 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-04-29 11:29:30,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:29:30,664 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549068562] [2025-04-29 11:29:30,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549068562] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:29:30,664 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748218556] [2025-04-29 11:29:30,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:29:30,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:29:30,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:29:30,666 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-04-29 11:29:30,668 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-04-29 11:29:30,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-29 11:29:30,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-29 11:29:30,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:29:30,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:29:30,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-29 11:29:30,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:29:30,840 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-04-29 11:29:30,840 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:29:30,858 INFO L354 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-04-29 11:29:30,950 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-04-29 11:29:30,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748218556] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:29:30,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:29:30,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2025-04-29 11:29:30,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822282680] [2025-04-29 11:29:30,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:29:30,951 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-29 11:29:30,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:29:30,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-29 11:29:30,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2025-04-29 11:29:30,952 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-04-29 11:29:31,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:29:31,172 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2025-04-29 11:29:31,172 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-29 11:29:31,172 INFO L79 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-04-29 11:29:31,172 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:29:31,173 INFO L225 Difference]: With dead ends: 79 [2025-04-29 11:29:31,173 INFO L226 Difference]: Without dead ends: 79 [2025-04-29 11:29:31,173 INFO L436 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-04-29 11:29:31,173 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 258 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:29:31,173 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 118 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:29:31,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-04-29 11:29:31,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 50. [2025-04-29 11:29:31,176 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-04-29 11:29:31,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2025-04-29 11:29:31,176 INFO L79 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 39 [2025-04-29 11:29:31,177 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:29:31,177 INFO L485 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2025-04-29 11:29:31,177 INFO L486 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-04-29 11:29:31,177 INFO L278 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2025-04-29 11:29:31,177 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-29 11:29:31,178 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:29:31,178 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-04-29 11:29:31,184 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-29 11:29:31,381 WARN L466 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-04-29 11:29:31,381 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting selectionSortErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 15 more)] === [2025-04-29 11:29:31,382 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:29:31,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1641111835, now seen corresponding path program 1 times [2025-04-29 11:29:31,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:29:31,382 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488466738] [2025-04-29 11:29:31,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:29:31,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:29:31,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-29 11:29:31,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-29 11:29:31,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:29:31,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:29:31,508 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-04-29 11:29:31,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:29:31,508 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488466738] [2025-04-29 11:29:31,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488466738] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:29:31,508 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652420922] [2025-04-29 11:29:31,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:29:31,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:29:31,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:29:31,510 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-04-29 11:29:31,512 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-04-29 11:29:31,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-29 11:29:31,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-29 11:29:31,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:29:31,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:29:31,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-29 11:29:31,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:29:31,702 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-04-29 11:29:31,702 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:29:31,727 INFO L354 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-04-29 11:29:31,826 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-04-29 11:29:31,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652420922] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:29:31,826 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:29:31,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2025-04-29 11:29:31,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357586112] [2025-04-29 11:29:31,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:29:31,827 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-29 11:29:31,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:29:31,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-29 11:29:31,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2025-04-29 11:29:31,827 INFO L87 Difference]: Start difference. First operand 50 states and 56 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-04-29 11:29:32,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:29:32,000 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2025-04-29 11:29:32,000 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-29 11:29:32,001 INFO L79 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-04-29 11:29:32,001 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:29:32,001 INFO L225 Difference]: With dead ends: 51 [2025-04-29 11:29:32,001 INFO L226 Difference]: Without dead ends: 51 [2025-04-29 11:29:32,001 INFO L436 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-04-29 11:29:32,001 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 91 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:29:32,002 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 126 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:29:32,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-04-29 11:29:32,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 44. [2025-04-29 11:29:32,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 41 states have (on average 1.170731707317073) internal successors, (48), 41 states have internal predecessors, (48), 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-04-29 11:29:32,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2025-04-29 11:29:32,003 INFO L79 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 43 [2025-04-29 11:29:32,003 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:29:32,003 INFO L485 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2025-04-29 11:29:32,003 INFO L486 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-04-29 11:29:32,003 INFO L278 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2025-04-29 11:29:32,004 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-29 11:29:32,004 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:29:32,004 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-04-29 11:29:32,009 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-04-29 11:29:32,207 WARN L466 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-04-29 11:29:32,207 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting selectionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 15 more)] === [2025-04-29 11:29:32,207 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:29:32,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1641111355, now seen corresponding path program 4 times [2025-04-29 11:29:32,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:29:32,207 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48094679] [2025-04-29 11:29:32,207 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:29:32,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:29:32,212 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 43 statements into 2 equivalence classes. [2025-04-29 11:29:32,216 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 38 of 43 statements. [2025-04-29 11:29:32,216 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-29 11:29:32,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:29:32,289 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-29 11:29:32,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:29:32,289 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48094679] [2025-04-29 11:29:32,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48094679] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:29:32,289 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579049719] [2025-04-29 11:29:32,289 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:29:32,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:29:32,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:29:32,291 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-04-29 11:29:32,293 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-04-29 11:29:32,325 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 43 statements into 2 equivalence classes. [2025-04-29 11:29:32,342 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 38 of 43 statements. [2025-04-29 11:29:32,342 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-29 11:29:32,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:29:32,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-29 11:29:32,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:29:32,376 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-29 11:29:32,376 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:29:32,433 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-29 11:29:32,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579049719] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:29:32,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:29:32,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 10 [2025-04-29 11:29:32,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291637475] [2025-04-29 11:29:32,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:29:32,434 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:29:32,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:29:32,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:29:32,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:29:32,434 INFO L87 Difference]: Start difference. First operand 44 states and 50 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-04-29 11:29:32,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:29:32,510 INFO L93 Difference]: Finished difference Result 95 states and 112 transitions. [2025-04-29 11:29:32,510 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 11:29:32,511 INFO L79 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-04-29 11:29:32,511 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:29:32,511 INFO L225 Difference]: With dead ends: 95 [2025-04-29 11:29:32,513 INFO L226 Difference]: Without dead ends: 66 [2025-04-29 11:29:32,513 INFO L436 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-04-29 11:29:32,514 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 46 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:29:32,514 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 135 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:29:32,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-04-29 11:29:32,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 58. [2025-04-29 11:29:32,516 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-04-29 11:29:32,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2025-04-29 11:29:32,516 INFO L79 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 43 [2025-04-29 11:29:32,516 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:29:32,516 INFO L485 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2025-04-29 11:29:32,516 INFO L486 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-04-29 11:29:32,516 INFO L278 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2025-04-29 11:29:32,516 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-04-29 11:29:32,516 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:29:32,516 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-04-29 11:29:32,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-04-29 11:29:32,719 WARN L466 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-04-29 11:29:32,719 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting selectionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 15 more)] === [2025-04-29 11:29:32,720 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:29:32,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1890199211, now seen corresponding path program 5 times [2025-04-29 11:29:32,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:29:32,720 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795727208] [2025-04-29 11:29:32,720 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-29 11:29:32,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:29:32,725 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 48 statements into 5 equivalence classes. [2025-04-29 11:29:32,734 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 48 of 48 statements. [2025-04-29 11:29:32,737 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-04-29 11:29:32,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:29:32,825 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-29 11:29:32,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:29:32,826 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795727208] [2025-04-29 11:29:32,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795727208] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:29:32,826 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596857369] [2025-04-29 11:29:32,826 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-29 11:29:32,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:29:32,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:29:32,828 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-04-29 11:29:32,829 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-04-29 11:29:32,861 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 48 statements into 5 equivalence classes. [2025-04-29 11:29:32,881 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 48 of 48 statements. [2025-04-29 11:29:32,881 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-04-29 11:29:32,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:29:32,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-29 11:29:32,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:29:32,956 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-29 11:29:32,956 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:29:33,015 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-29 11:29:33,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596857369] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:29:33,015 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:29:33,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 17 [2025-04-29 11:29:33,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749983287] [2025-04-29 11:29:33,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:29:33,015 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-29 11:29:33,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:29:33,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-29 11:29:33,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2025-04-29 11:29:33,016 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-04-29 11:29:33,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:29:33,083 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2025-04-29 11:29:33,083 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:29:33,083 INFO L79 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-04-29 11:29:33,083 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:29:33,084 INFO L225 Difference]: With dead ends: 77 [2025-04-29 11:29:33,084 INFO L226 Difference]: Without dead ends: 63 [2025-04-29 11:29:33,084 INFO L436 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-04-29 11:29:33,084 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 21 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:29:33,084 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 143 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:29:33,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-04-29 11:29:33,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2025-04-29 11:29:33,085 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-04-29 11:29:33,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2025-04-29 11:29:33,085 INFO L79 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 48 [2025-04-29 11:29:33,086 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:29:33,086 INFO L485 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2025-04-29 11:29:33,086 INFO L486 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-04-29 11:29:33,086 INFO L278 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2025-04-29 11:29:33,086 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-04-29 11:29:33,086 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:29:33,086 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-04-29 11:29:33,092 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-04-29 11:29:33,290 WARN L466 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-04-29 11:29:33,290 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting selectionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 15 more)] === [2025-04-29 11:29:33,290 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:29:33,290 INFO L85 PathProgramCache]: Analyzing trace with hash 2079472655, now seen corresponding path program 6 times [2025-04-29 11:29:33,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:29:33,290 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576501743] [2025-04-29 11:29:33,290 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-29 11:29:33,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:29:33,295 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 51 statements into 5 equivalence classes. [2025-04-29 11:29:33,303 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 35 of 51 statements. [2025-04-29 11:29:33,303 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-29 11:29:33,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:29:33,496 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-04-29 11:29:33,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:29:33,497 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576501743] [2025-04-29 11:29:33,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576501743] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:29:33,497 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602432443] [2025-04-29 11:29:33,497 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-29 11:29:33,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:29:33,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:29:33,499 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-04-29 11:29:33,500 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-04-29 11:29:33,535 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 51 statements into 5 equivalence classes. [2025-04-29 11:29:33,551 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 35 of 51 statements. [2025-04-29 11:29:33,551 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-29 11:29:33,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:29:33,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-29 11:29:33,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:29:33,821 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 10 proven. 24 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-04-29 11:29:33,822 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:29:34,318 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-04-29 11:29:34,340 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 2 proven. 32 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-04-29 11:29:34,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602432443] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:29:34,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:29:34,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 32 [2025-04-29 11:29:34,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916387278] [2025-04-29 11:29:34,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:29:34,340 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-29 11:29:34,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:29:34,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-29 11:29:34,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=932, Unknown=0, NotChecked=0, Total=1056 [2025-04-29 11:29:34,341 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand has 33 states, 30 states have (on average 3.033333333333333) internal successors, (91), 27 states have internal predecessors, (91), 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-04-29 11:29:34,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:29:34,681 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2025-04-29 11:29:34,682 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-29 11:29:34,682 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 3.033333333333333) internal successors, (91), 27 states have internal predecessors, (91), 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 51 [2025-04-29 11:29:34,682 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:29:34,682 INFO L225 Difference]: With dead ends: 67 [2025-04-29 11:29:34,682 INFO L226 Difference]: Without dead ends: 0 [2025-04-29 11:29:34,683 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=258, Invalid=1464, Unknown=0, NotChecked=0, Total=1722 [2025-04-29 11:29:34,683 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 109 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:29:34,683 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 113 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:29:34,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-29 11:29:34,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-29 11:29:34,684 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-04-29 11:29:34,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-29 11:29:34,684 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2025-04-29 11:29:34,684 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:29:34,684 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-29 11:29:34,684 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 3.033333333333333) internal successors, (91), 27 states have internal predecessors, (91), 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-04-29 11:29:34,684 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-29 11:29:34,684 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-29 11:29:34,686 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 18 remaining) [2025-04-29 11:29:34,686 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 18 remaining) [2025-04-29 11:29:34,686 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (15 of 18 remaining) [2025-04-29 11:29:34,686 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (14 of 18 remaining) [2025-04-29 11:29:34,686 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE (13 of 18 remaining) [2025-04-29 11:29:34,686 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (12 of 18 remaining) [2025-04-29 11:29:34,687 INFO L790 garLoopResultBuilder]: Registering result SAFE for location selectionSortErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 18 remaining) [2025-04-29 11:29:34,687 INFO L790 garLoopResultBuilder]: Registering result SAFE for location selectionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 18 remaining) [2025-04-29 11:29:34,687 INFO L790 garLoopResultBuilder]: Registering result SAFE for location selectionSortErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 18 remaining) [2025-04-29 11:29:34,687 INFO L790 garLoopResultBuilder]: Registering result SAFE for location selectionSortErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 18 remaining) [2025-04-29 11:29:34,687 INFO L790 garLoopResultBuilder]: Registering result SAFE for location selectionSortErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 18 remaining) [2025-04-29 11:29:34,687 INFO L790 garLoopResultBuilder]: Registering result SAFE for location selectionSortErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 18 remaining) [2025-04-29 11:29:34,687 INFO L790 garLoopResultBuilder]: Registering result SAFE for location selectionSortErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 18 remaining) [2025-04-29 11:29:34,687 INFO L790 garLoopResultBuilder]: Registering result SAFE for location selectionSortErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 18 remaining) [2025-04-29 11:29:34,687 INFO L790 garLoopResultBuilder]: Registering result SAFE for location selectionSortErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 18 remaining) [2025-04-29 11:29:34,687 INFO L790 garLoopResultBuilder]: Registering result SAFE for location selectionSortErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 18 remaining) [2025-04-29 11:29:34,687 INFO L790 garLoopResultBuilder]: Registering result SAFE for location selectionSortErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 18 remaining) [2025-04-29 11:29:34,687 INFO L790 garLoopResultBuilder]: Registering result SAFE for location selectionSortErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 18 remaining) [2025-04-29 11:29:34,695 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-04-29 11:29:34,892 WARN L466 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-04-29 11:29:34,894 INFO L422 BasicCegarLoop]: Path program histogram: [6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:29:34,895 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 11:29:34,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 11:29:34 BoogieIcfgContainer [2025-04-29 11:29:34,897 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 11:29:34,898 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 11:29:34,898 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 11:29:34,898 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 11:29:34,898 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:29:21" (3/4) ... [2025-04-29 11:29:34,900 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-04-29 11:29:34,904 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure selectionSort [2025-04-29 11:29:34,906 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-04-29 11:29:34,906 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-04-29 11:29:34,906 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-04-29 11:29:34,906 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-04-29 11:29:34,957 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-29 11:29:34,957 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-29 11:29:34,957 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 11:29:34,958 INFO L158 Benchmark]: Toolchain (without parser) took 14307.62ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 114.0MB in the beginning and 242.5MB in the end (delta: -128.5MB). Peak memory consumption was 113.8MB. Max. memory is 16.1GB. [2025-04-29 11:29:34,958 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:29:34,959 INFO L158 Benchmark]: CACSL2BoogieTranslator took 214.64ms. Allocated memory is still 142.6MB. Free memory was 114.0MB in the beginning and 100.5MB in the end (delta: 13.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:29:34,959 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.67ms. Allocated memory is still 142.6MB. Free memory was 100.0MB in the beginning and 99.0MB in the end (delta: 988.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:29:34,959 INFO L158 Benchmark]: Boogie Preprocessor took 37.08ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 97.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:29:34,960 INFO L158 Benchmark]: RCFGBuilder took 260.32ms. Allocated memory is still 142.6MB. Free memory was 97.0MB in the beginning and 82.7MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:29:34,960 INFO L158 Benchmark]: TraceAbstraction took 13698.01ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 81.7MB in the beginning and 250.2MB in the end (delta: -168.5MB). Peak memory consumption was 71.9MB. Max. memory is 16.1GB. [2025-04-29 11:29:34,960 INFO L158 Benchmark]: Witness Printer took 59.66ms. Allocated memory is still 385.9MB. Free memory was 250.2MB in the beginning and 242.5MB in the end (delta: 7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:29:34,963 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.15ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 214.64ms. Allocated memory is still 142.6MB. Free memory was 114.0MB in the beginning and 100.5MB in the end (delta: 13.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.67ms. Allocated memory is still 142.6MB. Free memory was 100.0MB in the beginning and 99.0MB in the end (delta: 988.0kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.08ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 97.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 260.32ms. Allocated memory is still 142.6MB. Free memory was 97.0MB in the beginning and 82.7MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 13698.01ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 81.7MB in the beginning and 250.2MB in the end (delta: -168.5MB). Peak memory consumption was 71.9MB. Max. memory is 16.1GB. * Witness Printer took 59.66ms. Allocated memory is still 385.9MB. Free memory was 250.2MB in the beginning and 242.5MB in the end (delta: 7.7MB). 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: -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: 39]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 39]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 39]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 23]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - 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, 54 edges, 18 error locations. Started 1 CEGAR loops. OverallTime: 13.7s, OverallIterations: 24, TraceHistogramMax: 5, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1382 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1376 mSDsluCounter, 2852 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2227 mSDsCounter, 78 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4005 IncrementalHoareTripleChecker+Invalid, 4083 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 78 mSolverCounterUnsat, 625 mSDtfsCounter, 4005 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1079 GetRequests, 674 SyntacticMatches, 33 SemanticMatches, 372 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2133 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=14, InterpolantAutomatonStates: 223, 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, 168 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 959 NumberOfCodeBlocks, 879 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 1332 ConstructedInterpolants, 0 QuantifiedInterpolants, 10506 SizeOfPredicates, 97 NumberOfNonLiveVariables, 1800 ConjunctsInSsa, 219 ConjunctsInUnsatCore, 52 InterpolantComputations, 10 PerfectInterpolantSequences, 621/968 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-04-29 11:29:34,977 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