./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-memory-alloca/c.01-no-inv-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-memory-alloca/c.01-no-inv-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash f49dce48b63f0ee8eed4ac47c25c384a83e3c23200b58c130c184e2b953e32f3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:30:19,686 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:30:19,741 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-03-04 07:30:19,745 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:30:19,746 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:30:19,762 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:30:19,763 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:30:19,763 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:30:19,763 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:30:19,764 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:30:19,764 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:30:19,764 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:30:19,765 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:30:19,765 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:30:19,765 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:30:19,765 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:30:19,765 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:30:19,765 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:30:19,766 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:30:19,766 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:30:19,766 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 07:30:19,766 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:30:19,766 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:30:19,766 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:30:19,766 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:30:19,766 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:30:19,766 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:30:19,766 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:30:19,766 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:30:19,766 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:30:19,766 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:30:19,766 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:30:19,766 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:30:19,766 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:30:19,766 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:30:19,767 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:30:19,767 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:30:19,767 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:30:19,767 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:30:19,767 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f49dce48b63f0ee8eed4ac47c25c384a83e3c23200b58c130c184e2b953e32f3 [2025-03-04 07:30:19,975 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:30:19,980 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:30:19,982 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:30:19,982 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:30:19,983 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:30:19,983 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/c.01-no-inv-alloca.i [2025-03-04 07:30:21,112 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a667234cd/7514e82ea0a74a8994e70ada6a524ebc/FLAG642f12bb6 [2025-03-04 07:30:21,384 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:30:21,385 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/c.01-no-inv-alloca.i [2025-03-04 07:30:21,393 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a667234cd/7514e82ea0a74a8994e70ada6a524ebc/FLAG642f12bb6 [2025-03-04 07:30:21,680 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a667234cd/7514e82ea0a74a8994e70ada6a524ebc [2025-03-04 07:30:21,683 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:30:21,684 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:30:21,685 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:30:21,685 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:30:21,688 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:30:21,688 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:30:21" (1/1) ... [2025-03-04 07:30:21,689 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@207b3483 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:30:21, skipping insertion in model container [2025-03-04 07:30:21,689 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:30:21" (1/1) ... [2025-03-04 07:30:21,709 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:30:21,862 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:30:21,870 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:30:21,901 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:30:21,916 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:30:21,916 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:30:21 WrapperNode [2025-03-04 07:30:21,917 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:30:21,917 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:30:21,917 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:30:21,917 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:30:21,921 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:30:21" (1/1) ... [2025-03-04 07:30:21,928 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:30:21" (1/1) ... [2025-03-04 07:30:21,938 INFO L138 Inliner]: procedures = 111, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 76 [2025-03-04 07:30:21,939 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:30:21,939 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:30:21,939 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:30:21,939 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:30:21,944 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:30:21" (1/1) ... [2025-03-04 07:30:21,944 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:30:21" (1/1) ... [2025-03-04 07:30:21,945 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:30:21" (1/1) ... [2025-03-04 07:30:21,952 INFO L175 MemorySlicer]: Split 13 memory accesses to 3 slices as follows [6, 2, 5]. 46 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0]. The 6 writes are split as follows [3, 1, 2]. [2025-03-04 07:30:21,952 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:30:21" (1/1) ... [2025-03-04 07:30:21,953 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:30:21" (1/1) ... [2025-03-04 07:30:21,956 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:30:21" (1/1) ... [2025-03-04 07:30:21,956 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:30:21" (1/1) ... [2025-03-04 07:30:21,957 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:30:21" (1/1) ... [2025-03-04 07:30:21,958 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:30:21" (1/1) ... [2025-03-04 07:30:21,959 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:30:21,959 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:30:21,959 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:30:21,959 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:30:21,960 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:30:21" (1/1) ... [2025-03-04 07:30:21,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:30:21,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:30:21,987 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 07:30:21,989 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:30:22,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 07:30:22,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 07:30:22,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 07:30:22,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 07:30:22,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 07:30:22,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 07:30:22,006 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 07:30:22,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:30:22,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:30:22,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:30:22,088 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:30:22,089 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:30:22,223 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L565: havoc main_#t~nondet13#1;havoc main_#t~nondet14#1;havoc main_#t~ret15#1; [2025-03-04 07:30:22,223 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L562: havoc test_fun_#t~mem12#1;call ULTIMATE.dealloc(test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset);havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call ULTIMATE.dealloc(test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset);havoc test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call ULTIMATE.dealloc(test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset);havoc test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset; [2025-03-04 07:30:22,238 INFO L? ?]: Removed 61 outVars from TransFormulas that were not future-live. [2025-03-04 07:30:22,238 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:30:22,244 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:30:22,244 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:30:22,246 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:30:22 BoogieIcfgContainer [2025-03-04 07:30:22,246 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:30:22,248 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:30:22,248 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:30:22,251 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:30:22,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:30:21" (1/3) ... [2025-03-04 07:30:22,253 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28c7abe0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:30:22, skipping insertion in model container [2025-03-04 07:30:22,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:30:21" (2/3) ... [2025-03-04 07:30:22,254 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28c7abe0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:30:22, skipping insertion in model container [2025-03-04 07:30:22,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:30:22" (3/3) ... [2025-03-04 07:30:22,255 INFO L128 eAbstractionObserver]: Analyzing ICFG c.01-no-inv-alloca.i [2025-03-04 07:30:22,265 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:30:22,267 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG c.01-no-inv-alloca.i that has 1 procedures, 54 locations, 1 initial locations, 2 loop locations, and 27 error locations. [2025-03-04 07:30:22,302 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:30:22,311 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;@515372d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:30:22,312 INFO L334 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2025-03-04 07:30:22,315 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 26 states have (on average 2.230769230769231) internal successors, (58), 53 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:30:22,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-04 07:30:22,320 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:30:22,321 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-04 07:30:22,321 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-03-04 07:30:22,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:30:22,325 INFO L85 PathProgramCache]: Analyzing trace with hash 89337, now seen corresponding path program 1 times [2025-03-04 07:30:22,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:30:22,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838075902] [2025-03-04 07:30:22,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:30:22,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:30:22,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 07:30:22,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 07:30:22,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:30:22,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:30:22,593 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:30:22,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:30:22,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838075902] [2025-03-04 07:30:22,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838075902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:30:22,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:30:22,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:30:22,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162462782] [2025-03-04 07:30:22,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:30:22,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:30:22,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:30:22,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:30:22,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:30:22,621 INFO L87 Difference]: Start difference. First operand has 54 states, 26 states have (on average 2.230769230769231) internal successors, (58), 53 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:30:22,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:30:22,689 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2025-03-04 07:30:22,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:30:22,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-04 07:30:22,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:30:22,698 INFO L225 Difference]: With dead ends: 49 [2025-03-04 07:30:22,699 INFO L226 Difference]: Without dead ends: 47 [2025-03-04 07:30:22,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:30:22,703 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 39 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:30:22,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 25 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:30:22,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-04 07:30:22,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-03-04 07:30:22,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 25 states have (on average 1.96) internal successors, (49), 46 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:30:22,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2025-03-04 07:30:22,728 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 3 [2025-03-04 07:30:22,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:30:22,729 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2025-03-04 07:30:22,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:30:22,729 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2025-03-04 07:30:22,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-04 07:30:22,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:30:22,729 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-04 07:30:22,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 07:30:22,729 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-03-04 07:30:22,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:30:22,731 INFO L85 PathProgramCache]: Analyzing trace with hash 89338, now seen corresponding path program 1 times [2025-03-04 07:30:22,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:30:22,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411322986] [2025-03-04 07:30:22,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:30:22,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:30:22,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 07:30:22,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 07:30:22,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:30:22,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:30:22,867 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:30:22,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:30:22,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411322986] [2025-03-04 07:30:22,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411322986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:30:22,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:30:22,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:30:22,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115756527] [2025-03-04 07:30:22,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:30:22,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:30:22,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:30:22,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:30:22,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:30:22,870 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:30:22,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:30:22,907 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2025-03-04 07:30:22,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:30:22,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-04 07:30:22,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:30:22,908 INFO L225 Difference]: With dead ends: 42 [2025-03-04 07:30:22,908 INFO L226 Difference]: Without dead ends: 42 [2025-03-04 07:30:22,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:30:22,908 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 40 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:30:22,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 25 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:30:22,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-04 07:30:22,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-03-04 07:30:22,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 25 states have (on average 1.76) internal successors, (44), 41 states have internal predecessors, (44), 0 states have call successors, (0), 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:30:22,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2025-03-04 07:30:22,911 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 3 [2025-03-04 07:30:22,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:30:22,911 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2025-03-04 07:30:22,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:30:22,911 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2025-03-04 07:30:22,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 07:30:22,911 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:30:22,911 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 07:30:22,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 07:30:22,911 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-03-04 07:30:22,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:30:22,912 INFO L85 PathProgramCache]: Analyzing trace with hash 2769470, now seen corresponding path program 1 times [2025-03-04 07:30:22,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:30:22,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399878963] [2025-03-04 07:30:22,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:30:22,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:30:22,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 07:30:22,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 07:30:22,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:30:22,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:30:23,011 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:30:23,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:30:23,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399878963] [2025-03-04 07:30:23,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399878963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:30:23,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:30:23,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:30:23,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411159618] [2025-03-04 07:30:23,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:30:23,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:30:23,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:30:23,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:30:23,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:30:23,013 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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:30:23,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:30:23,053 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2025-03-04 07:30:23,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:30:23,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2025-03-04 07:30:23,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:30:23,055 INFO L225 Difference]: With dead ends: 36 [2025-03-04 07:30:23,055 INFO L226 Difference]: Without dead ends: 36 [2025-03-04 07:30:23,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:30:23,057 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 26 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:30:23,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 16 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:30:23,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-04 07:30:23,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-03-04 07:30:23,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 25 states have (on average 1.52) internal successors, (38), 35 states have internal predecessors, (38), 0 states have call successors, (0), 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:30:23,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2025-03-04 07:30:23,059 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 4 [2025-03-04 07:30:23,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:30:23,059 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2025-03-04 07:30:23,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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:30:23,059 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2025-03-04 07:30:23,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 07:30:23,059 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:30:23,059 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 07:30:23,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 07:30:23,059 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-03-04 07:30:23,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:30:23,061 INFO L85 PathProgramCache]: Analyzing trace with hash 2769471, now seen corresponding path program 1 times [2025-03-04 07:30:23,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:30:23,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735967485] [2025-03-04 07:30:23,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:30:23,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:30:23,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 07:30:23,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 07:30:23,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:30:23,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:30:23,149 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:30:23,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:30:23,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735967485] [2025-03-04 07:30:23,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735967485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:30:23,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:30:23,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:30:23,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511652971] [2025-03-04 07:30:23,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:30:23,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:30:23,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:30:23,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:30:23,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:30:23,150 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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:30:23,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:30:23,171 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2025-03-04 07:30:23,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:30:23,172 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2025-03-04 07:30:23,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:30:23,172 INFO L225 Difference]: With dead ends: 30 [2025-03-04 07:30:23,172 INFO L226 Difference]: Without dead ends: 30 [2025-03-04 07:30:23,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:30:23,173 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 27 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:30:23,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 19 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:30:23,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-04 07:30:23,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-03-04 07:30:23,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.28) internal successors, (32), 29 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:30:23,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2025-03-04 07:30:23,175 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 4 [2025-03-04 07:30:23,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:30:23,175 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2025-03-04 07:30:23,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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:30:23,175 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2025-03-04 07:30:23,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 07:30:23,175 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:30:23,175 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 07:30:23,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 07:30:23,175 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-03-04 07:30:23,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:30:23,175 INFO L85 PathProgramCache]: Analyzing trace with hash 85853590, now seen corresponding path program 1 times [2025-03-04 07:30:23,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:30:23,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057101998] [2025-03-04 07:30:23,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:30:23,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:30:23,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 07:30:23,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 07:30:23,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:30:23,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:30:23,215 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:30:23,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:30:23,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057101998] [2025-03-04 07:30:23,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057101998] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:30:23,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:30:23,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:30:23,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093995123] [2025-03-04 07:30:23,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:30:23,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:30:23,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:30:23,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:30:23,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:30:23,217 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:30:23,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:30:23,244 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2025-03-04 07:30:23,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:30:23,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-04 07:30:23,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:30:23,245 INFO L225 Difference]: With dead ends: 28 [2025-03-04 07:30:23,245 INFO L226 Difference]: Without dead ends: 28 [2025-03-04 07:30:23,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:30:23,245 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 20 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:30:23,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 15 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:30:23,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-04 07:30:23,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-04 07:30:23,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 25 states have (on average 1.2) internal successors, (30), 27 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:30:23,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2025-03-04 07:30:23,247 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 5 [2025-03-04 07:30:23,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:30:23,247 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2025-03-04 07:30:23,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:30:23,247 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2025-03-04 07:30:23,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 07:30:23,247 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:30:23,247 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 07:30:23,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 07:30:23,248 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-03-04 07:30:23,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:30:23,248 INFO L85 PathProgramCache]: Analyzing trace with hash 85853591, now seen corresponding path program 1 times [2025-03-04 07:30:23,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:30:23,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267241065] [2025-03-04 07:30:23,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:30:23,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:30:23,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 07:30:23,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 07:30:23,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:30:23,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:30:23,305 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:30:23,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:30:23,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267241065] [2025-03-04 07:30:23,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267241065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:30:23,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:30:23,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:30:23,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151140927] [2025-03-04 07:30:23,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:30:23,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:30:23,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:30:23,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:30:23,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:30:23,306 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:30:23,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:30:23,329 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2025-03-04 07:30:23,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:30:23,329 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-04 07:30:23,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:30:23,329 INFO L225 Difference]: With dead ends: 26 [2025-03-04 07:30:23,329 INFO L226 Difference]: Without dead ends: 26 [2025-03-04 07:30:23,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:30:23,330 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:30:23,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 18 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:30:23,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-04 07:30:23,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-03-04 07:30:23,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:30:23,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2025-03-04 07:30:23,331 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 5 [2025-03-04 07:30:23,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:30:23,332 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2025-03-04 07:30:23,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:30:23,332 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2025-03-04 07:30:23,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-04 07:30:23,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:30:23,332 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:30:23,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 07:30:23,332 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2025-03-04 07:30:23,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:30:23,335 INFO L85 PathProgramCache]: Analyzing trace with hash -792490544, now seen corresponding path program 1 times [2025-03-04 07:30:23,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:30:23,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954111123] [2025-03-04 07:30:23,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:30:23,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:30:23,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 07:30:23,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 07:30:23,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:30:23,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:30:23,526 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:30:23,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:30:23,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954111123] [2025-03-04 07:30:23,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954111123] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:30:23,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:30:23,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:30:23,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605671552] [2025-03-04 07:30:23,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:30:23,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:30:23,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:30:23,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:30:23,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:30:23,528 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:30:23,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:30:23,557 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2025-03-04 07:30:23,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:30:23,558 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-04 07:30:23,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:30:23,558 INFO L225 Difference]: With dead ends: 25 [2025-03-04 07:30:23,558 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 07:30:23,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:30:23,559 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 17 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:30:23,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 23 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:30:23,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 07:30:23,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 07:30:23,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:30:23,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 07:30:23,560 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2025-03-04 07:30:23,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:30:23,560 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 07:30:23,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:30:23,560 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 07:30:23,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 07:30:23,562 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (26 of 27 remaining) [2025-03-04 07:30:23,562 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 27 remaining) [2025-03-04 07:30:23,562 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 27 remaining) [2025-03-04 07:30:23,563 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 27 remaining) [2025-03-04 07:30:23,563 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 27 remaining) [2025-03-04 07:30:23,563 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 27 remaining) [2025-03-04 07:30:23,563 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 27 remaining) [2025-03-04 07:30:23,563 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 27 remaining) [2025-03-04 07:30:23,563 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 27 remaining) [2025-03-04 07:30:23,563 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 27 remaining) [2025-03-04 07:30:23,563 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 27 remaining) [2025-03-04 07:30:23,563 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 27 remaining) [2025-03-04 07:30:23,563 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 27 remaining) [2025-03-04 07:30:23,563 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 27 remaining) [2025-03-04 07:30:23,564 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 27 remaining) [2025-03-04 07:30:23,564 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 27 remaining) [2025-03-04 07:30:23,564 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 27 remaining) [2025-03-04 07:30:23,564 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 27 remaining) [2025-03-04 07:30:23,564 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 27 remaining) [2025-03-04 07:30:23,564 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 27 remaining) [2025-03-04 07:30:23,564 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 27 remaining) [2025-03-04 07:30:23,564 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 27 remaining) [2025-03-04 07:30:23,565 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 27 remaining) [2025-03-04 07:30:23,565 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 27 remaining) [2025-03-04 07:30:23,565 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 27 remaining) [2025-03-04 07:30:23,565 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 27 remaining) [2025-03-04 07:30:23,565 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 27 remaining) [2025-03-04 07:30:23,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 07:30:23,567 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:30:23,569 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 07:30:23,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 07:30:23 BoogieIcfgContainer [2025-03-04 07:30:23,572 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 07:30:23,572 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 07:30:23,573 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 07:30:23,573 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 07:30:23,573 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:30:22" (3/4) ... [2025-03-04 07:30:23,575 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 07:30:23,583 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-03-04 07:30:23,583 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-04 07:30:23,583 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-04 07:30:23,583 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 07:30:23,643 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 07:30:23,643 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 07:30:23,643 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 07:30:23,644 INFO L158 Benchmark]: Toolchain (without parser) took 1959.64ms. Allocated memory is still 167.8MB. Free memory was 132.3MB in the beginning and 117.3MB in the end (delta: 15.0MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. [2025-03-04 07:30:23,646 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:30:23,646 INFO L158 Benchmark]: CACSL2BoogieTranslator took 231.92ms. Allocated memory is still 167.8MB. Free memory was 131.8MB in the beginning and 115.9MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 07:30:23,646 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.54ms. Allocated memory is still 167.8MB. Free memory was 115.9MB in the beginning and 114.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:30:23,646 INFO L158 Benchmark]: Boogie Preprocessor took 19.48ms. Allocated memory is still 167.8MB. Free memory was 114.6MB in the beginning and 113.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:30:23,646 INFO L158 Benchmark]: IcfgBuilder took 286.97ms. Allocated memory is still 167.8MB. Free memory was 112.7MB in the beginning and 96.1MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 07:30:23,646 INFO L158 Benchmark]: TraceAbstraction took 1323.97ms. Allocated memory is still 167.8MB. Free memory was 95.7MB in the beginning and 123.4MB in the end (delta: -27.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:30:23,647 INFO L158 Benchmark]: Witness Printer took 70.59ms. Allocated memory is still 167.8MB. Free memory was 123.4MB in the beginning and 117.3MB in the end (delta: 6.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:30:23,648 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 231.92ms. Allocated memory is still 167.8MB. Free memory was 131.8MB in the beginning and 115.9MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.54ms. Allocated memory is still 167.8MB. Free memory was 115.9MB in the beginning and 114.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 19.48ms. Allocated memory is still 167.8MB. Free memory was 114.6MB in the beginning and 113.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 286.97ms. Allocated memory is still 167.8MB. Free memory was 112.7MB in the beginning and 96.1MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1323.97ms. Allocated memory is still 167.8MB. Free memory was 95.7MB in the beginning and 123.4MB in the end (delta: -27.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 70.59ms. Allocated memory is still 167.8MB. Free memory was 123.4MB in the beginning and 117.3MB in the end (delta: 6.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 564]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 54 locations, 27 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 189 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 189 mSDsluCounter, 141 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 18 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 176 IncrementalHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 123 mSDtfsCounter, 176 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=0, InterpolantAutomatonStates: 22, 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, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 35 NumberOfCodeBlocks, 35 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 28 ConstructedInterpolants, 0 QuantifiedInterpolants, 272 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 27 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 07:30:23,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE