./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext3/derefAfterFree2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext3/derefAfterFree2.c -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 6c5050f69dd0fe75249366946a38ba884fb5943ccf611397d2d01e0ccda347b5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 06:26:02,908 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 06:26:02,966 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 06:26:02,972 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 06:26:02,972 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 06:26:03,000 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 06:26:03,000 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 06:26:03,000 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 06:26:03,000 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 06:26:03,000 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 06:26:03,001 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 06:26:03,001 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 06:26:03,001 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 06:26:03,001 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 06:26:03,001 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 06:26:03,001 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 06:26:03,001 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 06:26:03,001 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 06:26:03,001 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 06:26:03,001 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 06:26:03,001 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 06:26:03,001 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 06:26:03,001 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 06:26:03,004 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 06:26:03,004 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 06:26:03,004 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 06:26:03,004 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 06:26:03,004 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 06:26:03,004 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 06:26:03,004 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 06:26:03,004 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 06:26:03,004 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 06:26:03,004 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 06:26:03,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:26:03,005 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 06:26:03,005 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 06:26:03,005 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 06:26:03,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 06:26:03,005 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 06:26:03,005 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 06:26:03,005 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 06:26:03,005 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 06:26:03,005 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 -> 6c5050f69dd0fe75249366946a38ba884fb5943ccf611397d2d01e0ccda347b5 [2025-02-08 06:26:03,265 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 06:26:03,277 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 06:26:03,279 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 06:26:03,285 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 06:26:03,285 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 06:26:03,290 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext3/derefAfterFree2.c [2025-02-08 06:26:04,487 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1b818f3b7/51516c05396d4c05a81e0ee92c42ad97/FLAGcd3f333a4 [2025-02-08 06:26:04,738 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 06:26:04,738 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety-ext3/derefAfterFree2.c [2025-02-08 06:26:04,743 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1b818f3b7/51516c05396d4c05a81e0ee92c42ad97/FLAGcd3f333a4 [2025-02-08 06:26:05,066 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1b818f3b7/51516c05396d4c05a81e0ee92c42ad97 [2025-02-08 06:26:05,068 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 06:26:05,069 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 06:26:05,070 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 06:26:05,070 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 06:26:05,073 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 06:26:05,073 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:26:05" (1/1) ... [2025-02-08 06:26:05,074 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3da0e4b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:26:05, skipping insertion in model container [2025-02-08 06:26:05,074 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:26:05" (1/1) ... [2025-02-08 06:26:05,082 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 06:26:05,167 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:26:05,176 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 06:26:05,183 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:26:05,196 INFO L204 MainTranslator]: Completed translation [2025-02-08 06:26:05,196 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:26:05 WrapperNode [2025-02-08 06:26:05,197 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 06:26:05,197 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 06:26:05,197 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 06:26:05,197 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 06:26:05,201 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:26:05" (1/1) ... [2025-02-08 06:26:05,206 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:26:05" (1/1) ... [2025-02-08 06:26:05,217 INFO L138 Inliner]: procedures = 9, calls = 5, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2025-02-08 06:26:05,217 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 06:26:05,218 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 06:26:05,218 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 06:26:05,218 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 06:26:05,223 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:26:05" (1/1) ... [2025-02-08 06:26:05,224 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:26:05" (1/1) ... [2025-02-08 06:26:05,225 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:26:05" (1/1) ... [2025-02-08 06:26:05,236 INFO L175 MemorySlicer]: Split 1 memory accesses to 1 slices as follows [1]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 1 writes are split as follows [1]. [2025-02-08 06:26:05,236 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:26:05" (1/1) ... [2025-02-08 06:26:05,236 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:26:05" (1/1) ... [2025-02-08 06:26:05,240 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:26:05" (1/1) ... [2025-02-08 06:26:05,242 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:26:05" (1/1) ... [2025-02-08 06:26:05,245 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:26:05" (1/1) ... [2025-02-08 06:26:05,245 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:26:05" (1/1) ... [2025-02-08 06:26:05,246 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 06:26:05,248 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 06:26:05,248 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 06:26:05,248 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 06:26:05,249 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:26:05" (1/1) ... [2025-02-08 06:26:05,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:26:05,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:26:05,279 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 06:26:05,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 06:26:05,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 06:26:05,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 06:26:05,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 06:26:05,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 06:26:05,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 06:26:05,356 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 06:26:05,358 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 06:26:05,453 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-02-08 06:26:05,455 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 06:26:05,461 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 06:26:05,463 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 06:26:05,463 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:26:05 BoogieIcfgContainer [2025-02-08 06:26:05,463 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 06:26:05,465 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 06:26:05,465 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 06:26:05,468 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 06:26:05,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 06:26:05" (1/3) ... [2025-02-08 06:26:05,470 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b6669f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:26:05, skipping insertion in model container [2025-02-08 06:26:05,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:26:05" (2/3) ... [2025-02-08 06:26:05,471 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b6669f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:26:05, skipping insertion in model container [2025-02-08 06:26:05,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:26:05" (3/3) ... [2025-02-08 06:26:05,472 INFO L128 eAbstractionObserver]: Analyzing ICFG derefAfterFree2.c [2025-02-08 06:26:05,486 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 06:26:05,487 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG derefAfterFree2.c that has 1 procedures, 17 locations, 1 initial locations, 1 loop locations, and 6 error locations. [2025-02-08 06:26:05,517 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 06:26:05,525 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;@5de62547, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 06:26:05,526 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-08 06:26:05,529 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 10 states have (on average 1.8) internal successors, (18), 16 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:26:05,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 06:26:05,534 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:26:05,534 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 06:26:05,535 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 3 more)] === [2025-02-08 06:26:05,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:26:05,539 INFO L85 PathProgramCache]: Analyzing trace with hash 45230, now seen corresponding path program 1 times [2025-02-08 06:26:05,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:26:05,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346572150] [2025-02-08 06:26:05,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:26:05,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:26:05,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 06:26:05,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 06:26:05,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:26:05,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:26:05,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:26:05,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:26:05,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346572150] [2025-02-08 06:26:05,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346572150] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:26:05,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:26:05,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:26:05,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461933764] [2025-02-08 06:26:05,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:26:05,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:26:05,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:26:05,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:26:05,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:26:05,664 INFO L87 Difference]: Start difference. First operand has 17 states, 10 states have (on average 1.8) internal successors, (18), 16 states have internal predecessors, (18), 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 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:26:05,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:26:05,696 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2025-02-08 06:26:05,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:26:05,698 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 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 3 [2025-02-08 06:26:05,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:26:05,702 INFO L225 Difference]: With dead ends: 22 [2025-02-08 06:26:05,702 INFO L226 Difference]: Without dead ends: 20 [2025-02-08 06:26:05,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:26:05,705 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 4 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:26:05,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 22 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:26:05,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-02-08 06:26:05,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2025-02-08 06:26:05,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.75) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:26:05,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2025-02-08 06:26:05,725 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 3 [2025-02-08 06:26:05,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:26:05,725 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2025-02-08 06:26:05,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:26:05,725 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2025-02-08 06:26:05,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 06:26:05,725 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:26:05,726 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 06:26:05,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 06:26:05,726 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 3 more)] === [2025-02-08 06:26:05,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:26:05,727 INFO L85 PathProgramCache]: Analyzing trace with hash 45645, now seen corresponding path program 1 times [2025-02-08 06:26:05,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:26:05,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529593529] [2025-02-08 06:26:05,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:26:05,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:26:05,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 06:26:05,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 06:26:05,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:26:05,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:26:05,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:26:05,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:26:05,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529593529] [2025-02-08 06:26:05,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529593529] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:26:05,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:26:05,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 06:26:05,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676058279] [2025-02-08 06:26:05,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:26:05,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:26:05,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:26:05,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:26:05,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:26:05,772 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:26:05,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:26:05,795 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2025-02-08 06:26:05,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:26:05,796 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 3 [2025-02-08 06:26:05,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:26:05,796 INFO L225 Difference]: With dead ends: 22 [2025-02-08 06:26:05,796 INFO L226 Difference]: Without dead ends: 22 [2025-02-08 06:26:05,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:26:05,797 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 9 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:26:05,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 12 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:26:05,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-02-08 06:26:05,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2025-02-08 06:26:05,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.6) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:26:05,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2025-02-08 06:26:05,799 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 3 [2025-02-08 06:26:05,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:26:05,799 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2025-02-08 06:26:05,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:26:05,799 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2025-02-08 06:26:05,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 06:26:05,799 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:26:05,802 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 06:26:05,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 06:26:05,802 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 3 more)] === [2025-02-08 06:26:05,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:26:05,803 INFO L85 PathProgramCache]: Analyzing trace with hash 45646, now seen corresponding path program 1 times [2025-02-08 06:26:05,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:26:05,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627598728] [2025-02-08 06:26:05,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:26:05,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:26:05,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 06:26:05,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 06:26:05,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:26:05,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:26:05,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:26:05,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:26:05,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627598728] [2025-02-08 06:26:05,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627598728] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:26:05,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:26:05,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 06:26:05,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357032257] [2025-02-08 06:26:05,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:26:05,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:26:05,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:26:05,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:26:05,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:26:05,918 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:26:05,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:26:05,947 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2025-02-08 06:26:05,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:26:05,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 3 [2025-02-08 06:26:05,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:26:05,949 INFO L225 Difference]: With dead ends: 21 [2025-02-08 06:26:05,949 INFO L226 Difference]: Without dead ends: 21 [2025-02-08 06:26:05,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:26:05,950 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 2 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:26:05,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 12 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:26:05,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-02-08 06:26:05,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2025-02-08 06:26:05,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:26:05,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2025-02-08 06:26:05,959 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 3 [2025-02-08 06:26:05,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:26:05,959 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2025-02-08 06:26:05,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:26:05,959 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2025-02-08 06:26:05,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 06:26:05,960 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:26:05,960 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:26:05,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 06:26:05,960 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 3 more)] === [2025-02-08 06:26:05,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:26:05,961 INFO L85 PathProgramCache]: Analyzing trace with hash -796149789, now seen corresponding path program 1 times [2025-02-08 06:26:05,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:26:05,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196833516] [2025-02-08 06:26:05,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:26:05,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:26:05,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 06:26:05,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 06:26:05,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:26:05,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:26:05,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:26:05,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:26:05,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196833516] [2025-02-08 06:26:05,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196833516] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:26:05,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847772507] [2025-02-08 06:26:05,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:26:05,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:26:05,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:26:05,996 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:26:05,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 06:26:06,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 06:26:06,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 06:26:06,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:26:06,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:26:06,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 06:26:06,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:26:06,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:26:06,073 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:26:06,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:26:06,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847772507] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:26:06,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:26:06,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-02-08 06:26:06,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5800679] [2025-02-08 06:26:06,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:26:06,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:26:06,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:26:06,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:26:06,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:26:06,105 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:26:06,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:26:06,154 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2025-02-08 06:26:06,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:26:06,156 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-08 06:26:06,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:26:06,157 INFO L225 Difference]: With dead ends: 30 [2025-02-08 06:26:06,157 INFO L226 Difference]: Without dead ends: 30 [2025-02-08 06:26:06,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:26:06,158 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 20 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:26:06,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 23 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:26:06,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-02-08 06:26:06,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-02-08 06:26:06,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.4) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:26:06,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2025-02-08 06:26:06,163 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 7 [2025-02-08 06:26:06,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:26:06,164 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2025-02-08 06:26:06,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:26:06,164 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2025-02-08 06:26:06,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 06:26:06,164 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:26:06,164 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-08 06:26:06,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 06:26:06,369 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-08 06:26:06,370 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 3 more)] === [2025-02-08 06:26:06,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:26:06,370 INFO L85 PathProgramCache]: Analyzing trace with hash -796149373, now seen corresponding path program 1 times [2025-02-08 06:26:06,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:26:06,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115481488] [2025-02-08 06:26:06,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:26:06,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:26:06,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 06:26:06,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 06:26:06,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:26:06,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:26:06,534 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:26:06,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:26:06,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115481488] [2025-02-08 06:26:06,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115481488] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:26:06,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210516514] [2025-02-08 06:26:06,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:26:06,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:26:06,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:26:06,541 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:26:06,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 06:26:06,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 06:26:06,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 06:26:06,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:26:06,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:26:06,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-08 06:26:06,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:26:06,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 06:26:06,703 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:26:06,704 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:26:06,770 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:26:06,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210516514] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:26:06,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:26:06,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2, 2] total 7 [2025-02-08 06:26:06,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000462307] [2025-02-08 06:26:06,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:26:06,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 06:26:06,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:26:06,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 06:26:06,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-08 06:26:06,773 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:26:06,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:26:06,874 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2025-02-08 06:26:06,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:26:06,875 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-08 06:26:06,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:26:06,877 INFO L225 Difference]: With dead ends: 29 [2025-02-08 06:26:06,877 INFO L226 Difference]: Without dead ends: 29 [2025-02-08 06:26:06,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-02-08 06:26:06,879 INFO L435 NwaCegarLoop]: 2 mSDtfsCounter, 43 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:26:06,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 6 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:26:06,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-02-08 06:26:06,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-02-08 06:26:06,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:26:06,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2025-02-08 06:26:06,883 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 7 [2025-02-08 06:26:06,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:26:06,883 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2025-02-08 06:26:06,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:26:06,884 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2025-02-08 06:26:06,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-08 06:26:06,884 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:26:06,884 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1] [2025-02-08 06:26:06,891 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-08 06:26:07,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:26:07,085 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 3 more)] === [2025-02-08 06:26:07,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:26:07,085 INFO L85 PathProgramCache]: Analyzing trace with hash 404187637, now seen corresponding path program 1 times [2025-02-08 06:26:07,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:26:07,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19601744] [2025-02-08 06:26:07,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:26:07,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:26:07,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 06:26:07,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 06:26:07,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:26:07,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:26:07,130 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-08 06:26:07,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:26:07,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19601744] [2025-02-08 06:26:07,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19601744] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:26:07,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:26:07,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 06:26:07,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856954409] [2025-02-08 06:26:07,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:26:07,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:26:07,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:26:07,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:26:07,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:26:07,132 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:26:07,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:26:07,134 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2025-02-08 06:26:07,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:26:07,134 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 13 [2025-02-08 06:26:07,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:26:07,135 INFO L225 Difference]: With dead ends: 28 [2025-02-08 06:26:07,135 INFO L226 Difference]: Without dead ends: 28 [2025-02-08 06:26:07,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:26:07,136 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 7 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:26:07,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 11 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:26:07,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-02-08 06:26:07,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-02-08 06:26:07,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 25 states have (on average 1.2) internal successors, (30), 27 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:26:07,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2025-02-08 06:26:07,138 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 13 [2025-02-08 06:26:07,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:26:07,138 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2025-02-08 06:26:07,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:26:07,138 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2025-02-08 06:26:07,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-08 06:26:07,138 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:26:07,138 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1] [2025-02-08 06:26:07,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 06:26:07,139 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 3 more)] === [2025-02-08 06:26:07,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:26:07,139 INFO L85 PathProgramCache]: Analyzing trace with hash -355085165, now seen corresponding path program 1 times [2025-02-08 06:26:07,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:26:07,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189565596] [2025-02-08 06:26:07,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:26:07,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:26:07,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 06:26:07,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 06:26:07,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:26:07,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:26:07,161 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-08 06:26:07,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:26:07,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189565596] [2025-02-08 06:26:07,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189565596] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:26:07,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:26:07,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 06:26:07,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825586940] [2025-02-08 06:26:07,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:26:07,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:26:07,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:26:07,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:26:07,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:26:07,162 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:26:07,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:26:07,169 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2025-02-08 06:26:07,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:26:07,169 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 14 [2025-02-08 06:26:07,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:26:07,169 INFO L225 Difference]: With dead ends: 27 [2025-02-08 06:26:07,169 INFO L226 Difference]: Without dead ends: 27 [2025-02-08 06:26:07,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:26:07,170 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 4 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:26:07,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 8 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:26:07,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-02-08 06:26:07,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-02-08 06:26:07,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 25 states have (on average 1.16) internal successors, (29), 26 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:26:07,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2025-02-08 06:26:07,172 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 14 [2025-02-08 06:26:07,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:26:07,172 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2025-02-08 06:26:07,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:26:07,173 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2025-02-08 06:26:07,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-08 06:26:07,173 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:26:07,173 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 06:26:07,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 06:26:07,173 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 3 more)] === [2025-02-08 06:26:07,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:26:07,174 INFO L85 PathProgramCache]: Analyzing trace with hash 735517231, now seen corresponding path program 1 times [2025-02-08 06:26:07,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:26:07,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742265086] [2025-02-08 06:26:07,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:26:07,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:26:07,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 06:26:07,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 06:26:07,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:26:07,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:26:07,214 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:26:07,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:26:07,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742265086] [2025-02-08 06:26:07,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742265086] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:26:07,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897479178] [2025-02-08 06:26:07,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:26:07,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:26:07,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:26:07,217 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:26:07,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 06:26:07,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 06:26:07,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 06:26:07,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:26:07,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:26:07,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 06:26:07,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:26:07,299 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:26:07,299 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:26:07,354 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:26:07,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897479178] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:26:07,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:26:07,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-02-08 06:26:07,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492553761] [2025-02-08 06:26:07,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:26:07,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:26:07,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:26:07,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:26:07,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:26:07,356 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:26:07,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:26:07,404 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2025-02-08 06:26:07,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:26:07,406 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 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 18 [2025-02-08 06:26:07,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:26:07,406 INFO L225 Difference]: With dead ends: 34 [2025-02-08 06:26:07,406 INFO L226 Difference]: Without dead ends: 34 [2025-02-08 06:26:07,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:26:07,407 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 1 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:26:07,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 23 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:26:07,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-02-08 06:26:07,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2025-02-08 06:26:07,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 31 states have (on average 1.096774193548387) internal successors, (34), 32 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:26:07,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2025-02-08 06:26:07,409 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 18 [2025-02-08 06:26:07,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:26:07,409 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2025-02-08 06:26:07,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:26:07,409 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2025-02-08 06:26:07,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-08 06:26:07,412 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:26:07,412 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1] [2025-02-08 06:26:07,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 06:26:07,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:26:07,613 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 3 more)] === [2025-02-08 06:26:07,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:26:07,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1896217527, now seen corresponding path program 2 times [2025-02-08 06:26:07,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:26:07,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666155596] [2025-02-08 06:26:07,613 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:26:07,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:26:07,621 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-02-08 06:26:07,627 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 06:26:07,627 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:26:07,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:26:07,741 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:26:07,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:26:07,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666155596] [2025-02-08 06:26:07,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666155596] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:26:07,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772723710] [2025-02-08 06:26:07,742 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:26:07,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:26:07,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:26:07,743 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:26:07,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 06:26:07,775 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-02-08 06:26:07,784 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 06:26:07,784 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:26:07,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:26:07,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-08 06:26:07,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:26:07,838 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:26:07,839 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:26:07,920 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:26:07,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1772723710] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:26:07,920 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:26:07,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-02-08 06:26:07,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620113572] [2025-02-08 06:26:07,920 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:26:07,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 06:26:07,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:26:07,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 06:26:07,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-02-08 06:26:07,921 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:26:07,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:26:07,967 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2025-02-08 06:26:07,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 06:26:07,968 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 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 23 [2025-02-08 06:26:07,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:26:07,968 INFO L225 Difference]: With dead ends: 48 [2025-02-08 06:26:07,968 INFO L226 Difference]: Without dead ends: 48 [2025-02-08 06:26:07,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-02-08 06:26:07,969 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 21 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:26:07,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 18 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:26:07,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-02-08 06:26:07,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-02-08 06:26:07,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 47 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-08 06:26:07,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2025-02-08 06:26:07,975 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 23 [2025-02-08 06:26:07,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:26:07,976 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2025-02-08 06:26:07,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:26:07,976 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2025-02-08 06:26:07,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-08 06:26:07,976 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:26:07,976 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 5, 1, 1, 1, 1, 1, 1] [2025-02-08 06:26:07,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-08 06:26:08,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-02-08 06:26:08,178 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 3 more)] === [2025-02-08 06:26:08,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:26:08,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1970457136, now seen corresponding path program 2 times [2025-02-08 06:26:08,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:26:08,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853265958] [2025-02-08 06:26:08,179 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:26:08,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:26:08,189 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-08 06:26:08,195 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 06:26:08,195 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:26:08,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 06:26:08,195 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 06:26:08,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 06:26:08,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 06:26:08,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:26:08,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 06:26:08,211 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 06:26:08,212 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 06:26:08,212 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 6 remaining) [2025-02-08 06:26:08,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2025-02-08 06:26:08,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (3 of 6 remaining) [2025-02-08 06:26:08,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (2 of 6 remaining) [2025-02-08 06:26:08,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (1 of 6 remaining) [2025-02-08 06:26:08,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 6 remaining) [2025-02-08 06:26:08,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 06:26:08,216 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 06:26:08,229 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 06:26:08,231 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 06:26:08 BoogieIcfgContainer [2025-02-08 06:26:08,231 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 06:26:08,231 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 06:26:08,231 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 06:26:08,231 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 06:26:08,232 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:26:05" (3/4) ... [2025-02-08 06:26:08,232 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-08 06:26:08,261 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 14. [2025-02-08 06:26:08,315 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 06:26:08,316 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 06:26:08,316 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 06:26:08,316 INFO L158 Benchmark]: Toolchain (without parser) took 3247.40ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 81.6MB in the end (delta: 23.3MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. [2025-02-08 06:26:08,316 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 201.3MB. Free memory was 126.6MB in the beginning and 126.3MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:26:08,317 INFO L158 Benchmark]: CACSL2BoogieTranslator took 127.23ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 94.8MB in the end (delta: 10.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 06:26:08,317 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.31ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 94.0MB in the end (delta: 896.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:26:08,317 INFO L158 Benchmark]: Boogie Preprocessor took 28.70ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 92.9MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 06:26:08,317 INFO L158 Benchmark]: IcfgBuilder took 215.60ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 81.3MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 06:26:08,317 INFO L158 Benchmark]: TraceAbstraction took 2765.98ms. Allocated memory is still 142.6MB. Free memory was 81.3MB in the beginning and 87.2MB in the end (delta: -5.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:26:08,318 INFO L158 Benchmark]: Witness Printer took 84.67ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 81.6MB in the end (delta: 5.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 06:26:08,318 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.31ms. Allocated memory is still 201.3MB. Free memory was 126.6MB in the beginning and 126.3MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 127.23ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 94.8MB in the end (delta: 10.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.31ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 94.0MB in the end (delta: 896.7kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.70ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 92.9MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 215.60ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 81.3MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2765.98ms. Allocated memory is still 142.6MB. Free memory was 81.3MB in the beginning and 87.2MB in the end (delta: -5.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 84.67ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 81.6MB in the end (delta: 5.6MB). 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: [L6] int* p = malloc(10 * sizeof(int)); [L8] int i = 0; VAL [i=0, p={-1:0}] [L8] COND TRUE i < 10 [L9] p[i] = 1 [L10] COND FALSE !(i == 5) VAL [i=0, p={-1:0}] [L8] i++ VAL [i=1, p={-1:0}] [L8] COND TRUE i < 10 [L9] p[i] = 1 [L10] COND FALSE !(i == 5) VAL [i=1, p={-1:0}] [L8] i++ VAL [i=2, p={-1:0}] [L8] COND TRUE i < 10 [L9] p[i] = 1 [L10] COND FALSE !(i == 5) VAL [i=2, p={-1:0}] [L8] i++ VAL [i=3, p={-1:0}] [L8] COND TRUE i < 10 [L9] p[i] = 1 [L10] COND FALSE !(i == 5) VAL [i=3, p={-1:0}] [L8] i++ VAL [i=4, p={-1:0}] [L8] COND TRUE i < 10 [L9] p[i] = 1 [L10] COND FALSE !(i == 5) VAL [i=4, p={-1:0}] [L8] i++ VAL [i=5, p={-1:0}] [L8] COND TRUE i < 10 [L9] p[i] = 1 [L10] COND TRUE i == 5 VAL [i=5, p={-1:0}] [L11] free(p) VAL [i=5, p={-1:0}] [L11] free(p) VAL [i=5, p={-1:0}] [L11] free(p) [L8] i++ VAL [i=6, p={-1:0}] [L8] COND TRUE i < 10 [L9] p[i] = 1 - UnprovableResult [Line: 5]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 11]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 11]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 11]: 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. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 10, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 111 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 111 mSDsluCounter, 135 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 57 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 215 IncrementalHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 78 mSDtfsCounter, 215 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 91 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=9, InterpolantAutomatonStates: 47, 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, 9 MinimizatonAttempts, 6 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 176 NumberOfCodeBlocks, 176 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 184 ConstructedInterpolants, 0 QuantifiedInterpolants, 756 SizeOfPredicates, 0 NumberOfNonLiveVariables, 220 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 17 InterpolantComputations, 5 PerfectInterpolantSequences, 45/218 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-08 06:26:08,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)