./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 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/forester-heap/dll-rb-sentinel-1.i -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 503e46fe74670dc8b1fd2e8b2c5a408fc01c83cb421ff9aefb8796417315d291 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:52:13,200 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:52:13,255 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 07:52:13,262 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:52:13,265 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:52:13,285 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:52:13,286 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:52:13,286 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:52:13,286 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:52:13,287 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:52:13,287 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:52:13,287 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:52:13,288 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:52:13,288 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:52:13,288 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:52:13,288 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:52:13,288 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:52:13,288 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:52:13,289 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:52:13,289 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:52:13,289 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:52:13,289 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:52:13,289 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 07:52:13,289 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:52:13,289 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:52:13,289 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:52:13,289 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:52:13,290 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:52:13,290 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:52:13,290 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:52:13,290 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:52:13,290 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:52:13,290 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:52:13,290 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:52:13,290 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:52:13,290 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:52:13,290 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:52:13,290 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:52:13,290 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:52:13,291 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:52:13,291 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:52:13,291 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:52:13,291 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 -> 503e46fe74670dc8b1fd2e8b2c5a408fc01c83cb421ff9aefb8796417315d291 [2025-03-04 07:52:13,537 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:52:13,544 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:52:13,547 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:52:13,548 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:52:13,548 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:52:13,549 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i [2025-03-04 07:52:14,685 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f0dabe63/7fe69a7bc60040bcb1c671749f885af4/FLAGd84a3d520 [2025-03-04 07:52:14,926 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:52:14,926 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i [2025-03-04 07:52:14,934 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f0dabe63/7fe69a7bc60040bcb1c671749f885af4/FLAGd84a3d520 [2025-03-04 07:52:15,255 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f0dabe63/7fe69a7bc60040bcb1c671749f885af4 [2025-03-04 07:52:15,257 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:52:15,258 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:52:15,259 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:52:15,259 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:52:15,261 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:52:15,263 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:52:15" (1/1) ... [2025-03-04 07:52:15,264 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75ae6b47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:15, skipping insertion in model container [2025-03-04 07:52:15,264 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:52:15" (1/1) ... [2025-03-04 07:52:15,289 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:52:15,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:52:15,509 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:52:15,542 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:52:15,564 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:52:15,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:15 WrapperNode [2025-03-04 07:52:15,565 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:52:15,565 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:52:15,565 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:52:15,566 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:52:15,570 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:15" (1/1) ... [2025-03-04 07:52:15,581 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:15" (1/1) ... [2025-03-04 07:52:15,599 INFO L138 Inliner]: procedures = 119, calls = 50, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 152 [2025-03-04 07:52:15,602 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:52:15,603 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:52:15,603 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:52:15,603 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:52:15,609 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:15" (1/1) ... [2025-03-04 07:52:15,609 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:15" (1/1) ... [2025-03-04 07:52:15,611 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:15" (1/1) ... [2025-03-04 07:52:15,627 INFO L175 MemorySlicer]: Split 32 memory accesses to 2 slices as follows [2, 30]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 15 writes are split as follows [0, 15]. [2025-03-04 07:52:15,628 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:15" (1/1) ... [2025-03-04 07:52:15,628 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:15" (1/1) ... [2025-03-04 07:52:15,633 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:15" (1/1) ... [2025-03-04 07:52:15,634 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:15" (1/1) ... [2025-03-04 07:52:15,635 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:15" (1/1) ... [2025-03-04 07:52:15,636 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:15" (1/1) ... [2025-03-04 07:52:15,638 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:52:15,639 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:52:15,639 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:52:15,639 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:52:15,641 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:15" (1/1) ... [2025-03-04 07:52:15,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:52:15,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:52:15,664 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-04 07:52:15,667 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-04 07:52:15,682 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-03-04 07:52:15,682 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-03-04 07:52:15,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 07:52:15,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 07:52:15,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 07:52:15,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 07:52:15,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 07:52:15,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 07:52:15,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 07:52:15,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 07:52:15,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 07:52:15,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 07:52:15,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:52:15,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 07:52:15,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 07:52:15,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:52:15,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:52:15,767 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:52:15,768 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:52:16,088 INFO L? ?]: Removed 132 outVars from TransFormulas that were not future-live. [2025-03-04 07:52:16,088 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:52:16,099 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:52:16,099 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:52:16,100 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:52:16 BoogieIcfgContainer [2025-03-04 07:52:16,100 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:52:16,101 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:52:16,101 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:52:16,105 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:52:16,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:52:15" (1/3) ... [2025-03-04 07:52:16,106 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@292ada24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:52:16, skipping insertion in model container [2025-03-04 07:52:16,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:15" (2/3) ... [2025-03-04 07:52:16,107 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@292ada24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:52:16, skipping insertion in model container [2025-03-04 07:52:16,107 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:52:16" (3/3) ... [2025-03-04 07:52:16,108 INFO L128 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel-1.i [2025-03-04 07:52:16,119 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:52:16,120 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll-rb-sentinel-1.i that has 2 procedures, 170 locations, 1 initial locations, 10 loop locations, and 71 error locations. [2025-03-04 07:52:16,154 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:52:16,163 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;@5ebf4f2e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:52:16,163 INFO L334 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2025-03-04 07:52:16,167 INFO L276 IsEmpty]: Start isEmpty. Operand has 170 states, 90 states have (on average 2.111111111111111) internal successors, (190), 161 states have internal predecessors, (190), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 07:52:16,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-04 07:52:16,171 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:16,171 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-04 07:52:16,172 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 68 more)] === [2025-03-04 07:52:16,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:16,176 INFO L85 PathProgramCache]: Analyzing trace with hash 226371, now seen corresponding path program 1 times [2025-03-04 07:52:16,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:16,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627543610] [2025-03-04 07:52:16,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:16,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:16,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 07:52:16,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 07:52:16,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:16,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:16,303 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-04 07:52:16,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:16,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627543610] [2025-03-04 07:52:16,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627543610] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:16,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:16,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:52:16,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613447298] [2025-03-04 07:52:16,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:16,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:52:16,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:16,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:52:16,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:52:16,328 INFO L87 Difference]: Start difference. First operand has 170 states, 90 states have (on average 2.111111111111111) internal successors, (190), 161 states have internal predecessors, (190), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 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-04 07:52:16,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:16,471 INFO L93 Difference]: Finished difference Result 183 states and 196 transitions. [2025-03-04 07:52:16,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:52:16,473 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 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-04 07:52:16,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:16,477 INFO L225 Difference]: With dead ends: 183 [2025-03-04 07:52:16,477 INFO L226 Difference]: Without dead ends: 181 [2025-03-04 07:52:16,478 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-04 07:52:16,480 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 136 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:16,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 116 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:52:16,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-03-04 07:52:16,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 156. [2025-03-04 07:52:16,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 81 states have (on average 1.9753086419753085) internal successors, (160), 154 states have internal predecessors, (160), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:16,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 167 transitions. [2025-03-04 07:52:16,512 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 167 transitions. Word has length 3 [2025-03-04 07:52:16,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:16,512 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 167 transitions. [2025-03-04 07:52:16,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 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-04 07:52:16,513 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 167 transitions. [2025-03-04 07:52:16,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-04 07:52:16,513 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:16,513 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-04 07:52:16,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 07:52:16,513 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 68 more)] === [2025-03-04 07:52:16,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:16,514 INFO L85 PathProgramCache]: Analyzing trace with hash 226372, now seen corresponding path program 1 times [2025-03-04 07:52:16,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:16,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626218020] [2025-03-04 07:52:16,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:16,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:16,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 07:52:16,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 07:52:16,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:16,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:16,588 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-04 07:52:16,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:16,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626218020] [2025-03-04 07:52:16,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626218020] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:16,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:16,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:52:16,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239626672] [2025-03-04 07:52:16,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:16,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:52:16,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:16,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:52:16,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:52:16,590 INFO L87 Difference]: Start difference. First operand 156 states and 167 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 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-04 07:52:16,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:16,691 INFO L93 Difference]: Finished difference Result 153 states and 164 transitions. [2025-03-04 07:52:16,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:52:16,691 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 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-04 07:52:16,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:16,692 INFO L225 Difference]: With dead ends: 153 [2025-03-04 07:52:16,694 INFO L226 Difference]: Without dead ends: 153 [2025-03-04 07:52:16,694 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-04 07:52:16,694 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 148 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:16,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 95 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:52:16,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-03-04 07:52:16,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2025-03-04 07:52:16,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 81 states have (on average 1.9382716049382716) internal successors, (157), 151 states have internal predecessors, (157), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:16,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 164 transitions. [2025-03-04 07:52:16,703 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 164 transitions. Word has length 3 [2025-03-04 07:52:16,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:16,706 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 164 transitions. [2025-03-04 07:52:16,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 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-04 07:52:16,706 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 164 transitions. [2025-03-04 07:52:16,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 07:52:16,706 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:16,706 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:16,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 07:52:16,706 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 68 more)] === [2025-03-04 07:52:16,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:16,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1390072003, now seen corresponding path program 1 times [2025-03-04 07:52:16,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:16,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447889950] [2025-03-04 07:52:16,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:16,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:16,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 07:52:16,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 07:52:16,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:16,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:16,768 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-04 07:52:16,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:16,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447889950] [2025-03-04 07:52:16,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447889950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:16,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:16,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:52:16,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494085694] [2025-03-04 07:52:16,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:16,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:52:16,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:16,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:52:16,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:52:16,769 INFO L87 Difference]: Start difference. First operand 153 states and 164 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:16,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:16,875 INFO L93 Difference]: Finished difference Result 148 states and 161 transitions. [2025-03-04 07:52:16,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:52:16,876 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 07:52:16,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:16,876 INFO L225 Difference]: With dead ends: 148 [2025-03-04 07:52:16,876 INFO L226 Difference]: Without dead ends: 148 [2025-03-04 07:52:16,877 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-04 07:52:16,877 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 117 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:16,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 100 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:52:16,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-03-04 07:52:16,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2025-03-04 07:52:16,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 83 states have (on average 1.855421686746988) internal successors, (154), 146 states have internal predecessors, (154), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:16,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 161 transitions. [2025-03-04 07:52:16,885 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 161 transitions. Word has length 7 [2025-03-04 07:52:16,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:16,886 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 161 transitions. [2025-03-04 07:52:16,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:16,886 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 161 transitions. [2025-03-04 07:52:16,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 07:52:16,886 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:16,886 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:16,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 07:52:16,886 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 68 more)] === [2025-03-04 07:52:16,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:16,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1390072002, now seen corresponding path program 1 times [2025-03-04 07:52:16,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:16,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108913745] [2025-03-04 07:52:16,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:16,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:16,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 07:52:16,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 07:52:16,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:16,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:16,984 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-04 07:52:16,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:16,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108913745] [2025-03-04 07:52:16,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108913745] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:16,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:16,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:52:16,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635044128] [2025-03-04 07:52:16,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:16,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:52:16,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:16,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:52:16,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:52:16,986 INFO L87 Difference]: Start difference. First operand 148 states and 161 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:17,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:17,078 INFO L93 Difference]: Finished difference Result 152 states and 165 transitions. [2025-03-04 07:52:17,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:52:17,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 07:52:17,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:17,080 INFO L225 Difference]: With dead ends: 152 [2025-03-04 07:52:17,080 INFO L226 Difference]: Without dead ends: 152 [2025-03-04 07:52:17,080 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-04 07:52:17,081 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 111 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:17,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 114 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:52:17,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-03-04 07:52:17,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2025-03-04 07:52:17,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 90 states have (on average 1.7555555555555555) internal successors, (158), 150 states have internal predecessors, (158), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:17,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 165 transitions. [2025-03-04 07:52:17,086 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 165 transitions. Word has length 7 [2025-03-04 07:52:17,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:17,087 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 165 transitions. [2025-03-04 07:52:17,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:17,087 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 165 transitions. [2025-03-04 07:52:17,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 07:52:17,087 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:17,087 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:17,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 07:52:17,087 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 68 more)] === [2025-03-04 07:52:17,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:17,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1731751602, now seen corresponding path program 1 times [2025-03-04 07:52:17,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:17,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499495535] [2025-03-04 07:52:17,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:17,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:17,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 07:52:17,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 07:52:17,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:17,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:17,247 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-04 07:52:17,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:17,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499495535] [2025-03-04 07:52:17,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499495535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:17,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:17,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:52:17,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882756605] [2025-03-04 07:52:17,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:17,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:52:17,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:17,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:52:17,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:52:17,248 INFO L87 Difference]: Start difference. First operand 152 states and 165 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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-04 07:52:17,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:17,396 INFO L93 Difference]: Finished difference Result 139 states and 154 transitions. [2025-03-04 07:52:17,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:52:17,397 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-04 07:52:17,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:17,397 INFO L225 Difference]: With dead ends: 139 [2025-03-04 07:52:17,397 INFO L226 Difference]: Without dead ends: 139 [2025-03-04 07:52:17,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-04 07:52:17,398 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 154 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:17,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 84 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:52:17,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-03-04 07:52:17,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2025-03-04 07:52:17,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 92 states have (on average 1.5978260869565217) internal successors, (147), 137 states have internal predecessors, (147), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:17,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 154 transitions. [2025-03-04 07:52:17,403 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 154 transitions. Word has length 13 [2025-03-04 07:52:17,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:17,403 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 154 transitions. [2025-03-04 07:52:17,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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-04 07:52:17,403 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 154 transitions. [2025-03-04 07:52:17,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 07:52:17,403 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:17,403 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:17,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 07:52:17,403 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 68 more)] === [2025-03-04 07:52:17,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:17,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1731751603, now seen corresponding path program 1 times [2025-03-04 07:52:17,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:17,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172779616] [2025-03-04 07:52:17,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:17,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:17,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 07:52:17,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 07:52:17,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:17,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:17,570 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-04 07:52:17,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:17,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172779616] [2025-03-04 07:52:17,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172779616] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:17,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:17,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:52:17,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122846646] [2025-03-04 07:52:17,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:17,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:52:17,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:17,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:52:17,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:52:17,571 INFO L87 Difference]: Start difference. First operand 139 states and 154 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 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-04 07:52:17,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:17,813 INFO L93 Difference]: Finished difference Result 152 states and 168 transitions. [2025-03-04 07:52:17,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:52:17,814 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-04 07:52:17,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:17,814 INFO L225 Difference]: With dead ends: 152 [2025-03-04 07:52:17,815 INFO L226 Difference]: Without dead ends: 152 [2025-03-04 07:52:17,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:52:17,816 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 130 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:17,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 167 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:52:17,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-03-04 07:52:17,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 149. [2025-03-04 07:52:17,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 103 states have (on average 1.5533980582524272) internal successors, (160), 147 states have internal predecessors, (160), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:17,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 167 transitions. [2025-03-04 07:52:17,824 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 167 transitions. Word has length 13 [2025-03-04 07:52:17,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:17,824 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 167 transitions. [2025-03-04 07:52:17,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 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-04 07:52:17,824 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 167 transitions. [2025-03-04 07:52:17,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-04 07:52:17,825 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:17,825 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:17,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 07:52:17,825 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 68 more)] === [2025-03-04 07:52:17,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:17,825 INFO L85 PathProgramCache]: Analyzing trace with hash 494169529, now seen corresponding path program 1 times [2025-03-04 07:52:17,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:17,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851363658] [2025-03-04 07:52:17,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:17,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:17,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 07:52:17,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 07:52:17,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:17,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:17,897 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-04 07:52:17,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:17,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851363658] [2025-03-04 07:52:17,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851363658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:17,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:17,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:52:17,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404799699] [2025-03-04 07:52:17,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:17,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:52:17,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:17,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:52:17,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:52:17,899 INFO L87 Difference]: Start difference. First operand 149 states and 167 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:18,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:18,068 INFO L93 Difference]: Finished difference Result 185 states and 202 transitions. [2025-03-04 07:52:18,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:52:18,069 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-04 07:52:18,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:18,071 INFO L225 Difference]: With dead ends: 185 [2025-03-04 07:52:18,071 INFO L226 Difference]: Without dead ends: 185 [2025-03-04 07:52:18,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:52:18,072 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 277 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:18,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 165 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:52:18,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-03-04 07:52:18,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 148. [2025-03-04 07:52:18,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 103 states have (on average 1.5242718446601942) internal successors, (157), 146 states have internal predecessors, (157), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:18,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 163 transitions. [2025-03-04 07:52:18,082 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 163 transitions. Word has length 17 [2025-03-04 07:52:18,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:18,082 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 163 transitions. [2025-03-04 07:52:18,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:18,083 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 163 transitions. [2025-03-04 07:52:18,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 07:52:18,083 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:18,083 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:18,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 07:52:18,083 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 68 more)] === [2025-03-04 07:52:18,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:18,084 INFO L85 PathProgramCache]: Analyzing trace with hash -535048428, now seen corresponding path program 1 times [2025-03-04 07:52:18,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:18,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308310909] [2025-03-04 07:52:18,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:18,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:18,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 07:52:18,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 07:52:18,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:18,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:18,193 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-04 07:52:18,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:18,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308310909] [2025-03-04 07:52:18,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308310909] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:18,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:18,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:52:18,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177119834] [2025-03-04 07:52:18,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:18,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:52:18,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:18,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:52:18,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:52:18,195 INFO L87 Difference]: Start difference. First operand 148 states and 163 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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-04 07:52:18,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:18,308 INFO L93 Difference]: Finished difference Result 147 states and 161 transitions. [2025-03-04 07:52:18,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:52:18,308 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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 16 [2025-03-04 07:52:18,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:18,309 INFO L225 Difference]: With dead ends: 147 [2025-03-04 07:52:18,309 INFO L226 Difference]: Without dead ends: 147 [2025-03-04 07:52:18,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:52:18,309 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 4 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:18,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 346 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:52:18,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-03-04 07:52:18,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2025-03-04 07:52:18,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 103 states have (on average 1.5048543689320388) internal successors, (155), 145 states have internal predecessors, (155), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:18,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 161 transitions. [2025-03-04 07:52:18,312 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 161 transitions. Word has length 16 [2025-03-04 07:52:18,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:18,312 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 161 transitions. [2025-03-04 07:52:18,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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-04 07:52:18,313 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 161 transitions. [2025-03-04 07:52:18,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 07:52:18,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:18,313 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:18,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 07:52:18,313 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 68 more)] === [2025-03-04 07:52:18,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:18,314 INFO L85 PathProgramCache]: Analyzing trace with hash -535048427, now seen corresponding path program 1 times [2025-03-04 07:52:18,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:18,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711502263] [2025-03-04 07:52:18,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:18,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:18,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 07:52:18,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 07:52:18,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:18,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:18,475 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-04 07:52:18,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:18,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711502263] [2025-03-04 07:52:18,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711502263] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:18,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:18,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:52:18,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952122266] [2025-03-04 07:52:18,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:18,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:52:18,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:18,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:52:18,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:52:18,477 INFO L87 Difference]: Start difference. First operand 147 states and 161 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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-04 07:52:18,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:18,614 INFO L93 Difference]: Finished difference Result 146 states and 159 transitions. [2025-03-04 07:52:18,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:52:18,615 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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 16 [2025-03-04 07:52:18,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:18,615 INFO L225 Difference]: With dead ends: 146 [2025-03-04 07:52:18,615 INFO L226 Difference]: Without dead ends: 146 [2025-03-04 07:52:18,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:52:18,616 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 2 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:18,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 331 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:52:18,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-03-04 07:52:18,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2025-03-04 07:52:18,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 103 states have (on average 1.4854368932038835) internal successors, (153), 144 states have internal predecessors, (153), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:18,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 159 transitions. [2025-03-04 07:52:18,618 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 159 transitions. Word has length 16 [2025-03-04 07:52:18,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:18,618 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 159 transitions. [2025-03-04 07:52:18,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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-04 07:52:18,618 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 159 transitions. [2025-03-04 07:52:18,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-04 07:52:18,619 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:18,619 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:18,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 07:52:18,619 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 68 more)] === [2025-03-04 07:52:18,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:18,619 INFO L85 PathProgramCache]: Analyzing trace with hash 537240008, now seen corresponding path program 1 times [2025-03-04 07:52:18,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:18,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881823587] [2025-03-04 07:52:18,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:18,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:18,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 07:52:18,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 07:52:18,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:18,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:18,809 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-04 07:52:18,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:18,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881823587] [2025-03-04 07:52:18,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881823587] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:18,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:18,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 07:52:18,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088946136] [2025-03-04 07:52:18,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:18,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:52:18,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:18,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:52:18,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:52:18,811 INFO L87 Difference]: Start difference. First operand 146 states and 159 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:19,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:19,056 INFO L93 Difference]: Finished difference Result 186 states and 205 transitions. [2025-03-04 07:52:19,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 07:52:19,057 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-04 07:52:19,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:19,057 INFO L225 Difference]: With dead ends: 186 [2025-03-04 07:52:19,057 INFO L226 Difference]: Without dead ends: 186 [2025-03-04 07:52:19,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2025-03-04 07:52:19,058 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 199 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:19,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 384 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:52:19,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-03-04 07:52:19,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 151. [2025-03-04 07:52:19,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 108 states have (on average 1.462962962962963) internal successors, (158), 149 states have internal predecessors, (158), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:19,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 164 transitions. [2025-03-04 07:52:19,063 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 164 transitions. Word has length 20 [2025-03-04 07:52:19,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:19,063 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 164 transitions. [2025-03-04 07:52:19,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:19,063 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 164 transitions. [2025-03-04 07:52:19,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-04 07:52:19,063 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:19,064 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:19,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 07:52:19,064 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 68 more)] === [2025-03-04 07:52:19,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:19,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1057805874, now seen corresponding path program 1 times [2025-03-04 07:52:19,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:19,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673114094] [2025-03-04 07:52:19,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:19,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:19,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 07:52:19,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 07:52:19,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:19,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:19,265 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-04 07:52:19,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:19,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673114094] [2025-03-04 07:52:19,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673114094] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:19,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:19,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 07:52:19,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541549886] [2025-03-04 07:52:19,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:19,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 07:52:19,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:19,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 07:52:19,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:52:19,267 INFO L87 Difference]: Start difference. First operand 151 states and 164 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 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-04 07:52:19,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:19,602 INFO L93 Difference]: Finished difference Result 150 states and 163 transitions. [2025-03-04 07:52:19,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 07:52:19,602 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 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) Word has length 20 [2025-03-04 07:52:19,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:19,603 INFO L225 Difference]: With dead ends: 150 [2025-03-04 07:52:19,603 INFO L226 Difference]: Without dead ends: 150 [2025-03-04 07:52:19,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-03-04 07:52:19,603 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 147 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:19,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 284 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:52:19,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-03-04 07:52:19,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2025-03-04 07:52:19,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 108 states have (on average 1.4537037037037037) internal successors, (157), 148 states have internal predecessors, (157), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:19,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 163 transitions. [2025-03-04 07:52:19,606 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 163 transitions. Word has length 20 [2025-03-04 07:52:19,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:19,606 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 163 transitions. [2025-03-04 07:52:19,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 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-04 07:52:19,607 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 163 transitions. [2025-03-04 07:52:19,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-04 07:52:19,607 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:19,607 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:19,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 07:52:19,607 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 68 more)] === [2025-03-04 07:52:19,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:19,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1057805873, now seen corresponding path program 1 times [2025-03-04 07:52:19,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:19,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834769923] [2025-03-04 07:52:19,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:19,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:19,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 07:52:19,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 07:52:19,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:19,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:19,828 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-04 07:52:19,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:19,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834769923] [2025-03-04 07:52:19,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834769923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:19,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:19,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 07:52:19,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027327717] [2025-03-04 07:52:19,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:19,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:52:19,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:19,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:52:19,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:52:19,830 INFO L87 Difference]: Start difference. First operand 150 states and 163 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 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-04 07:52:20,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:20,325 INFO L93 Difference]: Finished difference Result 164 states and 181 transitions. [2025-03-04 07:52:20,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 07:52:20,326 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 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) Word has length 20 [2025-03-04 07:52:20,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:20,326 INFO L225 Difference]: With dead ends: 164 [2025-03-04 07:52:20,326 INFO L226 Difference]: Without dead ends: 164 [2025-03-04 07:52:20,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2025-03-04 07:52:20,327 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 193 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:20,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 349 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:52:20,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-04 07:52:20,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 154. [2025-03-04 07:52:20,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 118 states have (on average 1.3983050847457628) internal successors, (165), 152 states have internal predecessors, (165), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:20,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 171 transitions. [2025-03-04 07:52:20,330 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 171 transitions. Word has length 20 [2025-03-04 07:52:20,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:20,330 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 171 transitions. [2025-03-04 07:52:20,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 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-04 07:52:20,330 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 171 transitions. [2025-03-04 07:52:20,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 07:52:20,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:20,331 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:20,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 07:52:20,331 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 68 more)] === [2025-03-04 07:52:20,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:20,331 INFO L85 PathProgramCache]: Analyzing trace with hash -34114820, now seen corresponding path program 1 times [2025-03-04 07:52:20,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:20,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430062285] [2025-03-04 07:52:20,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:20,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:20,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 07:52:20,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 07:52:20,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:20,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:20,493 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:52:20,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:20,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430062285] [2025-03-04 07:52:20,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430062285] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:52:20,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000790480] [2025-03-04 07:52:20,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:20,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:20,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:52:20,496 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-04 07:52:20,497 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-04 07:52:20,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 07:52:20,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 07:52:20,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:20,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:20,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-04 07:52:20,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:52:20,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:52:20,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:52:20,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-04 07:52:20,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-04 07:52:20,704 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:52:20,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2025-03-04 07:52:20,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-04 07:52:20,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 07:52:20,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:52:20,895 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:52:21,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-03-04 07:52:21,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-03-04 07:52:21,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-03-04 07:52:21,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:52:21,215 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:52:21,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000790480] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:52:21,215 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:52:21,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 7] total 16 [2025-03-04 07:52:21,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881572134] [2025-03-04 07:52:21,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:52:21,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 07:52:21,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:21,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 07:52:21,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-03-04 07:52:21,216 INFO L87 Difference]: Start difference. First operand 154 states and 171 transitions. Second operand has 16 states, 16 states have (on average 4.0625) internal successors, (65), 16 states have internal predecessors, (65), 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-04 07:52:21,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:21,627 INFO L93 Difference]: Finished difference Result 192 states and 215 transitions. [2025-03-04 07:52:21,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 07:52:21,629 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 16 states have internal predecessors, (65), 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 25 [2025-03-04 07:52:21,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:21,629 INFO L225 Difference]: With dead ends: 192 [2025-03-04 07:52:21,629 INFO L226 Difference]: Without dead ends: 192 [2025-03-04 07:52:21,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2025-03-04 07:52:21,630 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 394 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:21,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 563 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:52:21,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-03-04 07:52:21,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 161. [2025-03-04 07:52:21,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 125 states have (on average 1.384) internal successors, (173), 159 states have internal predecessors, (173), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:21,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 179 transitions. [2025-03-04 07:52:21,633 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 179 transitions. Word has length 25 [2025-03-04 07:52:21,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:21,633 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 179 transitions. [2025-03-04 07:52:21,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 16 states have internal predecessors, (65), 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-04 07:52:21,633 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 179 transitions. [2025-03-04 07:52:21,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 07:52:21,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:21,634 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:21,640 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-04 07:52:21,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 07:52:21,838 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 68 more)] === [2025-03-04 07:52:21,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:21,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1066179937, now seen corresponding path program 1 times [2025-03-04 07:52:21,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:21,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143054612] [2025-03-04 07:52:21,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:21,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:21,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 07:52:21,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 07:52:21,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:21,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:21,888 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-04 07:52:21,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:21,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143054612] [2025-03-04 07:52:21,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143054612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:21,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:21,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:52:21,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351719955] [2025-03-04 07:52:21,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:21,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:52:21,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:21,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:52:21,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:52:21,890 INFO L87 Difference]: Start difference. First operand 161 states and 179 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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-04 07:52:21,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:21,998 INFO L93 Difference]: Finished difference Result 164 states and 180 transitions. [2025-03-04 07:52:21,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:52:21,998 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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 26 [2025-03-04 07:52:21,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:21,999 INFO L225 Difference]: With dead ends: 164 [2025-03-04 07:52:21,999 INFO L226 Difference]: Without dead ends: 164 [2025-03-04 07:52:21,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:52:22,000 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 18 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:22,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 341 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:52:22,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-04 07:52:22,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 160. [2025-03-04 07:52:22,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 124 states have (on average 1.3709677419354838) internal successors, (170), 158 states have internal predecessors, (170), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:22,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 176 transitions. [2025-03-04 07:52:22,003 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 176 transitions. Word has length 26 [2025-03-04 07:52:22,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:22,003 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 176 transitions. [2025-03-04 07:52:22,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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-04 07:52:22,003 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 176 transitions. [2025-03-04 07:52:22,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 07:52:22,005 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:22,005 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:22,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 07:52:22,006 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 68 more)] === [2025-03-04 07:52:22,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:22,006 INFO L85 PathProgramCache]: Analyzing trace with hash 663390316, now seen corresponding path program 1 times [2025-03-04 07:52:22,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:22,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104683641] [2025-03-04 07:52:22,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:22,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:22,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 07:52:22,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 07:52:22,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:22,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:22,087 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-04 07:52:22,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:22,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104683641] [2025-03-04 07:52:22,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104683641] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:22,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:22,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:52:22,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554377172] [2025-03-04 07:52:22,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:22,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:52:22,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:22,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:52:22,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:52:22,089 INFO L87 Difference]: Start difference. First operand 160 states and 176 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:22,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:22,171 INFO L93 Difference]: Finished difference Result 163 states and 177 transitions. [2025-03-04 07:52:22,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:52:22,171 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-03-04 07:52:22,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:22,172 INFO L225 Difference]: With dead ends: 163 [2025-03-04 07:52:22,172 INFO L226 Difference]: Without dead ends: 163 [2025-03-04 07:52:22,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-04 07:52:22,174 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 15 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:22,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 292 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:52:22,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-03-04 07:52:22,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 159. [2025-03-04 07:52:22,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 124 states have (on average 1.3548387096774193) internal successors, (168), 157 states have internal predecessors, (168), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:22,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 173 transitions. [2025-03-04 07:52:22,177 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 173 transitions. Word has length 28 [2025-03-04 07:52:22,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:22,177 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 173 transitions. [2025-03-04 07:52:22,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:22,177 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 173 transitions. [2025-03-04 07:52:22,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 07:52:22,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:22,179 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:22,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 07:52:22,179 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 68 more)] === [2025-03-04 07:52:22,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:22,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1259405496, now seen corresponding path program 1 times [2025-03-04 07:52:22,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:22,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444607284] [2025-03-04 07:52:22,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:22,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:22,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 07:52:22,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 07:52:22,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:22,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:22,260 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-04 07:52:22,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:22,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444607284] [2025-03-04 07:52:22,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444607284] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:22,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:22,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:52:22,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047173815] [2025-03-04 07:52:22,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:22,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:52:22,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:22,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:52:22,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:52:22,261 INFO L87 Difference]: Start difference. First operand 159 states and 173 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:22,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:22,370 INFO L93 Difference]: Finished difference Result 158 states and 172 transitions. [2025-03-04 07:52:22,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:52:22,371 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-03-04 07:52:22,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:22,372 INFO L225 Difference]: With dead ends: 158 [2025-03-04 07:52:22,372 INFO L226 Difference]: Without dead ends: 158 [2025-03-04 07:52:22,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:52:22,373 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 3 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:22,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 321 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:52:22,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-04 07:52:22,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2025-03-04 07:52:22,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 124 states have (on average 1.346774193548387) internal successors, (167), 156 states have internal predecessors, (167), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:22,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 172 transitions. [2025-03-04 07:52:22,378 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 172 transitions. Word has length 28 [2025-03-04 07:52:22,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:22,378 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 172 transitions. [2025-03-04 07:52:22,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:22,378 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 172 transitions. [2025-03-04 07:52:22,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 07:52:22,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:22,379 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:22,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 07:52:22,379 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 68 more)] === [2025-03-04 07:52:22,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:22,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1259405495, now seen corresponding path program 1 times [2025-03-04 07:52:22,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:22,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889345509] [2025-03-04 07:52:22,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:22,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:22,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 07:52:22,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 07:52:22,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:22,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:22,520 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-04 07:52:22,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:22,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889345509] [2025-03-04 07:52:22,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889345509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:22,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:22,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:52:22,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697382618] [2025-03-04 07:52:22,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:22,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:52:22,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:22,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:52:22,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:52:22,523 INFO L87 Difference]: Start difference. First operand 158 states and 172 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:22,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:22,656 INFO L93 Difference]: Finished difference Result 157 states and 171 transitions. [2025-03-04 07:52:22,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:52:22,657 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-03-04 07:52:22,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:22,657 INFO L225 Difference]: With dead ends: 157 [2025-03-04 07:52:22,657 INFO L226 Difference]: Without dead ends: 157 [2025-03-04 07:52:22,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:52:22,658 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 1 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:22,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 311 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:52:22,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-04 07:52:22,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2025-03-04 07:52:22,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 124 states have (on average 1.3387096774193548) internal successors, (166), 155 states have internal predecessors, (166), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:22,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 171 transitions. [2025-03-04 07:52:22,660 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 171 transitions. Word has length 28 [2025-03-04 07:52:22,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:22,660 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 171 transitions. [2025-03-04 07:52:22,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:22,660 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 171 transitions. [2025-03-04 07:52:22,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 07:52:22,663 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:22,664 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:22,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 07:52:22,664 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 68 more)] === [2025-03-04 07:52:22,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:22,664 INFO L85 PathProgramCache]: Analyzing trace with hash 69892456, now seen corresponding path program 1 times [2025-03-04 07:52:22,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:22,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419940457] [2025-03-04 07:52:22,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:22,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:22,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 07:52:22,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 07:52:22,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:22,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:22,782 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-04 07:52:22,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:22,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419940457] [2025-03-04 07:52:22,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419940457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:22,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:22,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:52:22,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791759784] [2025-03-04 07:52:22,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:22,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:52:22,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:22,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:52:22,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:52:22,784 INFO L87 Difference]: Start difference. First operand 157 states and 171 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:22,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:22,865 INFO L93 Difference]: Finished difference Result 157 states and 169 transitions. [2025-03-04 07:52:22,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:52:22,866 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-03-04 07:52:22,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:22,867 INFO L225 Difference]: With dead ends: 157 [2025-03-04 07:52:22,867 INFO L226 Difference]: Without dead ends: 157 [2025-03-04 07:52:22,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-04 07:52:22,867 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 11 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:22,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 251 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:52:22,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-04 07:52:22,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2025-03-04 07:52:22,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 124 states have (on average 1.3225806451612903) internal successors, (164), 154 states have internal predecessors, (164), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:22,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 168 transitions. [2025-03-04 07:52:22,870 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 168 transitions. Word has length 31 [2025-03-04 07:52:22,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:22,870 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 168 transitions. [2025-03-04 07:52:22,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:22,870 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 168 transitions. [2025-03-04 07:52:22,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 07:52:22,870 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:22,871 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:22,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 07:52:22,871 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 68 more)] === [2025-03-04 07:52:22,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:22,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1278970053, now seen corresponding path program 1 times [2025-03-04 07:52:22,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:22,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676474140] [2025-03-04 07:52:22,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:22,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:22,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 07:52:22,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 07:52:22,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:22,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:22,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:52:22,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:22,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676474140] [2025-03-04 07:52:22,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676474140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:22,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:22,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:52:22,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793654842] [2025-03-04 07:52:22,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:22,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:52:22,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:22,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:52:22,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:52:22,902 INFO L87 Difference]: Start difference. First operand 156 states and 168 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:22,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:22,936 INFO L93 Difference]: Finished difference Result 158 states and 170 transitions. [2025-03-04 07:52:22,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:52:22,937 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-03-04 07:52:22,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:22,938 INFO L225 Difference]: With dead ends: 158 [2025-03-04 07:52:22,938 INFO L226 Difference]: Without dead ends: 158 [2025-03-04 07:52:22,938 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-04 07:52:22,939 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 64 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:22,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 126 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:52:22,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-04 07:52:22,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2025-03-04 07:52:22,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 126 states have (on average 1.3174603174603174) internal successors, (166), 156 states have internal predecessors, (166), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:22,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 170 transitions. [2025-03-04 07:52:22,944 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 170 transitions. Word has length 31 [2025-03-04 07:52:22,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:22,944 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 170 transitions. [2025-03-04 07:52:22,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:22,944 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 170 transitions. [2025-03-04 07:52:22,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-04 07:52:22,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:22,944 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:22,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 07:52:22,945 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 68 more)] === [2025-03-04 07:52:22,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:22,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1686119934, now seen corresponding path program 1 times [2025-03-04 07:52:22,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:22,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144488674] [2025-03-04 07:52:22,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:22,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:22,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 07:52:22,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 07:52:22,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:22,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:23,103 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-04 07:52:23,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:23,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144488674] [2025-03-04 07:52:23,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144488674] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:23,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:23,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 07:52:23,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326445791] [2025-03-04 07:52:23,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:23,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:52:23,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:23,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:52:23,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:52:23,105 INFO L87 Difference]: Start difference. First operand 158 states and 170 transitions. Second operand has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 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-04 07:52:23,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:23,301 INFO L93 Difference]: Finished difference Result 158 states and 170 transitions. [2025-03-04 07:52:23,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:52:23,302 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 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 32 [2025-03-04 07:52:23,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:23,302 INFO L225 Difference]: With dead ends: 158 [2025-03-04 07:52:23,303 INFO L226 Difference]: Without dead ends: 158 [2025-03-04 07:52:23,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-04 07:52:23,303 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 40 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:23,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 307 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:52:23,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-04 07:52:23,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2025-03-04 07:52:23,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 126 states have (on average 1.3095238095238095) internal successors, (165), 155 states have internal predecessors, (165), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:23,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 169 transitions. [2025-03-04 07:52:23,309 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 169 transitions. Word has length 32 [2025-03-04 07:52:23,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:23,309 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 169 transitions. [2025-03-04 07:52:23,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 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-04 07:52:23,309 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 169 transitions. [2025-03-04 07:52:23,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-04 07:52:23,309 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:23,309 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:23,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 07:52:23,310 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 68 more)] === [2025-03-04 07:52:23,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:23,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1686119933, now seen corresponding path program 1 times [2025-03-04 07:52:23,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:23,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728373212] [2025-03-04 07:52:23,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:23,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:23,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 07:52:23,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 07:52:23,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:23,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:23,570 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-04 07:52:23,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:23,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728373212] [2025-03-04 07:52:23,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728373212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:23,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:23,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 07:52:23,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562451150] [2025-03-04 07:52:23,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:23,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 07:52:23,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:23,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 07:52:23,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:52:23,573 INFO L87 Difference]: Start difference. First operand 157 states and 169 transitions. Second operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 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-04 07:52:23,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:23,862 INFO L93 Difference]: Finished difference Result 153 states and 165 transitions. [2025-03-04 07:52:23,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 07:52:23,863 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 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 32 [2025-03-04 07:52:23,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:23,863 INFO L225 Difference]: With dead ends: 153 [2025-03-04 07:52:23,863 INFO L226 Difference]: Without dead ends: 153 [2025-03-04 07:52:23,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-04 07:52:23,864 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 57 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:23,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 416 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:52:23,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-03-04 07:52:23,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 134. [2025-03-04 07:52:23,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 110 states have (on average 1.2727272727272727) internal successors, (140), 132 states have internal predecessors, (140), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:23,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 144 transitions. [2025-03-04 07:52:23,869 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 144 transitions. Word has length 32 [2025-03-04 07:52:23,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:23,869 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 144 transitions. [2025-03-04 07:52:23,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 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-04 07:52:23,870 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 144 transitions. [2025-03-04 07:52:23,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-04 07:52:23,870 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:23,870 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:23,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 07:52:23,870 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 68 more)] === [2025-03-04 07:52:23,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:23,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1619955159, now seen corresponding path program 1 times [2025-03-04 07:52:23,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:23,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096465981] [2025-03-04 07:52:23,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:23,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:23,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 07:52:23,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 07:52:23,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:23,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:24,086 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-04 07:52:24,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:24,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096465981] [2025-03-04 07:52:24,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096465981] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:24,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:24,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 07:52:24,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705648637] [2025-03-04 07:52:24,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:24,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 07:52:24,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:24,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 07:52:24,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-04 07:52:24,088 INFO L87 Difference]: Start difference. First operand 134 states and 144 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:24,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:24,444 INFO L93 Difference]: Finished difference Result 183 states and 196 transitions. [2025-03-04 07:52:24,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 07:52:24,445 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-03-04 07:52:24,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:24,447 INFO L225 Difference]: With dead ends: 183 [2025-03-04 07:52:24,447 INFO L226 Difference]: Without dead ends: 183 [2025-03-04 07:52:24,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2025-03-04 07:52:24,449 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 302 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:24,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 323 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:52:24,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-03-04 07:52:24,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 141. [2025-03-04 07:52:24,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 117 states have (on average 1.2564102564102564) internal successors, (147), 139 states have internal predecessors, (147), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:24,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 151 transitions. [2025-03-04 07:52:24,453 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 151 transitions. Word has length 33 [2025-03-04 07:52:24,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:24,454 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 151 transitions. [2025-03-04 07:52:24,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:24,454 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 151 transitions. [2025-03-04 07:52:24,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-04 07:52:24,454 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:24,454 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:24,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 07:52:24,454 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 68 more)] === [2025-03-04 07:52:24,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:24,455 INFO L85 PathProgramCache]: Analyzing trace with hash 2067369101, now seen corresponding path program 1 times [2025-03-04 07:52:24,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:24,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681817624] [2025-03-04 07:52:24,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:24,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:24,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 07:52:24,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 07:52:24,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:24,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:24,529 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-04 07:52:24,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:52:24,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681817624] [2025-03-04 07:52:24,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681817624] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:52:24,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814832276] [2025-03-04 07:52:24,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:24,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:24,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:52:24,532 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-04 07:52:24,534 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-04 07:52:24,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 07:52:24,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 07:52:24,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:24,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:24,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 07:52:24,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:52:24,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-04 07:52:24,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:52:24,660 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:52:24,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1814832276] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:24,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:52:24,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2025-03-04 07:52:24,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676787964] [2025-03-04 07:52:24,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:24,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:52:24,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:52:24,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:52:24,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:52:24,661 INFO L87 Difference]: Start difference. First operand 141 states and 151 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 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-04 07:52:24,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:24,716 INFO L93 Difference]: Finished difference Result 148 states and 158 transitions. [2025-03-04 07:52:24,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:52:24,717 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 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 33 [2025-03-04 07:52:24,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:24,717 INFO L225 Difference]: With dead ends: 148 [2025-03-04 07:52:24,717 INFO L226 Difference]: Without dead ends: 148 [2025-03-04 07:52:24,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:52:24,718 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 5 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:24,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 274 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:52:24,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-03-04 07:52:24,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 144. [2025-03-04 07:52:24,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 120 states have (on average 1.25) internal successors, (150), 142 states have internal predecessors, (150), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:24,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 154 transitions. [2025-03-04 07:52:24,720 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 154 transitions. Word has length 33 [2025-03-04 07:52:24,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:24,720 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 154 transitions. [2025-03-04 07:52:24,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 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-04 07:52:24,720 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 154 transitions. [2025-03-04 07:52:24,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-04 07:52:24,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:24,722 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:24,729 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-04 07:52:24,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-04 07:52:24,923 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 68 more)] === [2025-03-04 07:52:24,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:24,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1141966814, now seen corresponding path program 1 times [2025-03-04 07:52:24,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:52:24,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046094733] [2025-03-04 07:52:24,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:24,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:52:24,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 07:52:24,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 07:52:24,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:24,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 07:52:24,939 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 07:52:24,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 07:52:24,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 07:52:24,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:24,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 07:52:24,965 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 07:52:24,965 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 07:52:24,966 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (70 of 71 remaining) [2025-03-04 07:52:24,967 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK (69 of 71 remaining) [2025-03-04 07:52:24,967 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (68 of 71 remaining) [2025-03-04 07:52:24,967 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (67 of 71 remaining) [2025-03-04 07:52:24,968 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (66 of 71 remaining) [2025-03-04 07:52:24,968 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 71 remaining) [2025-03-04 07:52:24,968 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 71 remaining) [2025-03-04 07:52:24,968 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE (63 of 71 remaining) [2025-03-04 07:52:24,968 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE (62 of 71 remaining) [2025-03-04 07:52:24,968 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE (61 of 71 remaining) [2025-03-04 07:52:24,968 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 71 remaining) [2025-03-04 07:52:24,968 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 71 remaining) [2025-03-04 07:52:24,968 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE (58 of 71 remaining) [2025-03-04 07:52:24,968 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE (57 of 71 remaining) [2025-03-04 07:52:24,968 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE (56 of 71 remaining) [2025-03-04 07:52:24,968 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 71 remaining) [2025-03-04 07:52:24,968 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 71 remaining) [2025-03-04 07:52:24,968 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 71 remaining) [2025-03-04 07:52:24,968 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 71 remaining) [2025-03-04 07:52:24,968 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 71 remaining) [2025-03-04 07:52:24,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 71 remaining) [2025-03-04 07:52:24,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 71 remaining) [2025-03-04 07:52:24,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 71 remaining) [2025-03-04 07:52:24,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 71 remaining) [2025-03-04 07:52:24,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 71 remaining) [2025-03-04 07:52:24,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 71 remaining) [2025-03-04 07:52:24,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 71 remaining) [2025-03-04 07:52:24,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 71 remaining) [2025-03-04 07:52:24,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 71 remaining) [2025-03-04 07:52:24,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 71 remaining) [2025-03-04 07:52:24,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 71 remaining) [2025-03-04 07:52:24,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 71 remaining) [2025-03-04 07:52:24,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 71 remaining) [2025-03-04 07:52:24,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 71 remaining) [2025-03-04 07:52:24,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 71 remaining) [2025-03-04 07:52:24,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 71 remaining) [2025-03-04 07:52:24,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 71 remaining) [2025-03-04 07:52:24,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 71 remaining) [2025-03-04 07:52:24,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 71 remaining) [2025-03-04 07:52:24,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 71 remaining) [2025-03-04 07:52:24,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 71 remaining) [2025-03-04 07:52:24,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 71 remaining) [2025-03-04 07:52:24,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 71 remaining) [2025-03-04 07:52:24,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 71 remaining) [2025-03-04 07:52:24,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 71 remaining) [2025-03-04 07:52:24,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 71 remaining) [2025-03-04 07:52:24,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 71 remaining) [2025-03-04 07:52:24,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 71 remaining) [2025-03-04 07:52:24,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 71 remaining) [2025-03-04 07:52:24,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 71 remaining) [2025-03-04 07:52:24,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 71 remaining) [2025-03-04 07:52:24,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 71 remaining) [2025-03-04 07:52:24,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 71 remaining) [2025-03-04 07:52:24,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 71 remaining) [2025-03-04 07:52:24,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 71 remaining) [2025-03-04 07:52:24,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 71 remaining) [2025-03-04 07:52:24,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 71 remaining) [2025-03-04 07:52:24,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 71 remaining) [2025-03-04 07:52:24,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 71 remaining) [2025-03-04 07:52:24,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 71 remaining) [2025-03-04 07:52:24,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 71 remaining) [2025-03-04 07:52:24,971 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 71 remaining) [2025-03-04 07:52:24,971 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 71 remaining) [2025-03-04 07:52:24,971 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 71 remaining) [2025-03-04 07:52:24,971 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 71 remaining) [2025-03-04 07:52:24,971 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 71 remaining) [2025-03-04 07:52:24,971 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 71 remaining) [2025-03-04 07:52:24,972 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 71 remaining) [2025-03-04 07:52:24,972 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 71 remaining) [2025-03-04 07:52:24,972 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 71 remaining) [2025-03-04 07:52:24,972 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 71 remaining) [2025-03-04 07:52:24,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 07:52:24,974 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:24,996 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 07:52:24,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 07:52:24 BoogieIcfgContainer [2025-03-04 07:52:24,999 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 07:52:24,999 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 07:52:24,999 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 07:52:24,999 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 07:52:25,001 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:52:16" (3/4) ... [2025-03-04 07:52:25,002 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 07:52:25,003 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 07:52:25,004 INFO L158 Benchmark]: Toolchain (without parser) took 9745.35ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 105.0MB in the beginning and 212.2MB in the end (delta: -107.2MB). Peak memory consumption was 95.4MB. Max. memory is 16.1GB. [2025-03-04 07:52:25,004 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:52:25,004 INFO L158 Benchmark]: CACSL2BoogieTranslator took 306.26ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 87.5MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 07:52:25,005 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.88ms. Allocated memory is still 142.6MB. Free memory was 87.5MB in the beginning and 85.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:52:25,005 INFO L158 Benchmark]: Boogie Preprocessor took 35.51ms. Allocated memory is still 142.6MB. Free memory was 85.6MB in the beginning and 84.0MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 07:52:25,005 INFO L158 Benchmark]: IcfgBuilder took 461.11ms. Allocated memory is still 142.6MB. Free memory was 84.0MB in the beginning and 55.1MB in the end (delta: 29.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 07:52:25,005 INFO L158 Benchmark]: TraceAbstraction took 8897.62ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 54.1MB in the beginning and 212.3MB in the end (delta: -158.2MB). Peak memory consumption was 45.1MB. Max. memory is 16.1GB. [2025-03-04 07:52:25,006 INFO L158 Benchmark]: Witness Printer took 3.39ms. Allocated memory is still 343.9MB. Free memory was 212.3MB in the beginning and 212.2MB in the end (delta: 69.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:52:25,006 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.20ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 306.26ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 87.5MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.88ms. Allocated memory is still 142.6MB. Free memory was 87.5MB in the beginning and 85.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.51ms. Allocated memory is still 142.6MB. Free memory was 85.6MB in the beginning and 84.0MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 461.11ms. Allocated memory is still 142.6MB. Free memory was 84.0MB in the beginning and 55.1MB in the end (delta: 29.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 8897.62ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 54.1MB in the beginning and 212.3MB in the end (delta: -158.2MB). Peak memory consumption was 45.1MB. Max. memory is 16.1GB. * Witness Printer took 3.39ms. Allocated memory is still 343.9MB. Free memory was 212.3MB in the beginning and 212.2MB in the end (delta: 69.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 996]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 996. Possible FailurePath: [L998] struct TSLL* null = malloc(sizeof(struct TSLL)); [L999] null->next = ((void*)0) [L1000] null->prev = ((void*)0) [L1001] null->colour = BLACK [L1003] struct TSLL* list = malloc(sizeof(struct TSLL)); [L1004] list->next = null [L1005] list->prev = null [L1006] list->colour = BLACK [L1008] struct TSLL* end = list; VAL [end={-2:0}, list={-2:0}, null={-1:0}] [L1011] COND TRUE __VERIFIER_nondet_int() [L1011] COND FALSE !(__VERIFIER_nondet_int()) [L1037] end = null [L1038] end = list VAL [end={-2:0}, list={-2:0}, null={-1:0}] [L1041] COND FALSE !(!(null != end)) VAL [end={-2:0}, list={-2:0}, null={-1:0}] [L1041] COND FALSE !(0) VAL [end={-2:0}, list={-2:0}, null={-1:0}] [L1042] EXPR end->colour [L1042] COND FALSE !(!(BLACK == end->colour)) [L1042] COND FALSE !(0) VAL [end={-2:0}, list={-2:0}, null={-1:0}] [L1043] COND TRUE null != end [L1045] EXPR end->colour [L1045] COND FALSE !(RED == end->colour) [L1052] EXPR end->next [L1052] end = end->next [L1043] COND FALSE !(null != end) [L1056] COND TRUE null != list [L1058] EXPR list->colour [L1058] COND FALSE !(RED == list->colour) [L1067] EXPR list->next [L1067] end = list->next [L1068] free(list) VAL [end={-1:0}, null={-1:0}] [L1068] free(list) VAL [end={-1:0}, null={-1:0}] [L1068] free(list) [L1069] list = end VAL [list={-1:0}, null={-1:0}] [L1056] COND FALSE !(null != list) [L1073] return 0; VAL [\result=0] - UnprovableResult [Line: 985]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 170 locations, 71 error locations. Started 1 CEGAR loops. OverallTime: 8.8s, OverallIterations: 24, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2528 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2528 mSDsluCounter, 6060 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3846 mSDsCounter, 193 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5764 IncrementalHoareTripleChecker+Invalid, 5957 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 193 mSolverCounterUnsat, 2214 mSDtfsCounter, 5764 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 261 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=170occurred in iteration=0, InterpolantAutomatonStates: 141, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 216 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 574 NumberOfCodeBlocks, 574 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 539 ConstructedInterpolants, 6 QuantifiedInterpolants, 3157 SizeOfPredicates, 11 NumberOfNonLiveVariables, 397 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 26 InterpolantComputations, 22 PerfectInterpolantSequences, 5/9 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-04 07:52:25,023 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/forester-heap/dll-rb-sentinel-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 503e46fe74670dc8b1fd2e8b2c5a408fc01c83cb421ff9aefb8796417315d291 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:52:26,827 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:52:26,903 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-03-04 07:52:26,907 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:52:26,908 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:52:26,921 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:52:26,922 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:52:26,922 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:52:26,923 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:52:26,923 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:52:26,923 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:52:26,924 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:52:26,924 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:52:26,924 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:52:26,924 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:52:26,924 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:52:26,924 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:52:26,924 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:52:26,925 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:52:26,925 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:52:26,925 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:52:26,925 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:52:26,925 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 07:52:26,925 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:52:26,925 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:52:26,925 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 07:52:26,925 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 07:52:26,926 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:52:26,926 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:52:26,926 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:52:26,926 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:52:26,926 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:52:26,926 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:52:26,926 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:52:26,926 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:52:26,927 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:52:26,927 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:52:26,927 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:52:26,927 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 07:52:26,927 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 07:52:26,927 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:52:26,927 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:52:26,927 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:52:26,927 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:52:26,927 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 -> 503e46fe74670dc8b1fd2e8b2c5a408fc01c83cb421ff9aefb8796417315d291 [2025-03-04 07:52:27,130 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:52:27,137 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:52:27,138 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:52:27,140 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:52:27,140 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:52:27,141 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i [2025-03-04 07:52:28,293 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1995d81d8/6b6e47991401417695ed0fd214e7fd93/FLAG1638ab989 [2025-03-04 07:52:28,502 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:52:28,504 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i [2025-03-04 07:52:28,516 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1995d81d8/6b6e47991401417695ed0fd214e7fd93/FLAG1638ab989 [2025-03-04 07:52:28,534 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1995d81d8/6b6e47991401417695ed0fd214e7fd93 [2025-03-04 07:52:28,537 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:52:28,538 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:52:28,538 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:52:28,539 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:52:28,542 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:52:28,543 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:52:28" (1/1) ... [2025-03-04 07:52:28,544 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30d274bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:28, skipping insertion in model container [2025-03-04 07:52:28,544 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:52:28" (1/1) ... [2025-03-04 07:52:28,574 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:52:28,794 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:52:28,803 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:52:28,848 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:52:28,874 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:52:28,875 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:28 WrapperNode [2025-03-04 07:52:28,875 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:52:28,876 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:52:28,877 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:52:28,877 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:52:28,881 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:28" (1/1) ... [2025-03-04 07:52:28,900 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:28" (1/1) ... [2025-03-04 07:52:28,919 INFO L138 Inliner]: procedures = 122, calls = 50, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 151 [2025-03-04 07:52:28,920 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:52:28,921 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:52:28,922 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:52:28,922 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:52:28,929 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:28" (1/1) ... [2025-03-04 07:52:28,929 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:28" (1/1) ... [2025-03-04 07:52:28,933 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:28" (1/1) ... [2025-03-04 07:52:28,947 INFO L175 MemorySlicer]: Split 32 memory accesses to 2 slices as follows [2, 30]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 15 writes are split as follows [0, 15]. [2025-03-04 07:52:28,947 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:28" (1/1) ... [2025-03-04 07:52:28,948 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:28" (1/1) ... [2025-03-04 07:52:28,953 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:28" (1/1) ... [2025-03-04 07:52:28,956 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:28" (1/1) ... [2025-03-04 07:52:28,957 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:28" (1/1) ... [2025-03-04 07:52:28,957 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:28" (1/1) ... [2025-03-04 07:52:28,959 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:52:28,959 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:52:28,960 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:52:28,960 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:52:28,960 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:28" (1/1) ... [2025-03-04 07:52:28,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:52:28,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:52:28,987 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-04 07:52:28,991 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-04 07:52:29,009 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-03-04 07:52:29,009 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-03-04 07:52:29,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-04 07:52:29,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-04 07:52:29,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 07:52:29,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 07:52:29,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 07:52:29,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 07:52:29,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 07:52:29,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 07:52:29,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:52:29,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-04 07:52:29,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-04 07:52:29,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 07:52:29,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 07:52:29,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:52:29,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:52:29,088 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:52:29,090 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:52:29,640 INFO L? ?]: Removed 132 outVars from TransFormulas that were not future-live. [2025-03-04 07:52:29,641 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:52:29,654 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:52:29,654 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:52:29,654 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:52:29 BoogieIcfgContainer [2025-03-04 07:52:29,654 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:52:29,659 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:52:29,660 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:52:29,662 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:52:29,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:52:28" (1/3) ... [2025-03-04 07:52:29,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51c2b620 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:52:29, skipping insertion in model container [2025-03-04 07:52:29,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:52:28" (2/3) ... [2025-03-04 07:52:29,665 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51c2b620 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:52:29, skipping insertion in model container [2025-03-04 07:52:29,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:52:29" (3/3) ... [2025-03-04 07:52:29,666 INFO L128 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel-1.i [2025-03-04 07:52:29,675 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:52:29,677 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll-rb-sentinel-1.i that has 2 procedures, 170 locations, 1 initial locations, 10 loop locations, and 71 error locations. [2025-03-04 07:52:29,706 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:52:29,712 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;@c7ddc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:52:29,713 INFO L334 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2025-03-04 07:52:29,716 INFO L276 IsEmpty]: Start isEmpty. Operand has 170 states, 90 states have (on average 2.111111111111111) internal successors, (190), 161 states have internal predecessors, (190), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 07:52:29,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-04 07:52:29,719 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:29,719 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-04 07:52:29,719 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 68 more)] === [2025-03-04 07:52:29,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:29,723 INFO L85 PathProgramCache]: Analyzing trace with hash 226371, now seen corresponding path program 1 times [2025-03-04 07:52:29,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:52:29,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [541377008] [2025-03-04 07:52:29,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:29,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:29,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:52:29,732 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-04 07:52:29,733 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-04 07:52:29,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 07:52:29,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 07:52:29,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:29,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:29,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 07:52:29,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:52:29,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-03-04 07:52:29,842 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-04 07:52:29,842 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:52:29,844 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:52:29,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541377008] [2025-03-04 07:52:29,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541377008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:29,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:29,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:52:29,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458729448] [2025-03-04 07:52:29,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:29,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:52:29,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:52:29,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:52:29,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:52:29,867 INFO L87 Difference]: Start difference. First operand has 170 states, 90 states have (on average 2.111111111111111) internal successors, (190), 161 states have internal predecessors, (190), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 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-04 07:52:30,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:30,083 INFO L93 Difference]: Finished difference Result 183 states and 196 transitions. [2025-03-04 07:52:30,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:52:30,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 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-04 07:52:30,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:30,089 INFO L225 Difference]: With dead ends: 183 [2025-03-04 07:52:30,089 INFO L226 Difference]: Without dead ends: 181 [2025-03-04 07:52:30,090 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-04 07:52:30,092 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 136 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:30,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 116 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:52:30,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-03-04 07:52:30,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 156. [2025-03-04 07:52:30,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 81 states have (on average 1.9753086419753085) internal successors, (160), 154 states have internal predecessors, (160), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:30,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 167 transitions. [2025-03-04 07:52:30,118 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 167 transitions. Word has length 3 [2025-03-04 07:52:30,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:30,118 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 167 transitions. [2025-03-04 07:52:30,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 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-04 07:52:30,118 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 167 transitions. [2025-03-04 07:52:30,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-04 07:52:30,119 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:30,119 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-04 07:52:30,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 07:52:30,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:30,320 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 68 more)] === [2025-03-04 07:52:30,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:30,320 INFO L85 PathProgramCache]: Analyzing trace with hash 226372, now seen corresponding path program 1 times [2025-03-04 07:52:30,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:52:30,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [864214512] [2025-03-04 07:52:30,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:30,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:30,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:52:30,323 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-04 07:52:30,324 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-04 07:52:30,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 07:52:30,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 07:52:30,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:30,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:30,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 07:52:30,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:52:30,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:52:30,391 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-04 07:52:30,391 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:52:30,391 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:52:30,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864214512] [2025-03-04 07:52:30,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [864214512] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:30,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:30,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:52:30,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801715149] [2025-03-04 07:52:30,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:30,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:52:30,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:52:30,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:52:30,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:52:30,393 INFO L87 Difference]: Start difference. First operand 156 states and 167 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 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-04 07:52:30,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:30,588 INFO L93 Difference]: Finished difference Result 153 states and 164 transitions. [2025-03-04 07:52:30,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:52:30,588 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 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-04 07:52:30,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:30,589 INFO L225 Difference]: With dead ends: 153 [2025-03-04 07:52:30,589 INFO L226 Difference]: Without dead ends: 153 [2025-03-04 07:52:30,590 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-04 07:52:30,590 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 148 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:30,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 95 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:52:30,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-03-04 07:52:30,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2025-03-04 07:52:30,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 81 states have (on average 1.9382716049382716) internal successors, (157), 151 states have internal predecessors, (157), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:30,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 164 transitions. [2025-03-04 07:52:30,599 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 164 transitions. Word has length 3 [2025-03-04 07:52:30,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:30,599 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 164 transitions. [2025-03-04 07:52:30,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 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-04 07:52:30,600 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 164 transitions. [2025-03-04 07:52:30,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 07:52:30,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:30,601 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:30,607 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-04 07:52:30,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:30,803 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 68 more)] === [2025-03-04 07:52:30,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:30,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1390072003, now seen corresponding path program 1 times [2025-03-04 07:52:30,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:52:30,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1953504502] [2025-03-04 07:52:30,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:30,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:30,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:52:30,806 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-04 07:52:30,807 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-04 07:52:30,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 07:52:30,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 07:52:30,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:30,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:30,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 07:52:30,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:52:30,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-03-04 07:52:30,906 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-04 07:52:30,906 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:52:30,906 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:52:30,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953504502] [2025-03-04 07:52:30,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953504502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:30,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:30,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:52:30,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824737588] [2025-03-04 07:52:30,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:30,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:52:30,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:52:30,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:52:30,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:52:30,908 INFO L87 Difference]: Start difference. First operand 153 states and 164 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:31,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:31,075 INFO L93 Difference]: Finished difference Result 148 states and 161 transitions. [2025-03-04 07:52:31,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:52:31,076 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 07:52:31,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:31,076 INFO L225 Difference]: With dead ends: 148 [2025-03-04 07:52:31,076 INFO L226 Difference]: Without dead ends: 148 [2025-03-04 07:52:31,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-04 07:52:31,077 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 117 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:31,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 100 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:52:31,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-03-04 07:52:31,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2025-03-04 07:52:31,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 83 states have (on average 1.855421686746988) internal successors, (154), 146 states have internal predecessors, (154), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:31,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 161 transitions. [2025-03-04 07:52:31,082 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 161 transitions. Word has length 7 [2025-03-04 07:52:31,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:31,082 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 161 transitions. [2025-03-04 07:52:31,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:31,082 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 161 transitions. [2025-03-04 07:52:31,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 07:52:31,082 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:31,082 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:31,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 07:52:31,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:31,287 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 68 more)] === [2025-03-04 07:52:31,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:31,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1390072002, now seen corresponding path program 1 times [2025-03-04 07:52:31,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:52:31,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [92356208] [2025-03-04 07:52:31,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:31,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:31,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:52:31,290 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:52:31,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 07:52:31,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 07:52:31,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 07:52:31,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:31,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:31,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 07:52:31,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:52:31,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:52:31,355 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-04 07:52:31,355 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:52:31,355 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:52:31,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92356208] [2025-03-04 07:52:31,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [92356208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:31,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:31,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:52:31,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582443203] [2025-03-04 07:52:31,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:31,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:52:31,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:52:31,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:52:31,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:52:31,356 INFO L87 Difference]: Start difference. First operand 148 states and 161 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:31,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:31,581 INFO L93 Difference]: Finished difference Result 152 states and 165 transitions. [2025-03-04 07:52:31,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:52:31,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 07:52:31,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:31,583 INFO L225 Difference]: With dead ends: 152 [2025-03-04 07:52:31,583 INFO L226 Difference]: Without dead ends: 152 [2025-03-04 07:52:31,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-04 07:52:31,583 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 111 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:31,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 114 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:52:31,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-03-04 07:52:31,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2025-03-04 07:52:31,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 90 states have (on average 1.7555555555555555) internal successors, (158), 150 states have internal predecessors, (158), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:31,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 165 transitions. [2025-03-04 07:52:31,590 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 165 transitions. Word has length 7 [2025-03-04 07:52:31,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:31,590 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 165 transitions. [2025-03-04 07:52:31,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:31,590 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 165 transitions. [2025-03-04 07:52:31,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 07:52:31,591 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:31,591 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:31,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 07:52:31,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:31,791 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 68 more)] === [2025-03-04 07:52:31,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:31,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1731751602, now seen corresponding path program 1 times [2025-03-04 07:52:31,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:52:31,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [512101091] [2025-03-04 07:52:31,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:31,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:31,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:52:31,794 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:52:31,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 07:52:31,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 07:52:31,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 07:52:31,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:31,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:31,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 07:52:31,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:52:31,903 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2025-03-04 07:52:31,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2025-03-04 07:52:31,911 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-04 07:52:31,911 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:52:31,911 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:52:31,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512101091] [2025-03-04 07:52:31,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [512101091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:31,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:31,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:52:31,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491764920] [2025-03-04 07:52:31,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:31,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:52:31,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:52:31,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:52:31,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:52:31,912 INFO L87 Difference]: Start difference. First operand 152 states and 165 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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-04 07:52:32,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:32,161 INFO L93 Difference]: Finished difference Result 139 states and 154 transitions. [2025-03-04 07:52:32,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:52:32,162 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-04 07:52:32,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:32,162 INFO L225 Difference]: With dead ends: 139 [2025-03-04 07:52:32,162 INFO L226 Difference]: Without dead ends: 139 [2025-03-04 07:52:32,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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-04 07:52:32,163 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 154 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:32,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 84 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:52:32,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-03-04 07:52:32,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2025-03-04 07:52:32,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 92 states have (on average 1.5978260869565217) internal successors, (147), 137 states have internal predecessors, (147), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:32,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 154 transitions. [2025-03-04 07:52:32,168 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 154 transitions. Word has length 13 [2025-03-04 07:52:32,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:32,168 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 154 transitions. [2025-03-04 07:52:32,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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-04 07:52:32,168 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 154 transitions. [2025-03-04 07:52:32,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 07:52:32,168 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:32,168 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:32,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 07:52:32,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:32,369 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 68 more)] === [2025-03-04 07:52:32,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:32,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1731751603, now seen corresponding path program 1 times [2025-03-04 07:52:32,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:52:32,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1134372173] [2025-03-04 07:52:32,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:32,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:32,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:52:32,372 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:52:32,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 07:52:32,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 07:52:32,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 07:52:32,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:32,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:32,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 07:52:32,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:52:32,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:52:32,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:52:32,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-04 07:52:32,527 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-04 07:52:32,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-03-04 07:52:32,535 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-04 07:52:32,535 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:52:32,535 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:52:32,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134372173] [2025-03-04 07:52:32,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134372173] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:32,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:32,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:52:32,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515507687] [2025-03-04 07:52:32,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:32,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:52:32,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:52:32,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:52:32,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:52:32,537 INFO L87 Difference]: Start difference. First operand 139 states and 154 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 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-04 07:52:32,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:32,850 INFO L93 Difference]: Finished difference Result 152 states and 168 transitions. [2025-03-04 07:52:32,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:52:32,850 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-04 07:52:32,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:32,851 INFO L225 Difference]: With dead ends: 152 [2025-03-04 07:52:32,851 INFO L226 Difference]: Without dead ends: 152 [2025-03-04 07:52:32,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:52:32,852 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 149 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:32,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 134 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:52:32,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-03-04 07:52:32,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 149. [2025-03-04 07:52:32,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 103 states have (on average 1.5533980582524272) internal successors, (160), 147 states have internal predecessors, (160), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:32,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 167 transitions. [2025-03-04 07:52:32,857 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 167 transitions. Word has length 13 [2025-03-04 07:52:32,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:32,857 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 167 transitions. [2025-03-04 07:52:32,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 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-04 07:52:32,857 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 167 transitions. [2025-03-04 07:52:32,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-04 07:52:32,858 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:32,858 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:32,864 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 07:52:33,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:33,059 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 68 more)] === [2025-03-04 07:52:33,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:33,059 INFO L85 PathProgramCache]: Analyzing trace with hash 494169529, now seen corresponding path program 1 times [2025-03-04 07:52:33,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:52:33,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1133655068] [2025-03-04 07:52:33,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:33,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:33,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:52:33,061 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:52:33,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 07:52:33,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 07:52:33,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 07:52:33,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:33,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:33,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 07:52:33,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:52:33,158 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-04 07:52:33,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-03-04 07:52:33,186 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-04 07:52:33,186 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:52:33,186 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:52:33,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133655068] [2025-03-04 07:52:33,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133655068] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:33,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:33,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:52:33,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076874033] [2025-03-04 07:52:33,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:33,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:52:33,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:52:33,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:52:33,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:52:33,187 INFO L87 Difference]: Start difference. First operand 149 states and 167 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:33,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:33,471 INFO L93 Difference]: Finished difference Result 185 states and 202 transitions. [2025-03-04 07:52:33,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:52:33,472 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-04 07:52:33,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:33,473 INFO L225 Difference]: With dead ends: 185 [2025-03-04 07:52:33,473 INFO L226 Difference]: Without dead ends: 185 [2025-03-04 07:52:33,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:52:33,473 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 277 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:33,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 165 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:52:33,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-03-04 07:52:33,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 148. [2025-03-04 07:52:33,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 103 states have (on average 1.5242718446601942) internal successors, (157), 146 states have internal predecessors, (157), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:33,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 163 transitions. [2025-03-04 07:52:33,480 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 163 transitions. Word has length 17 [2025-03-04 07:52:33,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:33,481 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 163 transitions. [2025-03-04 07:52:33,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:33,481 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 163 transitions. [2025-03-04 07:52:33,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 07:52:33,481 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:33,481 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:33,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 07:52:33,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:33,682 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 68 more)] === [2025-03-04 07:52:33,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:33,682 INFO L85 PathProgramCache]: Analyzing trace with hash -535048428, now seen corresponding path program 1 times [2025-03-04 07:52:33,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:52:33,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [544420386] [2025-03-04 07:52:33,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:33,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:33,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:52:33,684 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:52:33,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 07:52:33,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 07:52:33,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 07:52:33,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:33,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:33,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 07:52:33,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:52:33,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-03-04 07:52:33,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:52:33,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-04 07:52:33,779 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-04 07:52:33,779 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:52:33,779 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:52:33,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544420386] [2025-03-04 07:52:33,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544420386] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:33,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:33,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:52:33,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122416739] [2025-03-04 07:52:33,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:33,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:52:33,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:52:33,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:52:33,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:52:33,780 INFO L87 Difference]: Start difference. First operand 148 states and 163 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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-04 07:52:34,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:34,052 INFO L93 Difference]: Finished difference Result 147 states and 161 transitions. [2025-03-04 07:52:34,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:52:34,052 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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 16 [2025-03-04 07:52:34,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:34,053 INFO L225 Difference]: With dead ends: 147 [2025-03-04 07:52:34,053 INFO L226 Difference]: Without dead ends: 147 [2025-03-04 07:52:34,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:52:34,053 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 4 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:34,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 346 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:52:34,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-03-04 07:52:34,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2025-03-04 07:52:34,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 103 states have (on average 1.5048543689320388) internal successors, (155), 145 states have internal predecessors, (155), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:34,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 161 transitions. [2025-03-04 07:52:34,056 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 161 transitions. Word has length 16 [2025-03-04 07:52:34,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:34,056 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 161 transitions. [2025-03-04 07:52:34,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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-04 07:52:34,056 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 161 transitions. [2025-03-04 07:52:34,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 07:52:34,056 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:34,056 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:34,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 07:52:34,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:34,257 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 68 more)] === [2025-03-04 07:52:34,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:34,257 INFO L85 PathProgramCache]: Analyzing trace with hash -535048427, now seen corresponding path program 1 times [2025-03-04 07:52:34,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:52:34,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1833085866] [2025-03-04 07:52:34,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:34,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:34,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:52:34,260 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:52:34,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 07:52:34,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 07:52:34,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 07:52:34,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:34,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:34,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 07:52:34,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:52:34,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:52:34,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:52:34,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:52:34,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-04 07:52:34,405 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-04 07:52:34,406 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:52:34,406 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:52:34,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833085866] [2025-03-04 07:52:34,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833085866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:34,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:34,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:52:34,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018106532] [2025-03-04 07:52:34,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:34,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:52:34,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:52:34,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:52:34,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:52:34,406 INFO L87 Difference]: Start difference. First operand 147 states and 161 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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-04 07:52:34,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:34,704 INFO L93 Difference]: Finished difference Result 146 states and 159 transitions. [2025-03-04 07:52:34,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:52:34,704 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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 16 [2025-03-04 07:52:34,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:34,705 INFO L225 Difference]: With dead ends: 146 [2025-03-04 07:52:34,705 INFO L226 Difference]: Without dead ends: 146 [2025-03-04 07:52:34,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:52:34,706 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 2 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:34,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 331 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:52:34,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-03-04 07:52:34,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2025-03-04 07:52:34,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 103 states have (on average 1.4854368932038835) internal successors, (153), 144 states have internal predecessors, (153), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:34,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 159 transitions. [2025-03-04 07:52:34,708 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 159 transitions. Word has length 16 [2025-03-04 07:52:34,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:34,708 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 159 transitions. [2025-03-04 07:52:34,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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-04 07:52:34,709 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 159 transitions. [2025-03-04 07:52:34,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-04 07:52:34,709 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:34,709 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:34,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 07:52:34,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:34,909 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 68 more)] === [2025-03-04 07:52:34,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:34,910 INFO L85 PathProgramCache]: Analyzing trace with hash 537240008, now seen corresponding path program 1 times [2025-03-04 07:52:34,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:52:34,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [939562657] [2025-03-04 07:52:34,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:34,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:34,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:52:34,912 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:52:34,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 07:52:34,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 07:52:34,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 07:52:34,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:34,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:34,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 07:52:34,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:52:34,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:52:35,041 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-04 07:52:35,041 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:52:35,041 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:52:35,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939562657] [2025-03-04 07:52:35,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939562657] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:35,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:35,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:52:35,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928400933] [2025-03-04 07:52:35,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:35,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:52:35,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:52:35,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:52:35,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:52:35,042 INFO L87 Difference]: Start difference. First operand 146 states and 159 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:35,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:35,372 INFO L93 Difference]: Finished difference Result 186 states and 205 transitions. [2025-03-04 07:52:35,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:52:35,373 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-04 07:52:35,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:35,373 INFO L225 Difference]: With dead ends: 186 [2025-03-04 07:52:35,373 INFO L226 Difference]: Without dead ends: 186 [2025-03-04 07:52:35,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:52:35,374 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 149 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:35,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 400 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:52:35,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-03-04 07:52:35,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 151. [2025-03-04 07:52:35,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 108 states have (on average 1.462962962962963) internal successors, (158), 149 states have internal predecessors, (158), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:35,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 164 transitions. [2025-03-04 07:52:35,377 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 164 transitions. Word has length 20 [2025-03-04 07:52:35,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:35,377 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 164 transitions. [2025-03-04 07:52:35,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:35,377 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 164 transitions. [2025-03-04 07:52:35,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-04 07:52:35,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:35,377 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:35,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 07:52:35,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:35,578 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 68 more)] === [2025-03-04 07:52:35,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:35,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1057805874, now seen corresponding path program 1 times [2025-03-04 07:52:35,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:52:35,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [529299466] [2025-03-04 07:52:35,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:35,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:35,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:52:35,580 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:52:35,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 07:52:35,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 07:52:35,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 07:52:35,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:35,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:35,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 07:52:35,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:52:35,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-03-04 07:52:35,706 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2025-03-04 07:52:35,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2025-03-04 07:52:35,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:52:35,801 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 07:52:35,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2025-03-04 07:52:35,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-03-04 07:52:35,883 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-04 07:52:35,884 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:52:35,884 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:52:35,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529299466] [2025-03-04 07:52:35,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529299466] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:35,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:35,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 07:52:35,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713002496] [2025-03-04 07:52:35,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:35,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 07:52:35,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:52:35,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 07:52:35,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:52:35,886 INFO L87 Difference]: Start difference. First operand 151 states and 164 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 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-04 07:52:36,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:36,552 INFO L93 Difference]: Finished difference Result 175 states and 196 transitions. [2025-03-04 07:52:36,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:52:36,553 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 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) Word has length 20 [2025-03-04 07:52:36,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:36,553 INFO L225 Difference]: With dead ends: 175 [2025-03-04 07:52:36,553 INFO L226 Difference]: Without dead ends: 175 [2025-03-04 07:52:36,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-04 07:52:36,554 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 202 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:36,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 261 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 07:52:36,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-03-04 07:52:36,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 150. [2025-03-04 07:52:36,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 108 states have (on average 1.4537037037037037) internal successors, (157), 148 states have internal predecessors, (157), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:36,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 163 transitions. [2025-03-04 07:52:36,557 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 163 transitions. Word has length 20 [2025-03-04 07:52:36,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:36,558 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 163 transitions. [2025-03-04 07:52:36,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 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-04 07:52:36,558 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 163 transitions. [2025-03-04 07:52:36,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-04 07:52:36,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:36,559 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:36,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 07:52:36,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:36,760 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 68 more)] === [2025-03-04 07:52:36,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:36,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1057805873, now seen corresponding path program 1 times [2025-03-04 07:52:36,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:52:36,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [220219213] [2025-03-04 07:52:36,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:36,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:36,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:52:36,762 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:52:36,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 07:52:36,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 07:52:36,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 07:52:36,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:36,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:36,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 07:52:36,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:52:36,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-03-04 07:52:36,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:52:36,884 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-04 07:52:36,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-03-04 07:52:36,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:52:36,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:52:36,973 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 07:52:36,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-03-04 07:52:36,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-04 07:52:36,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 07:52:36,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-04 07:52:37,029 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-04 07:52:37,029 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:52:37,029 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:52:37,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220219213] [2025-03-04 07:52:37,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220219213] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:37,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:37,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 07:52:37,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179680543] [2025-03-04 07:52:37,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:37,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 07:52:37,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:52:37,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 07:52:37,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:52:37,030 INFO L87 Difference]: Start difference. First operand 150 states and 163 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 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-04 07:52:37,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:37,955 INFO L93 Difference]: Finished difference Result 164 states and 181 transitions. [2025-03-04 07:52:37,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 07:52:37,956 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 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) Word has length 20 [2025-03-04 07:52:37,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:37,956 INFO L225 Difference]: With dead ends: 164 [2025-03-04 07:52:37,957 INFO L226 Difference]: Without dead ends: 164 [2025-03-04 07:52:37,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2025-03-04 07:52:37,957 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 191 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:37,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 308 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 07:52:37,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-04 07:52:37,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 154. [2025-03-04 07:52:37,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 118 states have (on average 1.3983050847457628) internal successors, (165), 152 states have internal predecessors, (165), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:37,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 171 transitions. [2025-03-04 07:52:37,961 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 171 transitions. Word has length 20 [2025-03-04 07:52:37,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:37,961 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 171 transitions. [2025-03-04 07:52:37,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 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-04 07:52:37,961 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 171 transitions. [2025-03-04 07:52:37,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 07:52:37,964 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:37,964 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:37,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 07:52:38,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:38,165 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 68 more)] === [2025-03-04 07:52:38,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:38,165 INFO L85 PathProgramCache]: Analyzing trace with hash -34114820, now seen corresponding path program 1 times [2025-03-04 07:52:38,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:52:38,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1932382634] [2025-03-04 07:52:38,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:38,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:38,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:52:38,167 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:52:38,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 07:52:38,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 07:52:38,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 07:52:38,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:38,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:38,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 07:52:38,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:52:38,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:52:38,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:52:38,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-04 07:52:38,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-04 07:52:38,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-04 07:52:38,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-03-04 07:52:38,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-03-04 07:52:38,554 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:52:38,555 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:52:38,702 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:52:38,703 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:52:38,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932382634] [2025-03-04 07:52:38,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932382634] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:52:38,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:52:38,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2025-03-04 07:52:38,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654490822] [2025-03-04 07:52:38,703 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:52:38,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 07:52:38,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:52:38,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 07:52:38,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-04 07:52:38,704 INFO L87 Difference]: Start difference. First operand 154 states and 171 transitions. Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 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-04 07:52:39,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:39,499 INFO L93 Difference]: Finished difference Result 192 states and 215 transitions. [2025-03-04 07:52:39,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 07:52:39,499 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 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 25 [2025-03-04 07:52:39,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:39,500 INFO L225 Difference]: With dead ends: 192 [2025-03-04 07:52:39,500 INFO L226 Difference]: Without dead ends: 192 [2025-03-04 07:52:39,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2025-03-04 07:52:39,500 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 275 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:39,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 595 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 07:52:39,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-03-04 07:52:39,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 161. [2025-03-04 07:52:39,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 125 states have (on average 1.384) internal successors, (173), 159 states have internal predecessors, (173), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:39,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 179 transitions. [2025-03-04 07:52:39,504 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 179 transitions. Word has length 25 [2025-03-04 07:52:39,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:39,504 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 179 transitions. [2025-03-04 07:52:39,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 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-04 07:52:39,504 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 179 transitions. [2025-03-04 07:52:39,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 07:52:39,504 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:39,504 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:39,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 07:52:39,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:39,705 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 68 more)] === [2025-03-04 07:52:39,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:39,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1066179937, now seen corresponding path program 1 times [2025-03-04 07:52:39,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:52:39,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1475612103] [2025-03-04 07:52:39,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:39,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:39,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:52:39,708 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:52:39,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 07:52:39,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 07:52:39,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 07:52:39,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:39,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:39,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 07:52:39,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:52:39,814 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-04 07:52:39,814 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:52:39,815 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:52:39,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475612103] [2025-03-04 07:52:39,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475612103] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:39,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:39,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:52:39,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914208768] [2025-03-04 07:52:39,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:39,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:52:39,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:52:39,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:52:39,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:52:39,816 INFO L87 Difference]: Start difference. First operand 161 states and 179 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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-04 07:52:40,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:40,111 INFO L93 Difference]: Finished difference Result 164 states and 180 transitions. [2025-03-04 07:52:40,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:52:40,112 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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 26 [2025-03-04 07:52:40,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:40,112 INFO L225 Difference]: With dead ends: 164 [2025-03-04 07:52:40,112 INFO L226 Difference]: Without dead ends: 164 [2025-03-04 07:52:40,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:52:40,113 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 18 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:40,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 341 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:52:40,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-04 07:52:40,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 160. [2025-03-04 07:52:40,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 124 states have (on average 1.3709677419354838) internal successors, (170), 158 states have internal predecessors, (170), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:40,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 176 transitions. [2025-03-04 07:52:40,116 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 176 transitions. Word has length 26 [2025-03-04 07:52:40,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:40,117 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 176 transitions. [2025-03-04 07:52:40,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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-04 07:52:40,117 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 176 transitions. [2025-03-04 07:52:40,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 07:52:40,119 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:40,119 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:40,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-04 07:52:40,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:40,323 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 68 more)] === [2025-03-04 07:52:40,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:40,323 INFO L85 PathProgramCache]: Analyzing trace with hash 663390316, now seen corresponding path program 1 times [2025-03-04 07:52:40,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:52:40,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1361965500] [2025-03-04 07:52:40,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:40,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:40,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:52:40,325 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:52:40,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 07:52:40,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 07:52:40,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 07:52:40,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:40,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:40,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 07:52:40,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:52:40,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-04 07:52:40,426 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-04 07:52:40,426 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:52:40,426 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:52:40,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361965500] [2025-03-04 07:52:40,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361965500] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:40,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:40,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:52:40,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003104455] [2025-03-04 07:52:40,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:40,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:52:40,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:52:40,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:52:40,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:52:40,427 INFO L87 Difference]: Start difference. First operand 160 states and 176 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:40,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:40,583 INFO L93 Difference]: Finished difference Result 163 states and 177 transitions. [2025-03-04 07:52:40,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:52:40,584 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-03-04 07:52:40,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:40,584 INFO L225 Difference]: With dead ends: 163 [2025-03-04 07:52:40,584 INFO L226 Difference]: Without dead ends: 163 [2025-03-04 07:52:40,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 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-04 07:52:40,585 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 15 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:40,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 292 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:52:40,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-03-04 07:52:40,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 159. [2025-03-04 07:52:40,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 124 states have (on average 1.3548387096774193) internal successors, (168), 157 states have internal predecessors, (168), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:40,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 173 transitions. [2025-03-04 07:52:40,587 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 173 transitions. Word has length 28 [2025-03-04 07:52:40,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:40,589 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 173 transitions. [2025-03-04 07:52:40,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:40,590 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 173 transitions. [2025-03-04 07:52:40,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 07:52:40,590 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:40,590 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:40,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-04 07:52:40,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:40,795 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 68 more)] === [2025-03-04 07:52:40,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:40,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1259405496, now seen corresponding path program 1 times [2025-03-04 07:52:40,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:52:40,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [746204662] [2025-03-04 07:52:40,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:40,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:40,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:52:40,799 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:52:40,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 07:52:40,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 07:52:40,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 07:52:40,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:40,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:40,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 07:52:40,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:52:40,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-03-04 07:52:40,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:52:40,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-04 07:52:40,934 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-04 07:52:40,934 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:52:40,934 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:52:40,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746204662] [2025-03-04 07:52:40,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [746204662] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:40,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:40,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:52:40,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946630391] [2025-03-04 07:52:40,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:40,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:52:40,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:52:40,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:52:40,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:52:40,935 INFO L87 Difference]: Start difference. First operand 159 states and 173 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:41,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:41,177 INFO L93 Difference]: Finished difference Result 158 states and 172 transitions. [2025-03-04 07:52:41,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:52:41,178 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-03-04 07:52:41,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:41,178 INFO L225 Difference]: With dead ends: 158 [2025-03-04 07:52:41,178 INFO L226 Difference]: Without dead ends: 158 [2025-03-04 07:52:41,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:52:41,179 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 3 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:41,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 321 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:52:41,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-04 07:52:41,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2025-03-04 07:52:41,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 124 states have (on average 1.346774193548387) internal successors, (167), 156 states have internal predecessors, (167), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:41,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 172 transitions. [2025-03-04 07:52:41,183 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 172 transitions. Word has length 28 [2025-03-04 07:52:41,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:41,184 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 172 transitions. [2025-03-04 07:52:41,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:41,184 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 172 transitions. [2025-03-04 07:52:41,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 07:52:41,184 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:41,184 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:41,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-04 07:52:41,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:41,385 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 68 more)] === [2025-03-04 07:52:41,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:41,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1259405495, now seen corresponding path program 1 times [2025-03-04 07:52:41,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:52:41,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1597386541] [2025-03-04 07:52:41,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:41,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:41,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:52:41,387 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:52:41,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 07:52:41,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 07:52:41,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 07:52:41,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:41,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:41,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 07:52:41,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:52:41,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:52:41,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:52:41,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:52:41,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-04 07:52:41,543 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-04 07:52:41,543 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:52:41,543 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:52:41,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597386541] [2025-03-04 07:52:41,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597386541] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:41,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:41,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:52:41,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033100366] [2025-03-04 07:52:41,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:41,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:52:41,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:52:41,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:52:41,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:52:41,545 INFO L87 Difference]: Start difference. First operand 158 states and 172 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:41,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:41,784 INFO L93 Difference]: Finished difference Result 157 states and 171 transitions. [2025-03-04 07:52:41,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:52:41,784 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-03-04 07:52:41,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:41,785 INFO L225 Difference]: With dead ends: 157 [2025-03-04 07:52:41,785 INFO L226 Difference]: Without dead ends: 157 [2025-03-04 07:52:41,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:52:41,785 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 1 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:41,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 311 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:52:41,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-04 07:52:41,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2025-03-04 07:52:41,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 124 states have (on average 1.3387096774193548) internal successors, (166), 155 states have internal predecessors, (166), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:41,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 171 transitions. [2025-03-04 07:52:41,788 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 171 transitions. Word has length 28 [2025-03-04 07:52:41,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:41,788 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 171 transitions. [2025-03-04 07:52:41,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:41,788 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 171 transitions. [2025-03-04 07:52:41,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 07:52:41,788 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:41,788 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:41,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-04 07:52:41,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:41,989 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 68 more)] === [2025-03-04 07:52:41,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:41,989 INFO L85 PathProgramCache]: Analyzing trace with hash 69892456, now seen corresponding path program 1 times [2025-03-04 07:52:41,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:52:41,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2063950649] [2025-03-04 07:52:41,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:41,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:41,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:52:41,991 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:52:41,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 07:52:42,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 07:52:42,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 07:52:42,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:42,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:42,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 07:52:42,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:52:42,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:52:42,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:52:42,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-04 07:52:42,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-04 07:52:42,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 07:52:42,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 07:52:42,145 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-04 07:52:42,145 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:52:42,145 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:52:42,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063950649] [2025-03-04 07:52:42,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2063950649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:42,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:42,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:52:42,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391531289] [2025-03-04 07:52:42,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:42,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:52:42,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:52:42,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:52:42,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:52:42,146 INFO L87 Difference]: Start difference. First operand 157 states and 171 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:42,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:42,338 INFO L93 Difference]: Finished difference Result 157 states and 169 transitions. [2025-03-04 07:52:42,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:52:42,338 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-03-04 07:52:42,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:42,339 INFO L225 Difference]: With dead ends: 157 [2025-03-04 07:52:42,339 INFO L226 Difference]: Without dead ends: 157 [2025-03-04 07:52:42,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 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-04 07:52:42,339 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 11 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:42,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 251 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:52:42,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-04 07:52:42,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2025-03-04 07:52:42,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 124 states have (on average 1.3225806451612903) internal successors, (164), 154 states have internal predecessors, (164), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:42,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 168 transitions. [2025-03-04 07:52:42,342 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 168 transitions. Word has length 31 [2025-03-04 07:52:42,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:42,342 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 168 transitions. [2025-03-04 07:52:42,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:42,342 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 168 transitions. [2025-03-04 07:52:42,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 07:52:42,342 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:42,342 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:42,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-04 07:52:42,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:42,543 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 68 more)] === [2025-03-04 07:52:42,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:42,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1278970053, now seen corresponding path program 1 times [2025-03-04 07:52:42,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:52:42,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [27037290] [2025-03-04 07:52:42,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:42,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:42,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:52:42,545 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:52:42,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-04 07:52:42,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 07:52:42,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 07:52:42,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:42,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:42,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 07:52:42,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:52:42,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:52:42,667 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:52:42,667 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:52:42,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27037290] [2025-03-04 07:52:42,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27037290] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:42,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:42,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:52:42,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3691450] [2025-03-04 07:52:42,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:42,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:52:42,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:52:42,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:52:42,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:52:42,668 INFO L87 Difference]: Start difference. First operand 156 states and 168 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:42,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:42,720 INFO L93 Difference]: Finished difference Result 158 states and 170 transitions. [2025-03-04 07:52:42,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:52:42,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-03-04 07:52:42,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:42,721 INFO L225 Difference]: With dead ends: 158 [2025-03-04 07:52:42,721 INFO L226 Difference]: Without dead ends: 158 [2025-03-04 07:52:42,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 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-04 07:52:42,721 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 64 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:42,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 126 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:52:42,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-04 07:52:42,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2025-03-04 07:52:42,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 126 states have (on average 1.3174603174603174) internal successors, (166), 156 states have internal predecessors, (166), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:42,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 170 transitions. [2025-03-04 07:52:42,723 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 170 transitions. Word has length 31 [2025-03-04 07:52:42,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:42,724 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 170 transitions. [2025-03-04 07:52:42,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:42,724 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 170 transitions. [2025-03-04 07:52:42,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-04 07:52:42,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:42,724 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:42,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-04 07:52:42,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:42,924 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 68 more)] === [2025-03-04 07:52:42,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:42,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1686119934, now seen corresponding path program 1 times [2025-03-04 07:52:42,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:52:42,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1043470355] [2025-03-04 07:52:42,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:42,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:42,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:52:42,927 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:52:42,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-04 07:52:42,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 07:52:43,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 07:52:43,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:43,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:43,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 07:52:43,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:52:43,057 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2025-03-04 07:52:43,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2025-03-04 07:52:43,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:52:43,123 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 07:52:43,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2025-03-04 07:52:43,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-03-04 07:52:43,177 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-04 07:52:43,177 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:52:43,177 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:52:43,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043470355] [2025-03-04 07:52:43,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043470355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:43,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:43,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 07:52:43,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898363784] [2025-03-04 07:52:43,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:43,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:52:43,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:52:43,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:52:43,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:52:43,178 INFO L87 Difference]: Start difference. First operand 158 states and 170 transitions. Second operand has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 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-04 07:52:43,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:43,561 INFO L93 Difference]: Finished difference Result 165 states and 177 transitions. [2025-03-04 07:52:43,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:52:43,561 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 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 32 [2025-03-04 07:52:43,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:43,562 INFO L225 Difference]: With dead ends: 165 [2025-03-04 07:52:43,562 INFO L226 Difference]: Without dead ends: 165 [2025-03-04 07:52:43,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:52:43,562 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 49 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:43,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 269 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:52:43,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-03-04 07:52:43,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 157. [2025-03-04 07:52:43,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 126 states have (on average 1.3095238095238095) internal successors, (165), 155 states have internal predecessors, (165), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:43,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 169 transitions. [2025-03-04 07:52:43,573 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 169 transitions. Word has length 32 [2025-03-04 07:52:43,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:43,573 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 169 transitions. [2025-03-04 07:52:43,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 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-04 07:52:43,573 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 169 transitions. [2025-03-04 07:52:43,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-04 07:52:43,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:43,573 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:43,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-03-04 07:52:43,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:43,774 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 68 more)] === [2025-03-04 07:52:43,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:43,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1686119933, now seen corresponding path program 1 times [2025-03-04 07:52:43,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:52:43,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [487440736] [2025-03-04 07:52:43,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:43,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:43,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:52:43,777 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:52:43,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-04 07:52:43,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 07:52:43,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 07:52:43,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:43,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:43,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 07:52:43,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:52:43,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:52:43,917 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-03-04 07:52:43,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2025-03-04 07:52:43,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:52:43,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:52:43,994 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 07:52:43,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-03-04 07:52:43,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-04 07:52:44,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 07:52:44,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-04 07:52:44,035 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-04 07:52:44,035 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:52:44,035 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:52:44,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487440736] [2025-03-04 07:52:44,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487440736] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:44,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:44,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 07:52:44,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450678291] [2025-03-04 07:52:44,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:44,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:52:44,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:52:44,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:52:44,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:52:44,036 INFO L87 Difference]: Start difference. First operand 157 states and 169 transitions. Second operand has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 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-04 07:52:44,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:44,514 INFO L93 Difference]: Finished difference Result 153 states and 165 transitions. [2025-03-04 07:52:44,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 07:52:44,514 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 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 32 [2025-03-04 07:52:44,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:44,514 INFO L225 Difference]: With dead ends: 153 [2025-03-04 07:52:44,515 INFO L226 Difference]: Without dead ends: 153 [2025-03-04 07:52:44,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-04 07:52:44,515 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 55 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:44,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 361 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:52:44,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-03-04 07:52:44,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 134. [2025-03-04 07:52:44,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 110 states have (on average 1.2727272727272727) internal successors, (140), 132 states have internal predecessors, (140), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:44,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 144 transitions. [2025-03-04 07:52:44,518 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 144 transitions. Word has length 32 [2025-03-04 07:52:44,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:44,518 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 144 transitions. [2025-03-04 07:52:44,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 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-04 07:52:44,518 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 144 transitions. [2025-03-04 07:52:44,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-04 07:52:44,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:44,518 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:44,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-03-04 07:52:44,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:44,719 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 68 more)] === [2025-03-04 07:52:44,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:44,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1619955159, now seen corresponding path program 1 times [2025-03-04 07:52:44,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:52:44,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [91031283] [2025-03-04 07:52:44,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:44,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:44,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:52:44,722 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:52:44,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-04 07:52:44,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 07:52:44,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 07:52:44,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:44,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:44,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 07:52:44,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:52:44,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-03-04 07:52:44,837 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-03-04 07:52:44,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2025-03-04 07:52:44,882 INFO L349 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2025-03-04 07:52:44,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2025-03-04 07:52:44,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:52:44,944 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 07:52:44,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2025-03-04 07:52:44,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2025-03-04 07:52:44,978 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-04 07:52:44,978 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:52:44,978 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:52:44,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91031283] [2025-03-04 07:52:44,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [91031283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:44,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:44,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 07:52:44,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340688320] [2025-03-04 07:52:44,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:44,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:52:44,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:52:44,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:52:44,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:52:44,979 INFO L87 Difference]: Start difference. First operand 134 states and 144 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:45,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:45,604 INFO L93 Difference]: Finished difference Result 153 states and 164 transitions. [2025-03-04 07:52:45,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 07:52:45,607 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-03-04 07:52:45,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:45,607 INFO L225 Difference]: With dead ends: 153 [2025-03-04 07:52:45,607 INFO L226 Difference]: Without dead ends: 153 [2025-03-04 07:52:45,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2025-03-04 07:52:45,609 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 150 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:45,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 362 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 07:52:45,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-03-04 07:52:45,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 141. [2025-03-04 07:52:45,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 117 states have (on average 1.2564102564102564) internal successors, (147), 139 states have internal predecessors, (147), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:45,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 151 transitions. [2025-03-04 07:52:45,611 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 151 transitions. Word has length 33 [2025-03-04 07:52:45,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:45,611 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 151 transitions. [2025-03-04 07:52:45,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:45,611 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 151 transitions. [2025-03-04 07:52:45,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-04 07:52:45,611 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:45,611 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:45,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-03-04 07:52:45,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:45,816 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 68 more)] === [2025-03-04 07:52:45,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:45,816 INFO L85 PathProgramCache]: Analyzing trace with hash 2067369101, now seen corresponding path program 1 times [2025-03-04 07:52:45,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:52:45,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [65744765] [2025-03-04 07:52:45,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:45,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:45,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:52:45,819 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:52:45,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-04 07:52:45,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 07:52:45,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 07:52:45,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:45,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:52:45,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 07:52:45,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:52:45,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-04 07:52:45,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:52:45,953 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:52:45,953 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:52:45,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65744765] [2025-03-04 07:52:45,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65744765] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:52:45,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:52:45,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:52:45,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450771931] [2025-03-04 07:52:45,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:52:45,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:52:45,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:52:45,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:52:45,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:52:45,954 INFO L87 Difference]: Start difference. First operand 141 states and 151 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 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-04 07:52:46,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:52:46,083 INFO L93 Difference]: Finished difference Result 148 states and 158 transitions. [2025-03-04 07:52:46,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:52:46,084 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 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 33 [2025-03-04 07:52:46,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:52:46,084 INFO L225 Difference]: With dead ends: 148 [2025-03-04 07:52:46,084 INFO L226 Difference]: Without dead ends: 148 [2025-03-04 07:52:46,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 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-04 07:52:46,085 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 5 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:52:46,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 274 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:52:46,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-03-04 07:52:46,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 144. [2025-03-04 07:52:46,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 120 states have (on average 1.25) internal successors, (150), 142 states have internal predecessors, (150), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:52:46,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 154 transitions. [2025-03-04 07:52:46,087 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 154 transitions. Word has length 33 [2025-03-04 07:52:46,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:52:46,087 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 154 transitions. [2025-03-04 07:52:46,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 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-04 07:52:46,087 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 154 transitions. [2025-03-04 07:52:46,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-04 07:52:46,087 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:52:46,088 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:46,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-03-04 07:52:46,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:46,288 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 68 more)] === [2025-03-04 07:52:46,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:52:46,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1141966814, now seen corresponding path program 1 times [2025-03-04 07:52:46,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:52:46,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [213295377] [2025-03-04 07:52:46,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:52:46,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:46,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:52:46,291 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:52:46,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-04 07:52:46,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 07:52:47,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 07:52:47,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:47,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 07:52:47,421 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 07:52:47,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 07:52:49,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 07:52:49,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:52:49,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 07:52:49,297 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-03-04 07:52:49,297 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 07:52:49,298 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (70 of 71 remaining) [2025-03-04 07:52:49,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK (69 of 71 remaining) [2025-03-04 07:52:49,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (68 of 71 remaining) [2025-03-04 07:52:49,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (67 of 71 remaining) [2025-03-04 07:52:49,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (66 of 71 remaining) [2025-03-04 07:52:49,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 71 remaining) [2025-03-04 07:52:49,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 71 remaining) [2025-03-04 07:52:49,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE (63 of 71 remaining) [2025-03-04 07:52:49,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE (62 of 71 remaining) [2025-03-04 07:52:49,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE (61 of 71 remaining) [2025-03-04 07:52:49,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 71 remaining) [2025-03-04 07:52:49,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 71 remaining) [2025-03-04 07:52:49,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE (58 of 71 remaining) [2025-03-04 07:52:49,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE (57 of 71 remaining) [2025-03-04 07:52:49,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE (56 of 71 remaining) [2025-03-04 07:52:49,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 71 remaining) [2025-03-04 07:52:49,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 71 remaining) [2025-03-04 07:52:49,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 71 remaining) [2025-03-04 07:52:49,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 71 remaining) [2025-03-04 07:52:49,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 71 remaining) [2025-03-04 07:52:49,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 71 remaining) [2025-03-04 07:52:49,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 71 remaining) [2025-03-04 07:52:49,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 71 remaining) [2025-03-04 07:52:49,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 71 remaining) [2025-03-04 07:52:49,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 71 remaining) [2025-03-04 07:52:49,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 71 remaining) [2025-03-04 07:52:49,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 71 remaining) [2025-03-04 07:52:49,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 71 remaining) [2025-03-04 07:52:49,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 71 remaining) [2025-03-04 07:52:49,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 71 remaining) [2025-03-04 07:52:49,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 71 remaining) [2025-03-04 07:52:49,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 71 remaining) [2025-03-04 07:52:49,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 71 remaining) [2025-03-04 07:52:49,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 71 remaining) [2025-03-04 07:52:49,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 71 remaining) [2025-03-04 07:52:49,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 71 remaining) [2025-03-04 07:52:49,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 71 remaining) [2025-03-04 07:52:49,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 71 remaining) [2025-03-04 07:52:49,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 71 remaining) [2025-03-04 07:52:49,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 71 remaining) [2025-03-04 07:52:49,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 71 remaining) [2025-03-04 07:52:49,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 71 remaining) [2025-03-04 07:52:49,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 71 remaining) [2025-03-04 07:52:49,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 71 remaining) [2025-03-04 07:52:49,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 71 remaining) [2025-03-04 07:52:49,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 71 remaining) [2025-03-04 07:52:49,301 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 71 remaining) [2025-03-04 07:52:49,301 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 71 remaining) [2025-03-04 07:52:49,301 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 71 remaining) [2025-03-04 07:52:49,302 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 71 remaining) [2025-03-04 07:52:49,302 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 71 remaining) [2025-03-04 07:52:49,302 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 71 remaining) [2025-03-04 07:52:49,302 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 71 remaining) [2025-03-04 07:52:49,302 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 71 remaining) [2025-03-04 07:52:49,302 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 71 remaining) [2025-03-04 07:52:49,302 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 71 remaining) [2025-03-04 07:52:49,302 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 71 remaining) [2025-03-04 07:52:49,302 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 71 remaining) [2025-03-04 07:52:49,302 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 71 remaining) [2025-03-04 07:52:49,302 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 71 remaining) [2025-03-04 07:52:49,302 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 71 remaining) [2025-03-04 07:52:49,302 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 71 remaining) [2025-03-04 07:52:49,302 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 71 remaining) [2025-03-04 07:52:49,303 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 71 remaining) [2025-03-04 07:52:49,303 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 71 remaining) [2025-03-04 07:52:49,303 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 71 remaining) [2025-03-04 07:52:49,303 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 71 remaining) [2025-03-04 07:52:49,303 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 71 remaining) [2025-03-04 07:52:49,303 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 71 remaining) [2025-03-04 07:52:49,303 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 71 remaining) [2025-03-04 07:52:49,303 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 71 remaining) [2025-03-04 07:52:49,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-03-04 07:52:49,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:52:49,506 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:52:49,524 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 07:52:49,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 07:52:49 BoogieIcfgContainer [2025-03-04 07:52:49,528 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 07:52:49,528 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 07:52:49,528 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 07:52:49,529 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 07:52:49,529 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:52:29" (3/4) ... [2025-03-04 07:52:49,531 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 07:52:49,532 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 07:52:49,532 INFO L158 Benchmark]: Toolchain (without parser) took 20994.62ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 91.4MB in the beginning and 51.9MB in the end (delta: 39.5MB). Peak memory consumption was 65.9MB. Max. memory is 16.1GB. [2025-03-04 07:52:49,532 INFO L158 Benchmark]: CDTParser took 0.85ms. Allocated memory is still 83.9MB. Free memory was 62.4MB in the beginning and 62.4MB in the end (delta: 34.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:52:49,532 INFO L158 Benchmark]: CACSL2BoogieTranslator took 337.30ms. Allocated memory is still 117.4MB. Free memory was 91.2MB in the beginning and 72.7MB in the end (delta: 18.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 07:52:49,533 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.73ms. Allocated memory is still 117.4MB. Free memory was 72.7MB in the beginning and 70.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:52:49,533 INFO L158 Benchmark]: Boogie Preprocessor took 37.57ms. Allocated memory is still 117.4MB. Free memory was 70.9MB in the beginning and 68.4MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 07:52:49,533 INFO L158 Benchmark]: IcfgBuilder took 695.11ms. Allocated memory is still 117.4MB. Free memory was 68.4MB in the beginning and 85.9MB in the end (delta: -17.6MB). Peak memory consumption was 38.3MB. Max. memory is 16.1GB. [2025-03-04 07:52:49,534 INFO L158 Benchmark]: TraceAbstraction took 19868.49ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 85.2MB in the beginning and 51.9MB in the end (delta: 33.3MB). Peak memory consumption was 61.2MB. Max. memory is 16.1GB. [2025-03-04 07:52:49,534 INFO L158 Benchmark]: Witness Printer took 3.26ms. Allocated memory is still 142.6MB. Free memory was 51.9MB in the beginning and 51.9MB in the end (delta: 12.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:52:49,535 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.85ms. Allocated memory is still 83.9MB. Free memory was 62.4MB in the beginning and 62.4MB in the end (delta: 34.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 337.30ms. Allocated memory is still 117.4MB. Free memory was 91.2MB in the beginning and 72.7MB in the end (delta: 18.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.73ms. Allocated memory is still 117.4MB. Free memory was 72.7MB in the beginning and 70.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.57ms. Allocated memory is still 117.4MB. Free memory was 70.9MB in the beginning and 68.4MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 695.11ms. Allocated memory is still 117.4MB. Free memory was 68.4MB in the beginning and 85.9MB in the end (delta: -17.6MB). Peak memory consumption was 38.3MB. Max. memory is 16.1GB. * TraceAbstraction took 19868.49ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 85.2MB in the beginning and 51.9MB in the end (delta: 33.3MB). Peak memory consumption was 61.2MB. Max. memory is 16.1GB. * Witness Printer took 3.26ms. Allocated memory is still 142.6MB. Free memory was 51.9MB in the beginning and 51.9MB in the end (delta: 12.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 996]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 996. Possible FailurePath: [L998] struct TSLL* null = malloc(sizeof(struct TSLL)); [L999] null->next = ((void*)0) [L1000] null->prev = ((void*)0) [L1001] null->colour = BLACK [L1003] struct TSLL* list = malloc(sizeof(struct TSLL)); [L1004] list->next = null [L1005] list->prev = null [L1006] list->colour = BLACK [L1008] struct TSLL* end = list; VAL [end={8388608:0}, list={8388608:0}, null={262144:0}] [L1011] COND TRUE __VERIFIER_nondet_int() [L1011] COND FALSE !(__VERIFIER_nondet_int()) [L1037] end = null [L1038] end = list VAL [end={8388608:0}, list={8388608:0}, null={262144:0}] [L1041] COND FALSE !(!(null != end)) VAL [end={8388608:0}, list={8388608:0}, null={262144:0}] [L1041] COND FALSE !(0) VAL [end={8388608:0}, list={8388608:0}, null={262144:0}] [L1042] EXPR end->colour [L1042] COND FALSE !(!(BLACK == end->colour)) [L1042] COND FALSE !(0) VAL [end={8388608:0}, list={8388608:0}, null={262144:0}] [L1043] COND TRUE null != end [L1045] EXPR end->colour [L1045] COND FALSE !(RED == end->colour) [L1052] EXPR end->next [L1052] end = end->next [L1043] COND FALSE !(null != end) [L1056] COND TRUE null != list [L1058] EXPR list->colour [L1058] COND FALSE !(RED == list->colour) [L1067] EXPR list->next [L1067] end = list->next [L1068] free(list) VAL [end={262144:0}, null={262144:0}] [L1068] free(list) VAL [end={262144:0}, null={262144:0}] [L1068] free(list) [L1069] list = end VAL [list={262144:0}, null={262144:0}] [L1056] COND FALSE !(null != list) [L1073] return 0; VAL [\result=0] - UnprovableResult [Line: 985]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 170 locations, 71 error locations. Started 1 CEGAR loops. OverallTime: 19.8s, OverallIterations: 24, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2286 SdHoareTripleChecker+Valid, 6.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2286 mSDsluCounter, 5957 SdHoareTripleChecker+Invalid, 5.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3695 mSDsCounter, 170 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5090 IncrementalHoareTripleChecker+Invalid, 5260 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 170 mSolverCounterUnsat, 2262 mSDtfsCounter, 5090 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 534 GetRequests, 400 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=170occurred in iteration=0, InterpolantAutomatonStates: 139, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 218 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 516 NumberOfCodeBlocks, 516 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 483 ConstructedInterpolants, 4 QuantifiedInterpolants, 2965 SizeOfPredicates, 52 NumberOfNonLiveVariables, 3380 ConjunctsInSsa, 202 ConjunctsInUnsatCore, 24 InterpolantComputations, 22 PerfectInterpolantSequences, 4/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-04 07:52:49,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample