./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext3/getNumbers3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext3/getNumbers3.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c522d46e2ef8c6f97d600bd7187aa9b442df29a1c9828e86387b1c78c18556ba --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:59:28,121 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:59:28,163 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 11:59:28,166 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:59:28,166 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:59:28,183 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:59:28,183 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:59:28,183 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:59:28,184 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 11:59:28,184 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 11:59:28,184 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:59:28,184 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:59:28,184 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:59:28,184 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:59:28,184 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:59:28,184 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:59:28,185 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:59:28,185 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:59:28,185 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:59:28,185 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:59:28,185 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 11:59:28,185 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 11:59:28,185 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 11:59:28,185 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:59:28,185 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 11:59:28,185 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:59:28,185 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:59:28,186 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:59:28,186 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:59:28,186 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:59:28,186 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:59:28,186 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 11:59:28,186 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:59:28,186 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:59:28,186 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:59:28,186 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:59:28,186 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:59:28,186 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:59:28,187 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:59:28,187 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:59:28,187 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:59:28,187 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:59:28,187 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c522d46e2ef8c6f97d600bd7187aa9b442df29a1c9828e86387b1c78c18556ba [2025-03-17 11:59:28,390 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:59:28,399 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:59:28,400 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:59:28,401 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:59:28,401 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:59:28,403 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext3/getNumbers3.c [2025-03-17 11:59:29,512 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3a33c8a4/ca197924bc29485eb9f436ec996a3a61/FLAGe4da3feda [2025-03-17 11:59:29,721 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:59:29,733 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext3/getNumbers3.c [2025-03-17 11:59:29,754 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3a33c8a4/ca197924bc29485eb9f436ec996a3a61/FLAGe4da3feda [2025-03-17 11:59:30,082 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3a33c8a4/ca197924bc29485eb9f436ec996a3a61 [2025-03-17 11:59:30,084 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:59:30,085 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:59:30,086 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:59:30,086 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:59:30,088 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:59:30,089 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:59:30" (1/1) ... [2025-03-17 11:59:30,089 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7343d04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:59:30, skipping insertion in model container [2025-03-17 11:59:30,089 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:59:30" (1/1) ... [2025-03-17 11:59:30,097 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:59:30,188 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:59:30,198 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:59:30,206 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:59:30,217 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:59:30,218 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:59:30 WrapperNode [2025-03-17 11:59:30,219 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:59:30,219 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:59:30,219 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:59:30,220 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:59:30,224 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:59:30" (1/1) ... [2025-03-17 11:59:30,230 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:59:30" (1/1) ... [2025-03-17 11:59:30,242 INFO L138 Inliner]: procedures = 9, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 31 [2025-03-17 11:59:30,242 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:59:30,243 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:59:30,243 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:59:30,243 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:59:30,248 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:59:30" (1/1) ... [2025-03-17 11:59:30,249 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:59:30" (1/1) ... [2025-03-17 11:59:30,250 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:59:30" (1/1) ... [2025-03-17 11:59:30,260 INFO L175 MemorySlicer]: Split 12 memory accesses to 1 slices as follows [12]. 100 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [10]. The 2 writes are split as follows [2]. [2025-03-17 11:59:30,262 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:59:30" (1/1) ... [2025-03-17 11:59:30,262 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:59:30" (1/1) ... [2025-03-17 11:59:30,266 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:59:30" (1/1) ... [2025-03-17 11:59:30,269 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:59:30" (1/1) ... [2025-03-17 11:59:30,269 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:59:30" (1/1) ... [2025-03-17 11:59:30,272 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:59:30" (1/1) ... [2025-03-17 11:59:30,273 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:59:30,274 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:59:30,274 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:59:30,274 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:59:30,275 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:59:30" (1/1) ... [2025-03-17 11:59:30,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:59:30,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:59:30,300 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 11:59:30,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 11:59:30,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 11:59:30,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:59:30,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:59:30,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:59:30,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 11:59:30,363 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:59:30,365 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:59:30,460 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-17 11:59:30,461 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:59:30,468 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:59:30,468 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:59:30,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:59:30 BoogieIcfgContainer [2025-03-17 11:59:30,469 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:59:30,471 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:59:30,472 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:59:30,475 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:59:30,475 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:59:30" (1/3) ... [2025-03-17 11:59:30,476 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@293a190 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:59:30, skipping insertion in model container [2025-03-17 11:59:30,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:59:30" (2/3) ... [2025-03-17 11:59:30,477 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@293a190 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:59:30, skipping insertion in model container [2025-03-17 11:59:30,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:59:30" (3/3) ... [2025-03-17 11:59:30,478 INFO L128 eAbstractionObserver]: Analyzing ICFG getNumbers3.c [2025-03-17 11:59:30,489 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:59:30,491 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG getNumbers3.c that has 1 procedures, 14 locations, 1 initial locations, 1 loop locations, and 5 error locations. [2025-03-17 11:59:30,518 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:59:30,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;@35e198ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:59:30,525 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-17 11:59:30,527 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 8 states have (on average 1.75) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:59:30,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-17 11:59:30,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:59:30,531 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-17 11:59:30,531 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-03-17 11:59:30,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:59:30,536 INFO L85 PathProgramCache]: Analyzing trace with hash 41513, now seen corresponding path program 1 times [2025-03-17 11:59:30,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:59:30,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887689926] [2025-03-17 11:59:30,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:59:30,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:59:30,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 11:59:30,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 11:59:30,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:59:30,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:30,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:59:30,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:59:30,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887689926] [2025-03-17 11:59:30,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887689926] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:59:30,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:59:30,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:59:30,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629241752] [2025-03-17 11:59:30,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:59:30,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:59:30,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:59:30,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:59:30,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:59:30,690 INFO L87 Difference]: Start difference. First operand has 14 states, 8 states have (on average 1.75) internal successors, (14), 13 states have internal predecessors, (14), 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-03-17 11:59:30,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:59:30,720 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2025-03-17 11:59:30,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:59:30,722 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-03-17 11:59:30,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:59:30,726 INFO L225 Difference]: With dead ends: 18 [2025-03-17 11:59:30,726 INFO L226 Difference]: Without dead ends: 16 [2025-03-17 11:59:30,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:59:30,729 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 3 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:59:30,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 18 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:59:30,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-03-17 11:59:30,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 13. [2025-03-17 11:59:30,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.625) internal successors, (13), 12 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-03-17 11:59:30,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2025-03-17 11:59:30,755 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 3 [2025-03-17 11:59:30,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:59:30,755 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2025-03-17 11:59:30,755 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-03-17 11:59:30,755 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2025-03-17 11:59:30,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-17 11:59:30,756 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:59:30,756 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-17 11:59:30,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:59:30,756 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-03-17 11:59:30,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:59:30,757 INFO L85 PathProgramCache]: Analyzing trace with hash 41673, now seen corresponding path program 1 times [2025-03-17 11:59:30,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:59:30,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114000305] [2025-03-17 11:59:30,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:59:30,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:59:30,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 11:59:30,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 11:59:30,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:59:30,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:30,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:59:30,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:59:30,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114000305] [2025-03-17 11:59:30,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114000305] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:59:30,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:59:30,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 11:59:30,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204861027] [2025-03-17 11:59:30,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:59:30,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:59:30,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:59:30,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:59:30,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:59:30,842 INFO L87 Difference]: Start difference. First operand 13 states and 13 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-03-17 11:59:30,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:59:30,853 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2025-03-17 11:59:30,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:59:30,854 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-03-17 11:59:30,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:59:30,854 INFO L225 Difference]: With dead ends: 12 [2025-03-17 11:59:30,854 INFO L226 Difference]: Without dead ends: 12 [2025-03-17 11:59:30,855 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-03-17 11:59:30,855 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 9 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:59:30,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 5 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:59:30,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2025-03-17 11:59:30,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-03-17 11:59:30,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 8 states have (on average 1.5) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:59:30,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2025-03-17 11:59:30,859 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 3 [2025-03-17 11:59:30,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:59:30,859 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2025-03-17 11:59:30,859 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-03-17 11:59:30,859 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2025-03-17 11:59:30,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-17 11:59:30,859 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:59:30,859 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-17 11:59:30,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:59:30,859 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-03-17 11:59:30,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:59:30,860 INFO L85 PathProgramCache]: Analyzing trace with hash 41674, now seen corresponding path program 1 times [2025-03-17 11:59:30,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:59:30,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517272788] [2025-03-17 11:59:30,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:59:30,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:59:30,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 11:59:30,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 11:59:30,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:59:30,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:30,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:59:30,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:59:30,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517272788] [2025-03-17 11:59:30,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517272788] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:59:30,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:59:30,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 11:59:30,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760005683] [2025-03-17 11:59:30,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:59:30,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:59:30,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:59:30,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:59:30,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:59:30,956 INFO L87 Difference]: Start difference. First operand 12 states and 12 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-03-17 11:59:30,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:59:30,973 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2025-03-17 11:59:30,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:59:30,974 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-03-17 11:59:30,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:59:30,974 INFO L225 Difference]: With dead ends: 14 [2025-03-17 11:59:30,974 INFO L226 Difference]: Without dead ends: 14 [2025-03-17 11:59:30,974 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-03-17 11:59:30,974 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 1 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:59:30,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 11 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:59:30,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-03-17 11:59:30,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2025-03-17 11:59:30,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 12 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-03-17 11:59:30,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2025-03-17 11:59:30,976 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 3 [2025-03-17 11:59:30,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:59:30,976 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2025-03-17 11:59:30,976 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-03-17 11:59:30,976 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2025-03-17 11:59:30,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 11:59:30,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:59:30,976 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 11:59:30,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:59:30,977 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-03-17 11:59:30,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:59:30,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1241457469, now seen corresponding path program 1 times [2025-03-17 11:59:30,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:59:30,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074528035] [2025-03-17 11:59:30,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:59:30,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:59:30,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 11:59:30,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 11:59:30,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:59:30,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:31,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:59:31,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:59:31,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074528035] [2025-03-17 11:59:31,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074528035] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:59:31,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867193715] [2025-03-17 11:59:31,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:59:31,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:59:31,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:59:31,047 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:59:31,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 11:59:31,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 11:59:31,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 11:59:31,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:59:31,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:31,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 11:59:31,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:59:31,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:59:31,125 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:59:31,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:59:31,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867193715] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:59:31,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:59:31,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-17 11:59:31,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39633256] [2025-03-17 11:59:31,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:59:31,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 11:59:31,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:59:31,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 11:59:31,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:59:31,151 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:59:31,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:59:31,189 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2025-03-17 11:59:31,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:59:31,189 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-17 11:59:31,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:59:31,189 INFO L225 Difference]: With dead ends: 21 [2025-03-17 11:59:31,189 INFO L226 Difference]: Without dead ends: 21 [2025-03-17 11:59:31,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:59:31,190 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 4 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:59:31,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 22 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:59:31,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-17 11:59:31,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-03-17 11:59:31,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 20 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-03-17 11:59:31,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2025-03-17 11:59:31,192 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 6 [2025-03-17 11:59:31,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:59:31,192 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2025-03-17 11:59:31,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:59:31,192 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2025-03-17 11:59:31,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 11:59:31,192 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:59:31,192 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2025-03-17 11:59:31,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 11:59:31,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:59:31,393 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-03-17 11:59:31,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:59:31,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1241457630, now seen corresponding path program 1 times [2025-03-17 11:59:31,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:59:31,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932360137] [2025-03-17 11:59:31,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:59:31,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:59:31,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 11:59:31,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 11:59:31,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:59:31,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:31,545 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:59:31,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:59:31,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932360137] [2025-03-17 11:59:31,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932360137] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:59:31,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805423870] [2025-03-17 11:59:31,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:59:31,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:59:31,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:59:31,548 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:59:31,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 11:59:31,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 11:59:31,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 11:59:31,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:59:31,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:31,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 11:59:31,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:59:31,676 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:59:31,678 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:59:31,741 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:59:31,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805423870] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:59:31,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:59:31,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2, 2] total 7 [2025-03-17 11:59:31,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404806767] [2025-03-17 11:59:31,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:59:31,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 11:59:31,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:59:31,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 11:59:31,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:59:31,744 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 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-03-17 11:59:31,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:59:31,828 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2025-03-17 11:59:31,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 11:59:31,828 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 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) Word has length 6 [2025-03-17 11:59:31,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:59:31,828 INFO L225 Difference]: With dead ends: 20 [2025-03-17 11:59:31,828 INFO L226 Difference]: Without dead ends: 20 [2025-03-17 11:59:31,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-03-17 11:59:31,829 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 11 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:59:31,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 27 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:59:31,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-17 11:59:31,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-03-17 11:59:31,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:59:31,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2025-03-17 11:59:31,832 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 6 [2025-03-17 11:59:31,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:59:31,833 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2025-03-17 11:59:31,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 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-03-17 11:59:31,833 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2025-03-17 11:59:31,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 11:59:31,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:59:31,834 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1] [2025-03-17 11:59:31,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 11:59:32,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:59:32,038 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-03-17 11:59:32,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:59:32,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1228672727, now seen corresponding path program 2 times [2025-03-17 11:59:32,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:59:32,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951523529] [2025-03-17 11:59:32,039 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:59:32,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:59:32,046 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-17 11:59:32,049 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 15 statements. [2025-03-17 11:59:32,049 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:59:32,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:32,084 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-17 11:59:32,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:59:32,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951523529] [2025-03-17 11:59:32,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951523529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:59:32,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:59:32,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:59:32,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369834942] [2025-03-17 11:59:32,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:59:32,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:59:32,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:59:32,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:59:32,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:59:32,085 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:59:32,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:59:32,099 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2025-03-17 11:59:32,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:59:32,099 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-17 11:59:32,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:59:32,100 INFO L225 Difference]: With dead ends: 19 [2025-03-17 11:59:32,100 INFO L226 Difference]: Without dead ends: 19 [2025-03-17 11:59:32,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:59:32,101 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 5 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:59:32,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 7 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:59:32,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-03-17 11:59:32,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-03-17 11:59:32,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:59:32,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2025-03-17 11:59:32,104 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 15 [2025-03-17 11:59:32,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:59:32,104 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2025-03-17 11:59:32,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:59:32,104 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2025-03-17 11:59:32,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 11:59:32,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:59:32,104 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1] [2025-03-17 11:59:32,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:59:32,104 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-03-17 11:59:32,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:59:32,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1228672726, now seen corresponding path program 1 times [2025-03-17 11:59:32,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:59:32,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856482764] [2025-03-17 11:59:32,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:59:32,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:59:32,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 11:59:32,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 11:59:32,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:59:32,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:32,195 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:59:32,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:59:32,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856482764] [2025-03-17 11:59:32,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856482764] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:59:32,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578033855] [2025-03-17 11:59:32,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:59:32,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:59:32,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:59:32,197 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:59:32,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 11:59:32,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 11:59:32,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 11:59:32,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:59:32,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:32,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 11:59:32,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:59:32,256 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:59:32,256 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:59:32,321 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:59:32,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578033855] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:59:32,321 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:59:32,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-17 11:59:32,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182201837] [2025-03-17 11:59:32,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:59:32,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 11:59:32,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:59:32,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 11:59:32,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-17 11:59:32,323 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:59:32,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:59:32,385 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2025-03-17 11:59:32,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 11:59:32,385 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 states have internal predecessors, (33), 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 15 [2025-03-17 11:59:32,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:59:32,386 INFO L225 Difference]: With dead ends: 37 [2025-03-17 11:59:32,386 INFO L226 Difference]: Without dead ends: 37 [2025-03-17 11:59:32,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-17 11:59:32,387 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 4 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:59:32,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 18 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:59:32,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-17 11:59:32,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-03-17 11:59:32,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 36 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:59:32,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2025-03-17 11:59:32,389 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 15 [2025-03-17 11:59:32,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:59:32,389 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2025-03-17 11:59:32,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:59:32,390 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2025-03-17 11:59:32,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-17 11:59:32,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:59:32,390 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1] [2025-03-17 11:59:32,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 11:59:32,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:59:32,596 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-03-17 11:59:32,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:59:32,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1226328150, now seen corresponding path program 2 times [2025-03-17 11:59:32,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:59:32,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858294282] [2025-03-17 11:59:32,596 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:59:32,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:59:32,607 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-17 11:59:32,609 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 33 statements. [2025-03-17 11:59:32,609 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:59:32,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:32,647 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 11:59:32,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:59:32,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858294282] [2025-03-17 11:59:32,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858294282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:59:32,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:59:32,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:59:32,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051771343] [2025-03-17 11:59:32,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:59:32,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:59:32,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:59:32,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:59:32,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:59:32,648 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:59:32,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:59:32,663 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2025-03-17 11:59:32,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:59:32,664 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-03-17 11:59:32,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:59:32,664 INFO L225 Difference]: With dead ends: 36 [2025-03-17 11:59:32,664 INFO L226 Difference]: Without dead ends: 36 [2025-03-17 11:59:32,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 11:59:32,665 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 4 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:59:32,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 9 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:59:32,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-17 11:59:32,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-03-17 11:59:32,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:59:32,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2025-03-17 11:59:32,667 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 33 [2025-03-17 11:59:32,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:59:32,667 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2025-03-17 11:59:32,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:59:32,667 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2025-03-17 11:59:32,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-17 11:59:32,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:59:32,668 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1] [2025-03-17 11:59:32,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:59:32,668 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2025-03-17 11:59:32,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:59:32,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1680314905, now seen corresponding path program 1 times [2025-03-17 11:59:32,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:59:32,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911687258] [2025-03-17 11:59:32,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:59:32,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:59:32,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 11:59:32,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 11:59:32,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:59:32,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:32,711 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-17 11:59:32,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:59:32,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911687258] [2025-03-17 11:59:32,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911687258] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:59:32,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:59:32,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 11:59:32,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446556986] [2025-03-17 11:59:32,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:59:32,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:59:32,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:59:32,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:59:32,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:59:32,713 INFO L87 Difference]: Start difference. First operand 36 states and 36 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-03-17 11:59:32,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:59:32,715 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2025-03-17 11:59:32,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:59:32,716 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 35 [2025-03-17 11:59:32,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:59:32,716 INFO L225 Difference]: With dead ends: 35 [2025-03-17 11:59:32,716 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 11:59:32,716 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-03-17 11:59:32,716 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5 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-03-17 11:59:32,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:59:32,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 11:59:32,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 11:59:32,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:59:32,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 11:59:32,717 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2025-03-17 11:59:32,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:59:32,717 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 11:59:32,717 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-03-17 11:59:32,717 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 11:59:32,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 11:59:32,719 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 5 remaining) [2025-03-17 11:59:32,719 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 5 remaining) [2025-03-17 11:59:32,719 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 5 remaining) [2025-03-17 11:59:32,719 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 5 remaining) [2025-03-17 11:59:32,719 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 5 remaining) [2025-03-17 11:59:32,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:59:32,722 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1] [2025-03-17 11:59:32,723 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 11:59:32,733 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 11:59:32 BoogieIcfgContainer [2025-03-17 11:59:32,733 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 11:59:32,733 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 11:59:32,733 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 11:59:32,734 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 11:59:32,734 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:59:30" (3/4) ... [2025-03-17 11:59:32,735 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 11:59:32,741 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-03-17 11:59:32,741 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-17 11:59:32,741 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 11:59:32,815 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 11:59:32,815 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 11:59:32,815 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 11:59:32,815 INFO L158 Benchmark]: Toolchain (without parser) took 2730.73ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 80.8MB in the end (delta: 25.3MB). Peak memory consumption was 24.8MB. Max. memory is 16.1GB. [2025-03-17 11:59:32,815 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:59:32,816 INFO L158 Benchmark]: CACSL2BoogieTranslator took 133.35ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 94.9MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 11:59:32,816 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.33ms. Allocated memory is still 142.6MB. Free memory was 94.9MB in the beginning and 93.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:59:32,819 INFO L158 Benchmark]: Boogie Preprocessor took 30.44ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 93.2MB in the end (delta: 628.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:59:32,820 INFO L158 Benchmark]: IcfgBuilder took 195.03ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 81.5MB in the end (delta: 11.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 11:59:32,820 INFO L158 Benchmark]: TraceAbstraction took 2261.76ms. Allocated memory is still 142.6MB. Free memory was 81.5MB in the beginning and 85.7MB in the end (delta: -4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:59:32,820 INFO L158 Benchmark]: Witness Printer took 81.35ms. Allocated memory is still 142.6MB. Free memory was 85.7MB in the beginning and 80.8MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 11:59:32,821 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.19ms. Allocated memory is still 201.3MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 133.35ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 94.9MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.33ms. Allocated memory is still 142.6MB. Free memory was 94.9MB in the beginning and 93.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.44ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 93.2MB in the end (delta: 628.7kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 195.03ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 81.5MB in the end (delta: 11.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2261.76ms. Allocated memory is still 142.6MB. Free memory was 81.5MB in the beginning and 85.7MB in the end (delta: -4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 81.35ms. Allocated memory is still 142.6MB. Free memory was 85.7MB in the beginning and 80.8MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 12]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 14 locations, 14 edges, 5 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 9, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 41 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 41 mSDsluCounter, 122 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 66 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 153 IncrementalHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 56 mSDtfsCounter, 153 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=7, InterpolantAutomatonStates: 45, 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, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 146 NumberOfCodeBlocks, 104 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 158 ConstructedInterpolants, 0 QuantifiedInterpolants, 1058 SizeOfPredicates, 0 NumberOfNonLiveVariables, 196 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 15 InterpolantComputations, 6 PerfectInterpolantSequences, 312/387 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-17 11:59:32,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE