./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/mix051_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/mix051_tso.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 798582ee4a09ede0f5c496225fe921dfd53b0dfd5ded797f7106b8b9ef24e798 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 09:52:10,199 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 09:52:10,245 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 09:52:10,248 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 09:52:10,251 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 09:52:10,263 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 09:52:10,264 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 09:52:10,264 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 09:52:10,264 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 09:52:10,264 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 09:52:10,264 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 09:52:10,264 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 09:52:10,265 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 09:52:10,265 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 09:52:10,265 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 09:52:10,265 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 09:52:10,265 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 09:52:10,265 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 09:52:10,265 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 09:52:10,265 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 09:52:10,265 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 09:52:10,266 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 09:52:10,266 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 09:52:10,266 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 09:52:10,266 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 09:52:10,266 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 09:52:10,266 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 09:52:10,266 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 09:52:10,266 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 09:52:10,266 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 09:52:10,266 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 09:52:10,266 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 09:52:10,267 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 09:52:10,267 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:52:10,267 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 09:52:10,267 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 09:52:10,267 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 09:52:10,267 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 09:52:10,267 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 09:52:10,267 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 09:52:10,267 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 09:52:10,267 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 09:52:10,267 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 -> 798582ee4a09ede0f5c496225fe921dfd53b0dfd5ded797f7106b8b9ef24e798 [2025-03-04 09:52:10,476 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 09:52:10,484 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 09:52:10,487 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 09:52:10,488 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 09:52:10,488 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 09:52:10,489 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix051_tso.oepc.i [2025-03-04 09:52:11,621 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59026c49a/5135ab149b4146a2ba75db99b6d415d7/FLAG138880fed [2025-03-04 09:52:11,907 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 09:52:11,908 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix051_tso.oepc.i [2025-03-04 09:52:11,923 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59026c49a/5135ab149b4146a2ba75db99b6d415d7/FLAG138880fed [2025-03-04 09:52:12,181 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59026c49a/5135ab149b4146a2ba75db99b6d415d7 [2025-03-04 09:52:12,183 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 09:52:12,184 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 09:52:12,185 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 09:52:12,185 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 09:52:12,188 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 09:52:12,188 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:52:12" (1/1) ... [2025-03-04 09:52:12,189 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3800c82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:52:12, skipping insertion in model container [2025-03-04 09:52:12,189 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:52:12" (1/1) ... [2025-03-04 09:52:12,222 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 09:52:12,436 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:52:12,447 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 09:52:12,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:52:12,533 INFO L204 MainTranslator]: Completed translation [2025-03-04 09:52:12,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:52:12 WrapperNode [2025-03-04 09:52:12,534 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 09:52:12,535 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 09:52:12,535 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 09:52:12,535 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 09:52:12,539 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:52:12" (1/1) ... [2025-03-04 09:52:12,549 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:52:12" (1/1) ... [2025-03-04 09:52:12,574 INFO L138 Inliner]: procedures = 176, calls = 52, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 150 [2025-03-04 09:52:12,574 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 09:52:12,576 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 09:52:12,577 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 09:52:12,577 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 09:52:12,583 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:52:12" (1/1) ... [2025-03-04 09:52:12,583 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:52:12" (1/1) ... [2025-03-04 09:52:12,586 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:52:12" (1/1) ... [2025-03-04 09:52:12,605 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 09:52:12,605 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:52:12" (1/1) ... [2025-03-04 09:52:12,606 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:52:12" (1/1) ... [2025-03-04 09:52:12,614 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:52:12" (1/1) ... [2025-03-04 09:52:12,616 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:52:12" (1/1) ... [2025-03-04 09:52:12,620 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:52:12" (1/1) ... [2025-03-04 09:52:12,621 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:52:12" (1/1) ... [2025-03-04 09:52:12,623 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 09:52:12,624 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 09:52:12,624 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 09:52:12,624 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 09:52:12,625 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:52:12" (1/1) ... [2025-03-04 09:52:12,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:52:12,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:52:12,651 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 09:52:12,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 09:52:12,680 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 09:52:12,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 09:52:12,680 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-04 09:52:12,680 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-04 09:52:12,680 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-04 09:52:12,680 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-04 09:52:12,680 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-03-04 09:52:12,680 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-03-04 09:52:12,681 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2025-03-04 09:52:12,681 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2025-03-04 09:52:12,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 09:52:12,681 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 09:52:12,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 09:52:12,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 09:52:12,682 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 09:52:12,799 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 09:52:12,800 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 09:52:13,119 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 09:52:13,119 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 09:52:13,321 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 09:52:13,321 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 09:52:13,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:52:13 BoogieIcfgContainer [2025-03-04 09:52:13,322 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 09:52:13,324 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 09:52:13,324 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 09:52:13,327 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 09:52:13,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 09:52:12" (1/3) ... [2025-03-04 09:52:13,328 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30e6d4e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:52:13, skipping insertion in model container [2025-03-04 09:52:13,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:52:12" (2/3) ... [2025-03-04 09:52:13,329 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30e6d4e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:52:13, skipping insertion in model container [2025-03-04 09:52:13,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:52:13" (3/3) ... [2025-03-04 09:52:13,331 INFO L128 eAbstractionObserver]: Analyzing ICFG mix051_tso.oepc.i [2025-03-04 09:52:13,343 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 09:52:13,346 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix051_tso.oepc.i that has 5 procedures, 52 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-03-04 09:52:13,346 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 09:52:13,402 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 09:52:13,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 53 transitions, 122 flow [2025-03-04 09:52:13,455 INFO L124 PetriNetUnfolderBase]: 2/49 cut-off events. [2025-03-04 09:52:13,457 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:52:13,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 49 events. 2/49 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 100 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2025-03-04 09:52:13,460 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 53 transitions, 122 flow [2025-03-04 09:52:13,462 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 49 transitions, 110 flow [2025-03-04 09:52:13,469 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:52:13,479 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;@6a8b168e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:52:13,479 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-04 09:52:13,483 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:52:13,485 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-03-04 09:52:13,485 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:52:13,485 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:52:13,486 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 09:52:13,486 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-04 09:52:13,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:52:13,492 INFO L85 PathProgramCache]: Analyzing trace with hash 139815811, now seen corresponding path program 1 times [2025-03-04 09:52:13,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:52:13,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19141644] [2025-03-04 09:52:13,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:52:13,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:52:13,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 09:52:13,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 09:52:13,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:52:13,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:52:13,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:52:13,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:52:13,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19141644] [2025-03-04 09:52:13,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19141644] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:52:13,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:52:13,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:52:13,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093477921] [2025-03-04 09:52:13,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:52:13,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:52:13,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:52:13,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:52:13,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:52:13,960 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2025-03-04 09:52:13,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 49 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:52:13,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:52:13,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2025-03-04 09:52:13,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:52:17,913 INFO L124 PetriNetUnfolderBase]: 43115/57400 cut-off events. [2025-03-04 09:52:17,913 INFO L125 PetriNetUnfolderBase]: For 246/246 co-relation queries the response was YES. [2025-03-04 09:52:18,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114516 conditions, 57400 events. 43115/57400 cut-off events. For 246/246 co-relation queries the response was YES. Maximal size of possible extension queue 1681. Compared 346963 event pairs, 5325 based on Foata normal form. 2592/59935 useless extension candidates. Maximal degree in co-relation 114504. Up to 49011 conditions per place. [2025-03-04 09:52:18,241 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 61 selfloop transitions, 2 changer transitions 2/73 dead transitions. [2025-03-04 09:52:18,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 73 transitions, 294 flow [2025-03-04 09:52:18,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:52:18,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:52:18,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2025-03-04 09:52:18,254 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-03-04 09:52:18,256 INFO L175 Difference]: Start difference. First operand has 60 places, 49 transitions, 110 flow. Second operand 3 states and 106 transitions. [2025-03-04 09:52:18,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 73 transitions, 294 flow [2025-03-04 09:52:18,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 73 transitions, 288 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 09:52:18,268 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 100 flow [2025-03-04 09:52:18,270 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2025-03-04 09:52:18,273 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -4 predicate places. [2025-03-04 09:52:18,275 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 100 flow [2025-03-04 09:52:18,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:52:18,275 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:52:18,275 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:52:18,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 09:52:18,276 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-04 09:52:18,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:52:18,276 INFO L85 PathProgramCache]: Analyzing trace with hash -774066886, now seen corresponding path program 1 times [2025-03-04 09:52:18,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:52:18,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252168079] [2025-03-04 09:52:18,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:52:18,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:52:18,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 09:52:18,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 09:52:18,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:52:18,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:52:18,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:52:18,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:52:18,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252168079] [2025-03-04 09:52:18,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252168079] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:52:18,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:52:18,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:52:18,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890824664] [2025-03-04 09:52:18,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:52:18,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:52:18,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:52:18,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:52:18,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:52:18,412 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2025-03-04 09:52:18,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:52:18,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:52:18,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2025-03-04 09:52:18,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:52:21,357 INFO L124 PetriNetUnfolderBase]: 38795/54687 cut-off events. [2025-03-04 09:52:21,357 INFO L125 PetriNetUnfolderBase]: For 2028/2028 co-relation queries the response was YES. [2025-03-04 09:52:21,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108213 conditions, 54687 events. 38795/54687 cut-off events. For 2028/2028 co-relation queries the response was YES. Maximal size of possible extension queue 1693. Compared 356484 event pairs, 38795 based on Foata normal form. 1296/55701 useless extension candidates. Maximal degree in co-relation 108203. Up to 50976 conditions per place. [2025-03-04 09:52:21,621 INFO L140 encePairwiseOnDemand]: 51/53 looper letters, 34 selfloop transitions, 1 changer transitions 1/43 dead transitions. [2025-03-04 09:52:21,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 43 transitions, 170 flow [2025-03-04 09:52:21,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:52:21,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:52:21,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2025-03-04 09:52:21,622 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44025157232704404 [2025-03-04 09:52:21,622 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 100 flow. Second operand 3 states and 70 transitions. [2025-03-04 09:52:21,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 43 transitions, 170 flow [2025-03-04 09:52:21,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 43 transitions, 166 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 09:52:21,625 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 94 flow [2025-03-04 09:52:21,625 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2025-03-04 09:52:21,626 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -6 predicate places. [2025-03-04 09:52:21,626 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 94 flow [2025-03-04 09:52:21,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:52:21,626 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:52:21,626 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:52:21,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 09:52:21,626 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-04 09:52:21,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:52:21,627 INFO L85 PathProgramCache]: Analyzing trace with hash -774066270, now seen corresponding path program 1 times [2025-03-04 09:52:21,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:52:21,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447656391] [2025-03-04 09:52:21,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:52:21,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:52:21,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 09:52:21,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 09:52:21,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:52:21,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:52:22,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:52:22,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:52:22,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447656391] [2025-03-04 09:52:22,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447656391] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:52:22,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:52:22,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:52:22,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287951943] [2025-03-04 09:52:22,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:52:22,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:52:22,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:52:22,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:52:22,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:52:22,426 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2025-03-04 09:52:22,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 94 flow. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:52:22,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:52:22,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2025-03-04 09:52:22,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:52:26,736 INFO L124 PetriNetUnfolderBase]: 50409/68915 cut-off events. [2025-03-04 09:52:26,736 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:52:26,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135903 conditions, 68915 events. 50409/68915 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2132. Compared 446189 event pairs, 7293 based on Foata normal form. 0/67682 useless extension candidates. Maximal degree in co-relation 135897. Up to 43463 conditions per place. [2025-03-04 09:52:27,040 INFO L140 encePairwiseOnDemand]: 40/53 looper letters, 70 selfloop transitions, 10 changer transitions 119/205 dead transitions. [2025-03-04 09:52:27,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 205 transitions, 830 flow [2025-03-04 09:52:27,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 09:52:27,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 09:52:27,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 323 transitions. [2025-03-04 09:52:27,045 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5540308747855918 [2025-03-04 09:52:27,046 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 94 flow. Second operand 11 states and 323 transitions. [2025-03-04 09:52:27,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 205 transitions, 830 flow [2025-03-04 09:52:27,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 205 transitions, 829 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:52:27,051 INFO L231 Difference]: Finished difference. Result has 70 places, 50 transitions, 196 flow [2025-03-04 09:52:27,052 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=196, PETRI_PLACES=70, PETRI_TRANSITIONS=50} [2025-03-04 09:52:27,053 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 10 predicate places. [2025-03-04 09:52:27,053 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 50 transitions, 196 flow [2025-03-04 09:52:27,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:52:27,053 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:52:27,053 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:52:27,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 09:52:27,053 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-04 09:52:27,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:52:27,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1711903034, now seen corresponding path program 1 times [2025-03-04 09:52:27,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:52:27,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085631069] [2025-03-04 09:52:27,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:52:27,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:52:27,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 09:52:27,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 09:52:27,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:52:27,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:52:27,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:52:27,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:52:27,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085631069] [2025-03-04 09:52:27,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085631069] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:52:27,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:52:27,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 09:52:27,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554420397] [2025-03-04 09:52:27,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:52:27,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:52:27,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:52:27,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:52:27,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:52:27,838 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2025-03-04 09:52:27,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 50 transitions, 196 flow. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:52:27,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:52:27,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2025-03-04 09:52:27,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:52:32,814 INFO L124 PetriNetUnfolderBase]: 42561/58619 cut-off events. [2025-03-04 09:52:32,815 INFO L125 PetriNetUnfolderBase]: For 84466/84466 co-relation queries the response was YES. [2025-03-04 09:52:33,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172272 conditions, 58619 events. 42561/58619 cut-off events. For 84466/84466 co-relation queries the response was YES. Maximal size of possible extension queue 1786. Compared 373841 event pairs, 7293 based on Foata normal form. 1188/59798 useless extension candidates. Maximal degree in co-relation 172257. Up to 43081 conditions per place. [2025-03-04 09:52:33,248 INFO L140 encePairwiseOnDemand]: 44/53 looper letters, 80 selfloop transitions, 7 changer transitions 69/162 dead transitions. [2025-03-04 09:52:33,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 162 transitions, 948 flow [2025-03-04 09:52:33,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 09:52:33,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 09:52:33,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 239 transitions. [2025-03-04 09:52:33,250 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5636792452830188 [2025-03-04 09:52:33,250 INFO L175 Difference]: Start difference. First operand has 70 places, 50 transitions, 196 flow. Second operand 8 states and 239 transitions. [2025-03-04 09:52:33,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 162 transitions, 948 flow [2025-03-04 09:52:33,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 162 transitions, 940 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-03-04 09:52:33,790 INFO L231 Difference]: Finished difference. Result has 72 places, 54 transitions, 271 flow [2025-03-04 09:52:33,790 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=271, PETRI_PLACES=72, PETRI_TRANSITIONS=54} [2025-03-04 09:52:33,791 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 12 predicate places. [2025-03-04 09:52:33,791 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 54 transitions, 271 flow [2025-03-04 09:52:33,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:52:33,791 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:52:33,791 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] [2025-03-04 09:52:33,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 09:52:33,792 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-04 09:52:33,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:52:33,792 INFO L85 PathProgramCache]: Analyzing trace with hash 2029760755, now seen corresponding path program 1 times [2025-03-04 09:52:33,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:52:33,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425907879] [2025-03-04 09:52:33,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:52:33,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:52:33,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 09:52:33,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 09:52:33,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:52:33,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:52:34,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:52:34,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:52:34,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425907879] [2025-03-04 09:52:34,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425907879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:52:34,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:52:34,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 09:52:34,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053205159] [2025-03-04 09:52:34,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:52:34,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:52:34,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:52:34,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:52:34,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:52:34,243 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2025-03-04 09:52:34,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 54 transitions, 271 flow. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:52:34,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:52:34,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2025-03-04 09:52:34,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:52:38,971 INFO L124 PetriNetUnfolderBase]: 39259/53989 cut-off events. [2025-03-04 09:52:38,971 INFO L125 PetriNetUnfolderBase]: For 149345/149345 co-relation queries the response was YES. [2025-03-04 09:52:39,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185611 conditions, 53989 events. 39259/53989 cut-off events. For 149345/149345 co-relation queries the response was YES. Maximal size of possible extension queue 1566. Compared 338933 event pairs, 5206 based on Foata normal form. 864/54836 useless extension candidates. Maximal degree in co-relation 185591. Up to 40750 conditions per place. [2025-03-04 09:52:39,336 INFO L140 encePairwiseOnDemand]: 43/53 looper letters, 78 selfloop transitions, 14 changer transitions 66/164 dead transitions. [2025-03-04 09:52:39,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 164 transitions, 1119 flow [2025-03-04 09:52:39,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 09:52:39,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 09:52:39,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 236 transitions. [2025-03-04 09:52:39,339 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5566037735849056 [2025-03-04 09:52:39,340 INFO L175 Difference]: Start difference. First operand has 72 places, 54 transitions, 271 flow. Second operand 8 states and 236 transitions. [2025-03-04 09:52:39,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 164 transitions, 1119 flow [2025-03-04 09:52:40,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 164 transitions, 1096 flow, removed 7 selfloop flow, removed 4 redundant places. [2025-03-04 09:52:40,092 INFO L231 Difference]: Finished difference. Result has 77 places, 59 transitions, 367 flow [2025-03-04 09:52:40,092 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=367, PETRI_PLACES=77, PETRI_TRANSITIONS=59} [2025-03-04 09:52:40,092 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 17 predicate places. [2025-03-04 09:52:40,092 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 59 transitions, 367 flow [2025-03-04 09:52:40,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:52:40,093 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:52:40,093 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] [2025-03-04 09:52:40,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 09:52:40,093 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-04 09:52:40,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:52:40,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1088104901, now seen corresponding path program 1 times [2025-03-04 09:52:40,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:52:40,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477010286] [2025-03-04 09:52:40,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:52:40,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:52:40,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 09:52:40,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 09:52:40,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:52:40,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:52:40,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:52:40,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:52:40,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477010286] [2025-03-04 09:52:40,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477010286] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:52:40,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:52:40,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:52:40,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304424622] [2025-03-04 09:52:40,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:52:40,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:52:40,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:52:40,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:52:40,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:52:40,225 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2025-03-04 09:52:40,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 59 transitions, 367 flow. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:52:40,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:52:40,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2025-03-04 09:52:40,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:52:43,717 INFO L124 PetriNetUnfolderBase]: 32575/45350 cut-off events. [2025-03-04 09:52:43,717 INFO L125 PetriNetUnfolderBase]: For 150820/150820 co-relation queries the response was YES. [2025-03-04 09:52:43,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163359 conditions, 45350 events. 32575/45350 cut-off events. For 150820/150820 co-relation queries the response was YES. Maximal size of possible extension queue 1366. Compared 281841 event pairs, 3537 based on Foata normal form. 1442/46755 useless extension candidates. Maximal degree in co-relation 163335. Up to 25435 conditions per place. [2025-03-04 09:52:44,000 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 122 selfloop transitions, 6 changer transitions 1/135 dead transitions. [2025-03-04 09:52:44,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 135 transitions, 1157 flow [2025-03-04 09:52:44,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:52:44,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 09:52:44,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 129 transitions. [2025-03-04 09:52:44,001 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6084905660377359 [2025-03-04 09:52:44,001 INFO L175 Difference]: Start difference. First operand has 77 places, 59 transitions, 367 flow. Second operand 4 states and 129 transitions. [2025-03-04 09:52:44,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 135 transitions, 1157 flow [2025-03-04 09:52:44,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 135 transitions, 1084 flow, removed 30 selfloop flow, removed 7 redundant places. [2025-03-04 09:52:44,558 INFO L231 Difference]: Finished difference. Result has 71 places, 63 transitions, 376 flow [2025-03-04 09:52:44,558 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=376, PETRI_PLACES=71, PETRI_TRANSITIONS=63} [2025-03-04 09:52:44,559 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 11 predicate places. [2025-03-04 09:52:44,559 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 63 transitions, 376 flow [2025-03-04 09:52:44,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:52:44,559 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:52:44,559 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] [2025-03-04 09:52:44,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 09:52:44,559 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-04 09:52:44,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:52:44,559 INFO L85 PathProgramCache]: Analyzing trace with hash 975279584, now seen corresponding path program 1 times [2025-03-04 09:52:44,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:52:44,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237428178] [2025-03-04 09:52:44,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:52:44,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:52:44,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 09:52:44,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 09:52:44,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:52:44,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:52:44,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:52:44,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:52:44,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237428178] [2025-03-04 09:52:44,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237428178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:52:44,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:52:44,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:52:44,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115036874] [2025-03-04 09:52:44,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:52:44,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:52:44,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:52:44,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:52:44,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:52:44,692 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2025-03-04 09:52:44,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 63 transitions, 376 flow. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 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-04 09:52:44,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:52:44,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2025-03-04 09:52:44,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand