./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/termination-recursive-malloc/selectionSort_recursive.i --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.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash ff7f98b41a2da3578e790df894a867e943a0857e97661a8032b524a76ca3b438 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:49:23,954 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:49:24,000 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-04-30 10:49:24,006 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:49:24,006 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:49:24,029 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:49:24,029 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:49:24,029 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:49:24,030 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:49:24,030 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:49:24,030 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:49:24,030 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:49:24,030 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:49:24,030 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:49:24,030 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:49:24,030 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:49:24,031 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:49:24,031 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:49:24,031 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-30 10:49:24,031 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-30 10:49:24,031 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-30 10:49:24,031 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:49:24,031 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-30 10:49:24,031 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:49:24,031 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:49:24,031 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:49:24,031 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:49:24,032 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:49:24,032 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:49:24,032 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:49:24,032 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:49:24,032 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:49:24,032 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:49:24,032 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:49:24,032 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:49:24,032 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:49:24,032 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:49:24,032 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:49:24,032 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:49:24,033 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:49:24,033 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:49:24,033 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:49:24,033 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:49:24,033 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ff7f98b41a2da3578e790df894a867e943a0857e97661a8032b524a76ca3b438 [2025-04-30 10:49:24,239 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:49:24,243 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:49:24,246 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:49:24,247 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:49:24,247 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:49:24,248 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/termination-recursive-malloc/selectionSort_recursive.i [2025-04-30 10:49:25,536 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a073e918b/6f7f70e371d34b38952f112855393102/FLAG4194338c7 [2025-04-30 10:49:25,712 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:49:25,717 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/termination-recursive-malloc/selectionSort_recursive.i [2025-04-30 10:49:25,742 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a073e918b/6f7f70e371d34b38952f112855393102/FLAG4194338c7 [2025-04-30 10:49:26,537 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a073e918b/6f7f70e371d34b38952f112855393102 [2025-04-30 10:49:26,539 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:49:26,540 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:49:26,541 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:49:26,541 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:49:26,544 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:49:26,545 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:49:26" (1/1) ... [2025-04-30 10:49:26,545 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@184bd3a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:49:26, skipping insertion in model container [2025-04-30 10:49:26,546 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:49:26" (1/1) ... [2025-04-30 10:49:26,555 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:49:26,708 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:49:26,714 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:49:26,733 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:49:26,742 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:49:26,742 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:49:26 WrapperNode [2025-04-30 10:49:26,742 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:49:26,743 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:49:26,743 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:49:26,743 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:49:26,749 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:49:26" (1/1) ... [2025-04-30 10:49:26,756 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:49:26" (1/1) ... [2025-04-30 10:49:26,772 INFO L138 Inliner]: procedures = 11, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 31 [2025-04-30 10:49:26,772 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:49:26,773 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:49:26,773 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:49:26,773 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:49:26,778 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:49:26" (1/1) ... [2025-04-30 10:49:26,779 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:49:26" (1/1) ... [2025-04-30 10:49:26,785 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:49:26" (1/1) ... [2025-04-30 10:49:26,796 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-30 10:49:26,797 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:49:26" (1/1) ... [2025-04-30 10:49:26,797 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:49:26" (1/1) ... [2025-04-30 10:49:26,802 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:49:26" (1/1) ... [2025-04-30 10:49:26,807 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:49:26" (1/1) ... [2025-04-30 10:49:26,809 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:49:26" (1/1) ... [2025-04-30 10:49:26,810 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:49:26" (1/1) ... [2025-04-30 10:49:26,812 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:49:26" (1/1) ... [2025-04-30 10:49:26,814 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:49:26,815 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:49:26,816 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:49:26,816 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:49:26,817 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:49:26" (1/1) ... [2025-04-30 10:49:26,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:49:26,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:49:26,843 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-30 10:49:26,847 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-30 10:49:26,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-30 10:49:26,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-30 10:49:26,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:49:26,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:49:26,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-30 10:49:26,866 INFO L130 BoogieDeclarations]: Found specification of procedure selectionSort [2025-04-30 10:49:26,866 INFO L138 BoogieDeclarations]: Found implementation of procedure selectionSort [2025-04-30 10:49:26,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-30 10:49:26,910 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:49:26,911 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:49:27,058 INFO L? ?]: Removed 44 outVars from TransFormulas that were not future-live. [2025-04-30 10:49:27,058 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:49:27,066 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:49:27,066 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:49:27,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:49:27 BoogieIcfgContainer [2025-04-30 10:49:27,067 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:49:27,068 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:49:27,068 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:49:27,071 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:49:27,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:49:26" (1/3) ... [2025-04-30 10:49:27,072 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@329a6462 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:49:27, skipping insertion in model container [2025-04-30 10:49:27,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:49:26" (2/3) ... [2025-04-30 10:49:27,072 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@329a6462 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:49:27, skipping insertion in model container [2025-04-30 10:49:27,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:49:27" (3/3) ... [2025-04-30 10:49:27,073 INFO L128 eAbstractionObserver]: Analyzing ICFG selectionSort_recursive.i [2025-04-30 10:49:27,082 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:49:27,084 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG selectionSort_recursive.i that has 2 procedures, 47 locations, 54 edges, 1 initial locations, 2 loop locations, and 18 error locations. [2025-04-30 10:49:27,110 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:49:27,118 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;@4e9d38e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:49:27,119 INFO L341 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-04-30 10:49:27,121 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-30 10:49:27,129 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-04-30 10:49:27,129 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:49:27,129 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-04-30 10:49:27,129 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-30 10:49:27,133 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:49:27,133 INFO L85 PathProgramCache]: Analyzing trace with hash 925624, now seen corresponding path program 1 times [2025-04-30 10:49:27,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:49:27,138 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040753767] [2025-04-30 10:49:27,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:49:27,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:49:27,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-30 10:49:27,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-30 10:49:27,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:49:27,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:49:27,234 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-30 10:49:27,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:49:27,236 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040753767] [2025-04-30 10:49:27,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040753767] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:49:27,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:49:27,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:49:27,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784818881] [2025-04-30 10:49:27,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:49:27,241 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:49:27,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:49:27,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:49:27,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:49:27,258 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-30 10:49:27,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:49:27,324 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2025-04-30 10:49:27,326 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:49:27,327 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-30 10:49:27,327 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:49:27,331 INFO L225 Difference]: With dead ends: 48 [2025-04-30 10:49:27,331 INFO L226 Difference]: Without dead ends: 45 [2025-04-30 10:49:27,332 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-30 10:49:27,335 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-30 10:49:27,335 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-30 10:49:27,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-04-30 10:49:27,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-04-30 10:49:27,357 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-30 10:49:27,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2025-04-30 10:49:27,361 INFO L79 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 4 [2025-04-30 10:49:27,361 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:49:27,361 INFO L485 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2025-04-30 10:49:27,362 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-30 10:49:27,362 INFO L278 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2025-04-30 10:49:27,362 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-30 10:49:27,362 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:49:27,362 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-30 10:49:27,362 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:49:27,362 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-30 10:49:27,363 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:49:27,363 INFO L85 PathProgramCache]: Analyzing trace with hash 28695814, now seen corresponding path program 1 times [2025-04-30 10:49:27,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:49:27,363 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885202902] [2025-04-30 10:49:27,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:49:27,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:49:27,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-30 10:49:27,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-30 10:49:27,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:49:27,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:49:27,457 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-30 10:49:27,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:49:27,457 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885202902] [2025-04-30 10:49:27,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885202902] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:49:27,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:49:27,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:49:27,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790008829] [2025-04-30 10:49:27,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:49:27,458 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:49:27,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:49:27,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:49:27,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:49:27,459 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-30 10:49:27,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:49:27,491 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2025-04-30 10:49:27,491 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:49:27,492 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-30 10:49:27,492 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:49:27,492 INFO L225 Difference]: With dead ends: 43 [2025-04-30 10:49:27,492 INFO L226 Difference]: Without dead ends: 43 [2025-04-30 10:49:27,492 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-30 10:49:27,493 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-30 10:49:27,493 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-30 10:49:27,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-04-30 10:49:27,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-04-30 10:49:27,495 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-30 10:49:27,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2025-04-30 10:49:27,496 INFO L79 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 5 [2025-04-30 10:49:27,496 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:49:27,496 INFO L485 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2025-04-30 10:49:27,496 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-30 10:49:27,496 INFO L278 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2025-04-30 10:49:27,497 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-30 10:49:27,497 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:49:27,497 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-30 10:49:27,497 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:49:27,497 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-30 10:49:27,497 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:49:27,497 INFO L85 PathProgramCache]: Analyzing trace with hash 28695815, now seen corresponding path program 1 times [2025-04-30 10:49:27,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:49:27,497 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642535873] [2025-04-30 10:49:27,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:49:27,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:49:27,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-30 10:49:27,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-30 10:49:27,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:49:27,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:49:27,652 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-30 10:49:27,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:49:27,653 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642535873] [2025-04-30 10:49:27,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642535873] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:49:27,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:49:27,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:49:27,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660599041] [2025-04-30 10:49:27,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:49:27,654 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:49:27,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:49:27,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:49:27,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:49:27,654 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-30 10:49:27,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:49:27,744 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2025-04-30 10:49:27,744 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:49:27,745 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-30 10:49:27,745 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:49:27,745 INFO L225 Difference]: With dead ends: 46 [2025-04-30 10:49:27,745 INFO L226 Difference]: Without dead ends: 46 [2025-04-30 10:49:27,745 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-30 10:49:27,746 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-30 10:49:27,746 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-30 10:49:27,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-04-30 10:49:27,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2025-04-30 10:49:27,752 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-30 10:49:27,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2025-04-30 10:49:27,753 INFO L79 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 5 [2025-04-30 10:49:27,753 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:49:27,753 INFO L485 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2025-04-30 10:49:27,753 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-30 10:49:27,753 INFO L278 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2025-04-30 10:49:27,753 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-30 10:49:27,753 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:49:27,753 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:49:27,753 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:49:27,753 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-30 10:49:27,754 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:49:27,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1463014174, now seen corresponding path program 1 times [2025-04-30 10:49:27,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:49:27,754 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882601693] [2025-04-30 10:49:27,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:49:27,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:49:27,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-30 10:49:27,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-30 10:49:27,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:49:27,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:49:27,813 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-30 10:49:27,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:49:27,813 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882601693] [2025-04-30 10:49:27,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882601693] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:49:27,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:49:27,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:49:27,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147698528] [2025-04-30 10:49:27,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:49:27,814 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:49:27,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:49:27,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:49:27,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:49:27,814 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-30 10:49:27,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:49:27,830 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2025-04-30 10:49:27,832 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:49:27,832 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-30 10:49:27,832 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:49:27,832 INFO L225 Difference]: With dead ends: 46 [2025-04-30 10:49:27,832 INFO L226 Difference]: Without dead ends: 46 [2025-04-30 10:49:27,832 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-30 10:49:27,833 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-30 10:49:27,833 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-30 10:49:27,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-04-30 10:49:27,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2025-04-30 10:49:27,835 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-30 10:49:27,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2025-04-30 10:49:27,840 INFO L79 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 9 [2025-04-30 10:49:27,840 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:49:27,840 INFO L485 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2025-04-30 10:49:27,840 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-30 10:49:27,840 INFO L278 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2025-04-30 10:49:27,840 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-30 10:49:27,840 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:49:27,840 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-04-30 10:49:27,840 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:49:27,840 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-30 10:49:27,841 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:49:27,841 INFO L85 PathProgramCache]: Analyzing trace with hash 178487949, now seen corresponding path program 1 times [2025-04-30 10:49:27,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:49:27,841 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673741039] [2025-04-30 10:49:27,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:49:27,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:49:27,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-30 10:49:27,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-30 10:49:27,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:49:27,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:49:28,077 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-30 10:49:28,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:49:28,077 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673741039] [2025-04-30 10:49:28,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673741039] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:49:28,077 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626436191] [2025-04-30 10:49:28,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:49:28,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:49:28,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:49:28,080 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-30 10:49:28,082 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-30 10:49:28,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-30 10:49:28,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-30 10:49:28,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:49:28,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:49:28,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-30 10:49:28,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:49:28,160 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-30 10:49:28,344 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-30 10:49:28,345 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:49:28,547 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-30 10:49:28,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626436191] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:49:28,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:49:28,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 15 [2025-04-30 10:49:28,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076440457] [2025-04-30 10:49:28,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:49:28,548 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-30 10:49:28,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:49:28,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-30 10:49:28,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2025-04-30 10:49:28,549 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-30 10:49:28,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:49:28,718 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2025-04-30 10:49:28,718 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:49:28,718 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-30 10:49:28,718 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:49:28,719 INFO L225 Difference]: With dead ends: 45 [2025-04-30 10:49:28,719 INFO L226 Difference]: Without dead ends: 45 [2025-04-30 10:49:28,719 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2025-04-30 10:49:28,719 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-30 10:49:28,720 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-30 10:49:28,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-04-30 10:49:28,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2025-04-30 10:49:28,724 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-30 10:49:28,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2025-04-30 10:49:28,727 INFO L79 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 8 [2025-04-30 10:49:28,727 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:49:28,727 INFO L485 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2025-04-30 10:49:28,727 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-30 10:49:28,727 INFO L278 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2025-04-30 10:49:28,728 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-30 10:49:28,728 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:49:28,728 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:49:28,736 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-30 10:49:28,928 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-30 10:49:28,929 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-30 10:49:28,929 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:49:28,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1042761124, now seen corresponding path program 1 times [2025-04-30 10:49:28,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:49:28,929 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947688329] [2025-04-30 10:49:28,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:49:28,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:49:28,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-30 10:49:28,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-30 10:49:28,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:49:28,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:49:28,983 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-30 10:49:28,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:49:28,984 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947688329] [2025-04-30 10:49:28,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947688329] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:49:28,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:49:28,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:49:28,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396242271] [2025-04-30 10:49:28,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:49:28,984 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:49:28,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:49:28,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:49:28,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:49:28,985 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-30 10:49:29,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:49:29,047 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2025-04-30 10:49:29,048 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:49:29,048 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-30 10:49:29,048 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:49:29,048 INFO L225 Difference]: With dead ends: 37 [2025-04-30 10:49:29,048 INFO L226 Difference]: Without dead ends: 37 [2025-04-30 10:49:29,049 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-30 10:49:29,050 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.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:49:29,050 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.1s Time] [2025-04-30 10:49:29,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-04-30 10:49:29,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-04-30 10:49:29,052 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-30 10:49:29,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2025-04-30 10:49:29,052 INFO L79 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 12 [2025-04-30 10:49:29,052 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:49:29,052 INFO L485 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2025-04-30 10:49:29,052 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-30 10:49:29,052 INFO L278 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2025-04-30 10:49:29,054 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-30 10:49:29,055 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:49:29,055 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:49:29,055 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:49:29,055 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-30 10:49:29,055 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:49:29,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1042761125, now seen corresponding path program 1 times [2025-04-30 10:49:29,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:49:29,055 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578978601] [2025-04-30 10:49:29,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:49:29,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:49:29,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-30 10:49:29,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-30 10:49:29,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:49:29,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:49:29,136 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-30 10:49:29,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:49:29,137 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578978601] [2025-04-30 10:49:29,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578978601] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:49:29,137 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926619371] [2025-04-30 10:49:29,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:49:29,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:49:29,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:49:29,139 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-30 10:49:29,140 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-30 10:49:29,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-30 10:49:29,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-30 10:49:29,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:49:29,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:49:29,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-30 10:49:29,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:49:29,206 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-30 10:49:29,206 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:49:29,255 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-30 10:49:29,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926619371] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:49:29,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:49:29,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-04-30 10:49:29,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934328944] [2025-04-30 10:49:29,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:49:29,255 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-30 10:49:29,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:49:29,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-30 10:49:29,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-04-30 10:49:29,256 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-30 10:49:29,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:49:29,306 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2025-04-30 10:49:29,307 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:49:29,307 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-30 10:49:29,307 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:49:29,307 INFO L225 Difference]: With dead ends: 54 [2025-04-30 10:49:29,307 INFO L226 Difference]: Without dead ends: 54 [2025-04-30 10:49:29,307 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-30 10:49:29,308 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-30 10:49:29,308 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-30 10:49:29,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-04-30 10:49:29,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2025-04-30 10:49:29,310 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-30 10:49:29,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2025-04-30 10:49:29,313 INFO L79 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 12 [2025-04-30 10:49:29,313 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:49:29,313 INFO L485 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2025-04-30 10:49:29,313 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-30 10:49:29,313 INFO L278 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2025-04-30 10:49:29,313 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-30 10:49:29,314 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:49:29,314 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:49:29,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-30 10:49:29,514 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-30 10:49:29,514 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-30 10:49:29,514 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:49:29,515 INFO L85 PathProgramCache]: Analyzing trace with hash -2034157424, now seen corresponding path program 1 times [2025-04-30 10:49:29,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:49:29,515 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775892020] [2025-04-30 10:49:29,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:49:29,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:49:29,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-30 10:49:29,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-30 10:49:29,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:49:29,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:49:29,540 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-30 10:49:29,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:49:29,540 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775892020] [2025-04-30 10:49:29,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775892020] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:49:29,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:49:29,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:49:29,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179673504] [2025-04-30 10:49:29,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:49:29,541 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:49:29,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:49:29,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:49:29,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:49:29,541 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-30 10:49:29,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:49:29,545 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2025-04-30 10:49:29,546 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:49:29,546 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-30 10:49:29,546 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:49:29,547 INFO L225 Difference]: With dead ends: 44 [2025-04-30 10:49:29,547 INFO L226 Difference]: Without dead ends: 44 [2025-04-30 10:49:29,547 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-30 10:49:29,547 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-30 10:49:29,547 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-30 10:49:29,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-04-30 10:49:29,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-04-30 10:49:29,549 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-30 10:49:29,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2025-04-30 10:49:29,550 INFO L79 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 13 [2025-04-30 10:49:29,550 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:49:29,550 INFO L485 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2025-04-30 10:49:29,550 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-30 10:49:29,550 INFO L278 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2025-04-30 10:49:29,550 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-30 10:49:29,550 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:49:29,550 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:49:29,550 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:49:29,550 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-30 10:49:29,550 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:49:29,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1365629348, now seen corresponding path program 1 times [2025-04-30 10:49:29,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:49:29,550 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093923367] [2025-04-30 10:49:29,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:49:29,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:49:29,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-30 10:49:29,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-30 10:49:29,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:49:29,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:49:29,571 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-30 10:49:29,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:49:29,571 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093923367] [2025-04-30 10:49:29,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093923367] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:49:29,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:49:29,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:49:29,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072104315] [2025-04-30 10:49:29,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:49:29,572 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:49:29,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:49:29,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:49:29,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:49:29,572 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-30 10:49:29,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:49:29,581 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2025-04-30 10:49:29,581 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:49:29,581 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-30 10:49:29,581 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:49:29,582 INFO L225 Difference]: With dead ends: 43 [2025-04-30 10:49:29,582 INFO L226 Difference]: Without dead ends: 43 [2025-04-30 10:49:29,582 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-30 10:49:29,582 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-30 10:49:29,582 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-30 10:49:29,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-04-30 10:49:29,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-04-30 10:49:29,584 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-30 10:49:29,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2025-04-30 10:49:29,584 INFO L79 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 14 [2025-04-30 10:49:29,585 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:49:29,585 INFO L485 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2025-04-30 10:49:29,585 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-30 10:49:29,585 INFO L278 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2025-04-30 10:49:29,585 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-30 10:49:29,585 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:49:29,585 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:49:29,585 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-30 10:49:29,585 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-30 10:49:29,585 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:49:29,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1113816415, now seen corresponding path program 2 times [2025-04-30 10:49:29,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:49:29,586 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649550475] [2025-04-30 10:49:29,586 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:49:29,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:49:29,590 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-30 10:49:29,592 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 15 statements. [2025-04-30 10:49:29,592 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:49:29,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:49:29,606 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-30 10:49:29,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:49:29,607 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649550475] [2025-04-30 10:49:29,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649550475] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:49:29,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:49:29,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:49:29,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70651003] [2025-04-30 10:49:29,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:49:29,607 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:49:29,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:49:29,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:49:29,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:49:29,608 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-30 10:49:29,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:49:29,622 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2025-04-30 10:49:29,622 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:49:29,622 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-30 10:49:29,623 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:49:29,623 INFO L225 Difference]: With dead ends: 44 [2025-04-30 10:49:29,623 INFO L226 Difference]: Without dead ends: 44 [2025-04-30 10:49:29,623 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-30 10:49:29,623 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-30 10:49:29,624 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-30 10:49:29,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-04-30 10:49:29,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-04-30 10:49:29,627 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-30 10:49:29,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2025-04-30 10:49:29,630 INFO L79 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 15 [2025-04-30 10:49:29,630 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:49:29,630 INFO L485 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2025-04-30 10:49:29,630 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-30 10:49:29,630 INFO L278 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2025-04-30 10:49:29,631 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-30 10:49:29,631 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:49:29,631 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:49:29,631 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-30 10:49:29,631 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-30 10:49:29,631 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:49:29,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1113815935, now seen corresponding path program 1 times [2025-04-30 10:49:29,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:49:29,631 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32014841] [2025-04-30 10:49:29,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:49:29,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:49:29,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-30 10:49:29,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-30 10:49:29,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:49:29,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:49:29,835 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-30 10:49:29,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:49:29,835 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32014841] [2025-04-30 10:49:29,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32014841] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:49:29,835 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062760416] [2025-04-30 10:49:29,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:49:29,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:49:29,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:49:29,838 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-30 10:49:29,839 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-30 10:49:29,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-30 10:49:29,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-30 10:49:29,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:49:29,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:49:29,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-30 10:49:29,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:49:29,998 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-30 10:49:29,998 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:49:30,097 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-30 10:49:30,149 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-30 10:49:30,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2062760416] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:49:30,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:49:30,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2025-04-30 10:49:30,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333742559] [2025-04-30 10:49:30,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:49:30,150 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-30 10:49:30,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:49:30,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-30 10:49:30,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2025-04-30 10:49:30,152 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-30 10:49:30,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:49:30,428 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2025-04-30 10:49:30,428 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-30 10:49:30,428 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-30 10:49:30,428 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:49:30,428 INFO L225 Difference]: With dead ends: 73 [2025-04-30 10:49:30,428 INFO L226 Difference]: Without dead ends: 73 [2025-04-30 10:49:30,429 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-30 10:49:30,429 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-30 10:49:30,429 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-30 10:49:30,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-04-30 10:49:30,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 62. [2025-04-30 10:49:30,434 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-30 10:49:30,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 74 transitions. [2025-04-30 10:49:30,437 INFO L79 Accepts]: Start accepts. Automaton has 62 states and 74 transitions. Word has length 15 [2025-04-30 10:49:30,437 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:49:30,437 INFO L485 AbstractCegarLoop]: Abstraction has 62 states and 74 transitions. [2025-04-30 10:49:30,437 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-30 10:49:30,437 INFO L278 IsEmpty]: Start isEmpty. Operand 62 states and 74 transitions. [2025-04-30 10:49:30,437 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-30 10:49:30,437 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:49:30,437 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:49:30,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-30 10:49:30,638 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-30 10:49:30,638 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-30 10:49:30,638 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:49:30,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1890187417, now seen corresponding path program 1 times [2025-04-30 10:49:30,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:49:30,638 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054702115] [2025-04-30 10:49:30,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:49:30,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:49:30,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-30 10:49:30,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:49:30,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:49:30,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:49:30,695 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-30 10:49:30,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:49:30,695 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054702115] [2025-04-30 10:49:30,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054702115] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:49:30,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:49:30,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:49:30,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502586201] [2025-04-30 10:49:30,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:49:30,696 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:49:30,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:49:30,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:49:30,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:49:30,697 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-30 10:49:30,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:49:30,719 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2025-04-30 10:49:30,719 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:49:30,719 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-30 10:49:30,719 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:49:30,719 INFO L225 Difference]: With dead ends: 61 [2025-04-30 10:49:30,719 INFO L226 Difference]: Without dead ends: 48 [2025-04-30 10:49:30,720 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-30 10:49:30,720 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-30 10:49:30,720 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-30 10:49:30,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-04-30 10:49:30,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2025-04-30 10:49:30,722 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-30 10:49:30,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2025-04-30 10:49:30,722 INFO L79 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 16 [2025-04-30 10:49:30,722 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:49:30,722 INFO L485 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2025-04-30 10:49:30,722 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-30 10:49:30,722 INFO L278 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2025-04-30 10:49:30,722 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-30 10:49:30,722 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:49:30,722 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:49:30,722 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-30 10:49:30,724 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-30 10:49:30,725 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:49:30,725 INFO L85 PathProgramCache]: Analyzing trace with hash 168555598, now seen corresponding path program 1 times [2025-04-30 10:49:30,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:49:30,725 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435701242] [2025-04-30 10:49:30,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:49:30,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:49:30,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-30 10:49:30,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:49:30,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:49:30,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:49:30,822 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-30 10:49:30,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:49:30,822 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435701242] [2025-04-30 10:49:30,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435701242] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:49:30,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:49:30,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:49:30,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37408961] [2025-04-30 10:49:30,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:49:30,823 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:49:30,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:49:30,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:49:30,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:49:30,823 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-30 10:49:30,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:49:30,894 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2025-04-30 10:49:30,895 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:49:30,895 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-30 10:49:30,895 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:49:30,895 INFO L225 Difference]: With dead ends: 63 [2025-04-30 10:49:30,895 INFO L226 Difference]: Without dead ends: 63 [2025-04-30 10:49:30,895 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-30 10:49:30,895 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-30 10:49:30,896 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-30 10:49:30,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-04-30 10:49:30,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 56. [2025-04-30 10:49:30,897 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-30 10:49:30,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2025-04-30 10:49:30,897 INFO L79 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 16 [2025-04-30 10:49:30,897 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:49:30,898 INFO L485 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2025-04-30 10:49:30,898 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-30 10:49:30,898 INFO L278 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2025-04-30 10:49:30,898 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-30 10:49:30,898 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:49:30,898 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:49:30,898 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-30 10:49:30,898 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-30 10:49:30,898 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:49:30,898 INFO L85 PathProgramCache]: Analyzing trace with hash 2134343793, now seen corresponding path program 1 times [2025-04-30 10:49:30,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:49:30,902 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505766525] [2025-04-30 10:49:30,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:49:30,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:49:30,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-30 10:49:30,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-30 10:49:30,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:49:30,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:49:31,001 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-30 10:49:31,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:49:31,001 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505766525] [2025-04-30 10:49:31,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505766525] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:49:31,001 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256558062] [2025-04-30 10:49:31,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:49:31,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:49:31,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:49:31,003 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-30 10:49:31,004 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-30 10:49:31,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-30 10:49:31,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-30 10:49:31,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:49:31,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:49:31,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-30 10:49:31,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:49:31,110 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-30 10:49:31,111 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:49:31,176 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-30 10:49:31,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256558062] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:49:31,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:49:31,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 17 [2025-04-30 10:49:31,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389170128] [2025-04-30 10:49:31,177 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:49:31,177 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-30 10:49:31,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:49:31,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-30 10:49:31,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2025-04-30 10:49:31,178 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-30 10:49:31,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:49:31,333 INFO L93 Difference]: Finished difference Result 108 states and 122 transitions. [2025-04-30 10:49:31,334 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-30 10:49:31,334 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-30 10:49:31,334 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:49:31,335 INFO L225 Difference]: With dead ends: 108 [2025-04-30 10:49:31,335 INFO L226 Difference]: Without dead ends: 108 [2025-04-30 10:49:31,335 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-30 10:49:31,335 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-30 10:49:31,335 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-30 10:49:31,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-04-30 10:49:31,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 95. [2025-04-30 10:49:31,342 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-30 10:49:31,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 116 transitions. [2025-04-30 10:49:31,342 INFO L79 Accepts]: Start accepts. Automaton has 95 states and 116 transitions. Word has length 20 [2025-04-30 10:49:31,342 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:49:31,343 INFO L485 AbstractCegarLoop]: Abstraction has 95 states and 116 transitions. [2025-04-30 10:49:31,343 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-30 10:49:31,343 INFO L278 IsEmpty]: Start isEmpty. Operand 95 states and 116 transitions. [2025-04-30 10:49:31,343 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-30 10:49:31,343 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:49:31,343 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-30 10:49:31,352 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-30 10:49:31,543 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-30 10:49:31,544 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-30 10:49:31,544 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:49:31,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1946779564, now seen corresponding path program 1 times [2025-04-30 10:49:31,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:49:31,544 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140386950] [2025-04-30 10:49:31,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:49:31,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:49:31,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-30 10:49:31,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-30 10:49:31,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:49:31,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:49:31,687 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-30 10:49:31,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:49:31,688 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140386950] [2025-04-30 10:49:31,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140386950] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:49:31,688 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57550881] [2025-04-30 10:49:31,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:49:31,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:49:31,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:49:31,690 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-30 10:49:31,692 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-30 10:49:31,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-30 10:49:31,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-30 10:49:31,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:49:31,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:49:31,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-30 10:49:31,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:49:31,833 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-30 10:49:31,833 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:49:31,882 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-30 10:49:31,939 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-30 10:49:31,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [57550881] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:49:31,939 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:49:31,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2025-04-30 10:49:31,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769819537] [2025-04-30 10:49:31,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:49:31,940 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-30 10:49:31,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:49:31,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-30 10:49:31,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2025-04-30 10:49:31,940 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-30 10:49:32,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:49:32,399 INFO L93 Difference]: Finished difference Result 122 states and 145 transitions. [2025-04-30 10:49:32,399 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-30 10:49:32,399 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-30 10:49:32,399 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:49:32,400 INFO L225 Difference]: With dead ends: 122 [2025-04-30 10:49:32,400 INFO L226 Difference]: Without dead ends: 122 [2025-04-30 10:49:32,401 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-30 10:49:32,401 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 127 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-30 10:49:32,401 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-30 10:49:32,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-04-30 10:49:32,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 76. [2025-04-30 10:49:32,404 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-30 10:49:32,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 90 transitions. [2025-04-30 10:49:32,404 INFO L79 Accepts]: Start accepts. Automaton has 76 states and 90 transitions. Word has length 22 [2025-04-30 10:49:32,404 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:49:32,404 INFO L485 AbstractCegarLoop]: Abstraction has 76 states and 90 transitions. [2025-04-30 10:49:32,405 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-30 10:49:32,405 INFO L278 IsEmpty]: Start isEmpty. Operand 76 states and 90 transitions. [2025-04-30 10:49:32,405 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-30 10:49:32,405 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:49:32,405 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:49:32,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-30 10:49:32,609 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-30 10:49:32,609 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-30 10:49:32,609 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:49:32,609 INFO L85 PathProgramCache]: Analyzing trace with hash -184197589, now seen corresponding path program 2 times [2025-04-30 10:49:32,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:49:32,609 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557929209] [2025-04-30 10:49:32,609 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:49:32,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:49:32,613 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-30 10:49:32,626 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-30 10:49:32,626 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:49:32,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:49:32,823 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-30 10:49:32,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:49:32,823 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557929209] [2025-04-30 10:49:32,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557929209] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:49:32,823 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939531841] [2025-04-30 10:49:32,823 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:49:32,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:49:32,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:49:32,825 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-30 10:49:32,827 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-30 10:49:32,850 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-30 10:49:32,860 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-30 10:49:32,860 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:49:32,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:49:32,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-04-30 10:49:32,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:49:33,013 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-30 10:49:33,013 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:49:33,142 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-30 10:49:33,224 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-30 10:49:33,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939531841] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:49:33,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:49:33,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 24 [2025-04-30 10:49:33,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914032910] [2025-04-30 10:49:33,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:49:33,225 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-30 10:49:33,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:49:33,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-30 10:49:33,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2025-04-30 10:49:33,226 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-30 10:49:33,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:49:33,821 INFO L93 Difference]: Finished difference Result 90 states and 106 transitions. [2025-04-30 10:49:33,821 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-30 10:49:33,821 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-30 10:49:33,821 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:49:33,822 INFO L225 Difference]: With dead ends: 90 [2025-04-30 10:49:33,822 INFO L226 Difference]: Without dead ends: 90 [2025-04-30 10:49:33,822 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-30 10:49:33,823 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-30 10:49:33,823 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-30 10:49:33,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-04-30 10:49:33,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 75. [2025-04-30 10:49:33,825 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-30 10:49:33,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 88 transitions. [2025-04-30 10:49:33,825 INFO L79 Accepts]: Start accepts. Automaton has 75 states and 88 transitions. Word has length 23 [2025-04-30 10:49:33,825 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:49:33,825 INFO L485 AbstractCegarLoop]: Abstraction has 75 states and 88 transitions. [2025-04-30 10:49:33,825 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-30 10:49:33,825 INFO L278 IsEmpty]: Start isEmpty. Operand 75 states and 88 transitions. [2025-04-30 10:49:33,826 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-30 10:49:33,826 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:49:33,826 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-30 10:49:33,832 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-30 10:49:34,026 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-30 10:49:34,026 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-30 10:49:34,027 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:49:34,027 INFO L85 PathProgramCache]: Analyzing trace with hash 2109281953, now seen corresponding path program 1 times [2025-04-30 10:49:34,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:49:34,027 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223775548] [2025-04-30 10:49:34,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:49:34,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:49:34,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-30 10:49:34,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-30 10:49:34,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:49:34,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:49:34,168 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-30 10:49:34,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:49:34,169 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223775548] [2025-04-30 10:49:34,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223775548] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:49:34,169 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191168206] [2025-04-30 10:49:34,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:49:34,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:49:34,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:49:34,171 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-30 10:49:34,172 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-30 10:49:34,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-30 10:49:34,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-30 10:49:34,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:49:34,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:49:34,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-30 10:49:34,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:49:34,314 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-30 10:49:34,314 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:49:34,385 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-30 10:49:34,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1191168206] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:49:34,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:49:34,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 18 [2025-04-30 10:49:34,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620194813] [2025-04-30 10:49:34,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:49:34,385 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-30 10:49:34,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:49:34,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-30 10:49:34,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2025-04-30 10:49:34,386 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-30 10:49:34,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:49:34,478 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2025-04-30 10:49:34,478 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:49:34,478 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-30 10:49:34,478 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:49:34,478 INFO L225 Difference]: With dead ends: 67 [2025-04-30 10:49:34,479 INFO L226 Difference]: Without dead ends: 49 [2025-04-30 10:49:34,479 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-30 10:49:34,480 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-30 10:49:34,480 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-30 10:49:34,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-04-30 10:49:34,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2025-04-30 10:49:34,483 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-30 10:49:34,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2025-04-30 10:49:34,483 INFO L79 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 30 [2025-04-30 10:49:34,483 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:49:34,483 INFO L485 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2025-04-30 10:49:34,483 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-30 10:49:34,483 INFO L278 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2025-04-30 10:49:34,484 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-30 10:49:34,485 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:49:34,485 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-30 10:49:34,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-30 10:49:34,685 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-30 10:49:34,685 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-30 10:49:34,686 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:49:34,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1942000603, now seen corresponding path program 2 times [2025-04-30 10:49:34,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:49:34,686 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376075872] [2025-04-30 10:49:34,686 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:49:34,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:49:34,691 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-30 10:49:34,697 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-30 10:49:34,697 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:49:34,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:49:34,803 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-30 10:49:34,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:49:34,803 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376075872] [2025-04-30 10:49:34,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376075872] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:49:34,803 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1653915697] [2025-04-30 10:49:34,803 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:49:34,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:49:34,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:49:34,805 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-30 10:49:34,807 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-30 10:49:34,835 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-30 10:49:34,849 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-30 10:49:34,849 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:49:34,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:49:34,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-30 10:49:34,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:49:34,938 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-30 10:49:34,939 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:49:35,019 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-30 10:49:35,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1653915697] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:49:35,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:49:35,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2025-04-30 10:49:35,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361890303] [2025-04-30 10:49:35,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:49:35,019 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-30 10:49:35,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:49:35,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-30 10:49:35,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2025-04-30 10:49:35,020 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-30 10:49:35,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:49:35,178 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2025-04-30 10:49:35,178 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-30 10:49:35,178 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-30 10:49:35,178 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:49:35,178 INFO L225 Difference]: With dead ends: 59 [2025-04-30 10:49:35,178 INFO L226 Difference]: Without dead ends: 59 [2025-04-30 10:49:35,179 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-30 10:49:35,179 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-30 10:49:35,179 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-30 10:49:35,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-04-30 10:49:35,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 52. [2025-04-30 10:49:35,180 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-30 10:49:35,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2025-04-30 10:49:35,181 INFO L79 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 33 [2025-04-30 10:49:35,181 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:49:35,181 INFO L485 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2025-04-30 10:49:35,181 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-30 10:49:35,181 INFO L278 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2025-04-30 10:49:35,181 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-30 10:49:35,181 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:49:35,181 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-30 10:49:35,188 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-30 10:49:35,381 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-30 10:49:35,382 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-30 10:49:35,382 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:49:35,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1758987893, now seen corresponding path program 3 times [2025-04-30 10:49:35,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:49:35,382 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118062316] [2025-04-30 10:49:35,382 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:49:35,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:49:35,390 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 4 equivalence classes. [2025-04-30 10:49:35,398 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 38 statements. [2025-04-30 10:49:35,398 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-30 10:49:35,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:49:35,585 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-30 10:49:35,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:49:35,586 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118062316] [2025-04-30 10:49:35,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118062316] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:49:35,586 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771323016] [2025-04-30 10:49:35,586 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:49:35,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:49:35,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:49:35,588 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-30 10:49:35,589 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-30 10:49:35,619 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 4 equivalence classes. [2025-04-30 10:49:35,634 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 38 statements. [2025-04-30 10:49:35,635 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-30 10:49:35,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:49:35,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-30 10:49:35,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:49:35,851 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-30 10:49:35,851 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:49:36,225 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-30 10:49:36,241 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-30 10:49:36,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771323016] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:49:36,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:49:36,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2025-04-30 10:49:36,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949176993] [2025-04-30 10:49:36,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:49:36,241 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-30 10:49:36,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:49:36,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-30 10:49:36,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=696, Unknown=0, NotChecked=0, Total=812 [2025-04-30 10:49:36,242 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-30 10:49:36,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:49:36,462 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2025-04-30 10:49:36,462 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-30 10:49:36,462 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-30 10:49:36,462 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:49:36,463 INFO L225 Difference]: With dead ends: 57 [2025-04-30 10:49:36,463 INFO L226 Difference]: Without dead ends: 57 [2025-04-30 10:49:36,463 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=191, Invalid=999, Unknown=0, NotChecked=0, Total=1190 [2025-04-30 10:49:36,463 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-30 10:49:36,463 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-30 10:49:36,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-04-30 10:49:36,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 52. [2025-04-30 10:49:36,464 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-30 10:49:36,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2025-04-30 10:49:36,465 INFO L79 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 38 [2025-04-30 10:49:36,465 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:49:36,465 INFO L485 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2025-04-30 10:49:36,465 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-30 10:49:36,465 INFO L278 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2025-04-30 10:49:36,465 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-30 10:49:36,465 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:49:36,465 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-30 10:49:36,472 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-30 10:49:36,666 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-30 10:49:36,666 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-30 10:49:36,666 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:49:36,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1305950184, now seen corresponding path program 1 times [2025-04-30 10:49:36,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:49:36,666 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325012320] [2025-04-30 10:49:36,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:49:36,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:49:36,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-30 10:49:36,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-30 10:49:36,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:49:36,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:49:36,784 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-30 10:49:36,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:49:36,785 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325012320] [2025-04-30 10:49:36,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325012320] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:49:36,785 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127023348] [2025-04-30 10:49:36,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:49:36,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:49:36,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:49:36,787 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-30 10:49:36,788 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-30 10:49:36,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-30 10:49:36,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-30 10:49:36,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:49:36,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:49:36,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-30 10:49:36,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:49:36,951 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-30 10:49:36,952 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:49:36,969 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-30 10:49:37,056 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-30 10:49:37,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127023348] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:49:37,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:49:37,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2025-04-30 10:49:37,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204810418] [2025-04-30 10:49:37,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:49:37,057 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-30 10:49:37,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:49:37,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-30 10:49:37,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2025-04-30 10:49:37,058 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-30 10:49:37,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:49:37,276 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2025-04-30 10:49:37,277 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-30 10:49:37,277 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-30 10:49:37,277 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:49:37,277 INFO L225 Difference]: With dead ends: 79 [2025-04-30 10:49:37,277 INFO L226 Difference]: Without dead ends: 79 [2025-04-30 10:49:37,277 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-30 10:49:37,278 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-30 10:49:37,278 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-30 10:49:37,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-04-30 10:49:37,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 50. [2025-04-30 10:49:37,279 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-30 10:49:37,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2025-04-30 10:49:37,279 INFO L79 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 39 [2025-04-30 10:49:37,279 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:49:37,279 INFO L485 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2025-04-30 10:49:37,279 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-30 10:49:37,279 INFO L278 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2025-04-30 10:49:37,280 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-30 10:49:37,280 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:49:37,280 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-30 10:49:37,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-04-30 10:49:37,486 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-30 10:49:37,486 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-30 10:49:37,486 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:49:37,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1641111835, now seen corresponding path program 1 times [2025-04-30 10:49:37,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:49:37,486 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629052843] [2025-04-30 10:49:37,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:49:37,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:49:37,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-30 10:49:37,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-30 10:49:37,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:49:37,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:49:37,614 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-30 10:49:37,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:49:37,615 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629052843] [2025-04-30 10:49:37,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629052843] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:49:37,615 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265679430] [2025-04-30 10:49:37,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:49:37,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:49:37,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:49:37,617 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-30 10:49:37,618 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-30 10:49:37,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-30 10:49:37,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-30 10:49:37,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:49:37,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:49:37,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-30 10:49:37,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:49:37,807 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-30 10:49:37,807 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:49:37,834 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-30 10:49:37,920 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-30 10:49:37,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265679430] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:49:37,920 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:49:37,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2025-04-30 10:49:37,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60197513] [2025-04-30 10:49:37,920 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:49:37,921 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-30 10:49:37,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:49:37,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-30 10:49:37,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2025-04-30 10:49:37,921 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-30 10:49:38,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:49:38,115 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2025-04-30 10:49:38,115 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-30 10:49:38,116 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-30 10:49:38,116 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:49:38,116 INFO L225 Difference]: With dead ends: 51 [2025-04-30 10:49:38,116 INFO L226 Difference]: Without dead ends: 51 [2025-04-30 10:49:38,116 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-30 10:49:38,117 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-30 10:49:38,117 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-30 10:49:38,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-04-30 10:49:38,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 44. [2025-04-30 10:49:38,117 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-30 10:49:38,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2025-04-30 10:49:38,118 INFO L79 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 43 [2025-04-30 10:49:38,118 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:49:38,118 INFO L485 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2025-04-30 10:49:38,118 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-30 10:49:38,118 INFO L278 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2025-04-30 10:49:38,118 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-30 10:49:38,118 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:49:38,118 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-30 10:49:38,124 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-30 10:49:38,318 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-30 10:49:38,319 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-30 10:49:38,319 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:49:38,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1641111355, now seen corresponding path program 4 times [2025-04-30 10:49:38,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:49:38,319 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8526570] [2025-04-30 10:49:38,319 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:49:38,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:49:38,324 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 43 statements into 2 equivalence classes. [2025-04-30 10:49:38,327 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 38 of 43 statements. [2025-04-30 10:49:38,327 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-30 10:49:38,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:49:38,403 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-30 10:49:38,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:49:38,403 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8526570] [2025-04-30 10:49:38,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8526570] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:49:38,403 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127725489] [2025-04-30 10:49:38,403 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:49:38,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:49:38,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:49:38,405 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-30 10:49:38,406 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-30 10:49:38,435 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 43 statements into 2 equivalence classes. [2025-04-30 10:49:38,449 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 38 of 43 statements. [2025-04-30 10:49:38,450 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-30 10:49:38,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:49:38,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-30 10:49:38,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:49:38,479 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-30 10:49:38,479 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:49:38,531 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-30 10:49:38,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127725489] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:49:38,532 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:49:38,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 10 [2025-04-30 10:49:38,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992176179] [2025-04-30 10:49:38,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:49:38,532 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:49:38,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:49:38,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:49:38,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:49:38,532 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-30 10:49:38,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:49:38,606 INFO L93 Difference]: Finished difference Result 95 states and 112 transitions. [2025-04-30 10:49:38,606 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-30 10:49:38,606 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-30 10:49:38,606 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:49:38,606 INFO L225 Difference]: With dead ends: 95 [2025-04-30 10:49:38,608 INFO L226 Difference]: Without dead ends: 66 [2025-04-30 10:49:38,608 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-30 10:49:38,609 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-30 10:49:38,609 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-30 10:49:38,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-04-30 10:49:38,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 58. [2025-04-30 10:49:38,610 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-30 10:49:38,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2025-04-30 10:49:38,610 INFO L79 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 43 [2025-04-30 10:49:38,610 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:49:38,610 INFO L485 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2025-04-30 10:49:38,610 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-30 10:49:38,611 INFO L278 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2025-04-30 10:49:38,611 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-04-30 10:49:38,611 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:49:38,611 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-30 10:49:38,618 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-30 10:49:38,815 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-30 10:49:38,815 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-30 10:49:38,815 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:49:38,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1890199211, now seen corresponding path program 5 times [2025-04-30 10:49:38,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:49:38,815 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317410743] [2025-04-30 10:49:38,815 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-30 10:49:38,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:49:38,820 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 48 statements into 5 equivalence classes. [2025-04-30 10:49:38,831 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 48 of 48 statements. [2025-04-30 10:49:38,831 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-04-30 10:49:38,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:49:38,926 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-30 10:49:38,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:49:38,926 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317410743] [2025-04-30 10:49:38,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317410743] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:49:38,926 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328381225] [2025-04-30 10:49:38,926 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-30 10:49:38,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:49:38,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:49:38,928 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-30 10:49:38,929 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-30 10:49:38,959 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 48 statements into 5 equivalence classes. [2025-04-30 10:49:38,979 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 48 of 48 statements. [2025-04-30 10:49:38,980 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-04-30 10:49:38,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:49:38,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-30 10:49:38,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:49:39,059 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-30 10:49:39,059 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:49:39,113 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-30 10:49:39,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328381225] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:49:39,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:49:39,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 17 [2025-04-30 10:49:39,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63878730] [2025-04-30 10:49:39,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:49:39,114 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-30 10:49:39,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:49:39,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-30 10:49:39,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2025-04-30 10:49:39,114 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-30 10:49:39,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:49:39,201 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2025-04-30 10:49:39,202 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-30 10:49:39,202 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-30 10:49:39,202 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:49:39,202 INFO L225 Difference]: With dead ends: 77 [2025-04-30 10:49:39,202 INFO L226 Difference]: Without dead ends: 63 [2025-04-30 10:49:39,202 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-30 10:49:39,203 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.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:49:39,203 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.1s Time] [2025-04-30 10:49:39,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-04-30 10:49:39,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2025-04-30 10:49:39,204 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-30 10:49:39,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2025-04-30 10:49:39,204 INFO L79 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 48 [2025-04-30 10:49:39,204 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:49:39,204 INFO L485 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2025-04-30 10:49:39,204 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-30 10:49:39,204 INFO L278 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2025-04-30 10:49:39,208 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-04-30 10:49:39,208 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:49:39,208 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-30 10:49:39,214 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-30 10:49:39,408 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-30 10:49:39,408 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-30 10:49:39,408 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:49:39,408 INFO L85 PathProgramCache]: Analyzing trace with hash 2079472655, now seen corresponding path program 6 times [2025-04-30 10:49:39,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:49:39,409 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544657504] [2025-04-30 10:49:39,409 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-30 10:49:39,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:49:39,414 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 51 statements into 5 equivalence classes. [2025-04-30 10:49:39,422 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 35 of 51 statements. [2025-04-30 10:49:39,422 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-30 10:49:39,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:49:39,598 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-30 10:49:39,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:49:39,598 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544657504] [2025-04-30 10:49:39,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544657504] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:49:39,598 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794095781] [2025-04-30 10:49:39,599 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-30 10:49:39,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:49:39,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:49:39,600 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-30 10:49:39,601 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-30 10:49:39,638 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 51 statements into 5 equivalence classes. [2025-04-30 10:49:39,652 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 35 of 51 statements. [2025-04-30 10:49:39,652 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-30 10:49:39,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:49:39,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-30 10:49:39,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:49:39,921 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-30 10:49:39,921 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:49:40,351 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-30 10:49:40,371 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-30 10:49:40,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [794095781] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:49:40,371 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:49:40,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 32 [2025-04-30 10:49:40,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376184930] [2025-04-30 10:49:40,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:49:40,372 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-30 10:49:40,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:49:40,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-30 10:49:40,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=932, Unknown=0, NotChecked=0, Total=1056 [2025-04-30 10:49:40,372 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-30 10:49:40,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:49:40,682 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2025-04-30 10:49:40,685 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-30 10:49:40,686 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-30 10:49:40,686 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:49:40,686 INFO L225 Difference]: With dead ends: 67 [2025-04-30 10:49:40,686 INFO L226 Difference]: Without dead ends: 0 [2025-04-30 10:49:40,686 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-30 10:49:40,686 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-30 10:49:40,686 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-30 10:49:40,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-30 10:49:40,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-30 10:49:40,687 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-30 10:49:40,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-30 10:49:40,687 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2025-04-30 10:49:40,687 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:49:40,687 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-30 10:49:40,687 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-30 10:49:40,687 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-30 10:49:40,687 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-30 10:49:40,689 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 18 remaining) [2025-04-30 10:49:40,689 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 18 remaining) [2025-04-30 10:49:40,689 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (15 of 18 remaining) [2025-04-30 10:49:40,689 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (14 of 18 remaining) [2025-04-30 10:49:40,689 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE (13 of 18 remaining) [2025-04-30 10:49:40,689 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (12 of 18 remaining) [2025-04-30 10:49:40,689 INFO L790 garLoopResultBuilder]: Registering result SAFE for location selectionSortErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 18 remaining) [2025-04-30 10:49:40,689 INFO L790 garLoopResultBuilder]: Registering result SAFE for location selectionSortErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 18 remaining) [2025-04-30 10:49:40,689 INFO L790 garLoopResultBuilder]: Registering result SAFE for location selectionSortErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 18 remaining) [2025-04-30 10:49:40,689 INFO L790 garLoopResultBuilder]: Registering result SAFE for location selectionSortErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 18 remaining) [2025-04-30 10:49:40,689 INFO L790 garLoopResultBuilder]: Registering result SAFE for location selectionSortErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 18 remaining) [2025-04-30 10:49:40,689 INFO L790 garLoopResultBuilder]: Registering result SAFE for location selectionSortErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 18 remaining) [2025-04-30 10:49:40,689 INFO L790 garLoopResultBuilder]: Registering result SAFE for location selectionSortErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 18 remaining) [2025-04-30 10:49:40,689 INFO L790 garLoopResultBuilder]: Registering result SAFE for location selectionSortErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 18 remaining) [2025-04-30 10:49:40,689 INFO L790 garLoopResultBuilder]: Registering result SAFE for location selectionSortErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 18 remaining) [2025-04-30 10:49:40,689 INFO L790 garLoopResultBuilder]: Registering result SAFE for location selectionSortErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 18 remaining) [2025-04-30 10:49:40,691 INFO L790 garLoopResultBuilder]: Registering result SAFE for location selectionSortErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 18 remaining) [2025-04-30 10:49:40,691 INFO L790 garLoopResultBuilder]: Registering result SAFE for location selectionSortErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 18 remaining) [2025-04-30 10:49:40,696 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-30 10:49:40,891 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-30 10:49:40,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-30 10:49:40,895 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-30 10:49:40,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.04 10:49:40 BoogieIcfgContainer [2025-04-30 10:49:40,897 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-30 10:49:40,897 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-30 10:49:40,897 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-30 10:49:40,897 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-30 10:49:40,898 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:49:27" (3/4) ... [2025-04-30 10:49:40,899 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-04-30 10:49:40,903 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure selectionSort [2025-04-30 10:49:40,904 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-04-30 10:49:40,905 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-04-30 10:49:40,905 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-04-30 10:49:40,905 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-04-30 10:49:40,950 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-30 10:49:40,950 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-30 10:49:40,951 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-30 10:49:40,952 INFO L158 Benchmark]: Toolchain (without parser) took 14411.17ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 105.4MB in the beginning and 289.3MB in the end (delta: -184.0MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. [2025-04-30 10:49:40,952 INFO L158 Benchmark]: CDTParser took 0.48ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:49:40,952 INFO L158 Benchmark]: CACSL2BoogieTranslator took 201.44ms. Allocated memory is still 142.6MB. Free memory was 105.4MB in the beginning and 91.7MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-30 10:49:40,952 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.25ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 90.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:49:40,952 INFO L158 Benchmark]: Boogie Preprocessor took 41.58ms. Allocated memory is still 142.6MB. Free memory was 90.5MB in the beginning and 89.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:49:40,953 INFO L158 Benchmark]: RCFGBuilder took 251.78ms. Allocated memory is still 142.6MB. Free memory was 89.3MB in the beginning and 74.9MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-30 10:49:40,953 INFO L158 Benchmark]: TraceAbstraction took 13828.93ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 73.7MB in the beginning and 297.0MB in the end (delta: -223.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:49:40,953 INFO L158 Benchmark]: Witness Printer took 53.68ms. Allocated memory is still 335.5MB. Free memory was 297.0MB in the beginning and 289.3MB in the end (delta: 7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-30 10:49:40,955 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.48ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 201.44ms. Allocated memory is still 142.6MB. Free memory was 105.4MB in the beginning and 91.7MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.25ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 90.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 41.58ms. Allocated memory is still 142.6MB. Free memory was 90.5MB in the beginning and 89.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 251.78ms. Allocated memory is still 142.6MB. Free memory was 89.3MB in the beginning and 74.9MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 13828.93ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 73.7MB in the beginning and 297.0MB in the end (delta: -223.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 53.68ms. Allocated memory is still 335.5MB. Free memory was 297.0MB in the beginning and 289.3MB in the end (delta: 7.6MB). 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: 42]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 42]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 42]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 26]: 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.8s, 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, 2.0s 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.7s 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.3s 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-30 10:49:40,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE