./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 e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/sll-token-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-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-?-e2fb8be-m [2025-03-08 22:15:54,713 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:15:54,757 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2025-03-08 22:15:54,760 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:15:54,760 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:15:54,787 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:15:54,788 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:15:54,788 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:15:54,789 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 22:15:54,789 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 22:15:54,789 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:15:54,790 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:15:54,790 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:15:54,790 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:15:54,790 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:15:54,790 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:15:54,790 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 22:15:54,790 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:15:54,790 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:15:54,790 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:15:54,791 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:15:54,791 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 22:15:54,791 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-08 22:15:54,791 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-08 22:15:54,791 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:15:54,791 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 22:15:54,791 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 22:15:54,791 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:15:54,791 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:15:54,791 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 22:15:54,792 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:15:54,792 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:15:54,792 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:15:54,792 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:15:54,792 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 22:15:54,792 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:15:54,793 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:15:54,793 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:15:54,793 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:15:54,793 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:15:54,793 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:15:54,793 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:15:54,793 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:15:54,793 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:15:54,793 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:15:54,793 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-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-03-08 22:15:55,020 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:15:55,029 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:15:55,031 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:15:55,032 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:15:55,032 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:15:55,034 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-token-1.i [2025-03-08 22:15:56,197 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6af7cd8fb/c14dbf277edb4a0e870fd6515025da39/FLAG93af33025 [2025-03-08 22:15:56,472 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:15:56,473 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-token-1.i [2025-03-08 22:15:56,485 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6af7cd8fb/c14dbf277edb4a0e870fd6515025da39/FLAG93af33025 [2025-03-08 22:15:56,763 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6af7cd8fb/c14dbf277edb4a0e870fd6515025da39 [2025-03-08 22:15:56,765 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:15:56,766 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:15:56,767 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:15:56,767 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:15:56,769 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:15:56,770 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:15:56" (1/1) ... [2025-03-08 22:15:56,771 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ce86567 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:15:56, skipping insertion in model container [2025-03-08 22:15:56,772 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:15:56" (1/1) ... [2025-03-08 22:15:56,798 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:15:57,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:15:57,038 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:15:57,083 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:15:57,104 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:15:57,105 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:15:57 WrapperNode [2025-03-08 22:15:57,105 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:15:57,106 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:15:57,106 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:15:57,106 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:15:57,111 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:15:57" (1/1) ... [2025-03-08 22:15:57,121 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:15:57" (1/1) ... [2025-03-08 22:15:57,133 INFO L138 Inliner]: procedures = 119, calls = 37, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 114 [2025-03-08 22:15:57,134 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:15:57,134 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:15:57,134 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:15:57,134 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:15:57,140 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:15:57" (1/1) ... [2025-03-08 22:15:57,141 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:15:57" (1/1) ... [2025-03-08 22:15:57,149 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:15:57" (1/1) ... [2025-03-08 22:15:57,160 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-03-08 22:15:57,161 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:15:57" (1/1) ... [2025-03-08 22:15:57,161 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:15:57" (1/1) ... [2025-03-08 22:15:57,166 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:15:57" (1/1) ... [2025-03-08 22:15:57,167 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:15:57" (1/1) ... [2025-03-08 22:15:57,168 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:15:57" (1/1) ... [2025-03-08 22:15:57,168 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:15:57" (1/1) ... [2025-03-08 22:15:57,169 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:15:57,170 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:15:57,170 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:15:57,170 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:15:57,171 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:15:57" (1/1) ... [2025-03-08 22:15:57,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:15:57,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:15:57,193 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-08 22:15:57,195 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-08 22:15:57,213 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-03-08 22:15:57,213 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-03-08 22:15:57,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 22:15:57,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 22:15:57,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 22:15:57,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 22:15:57,214 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 22:15:57,214 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:15:57,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 22:15:57,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 22:15:57,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 22:15:57,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 22:15:57,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 22:15:57,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 22:15:57,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 22:15:57,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:15:57,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:15:57,298 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:15:57,300 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:15:57,445 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-08 22:15:57,446 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:15:57,453 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:15:57,453 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:15:57,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:15:57 BoogieIcfgContainer [2025-03-08 22:15:57,453 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:15:57,455 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:15:57,455 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:15:57,459 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:15:57,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:15:56" (1/3) ... [2025-03-08 22:15:57,461 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@551dc3cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:15:57, skipping insertion in model container [2025-03-08 22:15:57,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:15:57" (2/3) ... [2025-03-08 22:15:57,461 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@551dc3cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:15:57, skipping insertion in model container [2025-03-08 22:15:57,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:15:57" (3/3) ... [2025-03-08 22:15:57,462 INFO L128 eAbstractionObserver]: Analyzing ICFG sll-token-1.i [2025-03-08 22:15:57,475 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:15:57,476 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll-token-1.i that has 2 procedures, 50 locations, 1 initial locations, 9 loop locations, and 2 error locations. [2025-03-08 22:15:57,507 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:15:57,521 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;@43acef96, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:15:57,522 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 22:15:57,525 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 40 states have (on average 1.675) internal successors, (67), 42 states have internal predecessors, (67), 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-03-08 22:15:57,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-08 22:15:57,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:15:57,530 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:15:57,531 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:15:57,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:15:57,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1798883859, now seen corresponding path program 1 times [2025-03-08 22:15:57,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:15:57,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508881719] [2025-03-08 22:15:57,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:15:57,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:15:57,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 22:15:57,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 22:15:57,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:15:57,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:15:57,724 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-08 22:15:57,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:15:57,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508881719] [2025-03-08 22:15:57,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508881719] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:15:57,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:15:57,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:15:57,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472963049] [2025-03-08 22:15:57,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:15:57,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:15:57,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:15:57,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:15:57,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:15:57,756 INFO L87 Difference]: Start difference. First operand has 50 states, 40 states have (on average 1.675) internal successors, (67), 42 states have internal predecessors, (67), 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-03-08 22:15:57,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:15:57,805 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2025-03-08 22:15:57,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:15:57,807 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-03-08 22:15:57,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:15:57,812 INFO L225 Difference]: With dead ends: 41 [2025-03-08 22:15:57,813 INFO L226 Difference]: Without dead ends: 39 [2025-03-08 22:15:57,815 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-03-08 22:15:57,818 INFO L435 NwaCegarLoop]: 44 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, 70 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-03-08 22:15:57,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 70 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:15:57,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-08 22:15:57,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-03-08 22:15:57,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.25) internal successors, (40), 37 states have internal predecessors, (40), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:15:57,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2025-03-08 22:15:57,852 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 8 [2025-03-08 22:15:57,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:15:57,852 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2025-03-08 22:15:57,852 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-03-08 22:15:57,852 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2025-03-08 22:15:57,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-08 22:15:57,853 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:15:57,853 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:15:57,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:15:57,853 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:15:57,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:15:57,853 INFO L85 PathProgramCache]: Analyzing trace with hash -103235879, now seen corresponding path program 1 times [2025-03-08 22:15:57,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:15:57,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673473354] [2025-03-08 22:15:57,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:15:57,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:15:57,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 22:15:57,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 22:15:57,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:15:57,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:15:57,983 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-08 22:15:57,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:15:57,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673473354] [2025-03-08 22:15:57,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673473354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:15:57,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:15:57,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 22:15:57,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150750803] [2025-03-08 22:15:57,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:15:57,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 22:15:57,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:15:57,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 22:15:57,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 22:15:57,986 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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-03-08 22:15:58,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:15:58,049 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2025-03-08 22:15:58,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:15:58,049 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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-03-08 22:15:58,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:15:58,050 INFO L225 Difference]: With dead ends: 57 [2025-03-08 22:15:58,050 INFO L226 Difference]: Without dead ends: 57 [2025-03-08 22:15:58,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:15:58,050 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 59 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 64 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.0s IncrementalHoareTripleChecker+Time [2025-03-08 22:15:58,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 64 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 22:15:58,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-08 22:15:58,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 38. [2025-03-08 22:15:58,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.21875) internal successors, (39), 36 states have internal predecessors, (39), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:15:58,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2025-03-08 22:15:58,056 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 9 [2025-03-08 22:15:58,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:15:58,056 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2025-03-08 22:15:58,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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-03-08 22:15:58,056 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2025-03-08 22:15:58,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 22:15:58,057 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:15:58,057 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:15:58,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:15:58,057 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:15:58,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:15:58,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1901921381, now seen corresponding path program 1 times [2025-03-08 22:15:58,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:15:58,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955238262] [2025-03-08 22:15:58,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:15:58,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:15:58,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 22:15:58,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 22:15:58,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:15:58,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:15:58,370 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-08 22:15:58,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:15:58,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955238262] [2025-03-08 22:15:58,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955238262] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:15:58,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:15:58,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:15:58,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024416519] [2025-03-08 22:15:58,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:15:58,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:15:58,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:15:58,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:15:58,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:15:58,372 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 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-03-08 22:15:58,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 22:15:58,475 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2025-03-08 22:15:58,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 22:15:58,476 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 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-03-08 22:15:58,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 22:15:58,476 INFO L225 Difference]: With dead ends: 50 [2025-03-08 22:15:58,476 INFO L226 Difference]: Without dead ends: 50 [2025-03-08 22:15:58,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 22:15:58,477 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 14 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 22:15:58,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 120 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 22:15:58,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-08 22:15:58,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2025-03-08 22:15:58,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 39 states have (on average 1.205128205128205) internal successors, (47), 43 states have internal predecessors, (47), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:15:58,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2025-03-08 22:15:58,485 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 14 [2025-03-08 22:15:58,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 22:15:58,485 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2025-03-08 22:15:58,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 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-03-08 22:15:58,485 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2025-03-08 22:15:58,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 22:15:58,486 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 22:15:58,486 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:15:58,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 22:15:58,486 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 22:15:58,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:15:58,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1881873960, now seen corresponding path program 1 times [2025-03-08 22:15:58,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:15:58,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734271550] [2025-03-08 22:15:58,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:15:58,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:15:58,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 22:15:58,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 22:15:58,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:15:58,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 22:15:58,510 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 22:15:58,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 22:15:58,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 22:15:58,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:15:58,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 22:15:58,539 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 22:15:58,540 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 22:15:58,540 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2025-03-08 22:15:58,541 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2025-03-08 22:15:58,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 22:15:58,544 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-08 22:15:58,562 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 22:15:58,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 10:15:58 BoogieIcfgContainer [2025-03-08 22:15:58,566 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 22:15:58,566 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 22:15:58,566 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 22:15:58,566 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 22:15:58,567 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:15:57" (3/4) ... [2025-03-08 22:15:58,567 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-08 22:15:58,599 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 11. [2025-03-08 22:15:58,633 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 22:15:58,634 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 22:15:58,634 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 22:15:58,635 INFO L158 Benchmark]: Toolchain (without parser) took 1869.28ms. Allocated memory is still 201.3MB. Free memory was 154.4MB in the beginning and 122.6MB in the end (delta: 31.9MB). Peak memory consumption was 31.4MB. Max. memory is 16.1GB. [2025-03-08 22:15:58,635 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 201.3MB. Free memory is still 118.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:15:58,635 INFO L158 Benchmark]: CACSL2BoogieTranslator took 338.95ms. Allocated memory is still 201.3MB. Free memory was 154.4MB in the beginning and 137.5MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 22:15:58,636 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.94ms. Allocated memory is still 201.3MB. Free memory was 137.5MB in the beginning and 135.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:15:58,636 INFO L158 Benchmark]: Boogie Preprocessor took 35.29ms. Allocated memory is still 201.3MB. Free memory was 135.6MB in the beginning and 134.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:15:58,636 INFO L158 Benchmark]: IcfgBuilder took 283.37ms. Allocated memory is still 201.3MB. Free memory was 134.1MB in the beginning and 118.8MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 22:15:58,636 INFO L158 Benchmark]: TraceAbstraction took 1110.66ms. Allocated memory is still 201.3MB. Free memory was 118.1MB in the beginning and 128.8MB in the end (delta: -10.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:15:58,636 INFO L158 Benchmark]: Witness Printer took 68.27ms. Allocated memory is still 201.3MB. Free memory was 128.8MB in the beginning and 122.6MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 22:15:58,637 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.40ms. Allocated memory is still 201.3MB. Free memory is still 118.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 338.95ms. Allocated memory is still 201.3MB. Free memory was 154.4MB in the beginning and 137.5MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.94ms. Allocated memory is still 201.3MB. Free memory was 137.5MB in the beginning and 135.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.29ms. Allocated memory is still 201.3MB. Free memory was 135.6MB in the beginning and 134.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 283.37ms. Allocated memory is still 201.3MB. Free memory was 134.1MB in the beginning and 118.8MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1110.66ms. Allocated memory is still 201.3MB. Free memory was 118.1MB in the beginning and 128.8MB in the end (delta: -10.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 68.27ms. Allocated memory is still 201.3MB. Free memory was 128.8MB in the beginning and 122.6MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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 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, 50 locations, 85 edges, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 77 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 77 mSDsluCounter, 254 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 145 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 98 IncrementalHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 109 mSDtfsCounter, 98 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred 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, 102 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-03-08 22:15:58,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup)