./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-properties/list-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/list-properties/list-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 657efb2af25c5cc2c0afb2bbf76276caecae7904494acc21657e1ac1176685b7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:54:05,963 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:54:06,016 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 07:54:06,023 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:54:06,025 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:54:06,043 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:54:06,044 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:54:06,044 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:54:06,045 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:54:06,045 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:54:06,045 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:54:06,046 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:54:06,046 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:54:06,046 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:54:06,046 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:54:06,046 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:54:06,046 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:54:06,046 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:54:06,047 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:54:06,047 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:54:06,047 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:54:06,047 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:54:06,047 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 07:54:06,047 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:54:06,047 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:54:06,047 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:54:06,047 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:54:06,047 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:54:06,048 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:54:06,048 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:54:06,048 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:54:06,048 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:54:06,048 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:54:06,048 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:54:06,049 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:54:06,049 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:54:06,049 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:54:06,049 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:54:06,049 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:54:06,049 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:54:06,049 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:54:06,049 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:54:06,049 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 -> 657efb2af25c5cc2c0afb2bbf76276caecae7904494acc21657e1ac1176685b7 [2025-03-04 07:54:06,263 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:54:06,272 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:54:06,273 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:54:06,274 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:54:06,274 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:54:06,276 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/list-1.i [2025-03-04 07:54:07,386 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/749fd8754/14e97d7557264199b14e65ace7c76b83/FLAGaffa8a9af [2025-03-04 07:54:07,633 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:54:07,633 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list-1.i [2025-03-04 07:54:07,641 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/749fd8754/14e97d7557264199b14e65ace7c76b83/FLAGaffa8a9af [2025-03-04 07:54:07,651 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/749fd8754/14e97d7557264199b14e65ace7c76b83 [2025-03-04 07:54:07,653 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:54:07,654 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:54:07,655 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:54:07,655 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:54:07,658 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:54:07,658 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:54:07" (1/1) ... [2025-03-04 07:54:07,659 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24f13cef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:54:07, skipping insertion in model container [2025-03-04 07:54:07,660 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:54:07" (1/1) ... [2025-03-04 07:54:07,682 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:54:07,911 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:54:07,919 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:54:07,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:54:07,973 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:54:07,973 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:54:07 WrapperNode [2025-03-04 07:54:07,973 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:54:07,974 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:54:07,974 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:54:07,974 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:54:07,978 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:54:07" (1/1) ... [2025-03-04 07:54:07,989 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:54:07" (1/1) ... [2025-03-04 07:54:08,001 INFO L138 Inliner]: procedures = 124, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 78 [2025-03-04 07:54:08,001 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:54:08,001 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:54:08,001 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:54:08,001 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:54:08,007 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:54:07" (1/1) ... [2025-03-04 07:54:08,008 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:54:07" (1/1) ... [2025-03-04 07:54:08,009 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:54:07" (1/1) ... [2025-03-04 07:54:08,018 INFO L175 MemorySlicer]: Split 14 memory accesses to 2 slices as follows [2, 12]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2025-03-04 07:54:08,019 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:54:07" (1/1) ... [2025-03-04 07:54:08,019 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:54:07" (1/1) ... [2025-03-04 07:54:08,022 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:54:07" (1/1) ... [2025-03-04 07:54:08,023 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:54:07" (1/1) ... [2025-03-04 07:54:08,023 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:54:07" (1/1) ... [2025-03-04 07:54:08,024 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:54:07" (1/1) ... [2025-03-04 07:54:08,025 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:54:08,026 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:54:08,026 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:54:08,026 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:54:08,026 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:54:07" (1/1) ... [2025-03-04 07:54:08,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:54:08,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:54:08,056 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:54:08,058 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:54:08,074 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2025-03-04 07:54:08,074 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2025-03-04 07:54:08,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 07:54:08,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 07:54:08,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 07:54:08,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 07:54:08,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 07:54:08,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 07:54:08,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 07:54:08,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 07:54:08,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 07:54:08,075 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 07:54:08,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 07:54:08,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 07:54:08,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:54:08,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:54:08,148 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:54:08,149 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:54:08,165 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2025-03-04 07:54:08,356 INFO L? ?]: Removed 63 outVars from TransFormulas that were not future-live. [2025-03-04 07:54:08,356 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:54:08,364 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:54:08,364 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:54:08,365 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:54:08 BoogieIcfgContainer [2025-03-04 07:54:08,365 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:54:08,367 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:54:08,367 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:54:08,370 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:54:08,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:54:07" (1/3) ... [2025-03-04 07:54:08,371 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a4b99b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:54:08, skipping insertion in model container [2025-03-04 07:54:08,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:54:07" (2/3) ... [2025-03-04 07:54:08,372 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a4b99b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:54:08, skipping insertion in model container [2025-03-04 07:54:08,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:54:08" (3/3) ... [2025-03-04 07:54:08,373 INFO L128 eAbstractionObserver]: Analyzing ICFG list-1.i [2025-03-04 07:54:08,384 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:54:08,385 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG list-1.i that has 2 procedures, 72 locations, 1 initial locations, 4 loop locations, and 26 error locations. [2025-03-04 07:54:08,408 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:54:08,415 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;@2c66c288, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:54:08,415 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-03-04 07:54:08,419 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 41 states have (on average 1.951219512195122) internal successors, (80), 69 states have internal predecessors, (80), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:54:08,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 07:54:08,423 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:54:08,423 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:54:08,424 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 07:54:08,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:54:08,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1438086350, now seen corresponding path program 1 times [2025-03-04 07:54:08,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:54:08,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519515289] [2025-03-04 07:54:08,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:54:08,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:54:08,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 07:54:08,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 07:54:08,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:54:08,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:54:08,617 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:54:08,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:54:08,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519515289] [2025-03-04 07:54:08,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519515289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:54:08,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:54:08,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:54:08,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536235590] [2025-03-04 07:54:08,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:54:08,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:54:08,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:54:08,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:54:08,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:54:08,640 INFO L87 Difference]: Start difference. First operand has 71 states, 41 states have (on average 1.951219512195122) internal successors, (80), 69 states have internal predecessors, (80), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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:54:08,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:54:08,790 INFO L93 Difference]: Finished difference Result 72 states and 85 transitions. [2025-03-04 07:54:08,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:54:08,793 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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:54:08,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:54:08,797 INFO L225 Difference]: With dead ends: 72 [2025-03-04 07:54:08,797 INFO L226 Difference]: Without dead ends: 65 [2025-03-04 07:54:08,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:54:08,800 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 61 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:54:08,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 66 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:54:08,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-04 07:54:08,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-03-04 07:54:08,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 46 states have (on average 1.6304347826086956) internal successors, (75), 64 states have internal predecessors, (75), 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:54:08,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2025-03-04 07:54:08,833 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 7 [2025-03-04 07:54:08,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:54:08,833 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2025-03-04 07:54:08,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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:54:08,834 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2025-03-04 07:54:08,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 07:54:08,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:54:08,835 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:54:08,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 07:54:08,835 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 07:54:08,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:54:08,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1438086351, now seen corresponding path program 1 times [2025-03-04 07:54:08,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:54:08,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393248136] [2025-03-04 07:54:08,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:54:08,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:54:08,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 07:54:08,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 07:54:08,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:54:08,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:54:08,956 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:54:08,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:54:08,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393248136] [2025-03-04 07:54:08,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393248136] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:54:08,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:54:08,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:54:08,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486359085] [2025-03-04 07:54:08,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:54:08,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:54:08,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:54:08,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:54:08,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:54:08,959 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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:54:09,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:54:09,056 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2025-03-04 07:54:09,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:54:09,057 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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:54:09,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:54:09,057 INFO L225 Difference]: With dead ends: 79 [2025-03-04 07:54:09,059 INFO L226 Difference]: Without dead ends: 79 [2025-03-04 07:54:09,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:54:09,060 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 59 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:54:09,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 69 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:54:09,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-04 07:54:09,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-03-04 07:54:09,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 60 states have (on average 1.45) internal successors, (87), 78 states have internal predecessors, (87), 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:54:09,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2025-03-04 07:54:09,068 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 7 [2025-03-04 07:54:09,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:54:09,068 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2025-03-04 07:54:09,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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:54:09,069 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2025-03-04 07:54:09,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 07:54:09,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:54:09,069 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:54:09,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 07:54:09,069 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 07:54:09,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:54:09,070 INFO L85 PathProgramCache]: Analyzing trace with hash 615093271, now seen corresponding path program 1 times [2025-03-04 07:54:09,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:54:09,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25276141] [2025-03-04 07:54:09,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:54:09,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:54:09,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 07:54:09,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 07:54:09,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:54:09,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:54:09,235 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:54:09,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:54:09,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25276141] [2025-03-04 07:54:09,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25276141] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:54:09,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:54:09,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:54:09,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112677384] [2025-03-04 07:54:09,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:54:09,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:54:09,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:54:09,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:54:09,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:54:09,236 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:54:09,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:54:09,349 INFO L93 Difference]: Finished difference Result 82 states and 93 transitions. [2025-03-04 07:54:09,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:54:09,349 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-04 07:54:09,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:54:09,350 INFO L225 Difference]: With dead ends: 82 [2025-03-04 07:54:09,350 INFO L226 Difference]: Without dead ends: 82 [2025-03-04 07:54:09,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:54:09,351 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 16 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:54:09,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 133 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:54:09,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-04 07:54:09,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-03-04 07:54:09,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 64 states have (on average 1.453125) internal successors, (93), 81 states have internal predecessors, (93), 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:54:09,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2025-03-04 07:54:09,355 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 93 transitions. Word has length 15 [2025-03-04 07:54:09,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:54:09,355 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 93 transitions. [2025-03-04 07:54:09,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:54:09,355 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2025-03-04 07:54:09,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 07:54:09,355 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:54:09,355 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:54:09,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 07:54:09,356 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 07:54:09,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:54:09,356 INFO L85 PathProgramCache]: Analyzing trace with hash 615093272, now seen corresponding path program 1 times [2025-03-04 07:54:09,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:54:09,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498300568] [2025-03-04 07:54:09,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:54:09,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:54:09,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 07:54:09,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 07:54:09,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:54:09,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:54:09,574 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:54:09,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:54:09,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498300568] [2025-03-04 07:54:09,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498300568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:54:09,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:54:09,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:54:09,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066796635] [2025-03-04 07:54:09,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:54:09,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:54:09,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:54:09,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:54:09,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:54:09,577 INFO L87 Difference]: Start difference. First operand 82 states and 93 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:54:09,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:54:09,732 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2025-03-04 07:54:09,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:54:09,732 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-04 07:54:09,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:54:09,733 INFO L225 Difference]: With dead ends: 83 [2025-03-04 07:54:09,733 INFO L226 Difference]: Without dead ends: 83 [2025-03-04 07:54:09,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:54:09,734 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 12 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:54:09,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 159 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:54:09,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-04 07:54:09,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 68. [2025-03-04 07:54:09,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 67 states have internal predecessors, (75), 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:54:09,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2025-03-04 07:54:09,737 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 15 [2025-03-04 07:54:09,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:54:09,737 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2025-03-04 07:54:09,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:54:09,737 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2025-03-04 07:54:09,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 07:54:09,738 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:54:09,738 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:54:09,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 07:54:09,738 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 07:54:09,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:54:09,738 INFO L85 PathProgramCache]: Analyzing trace with hash -366526995, now seen corresponding path program 1 times [2025-03-04 07:54:09,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:54:09,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925526740] [2025-03-04 07:54:09,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:54:09,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:54:09,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 07:54:09,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 07:54:09,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:54:09,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:54:09,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:54:09,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:54:09,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925526740] [2025-03-04 07:54:09,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925526740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:54:09,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:54:09,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:54:09,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883807867] [2025-03-04 07:54:09,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:54:09,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:54:09,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:54:09,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:54:09,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:54:09,824 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:54:09,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:54:09,928 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2025-03-04 07:54:09,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:54:09,928 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-04 07:54:09,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:54:09,929 INFO L225 Difference]: With dead ends: 103 [2025-03-04 07:54:09,929 INFO L226 Difference]: Without dead ends: 103 [2025-03-04 07:54:09,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:54:09,929 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 33 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:54:09,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 171 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:54:09,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-04 07:54:09,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 85. [2025-03-04 07:54:09,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 70 states have (on average 1.3857142857142857) internal successors, (97), 84 states have internal predecessors, (97), 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:54:09,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 97 transitions. [2025-03-04 07:54:09,936 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 97 transitions. Word has length 15 [2025-03-04 07:54:09,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:54:09,936 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 97 transitions. [2025-03-04 07:54:09,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:54:09,936 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 97 transitions. [2025-03-04 07:54:09,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-04 07:54:09,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:54:09,937 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:54:09,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 07:54:09,937 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 07:54:09,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:54:09,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1863210886, now seen corresponding path program 1 times [2025-03-04 07:54:09,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:54:09,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36222177] [2025-03-04 07:54:09,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:54:09,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:54:09,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 07:54:09,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 07:54:09,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:54:09,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:54:10,046 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:54:10,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:54:10,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36222177] [2025-03-04 07:54:10,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36222177] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:54:10,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:54:10,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:54:10,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092615998] [2025-03-04 07:54:10,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:54:10,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:54:10,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:54:10,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:54:10,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:54:10,048 INFO L87 Difference]: Start difference. First operand 85 states and 97 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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:54:10,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:54:10,140 INFO L93 Difference]: Finished difference Result 83 states and 94 transitions. [2025-03-04 07:54:10,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:54:10,140 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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 17 [2025-03-04 07:54:10,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:54:10,140 INFO L225 Difference]: With dead ends: 83 [2025-03-04 07:54:10,140 INFO L226 Difference]: Without dead ends: 83 [2025-03-04 07:54:10,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:54:10,141 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 12 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:54:10,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 122 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:54:10,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-04 07:54:10,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-03-04 07:54:10,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 70 states have (on average 1.3428571428571427) internal successors, (94), 82 states have internal predecessors, (94), 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:54:10,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 94 transitions. [2025-03-04 07:54:10,146 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 94 transitions. Word has length 17 [2025-03-04 07:54:10,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:54:10,146 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 94 transitions. [2025-03-04 07:54:10,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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:54:10,147 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 94 transitions. [2025-03-04 07:54:10,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-04 07:54:10,148 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:54:10,148 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:54:10,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 07:54:10,148 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 07:54:10,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:54:10,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1863210887, now seen corresponding path program 1 times [2025-03-04 07:54:10,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:54:10,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792551848] [2025-03-04 07:54:10,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:54:10,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:54:10,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 07:54:10,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 07:54:10,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:54:10,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:54:10,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:54:10,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:54:10,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792551848] [2025-03-04 07:54:10,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792551848] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:54:10,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:54:10,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:54:10,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059488448] [2025-03-04 07:54:10,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:54:10,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:54:10,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:54:10,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:54:10,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:54:10,284 INFO L87 Difference]: Start difference. First operand 83 states and 94 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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:54:10,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:54:10,392 INFO L93 Difference]: Finished difference Result 79 states and 89 transitions. [2025-03-04 07:54:10,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:54:10,393 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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 17 [2025-03-04 07:54:10,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:54:10,393 INFO L225 Difference]: With dead ends: 79 [2025-03-04 07:54:10,393 INFO L226 Difference]: Without dead ends: 79 [2025-03-04 07:54:10,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:54:10,394 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 5 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:54:10,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 139 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:54:10,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-04 07:54:10,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 70. [2025-03-04 07:54:10,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 61 states have (on average 1.2950819672131149) internal successors, (79), 69 states have internal predecessors, (79), 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:54:10,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2025-03-04 07:54:10,400 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 17 [2025-03-04 07:54:10,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:54:10,400 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2025-03-04 07:54:10,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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:54:10,401 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2025-03-04 07:54:10,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-04 07:54:10,401 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:54:10,401 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:54:10,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 07:54:10,402 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 07:54:10,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:54:10,402 INFO L85 PathProgramCache]: Analyzing trace with hash -21305884, now seen corresponding path program 1 times [2025-03-04 07:54:10,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:54:10,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150726566] [2025-03-04 07:54:10,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:54:10,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:54:10,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 07:54:10,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 07:54:10,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:54:10,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:54:10,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:54:10,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:54:10,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150726566] [2025-03-04 07:54:10,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150726566] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:54:10,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:54:10,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:54:10,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561573075] [2025-03-04 07:54:10,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:54:10,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:54:10,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:54:10,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:54:10,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:54:10,484 INFO L87 Difference]: Start difference. First operand 70 states and 79 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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:54:10,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:54:10,548 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2025-03-04 07:54:10,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:54:10,548 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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 17 [2025-03-04 07:54:10,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:54:10,549 INFO L225 Difference]: With dead ends: 82 [2025-03-04 07:54:10,549 INFO L226 Difference]: Without dead ends: 82 [2025-03-04 07:54:10,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:54:10,551 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 12 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:54:10,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 150 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:54:10,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-04 07:54:10,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 76. [2025-03-04 07:54:10,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 67 states have (on average 1.2686567164179106) internal successors, (85), 75 states have internal predecessors, (85), 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:54:10,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2025-03-04 07:54:10,555 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 17 [2025-03-04 07:54:10,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:54:10,555 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2025-03-04 07:54:10,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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:54:10,555 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2025-03-04 07:54:10,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 07:54:10,556 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:54:10,556 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:54:10,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 07:54:10,556 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 07:54:10,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:54:10,556 INFO L85 PathProgramCache]: Analyzing trace with hash -659682475, now seen corresponding path program 1 times [2025-03-04 07:54:10,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:54:10,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541375511] [2025-03-04 07:54:10,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:54:10,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:54:10,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 07:54:10,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 07:54:10,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:54:10,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 07:54:10,567 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 07:54:10,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 07:54:10,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 07:54:10,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:54:10,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 07:54:10,586 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 07:54:10,587 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 07:54:10,587 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (25 of 26 remaining) [2025-03-04 07:54:10,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (24 of 26 remaining) [2025-03-04 07:54:10,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 26 remaining) [2025-03-04 07:54:10,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 26 remaining) [2025-03-04 07:54:10,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 26 remaining) [2025-03-04 07:54:10,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 26 remaining) [2025-03-04 07:54:10,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 26 remaining) [2025-03-04 07:54:10,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 26 remaining) [2025-03-04 07:54:10,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 26 remaining) [2025-03-04 07:54:10,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 26 remaining) [2025-03-04 07:54:10,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 26 remaining) [2025-03-04 07:54:10,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 26 remaining) [2025-03-04 07:54:10,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 26 remaining) [2025-03-04 07:54:10,591 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 26 remaining) [2025-03-04 07:54:10,591 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 26 remaining) [2025-03-04 07:54:10,591 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 26 remaining) [2025-03-04 07:54:10,591 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 26 remaining) [2025-03-04 07:54:10,591 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 26 remaining) [2025-03-04 07:54:10,591 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 26 remaining) [2025-03-04 07:54:10,591 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 26 remaining) [2025-03-04 07:54:10,591 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 26 remaining) [2025-03-04 07:54:10,591 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 26 remaining) [2025-03-04 07:54:10,592 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 26 remaining) [2025-03-04 07:54:10,592 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 26 remaining) [2025-03-04 07:54:10,592 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 26 remaining) [2025-03-04 07:54:10,592 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 26 remaining) [2025-03-04 07:54:10,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 07:54:10,595 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:54:10,608 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 07:54:10,612 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 07:54:10 BoogieIcfgContainer [2025-03-04 07:54:10,612 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 07:54:10,613 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 07:54:10,613 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 07:54:10,613 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 07:54:10,614 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:54:08" (3/4) ... [2025-03-04 07:54:10,615 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 07:54:10,616 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 07:54:10,617 INFO L158 Benchmark]: Toolchain (without parser) took 2962.54ms. Allocated memory is still 142.6MB. Free memory was 107.1MB in the beginning and 93.4MB in the end (delta: 13.7MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. [2025-03-04 07:54:10,617 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:54:10,617 INFO L158 Benchmark]: CACSL2BoogieTranslator took 319.05ms. Allocated memory is still 142.6MB. Free memory was 107.1MB in the beginning and 90.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 07:54:10,618 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.78ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 88.1MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 07:54:10,618 INFO L158 Benchmark]: Boogie Preprocessor took 23.97ms. Allocated memory is still 142.6MB. Free memory was 88.1MB in the beginning and 87.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:54:10,618 INFO L158 Benchmark]: IcfgBuilder took 339.21ms. Allocated memory is still 142.6MB. Free memory was 86.1MB in the beginning and 69.1MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 07:54:10,619 INFO L158 Benchmark]: TraceAbstraction took 2245.95ms. Allocated memory is still 142.6MB. Free memory was 68.0MB in the beginning and 94.7MB in the end (delta: -26.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:54:10,619 INFO L158 Benchmark]: Witness Printer took 2.83ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 93.4MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:54:10,621 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.26ms. Allocated memory is still 201.3MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 319.05ms. Allocated memory is still 142.6MB. Free memory was 107.1MB in the beginning and 90.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.78ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 88.1MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.97ms. Allocated memory is still 142.6MB. Free memory was 88.1MB in the beginning and 87.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 339.21ms. Allocated memory is still 142.6MB. Free memory was 86.1MB in the beginning and 69.1MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2245.95ms. Allocated memory is still 142.6MB. Free memory was 68.0MB in the beginning and 94.7MB in the end (delta: -26.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.83ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 93.4MB in the end (delta: 41.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: 531]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 531. Possible FailurePath: [L532] List a = (List) malloc(sizeof(struct node)); [L533] COND FALSE !(a == 0) VAL [a={-1:0}] [L534] List t; [L535] List p = a; VAL [a={-1:0}, p={-1:0}] [L536] COND TRUE __VERIFIER_nondet_int() [L536] COND FALSE !(__VERIFIER_nondet_int()) [L543] COND TRUE __VERIFIER_nondet_int() [L543] COND FALSE !(__VERIFIER_nondet_int()) [L550] p->h = 3 [L551] p = a VAL [p={-1:0}] [L552] EXPR p->h [L552] COND FALSE !(p->h == 1) [L554] EXPR p->h [L554] COND FALSE !(p->h == 2) [L556] EXPR p->h [L556] COND FALSE !(p->h != 3) [L558] return 0; VAL [\result=0] - UnprovableResult [Line: 12]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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, 72 locations, 26 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 210 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 210 mSDsluCounter, 1009 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 685 mSDsCounter, 81 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 997 IncrementalHoareTripleChecker+Invalid, 1078 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 81 mSolverCounterUnsat, 324 mSDtfsCounter, 997 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=5, InterpolantAutomatonStates: 54, 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, 8 MinimizatonAttempts, 48 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 128 NumberOfCodeBlocks, 128 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 102 ConstructedInterpolants, 0 QuantifiedInterpolants, 469 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 14/14 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:54:10,636 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/list-properties/list-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 657efb2af25c5cc2c0afb2bbf76276caecae7904494acc21657e1ac1176685b7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:54:12,395 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:54:12,464 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-03-04 07:54:12,472 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:54:12,472 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:54:12,509 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:54:12,513 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:54:12,513 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:54:12,513 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:54:12,514 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:54:12,514 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:54:12,514 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:54:12,514 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:54:12,514 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:54:12,514 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:54:12,514 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:54:12,514 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:54:12,514 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:54:12,514 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:54:12,514 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:54:12,514 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:54:12,514 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:54:12,514 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 07:54:12,514 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:54:12,515 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:54:12,515 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 07:54:12,515 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 07:54:12,515 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:54:12,515 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:54:12,515 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:54:12,515 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:54:12,515 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:54:12,515 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:54:12,515 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:54:12,515 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:54:12,515 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:54:12,515 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:54:12,515 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:54:12,515 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 07:54:12,517 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 07:54:12,518 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:54:12,518 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:54:12,518 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:54:12,521 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:54:12,522 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 -> 657efb2af25c5cc2c0afb2bbf76276caecae7904494acc21657e1ac1176685b7 [2025-03-04 07:54:12,757 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:54:12,764 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:54:12,766 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:54:12,768 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:54:12,768 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:54:12,769 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/list-1.i [2025-03-04 07:54:13,892 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa1fb6289/5ff10e75c15c4922aa9bc509b467e09d/FLAG182fea922 [2025-03-04 07:54:14,176 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:54:14,176 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list-1.i [2025-03-04 07:54:14,189 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa1fb6289/5ff10e75c15c4922aa9bc509b467e09d/FLAG182fea922 [2025-03-04 07:54:14,204 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa1fb6289/5ff10e75c15c4922aa9bc509b467e09d [2025-03-04 07:54:14,207 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:54:14,208 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:54:14,209 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:54:14,209 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:54:14,213 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:54:14,213 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:54:14" (1/1) ... [2025-03-04 07:54:14,214 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46788d79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:54:14, skipping insertion in model container [2025-03-04 07:54:14,214 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:54:14" (1/1) ... [2025-03-04 07:54:14,235 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:54:14,456 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:54:14,469 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:54:14,511 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:54:14,536 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:54:14,536 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:54:14 WrapperNode [2025-03-04 07:54:14,537 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:54:14,537 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:54:14,538 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:54:14,538 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:54:14,542 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:54:14" (1/1) ... [2025-03-04 07:54:14,552 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:54:14" (1/1) ... [2025-03-04 07:54:14,567 INFO L138 Inliner]: procedures = 127, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 77 [2025-03-04 07:54:14,568 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:54:14,568 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:54:14,568 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:54:14,568 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:54:14,573 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:54:14" (1/1) ... [2025-03-04 07:54:14,573 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:54:14" (1/1) ... [2025-03-04 07:54:14,578 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:54:14" (1/1) ... [2025-03-04 07:54:14,598 INFO L175 MemorySlicer]: Split 14 memory accesses to 2 slices as follows [2, 12]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2025-03-04 07:54:14,599 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:54:14" (1/1) ... [2025-03-04 07:54:14,599 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:54:14" (1/1) ... [2025-03-04 07:54:14,609 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:54:14" (1/1) ... [2025-03-04 07:54:14,611 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:54:14" (1/1) ... [2025-03-04 07:54:14,613 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:54:14" (1/1) ... [2025-03-04 07:54:14,618 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:54:14" (1/1) ... [2025-03-04 07:54:14,620 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:54:14,621 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:54:14,621 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:54:14,621 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:54:14,621 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:54:14" (1/1) ... [2025-03-04 07:54:14,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:54:14,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:54:14,653 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:54:14,655 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:54:14,673 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2025-03-04 07:54:14,673 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2025-03-04 07:54:14,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-04 07:54:14,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-04 07:54:14,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 07:54:14,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 07:54:14,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 07:54:14,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 07:54:14,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 07:54:14,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 07:54:14,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-04 07:54:14,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-04 07:54:14,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 07:54:14,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 07:54:14,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:54:14,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:54:14,756 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:54:14,757 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:54:14,776 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2025-03-04 07:54:14,993 INFO L? ?]: Removed 63 outVars from TransFormulas that were not future-live. [2025-03-04 07:54:14,995 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:54:15,003 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:54:15,005 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:54:15,005 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:54:15 BoogieIcfgContainer [2025-03-04 07:54:15,005 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:54:15,007 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:54:15,008 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:54:15,011 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:54:15,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:54:14" (1/3) ... [2025-03-04 07:54:15,013 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b1d5a4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:54:15, skipping insertion in model container [2025-03-04 07:54:15,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:54:14" (2/3) ... [2025-03-04 07:54:15,014 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b1d5a4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:54:15, skipping insertion in model container [2025-03-04 07:54:15,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:54:15" (3/3) ... [2025-03-04 07:54:15,015 INFO L128 eAbstractionObserver]: Analyzing ICFG list-1.i [2025-03-04 07:54:15,025 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:54:15,026 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG list-1.i that has 2 procedures, 72 locations, 1 initial locations, 4 loop locations, and 26 error locations. [2025-03-04 07:54:15,061 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:54:15,069 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;@3a56e505, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:54:15,069 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-03-04 07:54:15,076 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 41 states have (on average 1.951219512195122) internal successors, (80), 69 states have internal predecessors, (80), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:54:15,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 07:54:15,079 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:54:15,080 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:54:15,080 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 07:54:15,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:54:15,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1438086350, now seen corresponding path program 1 times [2025-03-04 07:54:15,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:54:15,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [537890982] [2025-03-04 07:54:15,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:54:15,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:54:15,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:54:15,093 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:54:15,095 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:54:15,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 07:54:15,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 07:54:15,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:54:15,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:54:15,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 07:54:15,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:54:15,200 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:54:15,239 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:54:15,239 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:54:15,239 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:54:15,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537890982] [2025-03-04 07:54:15,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537890982] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:54:15,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:54:15,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:54:15,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672923201] [2025-03-04 07:54:15,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:54:15,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:54:15,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:54:15,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:54:15,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:54:15,264 INFO L87 Difference]: Start difference. First operand has 71 states, 41 states have (on average 1.951219512195122) internal successors, (80), 69 states have internal predecessors, (80), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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:54:15,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:54:15,455 INFO L93 Difference]: Finished difference Result 72 states and 85 transitions. [2025-03-04 07:54:15,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:54:15,459 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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:54:15,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:54:15,462 INFO L225 Difference]: With dead ends: 72 [2025-03-04 07:54:15,462 INFO L226 Difference]: Without dead ends: 65 [2025-03-04 07:54:15,464 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:54:15,465 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 61 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:54:15,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 66 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:54:15,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-04 07:54:15,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-03-04 07:54:15,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 46 states have (on average 1.6304347826086956) internal successors, (75), 64 states have internal predecessors, (75), 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:54:15,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2025-03-04 07:54:15,488 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 7 [2025-03-04 07:54:15,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:54:15,488 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2025-03-04 07:54:15,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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:54:15,488 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2025-03-04 07:54:15,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 07:54:15,489 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:54:15,489 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:54:15,496 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:54:15,689 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:54:15,690 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 07:54:15,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:54:15,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1438086351, now seen corresponding path program 1 times [2025-03-04 07:54:15,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:54:15,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1335512135] [2025-03-04 07:54:15,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:54:15,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:54:15,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:54:15,693 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:54:15,694 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:54:15,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 07:54:15,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 07:54:15,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:54:15,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:54:15,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 07:54:15,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:54:15,755 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:54:15,806 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:54:15,806 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:54:15,806 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:54:15,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335512135] [2025-03-04 07:54:15,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335512135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:54:15,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:54:15,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:54:15,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647952650] [2025-03-04 07:54:15,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:54:15,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:54:15,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:54:15,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:54:15,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:54:15,808 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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:54:15,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:54:15,991 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2025-03-04 07:54:15,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:54:15,992 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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:54:15,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:54:15,992 INFO L225 Difference]: With dead ends: 79 [2025-03-04 07:54:15,992 INFO L226 Difference]: Without dead ends: 79 [2025-03-04 07:54:15,993 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:54:15,993 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 59 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:54:15,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 69 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:54:15,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-04 07:54:15,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-03-04 07:54:15,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 60 states have (on average 1.45) internal successors, (87), 78 states have internal predecessors, (87), 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:54:15,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2025-03-04 07:54:16,000 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 7 [2025-03-04 07:54:16,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:54:16,000 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2025-03-04 07:54:16,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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:54:16,000 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2025-03-04 07:54:16,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 07:54:16,001 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:54:16,001 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:54:16,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 07:54:16,203 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:54:16,203 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 07:54:16,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:54:16,204 INFO L85 PathProgramCache]: Analyzing trace with hash 615093271, now seen corresponding path program 1 times [2025-03-04 07:54:16,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:54:16,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [572995570] [2025-03-04 07:54:16,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:54:16,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:54:16,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:54:16,208 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:54:16,210 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:54:16,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 07:54:16,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 07:54:16,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:54:16,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:54:16,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 07:54:16,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:54:16,271 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:54:16,286 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 19 treesize of output 1 [2025-03-04 07:54:16,315 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 23 treesize of output 11 [2025-03-04 07:54:16,335 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:54:16,335 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:54:16,335 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:54:16,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572995570] [2025-03-04 07:54:16,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572995570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:54:16,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:54:16,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:54:16,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911608922] [2025-03-04 07:54:16,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:54:16,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:54:16,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:54:16,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:54:16,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:54:16,337 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:54:16,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:54:16,561 INFO L93 Difference]: Finished difference Result 82 states and 93 transitions. [2025-03-04 07:54:16,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:54:16,562 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-04 07:54:16,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:54:16,563 INFO L225 Difference]: With dead ends: 82 [2025-03-04 07:54:16,563 INFO L226 Difference]: Without dead ends: 82 [2025-03-04 07:54:16,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:54:16,563 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 16 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:54:16,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 133 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:54:16,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-04 07:54:16,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-03-04 07:54:16,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 64 states have (on average 1.453125) internal successors, (93), 81 states have internal predecessors, (93), 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:54:16,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2025-03-04 07:54:16,571 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 93 transitions. Word has length 15 [2025-03-04 07:54:16,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:54:16,571 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 93 transitions. [2025-03-04 07:54:16,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:54:16,572 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2025-03-04 07:54:16,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 07:54:16,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:54:16,573 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:54:16,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 07:54:16,773 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:54:16,775 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 07:54:16,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:54:16,775 INFO L85 PathProgramCache]: Analyzing trace with hash 615093272, now seen corresponding path program 1 times [2025-03-04 07:54:16,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:54:16,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1878359479] [2025-03-04 07:54:16,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:54:16,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:54:16,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:54:16,777 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:54:16,779 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:54:16,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 07:54:16,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 07:54:16,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:54:16,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:54:16,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 07:54:16,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:54:16,830 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:54:16,850 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 19 treesize of output 1 [2025-03-04 07:54:16,855 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:54:16,877 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 21 treesize of output 9 [2025-03-04 07:54:16,911 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:54:16,911 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:54:16,911 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:54:16,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878359479] [2025-03-04 07:54:16,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878359479] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:54:16,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:54:16,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:54:16,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122222354] [2025-03-04 07:54:16,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:54:16,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:54:16,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:54:16,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:54:16,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:54:16,912 INFO L87 Difference]: Start difference. First operand 82 states and 93 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:54:17,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:54:17,156 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2025-03-04 07:54:17,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:54:17,156 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-04 07:54:17,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:54:17,157 INFO L225 Difference]: With dead ends: 83 [2025-03-04 07:54:17,157 INFO L226 Difference]: Without dead ends: 83 [2025-03-04 07:54:17,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:54:17,158 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 12 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:54:17,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 159 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:54:17,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-04 07:54:17,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 68. [2025-03-04 07:54:17,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 67 states have internal predecessors, (75), 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:54:17,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2025-03-04 07:54:17,164 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 15 [2025-03-04 07:54:17,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:54:17,164 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2025-03-04 07:54:17,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:54:17,164 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2025-03-04 07:54:17,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 07:54:17,164 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:54:17,164 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:54:17,172 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:54:17,367 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:54:17,367 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 07:54:17,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:54:17,367 INFO L85 PathProgramCache]: Analyzing trace with hash -366526995, now seen corresponding path program 1 times [2025-03-04 07:54:17,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:54:17,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [396828810] [2025-03-04 07:54:17,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:54:17,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:54:17,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:54:17,370 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:54:17,371 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:54:17,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 07:54:17,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 07:54:17,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:54:17,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:54:17,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 07:54:17,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:54:17,451 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:54:17,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:54:17,479 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:54:17,479 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:54:17,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396828810] [2025-03-04 07:54:17,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396828810] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:54:17,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:54:17,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:54:17,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138562025] [2025-03-04 07:54:17,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:54:17,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:54:17,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:54:17,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:54:17,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:54:17,480 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:54:17,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:54:17,650 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2025-03-04 07:54:17,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:54:17,650 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-04 07:54:17,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:54:17,651 INFO L225 Difference]: With dead ends: 90 [2025-03-04 07:54:17,651 INFO L226 Difference]: Without dead ends: 90 [2025-03-04 07:54:17,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:54:17,652 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 15 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:54:17,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 165 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:54:17,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-04 07:54:17,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 76. [2025-03-04 07:54:17,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 61 states have (on average 1.3934426229508197) internal successors, (85), 75 states have internal predecessors, (85), 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:54:17,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2025-03-04 07:54:17,656 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 15 [2025-03-04 07:54:17,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:54:17,656 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2025-03-04 07:54:17,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:54:17,657 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2025-03-04 07:54:17,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-04 07:54:17,658 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:54:17,658 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:54:17,664 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:54:17,858 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:54:17,859 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 07:54:17,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:54:17,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1863210886, now seen corresponding path program 1 times [2025-03-04 07:54:17,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:54:17,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [429645745] [2025-03-04 07:54:17,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:54:17,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:54:17,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:54:17,861 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:54:17,862 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:54:17,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 07:54:17,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 07:54:17,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:54:17,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:54:17,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 07:54:17,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:54:17,917 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:54:17,931 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 19 treesize of output 1 [2025-03-04 07:54:17,943 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 23 treesize of output 11 [2025-03-04 07:54:17,962 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:54:17,962 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:54:17,963 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:54:17,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429645745] [2025-03-04 07:54:17,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429645745] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:54:17,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:54:17,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:54:17,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367862745] [2025-03-04 07:54:17,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:54:17,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:54:17,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:54:17,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:54:17,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:54:17,964 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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:54:18,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:54:18,133 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2025-03-04 07:54:18,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:54:18,134 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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 17 [2025-03-04 07:54:18,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:54:18,134 INFO L225 Difference]: With dead ends: 74 [2025-03-04 07:54:18,134 INFO L226 Difference]: Without dead ends: 74 [2025-03-04 07:54:18,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:54:18,135 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 12 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:54:18,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 122 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:54:18,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-04 07:54:18,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-03-04 07:54:18,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 61 states have (on average 1.360655737704918) internal successors, (83), 73 states have internal predecessors, (83), 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:54:18,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2025-03-04 07:54:18,138 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 17 [2025-03-04 07:54:18,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:54:18,138 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2025-03-04 07:54:18,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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:54:18,138 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2025-03-04 07:54:18,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-04 07:54:18,138 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:54:18,138 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:54:18,146 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:54:18,343 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:54:18,343 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 07:54:18,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:54:18,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1863210887, now seen corresponding path program 1 times [2025-03-04 07:54:18,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:54:18,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [454579228] [2025-03-04 07:54:18,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:54:18,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:54:18,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:54:18,346 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:54:18,347 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:54:18,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 07:54:18,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 07:54:18,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:54:18,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:54:18,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 07:54:18,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:54:18,405 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:54:18,429 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:54:18,438 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 19 treesize of output 1 [2025-03-04 07:54:18,457 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 21 treesize of output 9 [2025-03-04 07:54:18,493 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:54:18,493 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:54:18,493 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:54:18,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454579228] [2025-03-04 07:54:18,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [454579228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:54:18,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:54:18,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:54:18,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163419409] [2025-03-04 07:54:18,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:54:18,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:54:18,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:54:18,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:54:18,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:54:18,494 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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:54:18,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:54:18,702 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2025-03-04 07:54:18,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:54:18,703 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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 17 [2025-03-04 07:54:18,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:54:18,703 INFO L225 Difference]: With dead ends: 70 [2025-03-04 07:54:18,703 INFO L226 Difference]: Without dead ends: 70 [2025-03-04 07:54:18,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:54:18,704 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 5 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:54:18,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 139 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:54:18,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-04 07:54:18,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 62. [2025-03-04 07:54:18,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 53 states have (on average 1.320754716981132) internal successors, (70), 61 states have internal predecessors, (70), 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:54:18,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2025-03-04 07:54:18,707 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 17 [2025-03-04 07:54:18,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:54:18,707 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2025-03-04 07:54:18,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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:54:18,707 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2025-03-04 07:54:18,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-04 07:54:18,707 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:54:18,707 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:54:18,717 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:54:18,908 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:54:18,908 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 07:54:18,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:54:18,908 INFO L85 PathProgramCache]: Analyzing trace with hash -21305884, now seen corresponding path program 1 times [2025-03-04 07:54:18,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:54:18,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [528471741] [2025-03-04 07:54:18,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:54:18,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:54:18,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:54:18,910 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:54:18,911 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:54:18,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 07:54:18,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 07:54:18,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:54:18,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:54:18,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 07:54:18,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:54:18,984 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:54:19,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:54:19,012 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:54:19,013 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 07:54:19,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528471741] [2025-03-04 07:54:19,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528471741] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:54:19,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:54:19,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:54:19,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423517073] [2025-03-04 07:54:19,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:54:19,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:54:19,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 07:54:19,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:54:19,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:54:19,013 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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:54:19,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:54:19,152 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2025-03-04 07:54:19,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:54:19,153 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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 17 [2025-03-04 07:54:19,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:54:19,153 INFO L225 Difference]: With dead ends: 75 [2025-03-04 07:54:19,153 INFO L226 Difference]: Without dead ends: 75 [2025-03-04 07:54:19,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:54:19,154 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 12 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:54:19,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 150 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:54:19,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-04 07:54:19,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 64. [2025-03-04 07:54:19,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 55 states have (on average 1.309090909090909) internal successors, (72), 63 states have internal predecessors, (72), 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:54:19,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2025-03-04 07:54:19,156 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 17 [2025-03-04 07:54:19,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:54:19,156 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2025-03-04 07:54:19,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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:54:19,157 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2025-03-04 07:54:19,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 07:54:19,157 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:54:19,157 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:54:19,163 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:54:19,357 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:54:19,358 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-04 07:54:19,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:54:19,358 INFO L85 PathProgramCache]: Analyzing trace with hash -659682475, now seen corresponding path program 1 times [2025-03-04 07:54:19,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 07:54:19,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [784435804] [2025-03-04 07:54:19,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:54:19,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:54:19,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:54:19,360 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:54:19,361 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:54:19,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 07:54:19,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 07:54:19,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:54:19,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 07:54:19,409 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 07:54:19,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 07:54:19,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 07:54:19,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:54:19,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 07:54:19,443 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-03-04 07:54:19,443 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 07:54:19,444 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (25 of 26 remaining) [2025-03-04 07:54:19,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (24 of 26 remaining) [2025-03-04 07:54:19,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 26 remaining) [2025-03-04 07:54:19,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 26 remaining) [2025-03-04 07:54:19,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 26 remaining) [2025-03-04 07:54:19,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 26 remaining) [2025-03-04 07:54:19,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 26 remaining) [2025-03-04 07:54:19,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 26 remaining) [2025-03-04 07:54:19,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 26 remaining) [2025-03-04 07:54:19,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 26 remaining) [2025-03-04 07:54:19,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 26 remaining) [2025-03-04 07:54:19,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 26 remaining) [2025-03-04 07:54:19,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 26 remaining) [2025-03-04 07:54:19,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 26 remaining) [2025-03-04 07:54:19,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 26 remaining) [2025-03-04 07:54:19,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 26 remaining) [2025-03-04 07:54:19,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 26 remaining) [2025-03-04 07:54:19,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 26 remaining) [2025-03-04 07:54:19,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 26 remaining) [2025-03-04 07:54:19,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 26 remaining) [2025-03-04 07:54:19,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 26 remaining) [2025-03-04 07:54:19,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 26 remaining) [2025-03-04 07:54:19,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 26 remaining) [2025-03-04 07:54:19,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 26 remaining) [2025-03-04 07:54:19,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 26 remaining) [2025-03-04 07:54:19,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 26 remaining) [2025-03-04 07:54:19,453 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:54:19,647 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:54:19,649 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:54:19,660 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 07:54:19,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 07:54:19 BoogieIcfgContainer [2025-03-04 07:54:19,662 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 07:54:19,662 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 07:54:19,662 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 07:54:19,663 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 07:54:19,663 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:54:15" (3/4) ... [2025-03-04 07:54:19,664 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 07:54:19,665 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 07:54:19,665 INFO L158 Benchmark]: Toolchain (without parser) took 5457.45ms. Allocated memory was 117.4MB in the beginning and 234.9MB in the end (delta: 117.4MB). Free memory was 90.9MB in the beginning and 110.2MB in the end (delta: -19.3MB). Peak memory consumption was 98.3MB. Max. memory is 16.1GB. [2025-03-04 07:54:19,665 INFO L158 Benchmark]: CDTParser took 0.72ms. Allocated memory is still 117.4MB. Free memory is still 82.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:54:19,666 INFO L158 Benchmark]: CACSL2BoogieTranslator took 327.85ms. Allocated memory is still 117.4MB. Free memory was 90.7MB in the beginning and 72.8MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 07:54:19,666 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.55ms. Allocated memory is still 117.4MB. Free memory was 72.8MB in the beginning and 71.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:54:19,666 INFO L158 Benchmark]: Boogie Preprocessor took 51.62ms. Allocated memory is still 117.4MB. Free memory was 71.1MB in the beginning and 69.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:54:19,666 INFO L158 Benchmark]: IcfgBuilder took 385.17ms. Allocated memory is still 117.4MB. Free memory was 69.3MB in the beginning and 48.3MB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 07:54:19,666 INFO L158 Benchmark]: TraceAbstraction took 4654.63ms. Allocated memory was 117.4MB in the beginning and 234.9MB in the end (delta: 117.4MB). Free memory was 47.7MB in the beginning and 110.3MB in the end (delta: -62.6MB). Peak memory consumption was 56.4MB. Max. memory is 16.1GB. [2025-03-04 07:54:19,666 INFO L158 Benchmark]: Witness Printer took 2.38ms. Allocated memory is still 234.9MB. Free memory was 110.3MB in the beginning and 110.2MB in the end (delta: 35.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:54:19,667 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.72ms. Allocated memory is still 117.4MB. Free memory is still 82.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 327.85ms. Allocated memory is still 117.4MB. Free memory was 90.7MB in the beginning and 72.8MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.55ms. Allocated memory is still 117.4MB. Free memory was 72.8MB in the beginning and 71.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 51.62ms. Allocated memory is still 117.4MB. Free memory was 71.1MB in the beginning and 69.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 385.17ms. Allocated memory is still 117.4MB. Free memory was 69.3MB in the beginning and 48.3MB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4654.63ms. Allocated memory was 117.4MB in the beginning and 234.9MB in the end (delta: 117.4MB). Free memory was 47.7MB in the beginning and 110.3MB in the end (delta: -62.6MB). Peak memory consumption was 56.4MB. Max. memory is 16.1GB. * Witness Printer took 2.38ms. Allocated memory is still 234.9MB. Free memory was 110.3MB in the beginning and 110.2MB in the end (delta: 35.5kB). 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: 531]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 531. Possible FailurePath: [L532] List a = (List) malloc(sizeof(struct node)); [L533] COND FALSE !(a == 0) VAL [a={3:0}] [L534] List t; [L535] List p = a; VAL [a={3:0}, p={3:0}] [L536] COND TRUE __VERIFIER_nondet_int() [L536] COND FALSE !(__VERIFIER_nondet_int()) [L543] COND TRUE __VERIFIER_nondet_int() [L543] COND FALSE !(__VERIFIER_nondet_int()) [L550] p->h = 3 [L551] p = a VAL [p={3:0}] [L552] EXPR p->h [L552] COND FALSE !(p->h == 1) [L554] EXPR p->h [L554] COND FALSE !(p->h == 2) [L556] EXPR p->h [L556] COND FALSE !(p->h != 3) [L558] return 0; VAL [\result=0] - UnprovableResult [Line: 12]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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, 72 locations, 26 error locations. Started 1 CEGAR loops. OverallTime: 4.6s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 192 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 192 mSDsluCounter, 1003 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 680 mSDsCounter, 73 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 984 IncrementalHoareTripleChecker+Invalid, 1057 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 73 mSolverCounterUnsat, 323 mSDtfsCounter, 984 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=3, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 48 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 128 NumberOfCodeBlocks, 128 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 102 ConstructedInterpolants, 0 QuantifiedInterpolants, 504 SizeOfPredicates, 15 NumberOfNonLiveVariables, 460 ConjunctsInSsa, 70 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 14/14 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:54:19,679 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