./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/parallel-bakery-2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) 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/weaver/parallel-bakery-2.wvr.c -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 4f539592bc69a174492e01050b581a78ee6bfd25c2e79dba974730b39e2fa54b --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:21:45,027 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:21:45,087 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:21:45,093 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:21:45,094 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:21:45,115 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:21:45,116 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:21:45,116 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:21:45,116 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:21:45,116 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:21:45,117 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:21:45,117 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:21:45,117 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:21:45,117 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:21:45,118 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:21:45,118 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:21:45,118 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:21:45,118 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:21:45,119 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:21:45,119 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:21:45,119 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:21:45,119 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:21:45,119 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:21:45,119 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:21:45,119 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:21:45,119 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:21:45,119 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:21:45,119 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:21:45,119 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:21:45,119 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:21:45,119 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:21:45,119 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:21:45,120 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:21:45,120 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:21:45,120 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:21:45,120 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:21:45,120 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:21:45,120 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:21:45,120 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:21:45,120 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:21:45,120 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:21:45,120 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:21:45,120 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 -> 4f539592bc69a174492e01050b581a78ee6bfd25c2e79dba974730b39e2fa54b [2025-03-09 01:21:45,367 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:21:45,376 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:21:45,378 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:21:45,380 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:21:45,380 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:21:45,381 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-bakery-2.wvr.c [2025-03-09 01:21:46,521 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5b2a0b2b/91fdbf27175241f38ab4a33696378ed7/FLAG53d7879a4 [2025-03-09 01:21:46,734 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:21:46,734 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-bakery-2.wvr.c [2025-03-09 01:21:46,740 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5b2a0b2b/91fdbf27175241f38ab4a33696378ed7/FLAG53d7879a4 [2025-03-09 01:21:47,095 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5b2a0b2b/91fdbf27175241f38ab4a33696378ed7 [2025-03-09 01:21:47,097 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:21:47,098 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:21:47,099 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:21:47,099 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:21:47,102 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:21:47,102 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:21:47" (1/1) ... [2025-03-09 01:21:47,103 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68001dfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:21:47, skipping insertion in model container [2025-03-09 01:21:47,103 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:21:47" (1/1) ... [2025-03-09 01:21:47,113 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:21:47,249 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:21:47,258 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:21:47,274 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:21:47,283 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:21:47,283 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:21:47 WrapperNode [2025-03-09 01:21:47,283 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:21:47,284 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:21:47,284 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:21:47,284 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:21:47,288 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:21:47" (1/1) ... [2025-03-09 01:21:47,293 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:21:47" (1/1) ... [2025-03-09 01:21:47,309 INFO L138 Inliner]: procedures = 18, calls = 15, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 141 [2025-03-09 01:21:47,309 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:21:47,310 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:21:47,310 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:21:47,310 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:21:47,314 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:21:47" (1/1) ... [2025-03-09 01:21:47,315 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:21:47" (1/1) ... [2025-03-09 01:21:47,316 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:21:47" (1/1) ... [2025-03-09 01:21:47,331 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-09 01:21:47,331 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:21:47" (1/1) ... [2025-03-09 01:21:47,331 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:21:47" (1/1) ... [2025-03-09 01:21:47,336 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:21:47" (1/1) ... [2025-03-09 01:21:47,336 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:21:47" (1/1) ... [2025-03-09 01:21:47,337 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:21:47" (1/1) ... [2025-03-09 01:21:47,338 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:21:47" (1/1) ... [2025-03-09 01:21:47,339 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:21:47,340 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:21:47,340 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:21:47,340 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:21:47,340 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:21:47" (1/1) ... [2025-03-09 01:21:47,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:21:47,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:21:47,366 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-09 01:21:47,371 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-09 01:21:47,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:21:47,390 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-09 01:21:47,390 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-09 01:21:47,390 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-09 01:21:47,390 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-09 01:21:47,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:21:47,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:21:47,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:21:47,391 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 01:21:47,451 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:21:47,452 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:21:47,646 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:21:47,646 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:21:47,752 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:21:47,752 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:21:47,753 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:21:47 BoogieIcfgContainer [2025-03-09 01:21:47,753 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:21:47,754 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:21:47,754 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:21:47,757 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:21:47,757 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:21:47" (1/3) ... [2025-03-09 01:21:47,758 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@402c352f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:21:47, skipping insertion in model container [2025-03-09 01:21:47,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:21:47" (2/3) ... [2025-03-09 01:21:47,758 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@402c352f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:21:47, skipping insertion in model container [2025-03-09 01:21:47,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:21:47" (3/3) ... [2025-03-09 01:21:47,759 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-bakery-2.wvr.c [2025-03-09 01:21:47,771 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:21:47,772 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-bakery-2.wvr.c that has 3 procedures, 55 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-03-09 01:21:47,772 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:21:47,819 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-09 01:21:47,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 56 transitions, 126 flow [2025-03-09 01:21:47,880 INFO L124 PetriNetUnfolderBase]: 2/54 cut-off events. [2025-03-09 01:21:47,882 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 01:21:47,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 54 events. 2/54 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 42 event pairs, 0 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2025-03-09 01:21:47,886 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 56 transitions, 126 flow [2025-03-09 01:21:47,889 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 53 transitions, 118 flow [2025-03-09 01:21:47,900 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:21:47,907 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;@10e8f34a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:21:47,907 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-09 01:21:47,919 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:21:47,919 INFO L124 PetriNetUnfolderBase]: 2/50 cut-off events. [2025-03-09 01:21:47,919 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 01:21:47,919 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:47,920 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:21:47,920 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 01:21:47,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:47,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1487673132, now seen corresponding path program 1 times [2025-03-09 01:21:47,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:47,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591054991] [2025-03-09 01:21:47,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:47,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:47,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-09 01:21:48,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 01:21:48,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:48,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:48,408 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-09 01:21:48,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:48,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591054991] [2025-03-09 01:21:48,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591054991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:21:48,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:21:48,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 01:21:48,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88277379] [2025-03-09 01:21:48,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:21:48,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:21:48,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:48,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:21:48,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:21:48,435 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 56 [2025-03-09 01:21:48,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 53 transitions, 118 flow. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 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-09 01:21:48,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:48,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 56 [2025-03-09 01:21:48,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:48,848 INFO L124 PetriNetUnfolderBase]: 441/859 cut-off events. [2025-03-09 01:21:48,849 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2025-03-09 01:21:48,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1710 conditions, 859 events. 441/859 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3819 event pairs, 149 based on Foata normal form. 4/836 useless extension candidates. Maximal degree in co-relation 1552. Up to 274 conditions per place. [2025-03-09 01:21:48,854 INFO L140 encePairwiseOnDemand]: 46/56 looper letters, 70 selfloop transitions, 10 changer transitions 21/110 dead transitions. [2025-03-09 01:21:48,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 110 transitions, 461 flow [2025-03-09 01:21:48,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:21:48,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:21:48,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 201 transitions. [2025-03-09 01:21:48,864 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4486607142857143 [2025-03-09 01:21:48,865 INFO L175 Difference]: Start difference. First operand has 58 places, 53 transitions, 118 flow. Second operand 8 states and 201 transitions. [2025-03-09 01:21:48,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 110 transitions, 461 flow [2025-03-09 01:21:48,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 110 transitions, 435 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:21:48,874 INFO L231 Difference]: Finished difference. Result has 62 places, 56 transitions, 150 flow [2025-03-09 01:21:48,877 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=150, PETRI_PLACES=62, PETRI_TRANSITIONS=56} [2025-03-09 01:21:48,880 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 4 predicate places. [2025-03-09 01:21:48,880 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 56 transitions, 150 flow [2025-03-09 01:21:48,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 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-09 01:21:48,880 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:48,881 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:21:48,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:21:48,881 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 01:21:48,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:48,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1958320308, now seen corresponding path program 2 times [2025-03-09 01:21:48,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:48,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667002544] [2025-03-09 01:21:48,882 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:21:48,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:48,905 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 1 equivalence classes. [2025-03-09 01:21:48,912 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 01:21:48,912 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:21:48,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:49,033 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-09 01:21:49,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:49,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667002544] [2025-03-09 01:21:49,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667002544] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:21:49,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:21:49,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:21:49,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874233226] [2025-03-09 01:21:49,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:21:49,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:21:49,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:49,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:21:49,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:21:49,055 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 56 [2025-03-09 01:21:49,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 56 transitions, 150 flow. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:21:49,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:49,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 56 [2025-03-09 01:21:49,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:49,263 INFO L124 PetriNetUnfolderBase]: 722/1316 cut-off events. [2025-03-09 01:21:49,263 INFO L125 PetriNetUnfolderBase]: For 98/98 co-relation queries the response was YES. [2025-03-09 01:21:49,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2853 conditions, 1316 events. 722/1316 cut-off events. For 98/98 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 6065 event pairs, 120 based on Foata normal form. 0/1275 useless extension candidates. Maximal degree in co-relation 2835. Up to 814 conditions per place. [2025-03-09 01:21:49,269 INFO L140 encePairwiseOnDemand]: 44/56 looper letters, 89 selfloop transitions, 18 changer transitions 9/122 dead transitions. [2025-03-09 01:21:49,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 122 transitions, 558 flow [2025-03-09 01:21:49,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:21:49,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:21:49,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 171 transitions. [2025-03-09 01:21:49,271 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4362244897959184 [2025-03-09 01:21:49,271 INFO L175 Difference]: Start difference. First operand has 62 places, 56 transitions, 150 flow. Second operand 7 states and 171 transitions. [2025-03-09 01:21:49,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 122 transitions, 558 flow [2025-03-09 01:21:49,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 122 transitions, 556 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-09 01:21:49,290 INFO L231 Difference]: Finished difference. Result has 70 places, 70 transitions, 261 flow [2025-03-09 01:21:49,290 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=261, PETRI_PLACES=70, PETRI_TRANSITIONS=70} [2025-03-09 01:21:49,290 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 12 predicate places. [2025-03-09 01:21:49,290 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 70 transitions, 261 flow [2025-03-09 01:21:49,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:21:49,291 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:49,291 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:21:49,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:21:49,291 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 01:21:49,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:49,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1511533650, now seen corresponding path program 3 times [2025-03-09 01:21:49,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:49,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93116631] [2025-03-09 01:21:49,292 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:21:49,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:49,304 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 47 statements into 1 equivalence classes. [2025-03-09 01:21:49,316 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 01:21:49,318 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 01:21:49,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:49,404 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-09 01:21:49,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:49,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93116631] [2025-03-09 01:21:49,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93116631] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:21:49,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:21:49,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:21:49,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506787309] [2025-03-09 01:21:49,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:21:49,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:21:49,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:49,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:21:49,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:21:49,408 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 56 [2025-03-09 01:21:49,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 70 transitions, 261 flow. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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-09 01:21:49,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:49,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 56 [2025-03-09 01:21:49,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:49,573 INFO L124 PetriNetUnfolderBase]: 536/1092 cut-off events. [2025-03-09 01:21:49,573 INFO L125 PetriNetUnfolderBase]: For 503/505 co-relation queries the response was YES. [2025-03-09 01:21:49,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2869 conditions, 1092 events. 536/1092 cut-off events. For 503/505 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5395 event pairs, 334 based on Foata normal form. 10/1093 useless extension candidates. Maximal degree in co-relation 1287. Up to 753 conditions per place. [2025-03-09 01:21:49,581 INFO L140 encePairwiseOnDemand]: 53/56 looper letters, 64 selfloop transitions, 2 changer transitions 4/83 dead transitions. [2025-03-09 01:21:49,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 83 transitions, 453 flow [2025-03-09 01:21:49,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:21:49,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:21:49,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2025-03-09 01:21:49,583 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2025-03-09 01:21:49,583 INFO L175 Difference]: Start difference. First operand has 70 places, 70 transitions, 261 flow. Second operand 3 states and 90 transitions. [2025-03-09 01:21:49,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 83 transitions, 453 flow [2025-03-09 01:21:49,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 83 transitions, 448 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-09 01:21:49,591 INFO L231 Difference]: Finished difference. Result has 72 places, 70 transitions, 264 flow [2025-03-09 01:21:49,592 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=264, PETRI_PLACES=72, PETRI_TRANSITIONS=70} [2025-03-09 01:21:49,593 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 14 predicate places. [2025-03-09 01:21:49,593 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 70 transitions, 264 flow [2025-03-09 01:21:49,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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-09 01:21:49,593 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:49,593 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:21:49,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:21:49,594 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 01:21:49,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:49,594 INFO L85 PathProgramCache]: Analyzing trace with hash 2087921950, now seen corresponding path program 4 times [2025-03-09 01:21:49,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:49,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607028511] [2025-03-09 01:21:49,595 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:21:49,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:49,605 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 47 statements into 2 equivalence classes. [2025-03-09 01:21:49,610 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 36 of 47 statements. [2025-03-09 01:21:49,611 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-09 01:21:49,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:49,679 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-09 01:21:49,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:49,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607028511] [2025-03-09 01:21:49,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607028511] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:21:49,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:21:49,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:21:49,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29051767] [2025-03-09 01:21:49,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:21:49,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:21:49,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:49,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:21:49,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:21:49,694 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2025-03-09 01:21:49,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 70 transitions, 264 flow. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 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-09 01:21:49,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:49,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2025-03-09 01:21:49,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:50,157 INFO L124 PetriNetUnfolderBase]: 1158/2176 cut-off events. [2025-03-09 01:21:50,158 INFO L125 PetriNetUnfolderBase]: For 1129/1129 co-relation queries the response was YES. [2025-03-09 01:21:50,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5975 conditions, 2176 events. 1158/2176 cut-off events. For 1129/1129 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 11683 event pairs, 108 based on Foata normal form. 0/2148 useless extension candidates. Maximal degree in co-relation 2382. Up to 818 conditions per place. [2025-03-09 01:21:50,171 INFO L140 encePairwiseOnDemand]: 40/56 looper letters, 144 selfloop transitions, 45 changer transitions 7/203 dead transitions. [2025-03-09 01:21:50,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 203 transitions, 1169 flow [2025-03-09 01:21:50,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:21:50,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-09 01:21:50,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 224 transitions. [2025-03-09 01:21:50,175 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4 [2025-03-09 01:21:50,175 INFO L175 Difference]: Start difference. First operand has 72 places, 70 transitions, 264 flow. Second operand 10 states and 224 transitions. [2025-03-09 01:21:50,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 203 transitions, 1169 flow [2025-03-09 01:21:50,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 203 transitions, 1155 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:21:50,183 INFO L231 Difference]: Finished difference. Result has 85 places, 105 transitions, 608 flow [2025-03-09 01:21:50,183 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=608, PETRI_PLACES=85, PETRI_TRANSITIONS=105} [2025-03-09 01:21:50,184 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 27 predicate places. [2025-03-09 01:21:50,184 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 105 transitions, 608 flow [2025-03-09 01:21:50,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 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-09 01:21:50,185 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:50,185 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:21:50,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:21:50,185 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 01:21:50,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:50,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1615670634, now seen corresponding path program 5 times [2025-03-09 01:21:50,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:50,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855169156] [2025-03-09 01:21:50,186 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:21:50,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:50,197 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 47 statements into 1 equivalence classes. [2025-03-09 01:21:50,208 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 01:21:50,208 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:21:50,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:50,283 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-09 01:21:50,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:50,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855169156] [2025-03-09 01:21:50,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855169156] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:21:50,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:21:50,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:21:50,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240072235] [2025-03-09 01:21:50,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:21:50,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:21:50,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:50,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:21:50,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:21:50,284 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 56 [2025-03-09 01:21:50,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 105 transitions, 608 flow. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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-09 01:21:50,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:50,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 56 [2025-03-09 01:21:50,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:50,479 INFO L124 PetriNetUnfolderBase]: 862/1735 cut-off events. [2025-03-09 01:21:50,479 INFO L125 PetriNetUnfolderBase]: For 2682/2720 co-relation queries the response was YES. [2025-03-09 01:21:50,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5598 conditions, 1735 events. 862/1735 cut-off events. For 2682/2720 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 9495 event pairs, 482 based on Foata normal form. 26/1743 useless extension candidates. Maximal degree in co-relation 3385. Up to 1255 conditions per place. [2025-03-09 01:21:50,490 INFO L140 encePairwiseOnDemand]: 53/56 looper letters, 100 selfloop transitions, 2 changer transitions 1/125 dead transitions. [2025-03-09 01:21:50,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 125 transitions, 914 flow [2025-03-09 01:21:50,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:21:50,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:21:50,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2025-03-09 01:21:50,491 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2025-03-09 01:21:50,491 INFO L175 Difference]: Start difference. First operand has 85 places, 105 transitions, 608 flow. Second operand 3 states and 91 transitions. [2025-03-09 01:21:50,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 125 transitions, 914 flow [2025-03-09 01:21:50,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 125 transitions, 864 flow, removed 25 selfloop flow, removed 0 redundant places. [2025-03-09 01:21:50,505 INFO L231 Difference]: Finished difference. Result has 88 places, 103 transitions, 558 flow [2025-03-09 01:21:50,505 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=558, PETRI_PLACES=88, PETRI_TRANSITIONS=103} [2025-03-09 01:21:50,506 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 30 predicate places. [2025-03-09 01:21:50,508 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 103 transitions, 558 flow [2025-03-09 01:21:50,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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-09 01:21:50,508 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:50,508 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:21:50,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:21:50,508 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 01:21:50,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:50,509 INFO L85 PathProgramCache]: Analyzing trace with hash 953422550, now seen corresponding path program 6 times [2025-03-09 01:21:50,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:50,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616220457] [2025-03-09 01:21:50,509 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 01:21:50,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:50,520 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 47 statements into 1 equivalence classes. [2025-03-09 01:21:50,546 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 01:21:50,546 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-09 01:21:50,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:50,680 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-09 01:21:50,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:50,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616220457] [2025-03-09 01:21:50,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616220457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:21:50,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:21:50,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 01:21:50,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760287857] [2025-03-09 01:21:50,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:21:50,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:21:50,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:50,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:21:50,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:21:50,681 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 56 [2025-03-09 01:21:50,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 103 transitions, 558 flow. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 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-09 01:21:50,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:50,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 56 [2025-03-09 01:21:50,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:50,960 INFO L124 PetriNetUnfolderBase]: 857/1686 cut-off events. [2025-03-09 01:21:50,960 INFO L125 PetriNetUnfolderBase]: For 2123/2151 co-relation queries the response was YES. [2025-03-09 01:21:50,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5403 conditions, 1686 events. 857/1686 cut-off events. For 2123/2151 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 9117 event pairs, 259 based on Foata normal form. 9/1664 useless extension candidates. Maximal degree in co-relation 5112. Up to 556 conditions per place. [2025-03-09 01:21:50,969 INFO L140 encePairwiseOnDemand]: 47/56 looper letters, 97 selfloop transitions, 9 changer transitions 63/189 dead transitions. [2025-03-09 01:21:50,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 189 transitions, 1367 flow [2025-03-09 01:21:50,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:21:50,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:21:50,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 189 transitions. [2025-03-09 01:21:50,970 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.421875 [2025-03-09 01:21:50,970 INFO L175 Difference]: Start difference. First operand has 88 places, 103 transitions, 558 flow. Second operand 8 states and 189 transitions. [2025-03-09 01:21:50,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 189 transitions, 1367 flow [2025-03-09 01:21:50,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 189 transitions, 1355 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:21:50,980 INFO L231 Difference]: Finished difference. Result has 94 places, 97 transitions, 545 flow [2025-03-09 01:21:50,980 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=545, PETRI_PLACES=94, PETRI_TRANSITIONS=97} [2025-03-09 01:21:50,982 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 36 predicate places. [2025-03-09 01:21:50,982 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 97 transitions, 545 flow [2025-03-09 01:21:50,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 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-09 01:21:50,983 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:50,983 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:21:50,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:21:50,983 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 01:21:50,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:50,984 INFO L85 PathProgramCache]: Analyzing trace with hash 582775996, now seen corresponding path program 7 times [2025-03-09 01:21:50,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:50,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719815934] [2025-03-09 01:21:50,984 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 01:21:50,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:50,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-09 01:21:50,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 01:21:50,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:50,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:51,106 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-09 01:21:51,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:51,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719815934] [2025-03-09 01:21:51,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719815934] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:21:51,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:21:51,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:21:51,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038977017] [2025-03-09 01:21:51,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:21:51,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:21:51,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:51,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:21:51,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:21:51,127 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 56 [2025-03-09 01:21:51,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 97 transitions, 545 flow. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 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-09 01:21:51,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:51,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 56 [2025-03-09 01:21:51,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:51,282 INFO L124 PetriNetUnfolderBase]: 558/1188 cut-off events. [2025-03-09 01:21:51,282 INFO L125 PetriNetUnfolderBase]: For 1437/1449 co-relation queries the response was YES. [2025-03-09 01:21:51,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3786 conditions, 1188 events. 558/1188 cut-off events. For 1437/1449 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 6100 event pairs, 113 based on Foata normal form. 6/1168 useless extension candidates. Maximal degree in co-relation 3758. Up to 897 conditions per place. [2025-03-09 01:21:51,289 INFO L140 encePairwiseOnDemand]: 48/56 looper letters, 78 selfloop transitions, 13 changer transitions 6/117 dead transitions. [2025-03-09 01:21:51,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 117 transitions, 811 flow [2025-03-09 01:21:51,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:21:51,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:21:51,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2025-03-09 01:21:51,290 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45357142857142857 [2025-03-09 01:21:51,290 INFO L175 Difference]: Start difference. First operand has 94 places, 97 transitions, 545 flow. Second operand 5 states and 127 transitions. [2025-03-09 01:21:51,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 117 transitions, 811 flow [2025-03-09 01:21:51,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 117 transitions, 765 flow, removed 8 selfloop flow, removed 10 redundant places. [2025-03-09 01:21:51,297 INFO L231 Difference]: Finished difference. Result has 88 places, 98 transitions, 545 flow [2025-03-09 01:21:51,298 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=545, PETRI_PLACES=88, PETRI_TRANSITIONS=98} [2025-03-09 01:21:51,298 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 30 predicate places. [2025-03-09 01:21:51,298 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 98 transitions, 545 flow [2025-03-09 01:21:51,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 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-09 01:21:51,298 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:51,299 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:21:51,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 01:21:51,299 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 01:21:51,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:51,299 INFO L85 PathProgramCache]: Analyzing trace with hash 455072446, now seen corresponding path program 8 times [2025-03-09 01:21:51,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:51,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120453366] [2025-03-09 01:21:51,300 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:21:51,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:51,305 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 1 equivalence classes. [2025-03-09 01:21:51,311 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 01:21:51,311 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:21:51,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:51,431 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-09 01:21:51,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:51,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120453366] [2025-03-09 01:21:51,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120453366] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:21:51,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:21:51,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:21:51,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281720211] [2025-03-09 01:21:51,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:21:51,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:21:51,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:51,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:21:51,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:21:51,449 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 56 [2025-03-09 01:21:51,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 98 transitions, 545 flow. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 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-09 01:21:51,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:51,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 56 [2025-03-09 01:21:51,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:51,635 INFO L124 PetriNetUnfolderBase]: 518/1110 cut-off events. [2025-03-09 01:21:51,635 INFO L125 PetriNetUnfolderBase]: For 1300/1312 co-relation queries the response was YES. [2025-03-09 01:21:51,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3362 conditions, 1110 events. 518/1110 cut-off events. For 1300/1312 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5576 event pairs, 111 based on Foata normal form. 6/1090 useless extension candidates. Maximal degree in co-relation 3171. Up to 809 conditions per place. [2025-03-09 01:21:51,640 INFO L140 encePairwiseOnDemand]: 48/56 looper letters, 76 selfloop transitions, 14 changer transitions 6/116 dead transitions. [2025-03-09 01:21:51,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 116 transitions, 781 flow [2025-03-09 01:21:51,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:21:51,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:21:51,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2025-03-09 01:21:51,643 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4607142857142857 [2025-03-09 01:21:51,643 INFO L175 Difference]: Start difference. First operand has 88 places, 98 transitions, 545 flow. Second operand 5 states and 129 transitions. [2025-03-09 01:21:51,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 116 transitions, 781 flow [2025-03-09 01:21:51,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 116 transitions, 762 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-03-09 01:21:51,651 INFO L231 Difference]: Finished difference. Result has 90 places, 95 transitions, 536 flow [2025-03-09 01:21:51,651 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=536, PETRI_PLACES=90, PETRI_TRANSITIONS=95} [2025-03-09 01:21:51,652 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 32 predicate places. [2025-03-09 01:21:51,652 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 95 transitions, 536 flow [2025-03-09 01:21:51,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 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-09 01:21:51,653 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:51,653 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, 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-09 01:21:51,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 01:21:51,653 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 01:21:51,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:51,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1599084197, now seen corresponding path program 1 times [2025-03-09 01:21:51,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:51,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031167026] [2025-03-09 01:21:51,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:51,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:51,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-09 01:21:51,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-09 01:21:51,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:51,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:51,712 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-09 01:21:51,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:51,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031167026] [2025-03-09 01:21:51,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031167026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:21:51,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:21:51,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:21:51,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223152418] [2025-03-09 01:21:51,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:21:51,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:21:51,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:51,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:21:51,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:21:51,730 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 56 [2025-03-09 01:21:51,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 95 transitions, 536 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:21:51,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:51,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 56 [2025-03-09 01:21:51,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:51,913 INFO L124 PetriNetUnfolderBase]: 501/1047 cut-off events. [2025-03-09 01:21:51,914 INFO L125 PetriNetUnfolderBase]: For 1174/1188 co-relation queries the response was YES. [2025-03-09 01:21:51,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3123 conditions, 1047 events. 501/1047 cut-off events. For 1174/1188 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4908 event pairs, 91 based on Foata normal form. 24/1063 useless extension candidates. Maximal degree in co-relation 2870. Up to 545 conditions per place. [2025-03-09 01:21:51,919 INFO L140 encePairwiseOnDemand]: 45/56 looper letters, 86 selfloop transitions, 17 changer transitions 1/113 dead transitions. [2025-03-09 01:21:51,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 113 transitions, 784 flow [2025-03-09 01:21:51,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:21:51,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:21:51,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 121 transitions. [2025-03-09 01:21:51,920 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43214285714285716 [2025-03-09 01:21:51,920 INFO L175 Difference]: Start difference. First operand has 90 places, 95 transitions, 536 flow. Second operand 5 states and 121 transitions. [2025-03-09 01:21:51,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 113 transitions, 784 flow [2025-03-09 01:21:51,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 113 transitions, 732 flow, removed 7 selfloop flow, removed 6 redundant places. [2025-03-09 01:21:51,924 INFO L231 Difference]: Finished difference. Result has 89 places, 88 transitions, 506 flow [2025-03-09 01:21:51,925 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=506, PETRI_PLACES=89, PETRI_TRANSITIONS=88} [2025-03-09 01:21:51,925 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 31 predicate places. [2025-03-09 01:21:51,925 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 88 transitions, 506 flow [2025-03-09 01:21:51,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:21:51,925 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:51,925 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, 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-09 01:21:51,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 01:21:51,926 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 01:21:51,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:51,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1263726103, now seen corresponding path program 1 times [2025-03-09 01:21:51,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:51,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007512690] [2025-03-09 01:21:51,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:51,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:51,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-09 01:21:51,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-09 01:21:51,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:51,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:52,053 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-09 01:21:52,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:52,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007512690] [2025-03-09 01:21:52,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007512690] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:21:52,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:21:52,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 01:21:52,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171044385] [2025-03-09 01:21:52,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:21:52,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:21:52,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:52,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:21:52,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:21:52,075 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 56 [2025-03-09 01:21:52,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 88 transitions, 506 flow. Second operand has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 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-09 01:21:52,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:52,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 56 [2025-03-09 01:21:52,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:52,290 INFO L124 PetriNetUnfolderBase]: 449/957 cut-off events. [2025-03-09 01:21:52,291 INFO L125 PetriNetUnfolderBase]: For 1293/1307 co-relation queries the response was YES. [2025-03-09 01:21:52,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2939 conditions, 957 events. 449/957 cut-off events. For 1293/1307 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 4469 event pairs, 157 based on Foata normal form. 12/960 useless extension candidates. Maximal degree in co-relation 1651. Up to 331 conditions per place. [2025-03-09 01:21:52,296 INFO L140 encePairwiseOnDemand]: 46/56 looper letters, 73 selfloop transitions, 16 changer transitions 20/120 dead transitions. [2025-03-09 01:21:52,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 120 transitions, 830 flow [2025-03-09 01:21:52,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:21:52,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:21:52,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 154 transitions. [2025-03-09 01:21:52,297 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39285714285714285 [2025-03-09 01:21:52,298 INFO L175 Difference]: Start difference. First operand has 89 places, 88 transitions, 506 flow. Second operand 7 states and 154 transitions. [2025-03-09 01:21:52,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 120 transitions, 830 flow [2025-03-09 01:21:52,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 120 transitions, 820 flow, removed 5 selfloop flow, removed 0 redundant places. [2025-03-09 01:21:52,304 INFO L231 Difference]: Finished difference. Result has 97 places, 78 transitions, 460 flow [2025-03-09 01:21:52,305 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=460, PETRI_PLACES=97, PETRI_TRANSITIONS=78} [2025-03-09 01:21:52,305 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 39 predicate places. [2025-03-09 01:21:52,306 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 78 transitions, 460 flow [2025-03-09 01:21:52,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 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-09 01:21:52,306 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:52,306 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, 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-09 01:21:52,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 01:21:52,306 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 01:21:52,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:52,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1575856983, now seen corresponding path program 2 times [2025-03-09 01:21:52,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:52,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950401707] [2025-03-09 01:21:52,308 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:21:52,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:52,314 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 1 equivalence classes. [2025-03-09 01:21:52,318 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-09 01:21:52,318 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:21:52,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:52,362 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-09 01:21:52,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:52,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950401707] [2025-03-09 01:21:52,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950401707] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:21:52,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:21:52,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:21:52,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026564081] [2025-03-09 01:21:52,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:21:52,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:21:52,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:52,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:21:52,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:21:52,375 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 56 [2025-03-09 01:21:52,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 78 transitions, 460 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:21:52,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:52,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 56 [2025-03-09 01:21:52,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:52,501 INFO L124 PetriNetUnfolderBase]: 212/469 cut-off events. [2025-03-09 01:21:52,501 INFO L125 PetriNetUnfolderBase]: For 641/645 co-relation queries the response was YES. [2025-03-09 01:21:52,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1383 conditions, 469 events. 212/469 cut-off events. For 641/645 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1597 event pairs, 48 based on Foata normal form. 12/477 useless extension candidates. Maximal degree in co-relation 1361. Up to 188 conditions per place. [2025-03-09 01:21:52,503 INFO L140 encePairwiseOnDemand]: 47/56 looper letters, 59 selfloop transitions, 7 changer transitions 2/75 dead transitions. [2025-03-09 01:21:52,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 75 transitions, 475 flow [2025-03-09 01:21:52,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:21:52,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:21:52,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions. [2025-03-09 01:21:52,505 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3892857142857143 [2025-03-09 01:21:52,505 INFO L175 Difference]: Start difference. First operand has 97 places, 78 transitions, 460 flow. Second operand 5 states and 109 transitions. [2025-03-09 01:21:52,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 75 transitions, 475 flow [2025-03-09 01:21:52,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 75 transitions, 393 flow, removed 9 selfloop flow, removed 19 redundant places. [2025-03-09 01:21:52,507 INFO L231 Difference]: Finished difference. Result has 76 places, 56 transitions, 211 flow [2025-03-09 01:21:52,507 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=211, PETRI_PLACES=76, PETRI_TRANSITIONS=56} [2025-03-09 01:21:52,508 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 18 predicate places. [2025-03-09 01:21:52,508 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 56 transitions, 211 flow [2025-03-09 01:21:52,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:21:52,508 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:52,508 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, 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-09 01:21:52,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 01:21:52,510 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-09 01:21:52,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:52,510 INFO L85 PathProgramCache]: Analyzing trace with hash -555125333, now seen corresponding path program 2 times [2025-03-09 01:21:52,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:52,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658524094] [2025-03-09 01:21:52,510 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:21:52,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:52,516 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 1 equivalence classes. [2025-03-09 01:21:52,522 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-09 01:21:52,522 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:21:52,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:52,633 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-09 01:21:52,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:52,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658524094] [2025-03-09 01:21:52,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658524094] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:21:52,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:21:52,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 01:21:52,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297742862] [2025-03-09 01:21:52,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:21:52,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:21:52,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:52,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:21:52,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:21:52,647 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 56 [2025-03-09 01:21:52,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 56 transitions, 211 flow. Second operand has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 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-09 01:21:52,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:52,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 56 [2025-03-09 01:21:52,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:52,770 INFO L124 PetriNetUnfolderBase]: 106/263 cut-off events. [2025-03-09 01:21:52,771 INFO L125 PetriNetUnfolderBase]: For 154/154 co-relation queries the response was YES. [2025-03-09 01:21:52,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 677 conditions, 263 events. 106/263 cut-off events. For 154/154 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 872 event pairs, 40 based on Foata normal form. 10/273 useless extension candidates. Maximal degree in co-relation 668. Up to 86 conditions per place. [2025-03-09 01:21:52,771 INFO L140 encePairwiseOnDemand]: 48/56 looper letters, 0 selfloop transitions, 0 changer transitions 51/51 dead transitions. [2025-03-09 01:21:52,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 51 transitions, 269 flow [2025-03-09 01:21:52,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:21:52,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:21:52,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions. [2025-03-09 01:21:52,773 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28316326530612246 [2025-03-09 01:21:52,773 INFO L175 Difference]: Start difference. First operand has 76 places, 56 transitions, 211 flow. Second operand 7 states and 111 transitions. [2025-03-09 01:21:52,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 51 transitions, 269 flow [2025-03-09 01:21:52,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 51 transitions, 242 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-09 01:21:52,774 INFO L231 Difference]: Finished difference. Result has 58 places, 0 transitions, 0 flow [2025-03-09 01:21:52,774 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=0, PETRI_PLACES=58, PETRI_TRANSITIONS=0} [2025-03-09 01:21:52,774 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 0 predicate places. [2025-03-09 01:21:52,774 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 0 transitions, 0 flow [2025-03-09 01:21:52,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 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-09 01:21:52,777 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (3 of 4 remaining) [2025-03-09 01:21:52,777 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 4 remaining) [2025-03-09 01:21:52,777 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-03-09 01:21:52,778 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-03-09 01:21:52,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 01:21:52,778 INFO L422 BasicCegarLoop]: Path program histogram: [8, 2, 2] [2025-03-09 01:21:52,782 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-09 01:21:52,782 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 01:21:52,787 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 01:21:52 BasicIcfg [2025-03-09 01:21:52,787 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 01:21:52,787 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 01:21:52,787 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 01:21:52,788 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 01:21:52,788 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:21:47" (3/4) ... [2025-03-09 01:21:52,790 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 01:21:52,793 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-09 01:21:52,793 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-09 01:21:52,795 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-03-09 01:21:52,796 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-03-09 01:21:52,796 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-09 01:21:52,796 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-09 01:21:52,854 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 01:21:52,855 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 01:21:52,855 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 01:21:52,856 INFO L158 Benchmark]: Toolchain (without parser) took 5757.74ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 113.3MB in the beginning and 373.0MB in the end (delta: -259.7MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. [2025-03-09 01:21:52,856 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:21:52,856 INFO L158 Benchmark]: CACSL2BoogieTranslator took 184.91ms. Allocated memory is still 142.6MB. Free memory was 113.3MB in the beginning and 101.8MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:21:52,857 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.20ms. Allocated memory is still 142.6MB. Free memory was 101.8MB in the beginning and 100.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:21:52,857 INFO L158 Benchmark]: Boogie Preprocessor took 29.42ms. Allocated memory is still 142.6MB. Free memory was 100.0MB in the beginning and 98.5MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:21:52,857 INFO L158 Benchmark]: IcfgBuilder took 413.04ms. Allocated memory is still 142.6MB. Free memory was 98.5MB in the beginning and 69.8MB in the end (delta: 28.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-09 01:21:52,857 INFO L158 Benchmark]: TraceAbstraction took 5032.95ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 69.3MB in the beginning and 377.0MB in the end (delta: -307.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:21:52,857 INFO L158 Benchmark]: Witness Printer took 67.56ms. Allocated memory is still 427.8MB. Free memory was 377.0MB in the beginning and 373.0MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:21:52,860 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.22ms. Allocated memory is still 201.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 184.91ms. Allocated memory is still 142.6MB. Free memory was 113.3MB in the beginning and 101.8MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.20ms. Allocated memory is still 142.6MB. Free memory was 101.8MB in the beginning and 100.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.42ms. Allocated memory is still 142.6MB. Free memory was 100.0MB in the beginning and 98.5MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 413.04ms. Allocated memory is still 142.6MB. Free memory was 98.5MB in the beginning and 69.8MB in the end (delta: 28.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 5032.95ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 69.3MB in the beginning and 377.0MB in the end (delta: -307.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 67.56ms. Allocated memory is still 427.8MB. Free memory was 377.0MB in the beginning and 373.0MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 21]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 77]: 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, 85 locations, 88 edges, 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: 4.9s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 653 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 586 mSDsluCounter, 26 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2635 IncrementalHoareTripleChecker+Invalid, 2674 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 10 mSDtfsCounter, 2635 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=608occurred in iteration=4, InterpolantAutomatonStates: 73, 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.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 568 NumberOfCodeBlocks, 557 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 556 ConstructedInterpolants, 0 QuantifiedInterpolants, 1242 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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-09 01:21:52,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE