./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext-properties/960521-1_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext-properties/960521-1_1-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1bdc21b2f61b0d69220994ec3f8dc9d2db928c146bd54c19e0632aa07d01871a --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 10:13:40,211 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 10:13:40,283 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 10:13:40,288 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 10:13:40,289 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 10:13:40,302 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 10:13:40,303 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 10:13:40,303 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 10:13:40,303 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 10:13:40,303 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 10:13:40,303 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 10:13:40,303 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 10:13:40,304 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 10:13:40,304 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 10:13:40,304 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 10:13:40,304 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 10:13:40,304 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 10:13:40,304 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 10:13:40,304 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 10:13:40,304 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 10:13:40,304 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 10:13:40,305 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 10:13:40,305 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 10:13:40,305 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 10:13:40,305 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 10:13:40,305 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 10:13:40,305 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 10:13:40,305 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 10:13:40,305 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 10:13:40,305 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 10:13:40,305 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 10:13:40,305 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 10:13:40,306 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 10:13:40,306 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:13:40,306 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 10:13:40,306 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 10:13:40,306 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 10:13:40,306 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 10:13:40,306 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 10:13:40,306 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 10:13:40,306 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 10:13:40,306 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 10:13:40,306 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1bdc21b2f61b0d69220994ec3f8dc9d2db928c146bd54c19e0632aa07d01871a [2025-02-06 10:13:40,528 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 10:13:40,536 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 10:13:40,537 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 10:13:40,538 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 10:13:40,539 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 10:13:40,540 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/960521-1_1-1.i [2025-02-06 10:13:41,663 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d3e519165/035368b071464ea1aa4f0bdb365f97a8/FLAGc9b1bdbdc [2025-02-06 10:13:41,966 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 10:13:41,967 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-ext-properties/960521-1_1-1.i [2025-02-06 10:13:41,977 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d3e519165/035368b071464ea1aa4f0bdb365f97a8/FLAGc9b1bdbdc [2025-02-06 10:13:42,250 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d3e519165/035368b071464ea1aa4f0bdb365f97a8 [2025-02-06 10:13:42,252 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 10:13:42,253 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 10:13:42,254 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 10:13:42,254 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 10:13:42,257 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 10:13:42,257 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:13:42" (1/1) ... [2025-02-06 10:13:42,258 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43d00af5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:13:42, skipping insertion in model container [2025-02-06 10:13:42,259 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:13:42" (1/1) ... [2025-02-06 10:13:42,280 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 10:13:42,479 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:13:42,487 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 10:13:42,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:13:42,526 INFO L204 MainTranslator]: Completed translation [2025-02-06 10:13:42,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:13:42 WrapperNode [2025-02-06 10:13:42,527 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 10:13:42,528 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 10:13:42,528 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 10:13:42,528 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 10:13:42,532 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:13:42" (1/1) ... [2025-02-06 10:13:42,538 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:13:42" (1/1) ... [2025-02-06 10:13:42,550 INFO L138 Inliner]: procedures = 122, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 68 [2025-02-06 10:13:42,550 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 10:13:42,552 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 10:13:42,552 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 10:13:42,552 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 10:13:42,557 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:13:42" (1/1) ... [2025-02-06 10:13:42,559 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:13:42" (1/1) ... [2025-02-06 10:13:42,560 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:13:42" (1/1) ... [2025-02-06 10:13:42,570 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 1, 3]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 3 writes are split as follows [0, 1, 2]. [2025-02-06 10:13:42,570 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:13:42" (1/1) ... [2025-02-06 10:13:42,571 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:13:42" (1/1) ... [2025-02-06 10:13:42,574 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:13:42" (1/1) ... [2025-02-06 10:13:42,575 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:13:42" (1/1) ... [2025-02-06 10:13:42,575 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:13:42" (1/1) ... [2025-02-06 10:13:42,576 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:13:42" (1/1) ... [2025-02-06 10:13:42,577 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 10:13:42,578 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 10:13:42,578 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 10:13:42,578 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 10:13:42,579 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:13:42" (1/1) ... [2025-02-06 10:13:42,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:13:42,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:13:42,627 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 10:13:42,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 10:13:42,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 10:13:42,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 10:13:42,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 10:13:42,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 10:13:42,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 10:13:42,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 10:13:42,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 10:13:42,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 10:13:42,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 10:13:42,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 10:13:42,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 10:13:42,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 10:13:42,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 10:13:42,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 10:13:42,723 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 10:13:42,724 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 10:13:42,878 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-02-06 10:13:42,879 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 10:13:42,885 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 10:13:42,886 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 10:13:42,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:13:42 BoogieIcfgContainer [2025-02-06 10:13:42,887 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 10:13:42,889 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 10:13:42,889 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 10:13:42,892 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 10:13:42,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 10:13:42" (1/3) ... [2025-02-06 10:13:42,892 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f5109a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:13:42, skipping insertion in model container [2025-02-06 10:13:42,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:13:42" (2/3) ... [2025-02-06 10:13:42,893 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f5109a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:13:42, skipping insertion in model container [2025-02-06 10:13:42,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:13:42" (3/3) ... [2025-02-06 10:13:42,894 INFO L128 eAbstractionObserver]: Analyzing ICFG 960521-1_1-1.i [2025-02-06 10:13:42,903 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 10:13:42,904 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 960521-1_1-1.i that has 1 procedures, 53 locations, 1 initial locations, 3 loop locations, and 21 error locations. [2025-02-06 10:13:42,926 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 10:13:42,934 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@103aec9f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 10:13:42,934 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-02-06 10:13:42,936 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 52 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:42,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-06 10:13:42,939 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:13:42,940 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 10:13:42,940 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-02-06 10:13:42,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:13:42,943 INFO L85 PathProgramCache]: Analyzing trace with hash 83946870, now seen corresponding path program 1 times [2025-02-06 10:13:42,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:13:42,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709720173] [2025-02-06 10:13:42,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:13:42,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:13:43,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 10:13:43,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 10:13:43,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:13:43,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:43,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:13:43,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:13:43,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709720173] [2025-02-06 10:13:43,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709720173] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:13:43,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:13:43,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:13:43,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576985901] [2025-02-06 10:13:43,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:13:43,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 10:13:43,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:13:43,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 10:13:43,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 10:13:43,065 INFO L87 Difference]: Start difference. First operand has 53 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 52 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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-02-06 10:13:43,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:13:43,074 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2025-02-06 10:13:43,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 10:13:43,076 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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-02-06 10:13:43,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:13:43,079 INFO L225 Difference]: With dead ends: 53 [2025-02-06 10:13:43,079 INFO L226 Difference]: Without dead ends: 51 [2025-02-06 10:13:43,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 10:13:43,084 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:13:43,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:13:43,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-02-06 10:13:43,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-02-06 10:13:43,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 30 states have (on average 1.8) internal successors, (54), 50 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:43,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2025-02-06 10:13:43,109 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 5 [2025-02-06 10:13:43,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:13:43,109 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2025-02-06 10:13:43,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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-02-06 10:13:43,109 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2025-02-06 10:13:43,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 10:13:43,109 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:13:43,109 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 10:13:43,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 10:13:43,111 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-02-06 10:13:43,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:13:43,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1692641124, now seen corresponding path program 1 times [2025-02-06 10:13:43,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:13:43,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389293736] [2025-02-06 10:13:43,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:13:43,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:13:43,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 10:13:43,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 10:13:43,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:13:43,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:43,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:13:43,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:13:43,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389293736] [2025-02-06 10:13:43,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389293736] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:13:43,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:13:43,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:13:43,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127307687] [2025-02-06 10:13:43,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:13:43,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:13:43,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:13:43,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:13:43,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:13:43,211 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:43,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:13:43,237 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2025-02-06 10:13:43,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:13:43,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2025-02-06 10:13:43,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:13:43,238 INFO L225 Difference]: With dead ends: 50 [2025-02-06 10:13:43,238 INFO L226 Difference]: Without dead ends: 50 [2025-02-06 10:13:43,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:13:43,239 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:13:43,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:13:43,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-02-06 10:13:43,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-02-06 10:13:43,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 49 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:43,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2025-02-06 10:13:43,242 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 6 [2025-02-06 10:13:43,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:13:43,243 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2025-02-06 10:13:43,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:43,243 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2025-02-06 10:13:43,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 10:13:43,243 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:13:43,243 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 10:13:43,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 10:13:43,243 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-02-06 10:13:43,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:13:43,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1692641123, now seen corresponding path program 1 times [2025-02-06 10:13:43,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:13:43,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64656244] [2025-02-06 10:13:43,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:13:43,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:13:43,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 10:13:43,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 10:13:43,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:13:43,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:43,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:13:43,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:13:43,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64656244] [2025-02-06 10:13:43,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64656244] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:13:43,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:13:43,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:13:43,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081377812] [2025-02-06 10:13:43,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:13:43,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:13:43,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:13:43,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:13:43,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:13:43,407 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:43,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:13:43,465 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2025-02-06 10:13:43,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:13:43,466 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2025-02-06 10:13:43,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:13:43,466 INFO L225 Difference]: With dead ends: 97 [2025-02-06 10:13:43,466 INFO L226 Difference]: Without dead ends: 97 [2025-02-06 10:13:43,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:13:43,467 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 47 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:13:43,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 120 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:13:43,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-02-06 10:13:43,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 54. [2025-02-06 10:13:43,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 53 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:43,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2025-02-06 10:13:43,471 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 6 [2025-02-06 10:13:43,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:13:43,471 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2025-02-06 10:13:43,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:43,471 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2025-02-06 10:13:43,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 10:13:43,471 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:13:43,471 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-06 10:13:43,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 10:13:43,471 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-02-06 10:13:43,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:13:43,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1165563900, now seen corresponding path program 1 times [2025-02-06 10:13:43,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:13:43,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608197474] [2025-02-06 10:13:43,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:13:43,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:13:43,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 10:13:43,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 10:13:43,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:13:43,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:43,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:13:43,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:13:43,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608197474] [2025-02-06 10:13:43,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608197474] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:13:43,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56109061] [2025-02-06 10:13:43,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:13:43,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:13:43,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:13:43,571 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:13:43,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 10:13:43,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 10:13:43,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 10:13:43,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:13:43,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:43,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 10:13:43,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:13:43,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 10:13:43,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:13:43,694 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:13:43,738 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:13:43,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56109061] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:13:43,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:13:43,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-02-06 10:13:43,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829076410] [2025-02-06 10:13:43,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:13:43,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 10:13:43,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:13:43,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 10:13:43,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-06 10:13:43,740 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:43,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:13:43,851 INFO L93 Difference]: Finished difference Result 143 states and 152 transitions. [2025-02-06 10:13:43,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 10:13:43,851 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 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-02-06 10:13:43,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:13:43,852 INFO L225 Difference]: With dead ends: 143 [2025-02-06 10:13:43,852 INFO L226 Difference]: Without dead ends: 143 [2025-02-06 10:13:43,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-02-06 10:13:43,853 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 378 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:13:43,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 272 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:13:43,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-02-06 10:13:43,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 49. [2025-02-06 10:13:43,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 48 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:43,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2025-02-06 10:13:43,857 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 8 [2025-02-06 10:13:43,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:13:43,857 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2025-02-06 10:13:43,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:43,857 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2025-02-06 10:13:43,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 10:13:43,857 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:13:43,857 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:13:43,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 10:13:44,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:13:44,058 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-02-06 10:13:44,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:13:44,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1739313105, now seen corresponding path program 1 times [2025-02-06 10:13:44,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:13:44,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081389023] [2025-02-06 10:13:44,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:13:44,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:13:44,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 10:13:44,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 10:13:44,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:13:44,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:44,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:13:44,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:13:44,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081389023] [2025-02-06 10:13:44,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081389023] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:13:44,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:13:44,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:13:44,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077130956] [2025-02-06 10:13:44,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:13:44,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:13:44,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:13:44,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:13:44,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:13:44,106 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:44,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:13:44,130 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2025-02-06 10:13:44,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:13:44,130 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2025-02-06 10:13:44,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:13:44,130 INFO L225 Difference]: With dead ends: 46 [2025-02-06 10:13:44,130 INFO L226 Difference]: Without dead ends: 46 [2025-02-06 10:13:44,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:13:44,131 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 48 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:13:44,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 48 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:13:44,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-02-06 10:13:44,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-02-06 10:13:44,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 45 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:44,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2025-02-06 10:13:44,133 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 9 [2025-02-06 10:13:44,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:13:44,134 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2025-02-06 10:13:44,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:44,134 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2025-02-06 10:13:44,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 10:13:44,134 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:13:44,134 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:13:44,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 10:13:44,134 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-02-06 10:13:44,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:13:44,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1739313106, now seen corresponding path program 1 times [2025-02-06 10:13:44,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:13:44,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343813289] [2025-02-06 10:13:44,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:13:44,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:13:44,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 10:13:44,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 10:13:44,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:13:44,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:44,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:13:44,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:13:44,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343813289] [2025-02-06 10:13:44,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343813289] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:13:44,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:13:44,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:13:44,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713434801] [2025-02-06 10:13:44,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:13:44,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:13:44,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:13:44,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:13:44,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:13:44,257 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:44,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:13:44,306 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2025-02-06 10:13:44,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:13:44,307 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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 9 [2025-02-06 10:13:44,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:13:44,307 INFO L225 Difference]: With dead ends: 51 [2025-02-06 10:13:44,307 INFO L226 Difference]: Without dead ends: 51 [2025-02-06 10:13:44,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:13:44,308 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 46 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:13:44,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 74 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:13:44,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-02-06 10:13:44,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2025-02-06 10:13:44,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 32 states have (on average 1.5625) internal successors, (50), 45 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:44,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2025-02-06 10:13:44,314 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 9 [2025-02-06 10:13:44,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:13:44,314 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2025-02-06 10:13:44,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:44,314 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2025-02-06 10:13:44,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-06 10:13:44,314 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:13:44,314 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:13:44,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 10:13:44,315 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-02-06 10:13:44,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:13:44,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1915873517, now seen corresponding path program 1 times [2025-02-06 10:13:44,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:13:44,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819640628] [2025-02-06 10:13:44,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:13:44,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:13:44,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 10:13:44,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 10:13:44,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:13:44,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:44,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:13:44,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:13:44,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819640628] [2025-02-06 10:13:44,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819640628] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:13:44,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:13:44,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:13:44,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132108714] [2025-02-06 10:13:44,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:13:44,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:13:44,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:13:44,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:13:44,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:13:44,352 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:44,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:13:44,384 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2025-02-06 10:13:44,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:13:44,384 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2025-02-06 10:13:44,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:13:44,385 INFO L225 Difference]: With dead ends: 87 [2025-02-06 10:13:44,385 INFO L226 Difference]: Without dead ends: 87 [2025-02-06 10:13:44,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:13:44,386 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 36 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:13:44,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 162 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:13:44,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-02-06 10:13:44,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 57. [2025-02-06 10:13:44,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 56 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:44,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2025-02-06 10:13:44,389 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 10 [2025-02-06 10:13:44,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:13:44,389 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2025-02-06 10:13:44,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:44,389 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2025-02-06 10:13:44,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 10:13:44,389 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:13:44,390 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:13:44,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 10:13:44,390 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-02-06 10:13:44,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:13:44,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1391263160, now seen corresponding path program 1 times [2025-02-06 10:13:44,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:13:44,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282227807] [2025-02-06 10:13:44,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:13:44,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:13:44,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 10:13:44,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 10:13:44,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:13:44,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:44,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:13:44,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:13:44,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282227807] [2025-02-06 10:13:44,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282227807] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:13:44,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652207277] [2025-02-06 10:13:44,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:13:44,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:13:44,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:13:44,439 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:13:44,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 10:13:44,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 10:13:44,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 10:13:44,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:13:44,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:44,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 10:13:44,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:13:44,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:13:44,520 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:13:44,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652207277] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:13:44,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 10:13:44,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-02-06 10:13:44,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693925692] [2025-02-06 10:13:44,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:13:44,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:13:44,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:13:44,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:13:44,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:13:44,521 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:44,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:13:44,544 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2025-02-06 10:13:44,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:13:44,545 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-02-06 10:13:44,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:13:44,545 INFO L225 Difference]: With dead ends: 84 [2025-02-06 10:13:44,545 INFO L226 Difference]: Without dead ends: 84 [2025-02-06 10:13:44,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:13:44,546 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 30 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:13:44,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 134 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:13:44,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-02-06 10:13:44,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 56. [2025-02-06 10:13:44,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 55 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:44,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2025-02-06 10:13:44,548 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 12 [2025-02-06 10:13:44,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:13:44,548 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2025-02-06 10:13:44,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:44,548 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2025-02-06 10:13:44,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 10:13:44,548 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:13:44,548 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:13:44,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 10:13:44,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:13:44,749 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-02-06 10:13:44,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:13:44,750 INFO L85 PathProgramCache]: Analyzing trace with hash 854462194, now seen corresponding path program 1 times [2025-02-06 10:13:44,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:13:44,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342692714] [2025-02-06 10:13:44,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:13:44,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:13:44,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 10:13:44,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 10:13:44,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:13:44,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:44,776 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 10:13:44,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:13:44,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342692714] [2025-02-06 10:13:44,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342692714] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:13:44,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:13:44,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:13:44,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718162013] [2025-02-06 10:13:44,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:13:44,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:13:44,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:13:44,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:13:44,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:13:44,778 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:44,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:13:44,810 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2025-02-06 10:13:44,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:13:44,810 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-02-06 10:13:44,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:13:44,811 INFO L225 Difference]: With dead ends: 54 [2025-02-06 10:13:44,811 INFO L226 Difference]: Without dead ends: 54 [2025-02-06 10:13:44,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:13:44,811 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 19 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:13:44,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 69 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:13:44,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-02-06 10:13:44,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-02-06 10:13:44,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 53 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:44,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2025-02-06 10:13:44,813 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 12 [2025-02-06 10:13:44,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:13:44,813 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2025-02-06 10:13:44,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:44,813 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2025-02-06 10:13:44,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 10:13:44,814 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:13:44,814 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:13:44,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 10:13:44,814 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-02-06 10:13:44,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:13:44,815 INFO L85 PathProgramCache]: Analyzing trace with hash 854462195, now seen corresponding path program 1 times [2025-02-06 10:13:44,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:13:44,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840213741] [2025-02-06 10:13:44,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:13:44,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:13:44,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 10:13:44,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 10:13:44,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:13:44,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:44,849 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:13:44,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:13:44,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840213741] [2025-02-06 10:13:44,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840213741] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:13:44,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762747268] [2025-02-06 10:13:44,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:13:44,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:13:44,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:13:44,854 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:13:44,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 10:13:44,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 10:13:44,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 10:13:44,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:13:44,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:13:44,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 10:13:44,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:13:44,988 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:13:44,988 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:13:44,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762747268] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:13:44,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 10:13:44,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-02-06 10:13:44,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742600455] [2025-02-06 10:13:44,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:13:44,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:13:44,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:13:44,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:13:44,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:13:44,989 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:45,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:13:45,059 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2025-02-06 10:13:45,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:13:45,060 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-02-06 10:13:45,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:13:45,062 INFO L225 Difference]: With dead ends: 85 [2025-02-06 10:13:45,062 INFO L226 Difference]: Without dead ends: 85 [2025-02-06 10:13:45,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:13:45,065 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 86 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:13:45,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 151 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:13:45,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-02-06 10:13:45,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 55. [2025-02-06 10:13:45,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 43 states have (on average 1.372093023255814) internal successors, (59), 54 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:45,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2025-02-06 10:13:45,067 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 12 [2025-02-06 10:13:45,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:13:45,067 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2025-02-06 10:13:45,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:13:45,067 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2025-02-06 10:13:45,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-06 10:13:45,067 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:13:45,067 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:13:45,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 10:13:45,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:13:45,275 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 18 more)] === [2025-02-06 10:13:45,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:13:45,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1268914999, now seen corresponding path program 1 times [2025-02-06 10:13:45,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:13:45,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724497151] [2025-02-06 10:13:45,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:13:45,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:13:45,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 10:13:45,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 10:13:45,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:13:45,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 10:13:45,291 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 10:13:45,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 10:13:45,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 10:13:45,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:13:45,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 10:13:45,312 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 10:13:45,313 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 10:13:45,313 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 21 remaining) [2025-02-06 10:13:45,316 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (19 of 21 remaining) [2025-02-06 10:13:45,316 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (18 of 21 remaining) [2025-02-06 10:13:45,316 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (17 of 21 remaining) [2025-02-06 10:13:45,316 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (16 of 21 remaining) [2025-02-06 10:13:45,316 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE (15 of 21 remaining) [2025-02-06 10:13:45,316 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE (14 of 21 remaining) [2025-02-06 10:13:45,316 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE (13 of 21 remaining) [2025-02-06 10:13:45,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE (12 of 21 remaining) [2025-02-06 10:13:45,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE (11 of 21 remaining) [2025-02-06 10:13:45,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE (10 of 21 remaining) [2025-02-06 10:13:45,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE (9 of 21 remaining) [2025-02-06 10:13:45,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE (8 of 21 remaining) [2025-02-06 10:13:45,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE (7 of 21 remaining) [2025-02-06 10:13:45,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 21 remaining) [2025-02-06 10:13:45,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 21 remaining) [2025-02-06 10:13:45,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 21 remaining) [2025-02-06 10:13:45,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 21 remaining) [2025-02-06 10:13:45,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 21 remaining) [2025-02-06 10:13:45,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 21 remaining) [2025-02-06 10:13:45,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 21 remaining) [2025-02-06 10:13:45,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 10:13:45,322 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:13:45,338 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 10:13:45,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 10:13:45 BoogieIcfgContainer [2025-02-06 10:13:45,342 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 10:13:45,343 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 10:13:45,343 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 10:13:45,343 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 10:13:45,343 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:13:42" (3/4) ... [2025-02-06 10:13:45,344 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-06 10:13:45,375 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 8. [2025-02-06 10:13:45,410 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 10:13:45,412 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 10:13:45,412 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 10:13:45,413 INFO L158 Benchmark]: Toolchain (without parser) took 3159.93ms. Allocated memory is still 142.6MB. Free memory was 103.7MB in the beginning and 93.0MB in the end (delta: 10.7MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. [2025-02-06 10:13:45,413 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 10:13:45,413 INFO L158 Benchmark]: CACSL2BoogieTranslator took 273.56ms. Allocated memory is still 142.6MB. Free memory was 103.7MB in the beginning and 86.4MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 10:13:45,413 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.33ms. Allocated memory is still 142.6MB. Free memory was 86.4MB in the beginning and 85.4MB in the end (delta: 967.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 10:13:45,414 INFO L158 Benchmark]: Boogie Preprocessor took 24.96ms. Allocated memory is still 142.6MB. Free memory was 85.4MB in the beginning and 83.9MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 10:13:45,414 INFO L158 Benchmark]: IcfgBuilder took 309.19ms. Allocated memory is still 142.6MB. Free memory was 83.9MB in the beginning and 68.7MB in the end (delta: 15.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 10:13:45,414 INFO L158 Benchmark]: TraceAbstraction took 2453.34ms. Allocated memory is still 142.6MB. Free memory was 68.0MB in the beginning and 98.2MB in the end (delta: -30.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 10:13:45,414 INFO L158 Benchmark]: Witness Printer took 69.11ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 93.0MB in the end (delta: 5.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 10:13:45,415 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.45ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 273.56ms. Allocated memory is still 142.6MB. Free memory was 103.7MB in the beginning and 86.4MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.33ms. Allocated memory is still 142.6MB. Free memory was 86.4MB in the beginning and 85.4MB in the end (delta: 967.3kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.96ms. Allocated memory is still 142.6MB. Free memory was 85.4MB in the beginning and 83.9MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 309.19ms. Allocated memory is still 142.6MB. Free memory was 83.9MB in the beginning and 68.7MB in the end (delta: 15.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2453.34ms. Allocated memory is still 142.6MB. Free memory was 68.0MB in the beginning and 98.2MB in the end (delta: -30.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 69.11ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 93.0MB in the end (delta: 5.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L523] int *a, *b; [L524] int n; VAL [a={0:0}, b={0:0}, n=0] [L536] n = 1 VAL [a={0:0}, b={0:0}, n=1] [L537] COND TRUE __VERIFIER_nondet_int() && n < 30 [L537] COND FALSE !(__VERIFIER_nondet_int() && n < 30) [L540] a = malloc(n * sizeof(*a)) [L541] b = malloc(n * sizeof(*b)) [L542] EXPR b++ VAL [a={-1:0}, b={-2:4}, n=1] [L542] *b++ = 0 VAL [a={-1:0}, b={-2:4}, n=1] [L543] CALL foo() [L528] int i; [L529] i = 0 VAL [a={-1:0}, b={-2:4}, i=0, n=1] [L529] COND TRUE i < n VAL [a={-1:0}, b={-2:4}, n=1] [L530] a[i] = n VAL [a={-1:0}, b={-2:4}, n=1] [L529] i++ VAL [a={-1:0}, b={-2:4}, i=1, n=1] [L529] COND FALSE !(i < n) [L531] i = 0 VAL [a={-1:0}, b={-2:4}, i=0, n=1] [L531] COND FALSE !(i < n - 1) VAL [a={-1:0}, b={-2:4}, n=1] [L543] RET foo() [L544] b[-2] - UnprovableResult [Line: 534]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 547]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 547]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 547]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 547]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 547]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 547]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 53 locations, 21 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 690 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 690 mSDsluCounter, 1169 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 636 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 395 IncrementalHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 533 mSDtfsCounter, 395 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=7, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 230 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 115 ConstructedInterpolants, 0 QuantifiedInterpolants, 434 SizeOfPredicates, 4 NumberOfNonLiveVariables, 228 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 14 InterpolantComputations, 9 PerfectInterpolantSequences, 7/16 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 RESULT: Ultimate proved your program to be incorrect! [2025-02-06 10:13:45,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)