./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/safe036.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/safe036.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1118c32f43b2d6844c8e6b0e5b4fae8199d058f7b991e3c8d975cf675dc5221a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 09:58:10,931 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 09:58:10,995 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 09:58:11,002 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 09:58:11,002 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 09:58:11,020 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 09:58:11,020 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 09:58:11,020 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 09:58:11,021 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 09:58:11,021 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 09:58:11,021 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 09:58:11,021 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 09:58:11,022 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 09:58:11,022 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 09:58:11,022 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 09:58:11,022 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 09:58:11,022 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 09:58:11,023 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 09:58:11,023 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 09:58:11,023 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 09:58:11,023 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 09:58:11,023 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 09:58:11,023 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 09:58:11,023 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 09:58:11,023 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 09:58:11,024 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 09:58:11,024 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 09:58:11,024 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 09:58:11,024 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 09:58:11,024 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 09:58:11,024 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 09:58:11,024 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 09:58:11,024 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 09:58:11,024 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:58:11,024 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 09:58:11,025 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 09:58:11,025 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 09:58:11,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 09:58:11,025 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 09:58:11,025 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 09:58:11,025 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 09:58:11,025 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 09:58:11,025 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1118c32f43b2d6844c8e6b0e5b4fae8199d058f7b991e3c8d975cf675dc5221a [2025-03-04 09:58:11,422 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 09:58:11,430 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 09:58:11,432 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 09:58:11,433 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 09:58:11,433 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 09:58:11,435 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe036.i [2025-03-04 09:58:12,609 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78b86332c/9720db30b9e1453aa884ab678ca66295/FLAG5ed28549c [2025-03-04 09:58:12,871 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 09:58:12,871 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe036.i [2025-03-04 09:58:12,883 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78b86332c/9720db30b9e1453aa884ab678ca66295/FLAG5ed28549c [2025-03-04 09:58:13,176 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78b86332c/9720db30b9e1453aa884ab678ca66295 [2025-03-04 09:58:13,178 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 09:58:13,179 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 09:58:13,180 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 09:58:13,180 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 09:58:13,183 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 09:58:13,184 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:58:13" (1/1) ... [2025-03-04 09:58:13,184 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@213a47e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:58:13, skipping insertion in model container [2025-03-04 09:58:13,185 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:58:13" (1/1) ... [2025-03-04 09:58:13,207 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 09:58:13,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:58:13,481 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 09:58:13,516 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:58:13,551 INFO L204 MainTranslator]: Completed translation [2025-03-04 09:58:13,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:58:13 WrapperNode [2025-03-04 09:58:13,553 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 09:58:13,554 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 09:58:13,554 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 09:58:13,554 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 09:58:13,561 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:58:13" (1/1) ... [2025-03-04 09:58:13,571 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:58:13" (1/1) ... [2025-03-04 09:58:13,587 INFO L138 Inliner]: procedures = 174, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 52 [2025-03-04 09:58:13,589 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 09:58:13,590 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 09:58:13,590 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 09:58:13,590 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 09:58:13,595 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:58:13" (1/1) ... [2025-03-04 09:58:13,595 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:58:13" (1/1) ... [2025-03-04 09:58:13,598 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:58:13" (1/1) ... [2025-03-04 09:58:13,613 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 09:58:13,614 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:58:13" (1/1) ... [2025-03-04 09:58:13,614 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:58:13" (1/1) ... [2025-03-04 09:58:13,620 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:58:13" (1/1) ... [2025-03-04 09:58:13,622 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:58:13" (1/1) ... [2025-03-04 09:58:13,623 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:58:13" (1/1) ... [2025-03-04 09:58:13,625 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:58:13" (1/1) ... [2025-03-04 09:58:13,627 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 09:58:13,629 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 09:58:13,629 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 09:58:13,629 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 09:58:13,630 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:58:13" (1/1) ... [2025-03-04 09:58:13,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:58:13,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:58:13,658 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 09:58:13,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 09:58:13,679 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 09:58:13,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 09:58:13,679 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-04 09:58:13,680 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-04 09:58:13,680 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-04 09:58:13,680 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-04 09:58:13,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 09:58:13,680 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 09:58:13,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 09:58:13,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 09:58:13,681 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 09:58:13,769 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 09:58:13,770 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 09:58:13,864 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 09:58:13,865 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 09:58:13,915 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 09:58:13,916 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 09:58:13,916 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:58:13 BoogieIcfgContainer [2025-03-04 09:58:13,916 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 09:58:13,917 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 09:58:13,917 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 09:58:13,922 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 09:58:13,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 09:58:13" (1/3) ... [2025-03-04 09:58:13,923 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b7f5f84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:58:13, skipping insertion in model container [2025-03-04 09:58:13,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:58:13" (2/3) ... [2025-03-04 09:58:13,923 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b7f5f84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:58:13, skipping insertion in model container [2025-03-04 09:58:13,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:58:13" (3/3) ... [2025-03-04 09:58:13,924 INFO L128 eAbstractionObserver]: Analyzing ICFG safe036.i [2025-03-04 09:58:13,935 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 09:58:13,937 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe036.i that has 3 procedures, 35 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-03-04 09:58:13,937 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 09:58:13,983 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 09:58:14,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 36 transitions, 80 flow [2025-03-04 09:58:14,042 INFO L124 PetriNetUnfolderBase]: 2/34 cut-off events. [2025-03-04 09:58:14,048 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:58:14,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 34 events. 2/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 52 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2025-03-04 09:58:14,050 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 36 transitions, 80 flow [2025-03-04 09:58:14,053 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 33 transitions, 72 flow [2025-03-04 09:58:14,062 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:58:14,075 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;@5b03063e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:58:14,075 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-04 09:58:14,088 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:58:14,088 INFO L124 PetriNetUnfolderBase]: 2/31 cut-off events. [2025-03-04 09:58:14,088 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:58:14,088 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:58:14,089 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:58:14,089 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 09:58:14,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:58:14,095 INFO L85 PathProgramCache]: Analyzing trace with hash -940635992, now seen corresponding path program 1 times [2025-03-04 09:58:14,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:58:14,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318079834] [2025-03-04 09:58:14,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:58:14,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:58:14,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 09:58:14,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 09:58:14,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:58:14,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:58:14,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:58:14,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:58:14,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318079834] [2025-03-04 09:58:14,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318079834] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:58:14,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:58:14,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:58:14,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743807084] [2025-03-04 09:58:14,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:58:14,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:58:14,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:58:14,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:58:14,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:58:14,317 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2025-03-04 09:58:14,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:58:14,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:58:14,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2025-03-04 09:58:14,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:58:14,545 INFO L124 PetriNetUnfolderBase]: 720/1298 cut-off events. [2025-03-04 09:58:14,545 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-04 09:58:14,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2494 conditions, 1298 events. 720/1298 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 6590 event pairs, 720 based on Foata normal form. 140/1428 useless extension candidates. Maximal degree in co-relation 2484. Up to 1176 conditions per place. [2025-03-04 09:58:14,555 INFO L140 encePairwiseOnDemand]: 32/36 looper letters, 22 selfloop transitions, 1 changer transitions 1/29 dead transitions. [2025-03-04 09:58:14,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 29 transitions, 112 flow [2025-03-04 09:58:14,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:58:14,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:58:14,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2025-03-04 09:58:14,564 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2025-03-04 09:58:14,565 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 72 flow. Second operand 3 states and 48 transitions. [2025-03-04 09:58:14,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 29 transitions, 112 flow [2025-03-04 09:58:14,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 29 transitions, 110 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 09:58:14,569 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 62 flow [2025-03-04 09:58:14,571 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2025-03-04 09:58:14,573 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -2 predicate places. [2025-03-04 09:58:14,573 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 62 flow [2025-03-04 09:58:14,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:58:14,574 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:58:14,574 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:58:14,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 09:58:14,574 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 09:58:14,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:58:14,575 INFO L85 PathProgramCache]: Analyzing trace with hash -940635293, now seen corresponding path program 1 times [2025-03-04 09:58:14,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:58:14,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658078024] [2025-03-04 09:58:14,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:58:14,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:58:14,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 09:58:14,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 09:58:14,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:58:14,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:58:14,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:58:14,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:58:14,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658078024] [2025-03-04 09:58:14,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658078024] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:58:14,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:58:14,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:58:14,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776162826] [2025-03-04 09:58:14,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:58:14,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:58:14,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:58:14,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:58:14,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:58:14,775 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2025-03-04 09:58:14,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:58:14,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:58:14,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2025-03-04 09:58:14,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:58:14,905 INFO L124 PetriNetUnfolderBase]: 396/777 cut-off events. [2025-03-04 09:58:14,906 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:58:14,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1499 conditions, 777 events. 396/777 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3591 event pairs, 110 based on Foata normal form. 49/823 useless extension candidates. Maximal degree in co-relation 1493. Up to 349 conditions per place. [2025-03-04 09:58:14,911 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 44 selfloop transitions, 4 changer transitions 1/54 dead transitions. [2025-03-04 09:58:14,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 54 transitions, 214 flow [2025-03-04 09:58:14,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:58:14,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 09:58:14,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2025-03-04 09:58:14,913 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5763888888888888 [2025-03-04 09:58:14,913 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 62 flow. Second operand 4 states and 83 transitions. [2025-03-04 09:58:14,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 54 transitions, 214 flow [2025-03-04 09:58:14,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 54 transitions, 213 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:58:14,914 INFO L231 Difference]: Finished difference. Result has 39 places, 30 transitions, 87 flow [2025-03-04 09:58:14,914 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=87, PETRI_PLACES=39, PETRI_TRANSITIONS=30} [2025-03-04 09:58:14,916 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 1 predicate places. [2025-03-04 09:58:14,916 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 87 flow [2025-03-04 09:58:14,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:58:14,916 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:58:14,916 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:58:14,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 09:58:14,917 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 09:58:14,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:58:14,917 INFO L85 PathProgramCache]: Analyzing trace with hash 743289860, now seen corresponding path program 1 times [2025-03-04 09:58:14,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:58:14,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721615477] [2025-03-04 09:58:14,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:58:14,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:58:14,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 09:58:14,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 09:58:14,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:58:14,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:58:15,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:58:15,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:58:15,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721615477] [2025-03-04 09:58:15,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721615477] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:58:15,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:58:15,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:58:15,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864338086] [2025-03-04 09:58:15,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:58:15,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:58:15,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:58:15,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:58:15,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:58:15,063 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2025-03-04 09:58:15,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 87 flow. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:58:15,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:58:15,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2025-03-04 09:58:15,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:58:15,175 INFO L124 PetriNetUnfolderBase]: 186/362 cut-off events. [2025-03-04 09:58:15,176 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2025-03-04 09:58:15,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 844 conditions, 362 events. 186/362 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1215 event pairs, 74 based on Foata normal form. 24/383 useless extension candidates. Maximal degree in co-relation 835. Up to 146 conditions per place. [2025-03-04 09:58:15,177 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 35 selfloop transitions, 6 changer transitions 1/47 dead transitions. [2025-03-04 09:58:15,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 47 transitions, 210 flow [2025-03-04 09:58:15,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:58:15,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 09:58:15,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2025-03-04 09:58:15,181 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2025-03-04 09:58:15,181 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 87 flow. Second operand 5 states and 84 transitions. [2025-03-04 09:58:15,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 47 transitions, 210 flow [2025-03-04 09:58:15,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 47 transitions, 201 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-04 09:58:15,184 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 103 flow [2025-03-04 09:58:15,185 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=103, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2025-03-04 09:58:15,185 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 5 predicate places. [2025-03-04 09:58:15,186 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 103 flow [2025-03-04 09:58:15,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:58:15,186 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:58:15,186 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:58:15,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 09:58:15,186 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 09:58:15,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:58:15,187 INFO L85 PathProgramCache]: Analyzing trace with hash -728811771, now seen corresponding path program 1 times [2025-03-04 09:58:15,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:58:15,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847035075] [2025-03-04 09:58:15,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:58:15,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:58:15,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 09:58:15,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 09:58:15,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:58:15,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:58:15,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:58:15,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:58:15,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847035075] [2025-03-04 09:58:15,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847035075] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:58:15,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:58:15,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 09:58:15,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807036929] [2025-03-04 09:58:15,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:58:15,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:58:15,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:58:15,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:58:15,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:58:15,317 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2025-03-04 09:58:15,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 103 flow. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:58:15,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:58:15,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2025-03-04 09:58:15,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:58:15,493 INFO L124 PetriNetUnfolderBase]: 236/459 cut-off events. [2025-03-04 09:58:15,494 INFO L125 PetriNetUnfolderBase]: For 214/214 co-relation queries the response was YES. [2025-03-04 09:58:15,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1123 conditions, 459 events. 236/459 cut-off events. For 214/214 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1690 event pairs, 40 based on Foata normal form. 0/453 useless extension candidates. Maximal degree in co-relation 1112. Up to 258 conditions per place. [2025-03-04 09:58:15,496 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 28 selfloop transitions, 1 changer transitions 29/62 dead transitions. [2025-03-04 09:58:15,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 62 transitions, 325 flow [2025-03-04 09:58:15,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 09:58:15,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 09:58:15,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 104 transitions. [2025-03-04 09:58:15,498 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4126984126984127 [2025-03-04 09:58:15,499 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 103 flow. Second operand 7 states and 104 transitions. [2025-03-04 09:58:15,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 62 transitions, 325 flow [2025-03-04 09:58:15,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 62 transitions, 268 flow, removed 10 selfloop flow, removed 6 redundant places. [2025-03-04 09:58:15,501 INFO L231 Difference]: Finished difference. Result has 47 places, 29 transitions, 84 flow [2025-03-04 09:58:15,501 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=84, PETRI_PLACES=47, PETRI_TRANSITIONS=29} [2025-03-04 09:58:15,501 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 9 predicate places. [2025-03-04 09:58:15,501 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 29 transitions, 84 flow [2025-03-04 09:58:15,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:58:15,502 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:58:15,502 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:58:15,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 09:58:15,502 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 09:58:15,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:58:15,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1856645729, now seen corresponding path program 2 times [2025-03-04 09:58:15,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:58:15,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134684402] [2025-03-04 09:58:15,503 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:58:15,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:58:15,512 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 1 equivalence classes. [2025-03-04 09:58:15,515 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 09:58:15,515 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 09:58:15,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:58:15,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:58:15,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:58:15,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134684402] [2025-03-04 09:58:15,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134684402] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:58:15,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:58:15,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 09:58:15,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544071414] [2025-03-04 09:58:15,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:58:15,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:58:15,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:58:15,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:58:15,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:58:15,645 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2025-03-04 09:58:15,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 29 transitions, 84 flow. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:58:15,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:58:15,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2025-03-04 09:58:15,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:58:15,792 INFO L124 PetriNetUnfolderBase]: 152/304 cut-off events. [2025-03-04 09:58:15,793 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2025-03-04 09:58:15,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 690 conditions, 304 events. 152/304 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1040 event pairs, 36 based on Foata normal form. 4/305 useless extension candidates. Maximal degree in co-relation 683. Up to 128 conditions per place. [2025-03-04 09:58:15,794 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 0 selfloop transitions, 0 changer transitions 45/45 dead transitions. [2025-03-04 09:58:15,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 45 transitions, 209 flow [2025-03-04 09:58:15,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:58:15,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 09:58:15,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2025-03-04 09:58:15,795 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2025-03-04 09:58:15,795 INFO L175 Difference]: Start difference. First operand has 47 places, 29 transitions, 84 flow. Second operand 6 states and 84 transitions. [2025-03-04 09:58:15,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 45 transitions, 209 flow [2025-03-04 09:58:15,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 45 transitions, 203 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-04 09:58:15,796 INFO L231 Difference]: Finished difference. Result has 41 places, 0 transitions, 0 flow [2025-03-04 09:58:15,796 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=41, PETRI_TRANSITIONS=0} [2025-03-04 09:58:15,796 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 3 predicate places. [2025-03-04 09:58:15,796 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 0 transitions, 0 flow [2025-03-04 09:58:15,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:58:15,802 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 4 remaining) [2025-03-04 09:58:15,803 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (2 of 4 remaining) [2025-03-04 09:58:15,803 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-03-04 09:58:15,803 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-03-04 09:58:15,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 09:58:15,805 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2025-03-04 09:58:15,808 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 09:58:15,809 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 09:58:15,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 09:58:15 BasicIcfg [2025-03-04 09:58:15,813 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 09:58:15,814 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 09:58:15,814 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 09:58:15,814 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 09:58:15,815 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:58:13" (3/4) ... [2025-03-04 09:58:15,816 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 09:58:15,819 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure P0 [2025-03-04 09:58:15,819 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure P1 [2025-03-04 09:58:15,821 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2025-03-04 09:58:15,822 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-03-04 09:58:15,822 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-04 09:58:15,822 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-04 09:58:15,874 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 09:58:15,874 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 09:58:15,874 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 09:58:15,874 INFO L158 Benchmark]: Toolchain (without parser) took 2695.15ms. Allocated memory is still 167.8MB. Free memory was 128.4MB in the beginning and 102.3MB in the end (delta: 26.1MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. [2025-03-04 09:58:15,874 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 192.9MB. Free memory is still 117.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 09:58:15,875 INFO L158 Benchmark]: CACSL2BoogieTranslator took 372.72ms. Allocated memory is still 167.8MB. Free memory was 128.1MB in the beginning and 108.5MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 09:58:15,875 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.73ms. Allocated memory is still 167.8MB. Free memory was 108.5MB in the beginning and 106.7MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 09:58:15,875 INFO L158 Benchmark]: Boogie Preprocessor took 38.95ms. Allocated memory is still 167.8MB. Free memory was 106.7MB in the beginning and 105.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 09:58:15,875 INFO L158 Benchmark]: IcfgBuilder took 286.67ms. Allocated memory is still 167.8MB. Free memory was 105.2MB in the beginning and 87.5MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 09:58:15,875 INFO L158 Benchmark]: TraceAbstraction took 1896.23ms. Allocated memory is still 167.8MB. Free memory was 86.7MB in the beginning and 107.8MB in the end (delta: -21.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 09:58:15,875 INFO L158 Benchmark]: Witness Printer took 59.69ms. Allocated memory is still 167.8MB. Free memory was 107.8MB in the beginning and 102.3MB in the end (delta: 5.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 09:58:15,876 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.30ms. Allocated memory is still 192.9MB. Free memory is still 117.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 372.72ms. Allocated memory is still 167.8MB. Free memory was 128.1MB in the beginning and 108.5MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.73ms. Allocated memory is still 167.8MB. Free memory was 108.5MB in the beginning and 106.7MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.95ms. Allocated memory is still 167.8MB. Free memory was 106.7MB in the beginning and 105.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 286.67ms. Allocated memory is still 167.8MB. Free memory was 105.2MB in the beginning and 87.5MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1896.23ms. Allocated memory is still 167.8MB. Free memory was 86.7MB in the beginning and 107.8MB in the end (delta: -21.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 59.69ms. Allocated memory is still 167.8MB. Free memory was 107.8MB in the beginning and 102.3MB in the end (delta: 5.5MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 762]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 17]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 53 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.8s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 157 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 155 mSDsluCounter, 7 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 486 IncrementalHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 2 mSDtfsCounter, 486 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=3, InterpolantAutomatonStates: 25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 95 NumberOfCodeBlocks, 95 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 90 ConstructedInterpolants, 0 QuantifiedInterpolants, 290 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 09:58:15,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE