./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/forester-heap/sll-token-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/sll-token-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 10f8c5ed101296da8e76853e36294f37ed1d85898917b59e645db1ac667d60a8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:48:59,547 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:48:59,599 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2025-02-08 05:48:59,602 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:48:59,603 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:48:59,630 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:48:59,630 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:48:59,630 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:48:59,631 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 05:48:59,631 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 05:48:59,631 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:48:59,631 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:48:59,631 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:48:59,631 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:48:59,631 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:48:59,631 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:48:59,631 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:48:59,631 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:48:59,632 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:48:59,632 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:48:59,632 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:48:59,632 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:48:59,632 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 05:48:59,632 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 05:48:59,632 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:48:59,632 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:48:59,632 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 05:48:59,632 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:48:59,632 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:48:59,632 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:48:59,632 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:48:59,632 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:48:59,633 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:48:59,633 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:48:59,633 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 05:48:59,633 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:48:59,633 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:48:59,633 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:48:59,633 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:48:59,633 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:48:59,633 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:48:59,633 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:48:59,633 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:48:59,634 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:48:59,634 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:48:59,634 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 10f8c5ed101296da8e76853e36294f37ed1d85898917b59e645db1ac667d60a8 [2025-02-08 05:48:59,894 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:48:59,906 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:48:59,909 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:48:59,911 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:48:59,911 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:48:59,914 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-token-1.i [2025-02-08 05:49:01,302 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ca8a2fe0e/c120e3b0316e40f6a1eb28e2db8137dc/FLAGa1debdd53 [2025-02-08 05:49:01,665 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:49:01,667 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-token-1.i [2025-02-08 05:49:01,682 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ca8a2fe0e/c120e3b0316e40f6a1eb28e2db8137dc/FLAGa1debdd53 [2025-02-08 05:49:01,701 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ca8a2fe0e/c120e3b0316e40f6a1eb28e2db8137dc [2025-02-08 05:49:01,704 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:49:01,706 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:49:01,708 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:49:01,711 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:49:01,716 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:49:01,717 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:49:01" (1/1) ... [2025-02-08 05:49:01,718 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@472b8c99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:01, skipping insertion in model container [2025-02-08 05:49:01,720 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:49:01" (1/1) ... [2025-02-08 05:49:01,758 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:49:02,039 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:49:02,048 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:49:02,093 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:49:02,116 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:49:02,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:02 WrapperNode [2025-02-08 05:49:02,116 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:49:02,117 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:49:02,117 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:49:02,118 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:49:02,123 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:02" (1/1) ... [2025-02-08 05:49:02,132 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:02" (1/1) ... [2025-02-08 05:49:02,157 INFO L138 Inliner]: procedures = 119, calls = 37, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 114 [2025-02-08 05:49:02,157 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:49:02,158 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:49:02,158 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:49:02,158 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:49:02,168 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:02" (1/1) ... [2025-02-08 05:49:02,168 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:02" (1/1) ... [2025-02-08 05:49:02,173 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:02" (1/1) ... [2025-02-08 05:49:02,186 INFO L175 MemorySlicer]: Split 21 memory accesses to 2 slices as follows [2, 19]. 90 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 7 writes are split as follows [0, 7]. [2025-02-08 05:49:02,186 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:02" (1/1) ... [2025-02-08 05:49:02,187 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:02" (1/1) ... [2025-02-08 05:49:02,194 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:02" (1/1) ... [2025-02-08 05:49:02,195 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:02" (1/1) ... [2025-02-08 05:49:02,196 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:02" (1/1) ... [2025-02-08 05:49:02,197 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:02" (1/1) ... [2025-02-08 05:49:02,199 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:49:02,200 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:49:02,200 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:49:02,200 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:49:02,201 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:02" (1/1) ... [2025-02-08 05:49:02,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:49:02,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:49:02,235 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:49:02,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:49:02,262 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-02-08 05:49:02,262 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-02-08 05:49:02,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 05:49:02,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 05:49:02,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 05:49:02,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 05:49:02,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:49:02,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:49:02,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 05:49:02,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 05:49:02,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 05:49:02,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 05:49:02,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 05:49:02,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 05:49:02,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 05:49:02,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:49:02,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:49:02,374 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:49:02,377 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:49:02,580 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-02-08 05:49:02,582 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:49:02,592 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:49:02,594 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:49:02,594 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:49:02 BoogieIcfgContainer [2025-02-08 05:49:02,594 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:49:02,597 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:49:02,597 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:49:02,601 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:49:02,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:49:01" (1/3) ... [2025-02-08 05:49:02,602 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@499dc479 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:49:02, skipping insertion in model container [2025-02-08 05:49:02,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:02" (2/3) ... [2025-02-08 05:49:02,602 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@499dc479 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:49:02, skipping insertion in model container [2025-02-08 05:49:02,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:49:02" (3/3) ... [2025-02-08 05:49:02,603 INFO L128 eAbstractionObserver]: Analyzing ICFG sll-token-1.i [2025-02-08 05:49:02,612 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:49:02,613 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll-token-1.i that has 2 procedures, 51 locations, 1 initial locations, 9 loop locations, and 2 error locations. [2025-02-08 05:49:02,643 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:49:02,652 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;@7b48ce58, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:49:02,652 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-08 05:49:02,657 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 41 states have (on average 1.6585365853658536) internal successors, (68), 43 states have internal predecessors, (68), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 05:49:02,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 05:49:02,663 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:49:02,664 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:49:02,664 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:49:02,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:49:02,668 INFO L85 PathProgramCache]: Analyzing trace with hash 907686094, now seen corresponding path program 1 times [2025-02-08 05:49:02,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:49:02,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22788532] [2025-02-08 05:49:02,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:49:02,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:49:02,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 05:49:02,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 05:49:02,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:02,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:02,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:49:02,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:49:02,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22788532] [2025-02-08 05:49:02,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22788532] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:49:02,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:49:02,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:49:02,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688571686] [2025-02-08 05:49:02,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:49:02,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:49:02,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:49:02,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:49:02,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:49:02,940 INFO L87 Difference]: Start difference. First operand has 51 states, 41 states have (on average 1.6585365853658536) internal successors, (68), 43 states have internal predecessors, (68), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:49:03,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:49:03,004 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2025-02-08 05:49:03,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:49:03,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-08 05:49:03,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:49:03,011 INFO L225 Difference]: With dead ends: 42 [2025-02-08 05:49:03,012 INFO L226 Difference]: Without dead ends: 40 [2025-02-08 05:49:03,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:49:03,016 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 4 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 05:49:03,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 71 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 05:49:03,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-02-08 05:49:03,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-02-08 05:49:03,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 38 states have internal predecessors, (41), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:49:03,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2025-02-08 05:49:03,044 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 8 [2025-02-08 05:49:03,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:49:03,044 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2025-02-08 05:49:03,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:49:03,044 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2025-02-08 05:49:03,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-08 05:49:03,044 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:49:03,045 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:49:03,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:49:03,045 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:49:03,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:49:03,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1273249058, now seen corresponding path program 1 times [2025-02-08 05:49:03,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:49:03,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781612922] [2025-02-08 05:49:03,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:49:03,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:49:03,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 05:49:03,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 05:49:03,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:03,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:03,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:49:03,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:49:03,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781612922] [2025-02-08 05:49:03,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781612922] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:49:03,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:49:03,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:49:03,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442152493] [2025-02-08 05:49:03,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:49:03,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:49:03,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:49:03,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:49:03,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:49:03,210 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:49:03,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:49:03,306 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2025-02-08 05:49:03,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 05:49:03,306 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-08 05:49:03,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:49:03,307 INFO L225 Difference]: With dead ends: 58 [2025-02-08 05:49:03,307 INFO L226 Difference]: Without dead ends: 58 [2025-02-08 05:49:03,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:49:03,308 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 62 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 05:49:03,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 63 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 05:49:03,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-02-08 05:49:03,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 39. [2025-02-08 05:49:03,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 37 states have internal predecessors, (40), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:49:03,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2025-02-08 05:49:03,315 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 9 [2025-02-08 05:49:03,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:49:03,315 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2025-02-08 05:49:03,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:49:03,315 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2025-02-08 05:49:03,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-08 05:49:03,317 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:49:03,317 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:49:03,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:49:03,317 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:49:03,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:49:03,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1407371693, now seen corresponding path program 1 times [2025-02-08 05:49:03,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:49:03,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78483587] [2025-02-08 05:49:03,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:49:03,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:49:03,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 05:49:03,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 05:49:03,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:03,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:03,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:49:03,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:49:03,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78483587] [2025-02-08 05:49:03,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78483587] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:49:03,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:49:03,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 05:49:03,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48548713] [2025-02-08 05:49:03,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:49:03,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:49:03,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:49:03,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:49:03,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:49:03,680 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:49:03,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:49:03,802 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2025-02-08 05:49:03,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 05:49:03,803 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-02-08 05:49:03,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:49:03,803 INFO L225 Difference]: With dead ends: 52 [2025-02-08 05:49:03,803 INFO L226 Difference]: Without dead ends: 52 [2025-02-08 05:49:03,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-08 05:49:03,804 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 15 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 05:49:03,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 125 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 05:49:03,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-02-08 05:49:03,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 47. [2025-02-08 05:49:03,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 45 states have internal predecessors, (49), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:49:03,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2025-02-08 05:49:03,813 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 14 [2025-02-08 05:49:03,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:49:03,813 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2025-02-08 05:49:03,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:49:03,813 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2025-02-08 05:49:03,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-08 05:49:03,814 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:49:03,814 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:49:03,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:49:03,814 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:49:03,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:49:03,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1387324272, now seen corresponding path program 1 times [2025-02-08 05:49:03,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:49:03,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830078531] [2025-02-08 05:49:03,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:49:03,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:49:03,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 05:49:03,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 05:49:03,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:03,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:49:03,850 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:49:03,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 05:49:03,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 05:49:03,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:03,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:49:03,885 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:49:03,886 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:49:03,887 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2025-02-08 05:49:03,888 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2025-02-08 05:49:03,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:49:03,892 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-08 05:49:03,915 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:49:03,920 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:49:03 BoogieIcfgContainer [2025-02-08 05:49:03,920 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:49:03,921 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:49:03,921 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:49:03,921 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:49:03,922 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:49:02" (3/4) ... [2025-02-08 05:49:03,922 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-08 05:49:03,964 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 12. [2025-02-08 05:49:04,020 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:49:04,020 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:49:04,020 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:49:04,021 INFO L158 Benchmark]: Toolchain (without parser) took 2315.28ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 43.9MB in the end (delta: 67.6MB). Peak memory consumption was 64.8MB. Max. memory is 16.1GB. [2025-02-08 05:49:04,021 INFO L158 Benchmark]: CDTParser took 0.54ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:49:04,022 INFO L158 Benchmark]: CACSL2BoogieTranslator took 408.68ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 94.5MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 05:49:04,022 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.76ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 92.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:49:04,022 INFO L158 Benchmark]: Boogie Preprocessor took 41.59ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 91.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:49:04,022 INFO L158 Benchmark]: IcfgBuilder took 394.58ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 75.5MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 05:49:04,022 INFO L158 Benchmark]: TraceAbstraction took 1323.62ms. Allocated memory is still 142.6MB. Free memory was 75.1MB in the beginning and 49.9MB in the end (delta: 25.2MB). Peak memory consumption was 31.2MB. Max. memory is 16.1GB. [2025-02-08 05:49:04,023 INFO L158 Benchmark]: Witness Printer took 99.38ms. Allocated memory is still 142.6MB. Free memory was 49.9MB in the beginning and 43.9MB in the end (delta: 6.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:49:04,024 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.54ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 408.68ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 94.5MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.76ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 92.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 41.59ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 91.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 394.58ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 75.5MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1323.62ms. Allocated memory is still 142.6MB. Free memory was 75.1MB in the beginning and 49.9MB in the end (delta: 25.2MB). Peak memory consumption was 31.2MB. Max. memory is 16.1GB. * Witness Printer took 99.38ms. Allocated memory is still 142.6MB. Free memory was 49.9MB in the beginning and 43.9MB in the end (delta: 6.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 992]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1003] SLL* head = malloc(sizeof(SLL)); [L1004] head->next = ((void*)0) [L1005] head->data = 0 [L1007] SLL* x = head; VAL [head={-1:0}, x={-1:0}] [L1010] COND TRUE __VERIFIER_nondet_int() [L1010] COND FALSE !(__VERIFIER_nondet_int()) [L1018] x->data = 1 [L1019] x->next = malloc(sizeof(SLL)) [L1020] EXPR x->next [L1020] x->next->data = 2 [L1022] x = head VAL [head={-1:0}, x={-1:0}] [L1024] COND TRUE 0 VAL [head={-1:0}, x={-1:0}] [L1024] COND FALSE !(!(((void*)0) != x)) VAL [head={-1:0}, x={-1:0}] [L1024] COND FALSE !(0) VAL [head={-1:0}, x={-1:0}] [L1026] COND TRUE 1 != x->data [L1026] EXPR x->data [L1026] COND FALSE !(1 != x->data) [L1031] COND TRUE 0 [L1031] EXPR x->data [L1031] COND TRUE !(2 == x->data) [L1031] CALL reach_error() [L992] COND FALSE !(0) [L992] __assert_fail ("0", "sll-token-1.c", 12, __extension__ __PRETTY_FUNCTION__) - UnprovableResult [Line: 1000]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 81 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 81 mSDsluCounter, 259 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 147 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 97 IncrementalHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 112 mSDtfsCounter, 97 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=0, InterpolantAutomatonStates: 13, 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, 3 MinimizatonAttempts, 24 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 45 NumberOfCodeBlocks, 45 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 28 ConstructedInterpolants, 0 QuantifiedInterpolants, 116 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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 RESULT: Ultimate proved your program to be incorrect! [2025-02-08 05:49:04,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup)