./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.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_pso.opt_rmo.opt_tso.opt.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 0f6a99f321ab4c9a330ddab5bc184070524e662cb34c3dfc8d7fb0257fb493dd --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 09:52:05,086 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 09:52:05,142 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:05,146 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 09:52:05,146 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 09:52:05,171 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 09:52:05,172 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 09:52:05,172 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 09:52:05,173 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 09:52:05,173 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 09:52:05,173 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 09:52:05,173 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 09:52:05,174 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 09:52:05,174 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 09:52:05,174 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 09:52:05,174 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 09:52:05,174 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 09:52:05,174 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 09:52:05,174 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 09:52:05,174 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 09:52:05,174 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 09:52:05,174 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 09:52:05,174 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 09:52:05,174 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 09:52:05,174 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 09:52:05,174 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 09:52:05,174 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 09:52:05,174 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 09:52:05,175 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 09:52:05,175 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 09:52:05,175 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 09:52:05,175 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 09:52:05,175 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 09:52:05,175 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:52:05,175 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 09:52:05,175 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 09:52:05,175 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 09:52:05,175 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 09:52:05,175 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 09:52:05,175 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 09:52:05,175 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 09:52:05,175 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 09:52:05,175 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 -> 0f6a99f321ab4c9a330ddab5bc184070524e662cb34c3dfc8d7fb0257fb493dd [2025-03-04 09:52:05,444 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 09:52:05,454 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 09:52:05,457 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 09:52:05,458 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 09:52:05,458 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 09:52:05,459 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i [2025-03-04 09:52:06,623 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/801cac48a/4268b797d5274579a472fd26a3405a17/FLAG00aa5bfee [2025-03-04 09:52:06,899 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 09:52:06,900 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i [2025-03-04 09:52:06,910 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/801cac48a/4268b797d5274579a472fd26a3405a17/FLAG00aa5bfee [2025-03-04 09:52:07,206 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/801cac48a/4268b797d5274579a472fd26a3405a17 [2025-03-04 09:52:07,208 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 09:52:07,209 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 09:52:07,210 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 09:52:07,211 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 09:52:07,213 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 09:52:07,214 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:52:07" (1/1) ... [2025-03-04 09:52:07,215 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@758f4670 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:52:07, skipping insertion in model container [2025-03-04 09:52:07,215 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:52:07" (1/1) ... [2025-03-04 09:52:07,238 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 09:52:07,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:52:07,558 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 09:52:07,596 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:52:07,635 INFO L204 MainTranslator]: Completed translation [2025-03-04 09:52:07,635 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:52:07 WrapperNode [2025-03-04 09:52:07,636 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 09:52:07,637 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 09:52:07,637 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 09:52:07,637 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 09:52:07,642 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:07" (1/1) ... [2025-03-04 09:52:07,657 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:07" (1/1) ... [2025-03-04 09:52:07,681 INFO L138 Inliner]: procedures = 176, calls = 52, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 131 [2025-03-04 09:52:07,682 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 09:52:07,682 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 09:52:07,682 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 09:52:07,682 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 09:52:07,697 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:07" (1/1) ... [2025-03-04 09:52:07,698 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:07" (1/1) ... [2025-03-04 09:52:07,701 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:07" (1/1) ... [2025-03-04 09:52:07,716 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:07,716 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:07" (1/1) ... [2025-03-04 09:52:07,716 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:07" (1/1) ... [2025-03-04 09:52:07,722 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:07" (1/1) ... [2025-03-04 09:52:07,723 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:07" (1/1) ... [2025-03-04 09:52:07,726 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:07" (1/1) ... [2025-03-04 09:52:07,726 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:07" (1/1) ... [2025-03-04 09:52:07,729 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 09:52:07,729 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 09:52:07,729 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 09:52:07,729 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 09:52:07,730 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:52:07" (1/1) ... [2025-03-04 09:52:07,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:52:07,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:52:07,756 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:07,758 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:07,775 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 09:52:07,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 09:52:07,776 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-03-04 09:52:07,776 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-03-04 09:52:07,776 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-03-04 09:52:07,776 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-03-04 09:52:07,776 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-03-04 09:52:07,776 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-03-04 09:52:07,776 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2025-03-04 09:52:07,776 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2025-03-04 09:52:07,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 09:52:07,777 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 09:52:07,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 09:52:07,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 09:52:07,778 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:07,896 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 09:52:07,897 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 09:52:08,125 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 09:52:08,125 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 09:52:08,275 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 09:52:08,275 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 09:52:08,275 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:52:08 BoogieIcfgContainer [2025-03-04 09:52:08,275 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 09:52:08,277 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 09:52:08,277 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 09:52:08,282 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 09:52:08,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 09:52:07" (1/3) ... [2025-03-04 09:52:08,284 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6657de41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:52:08, skipping insertion in model container [2025-03-04 09:52:08,284 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:52:07" (2/3) ... [2025-03-04 09:52:08,284 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6657de41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:52:08, skipping insertion in model container [2025-03-04 09:52:08,284 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:52:08" (3/3) ... [2025-03-04 09:52:08,285 INFO L128 eAbstractionObserver]: Analyzing ICFG mix051_pso.opt_rmo.opt_tso.opt.i [2025-03-04 09:52:08,299 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 09:52:08,301 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix051_pso.opt_rmo.opt_tso.opt.i that has 5 procedures, 52 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-03-04 09:52:08,301 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 09:52:08,352 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 09:52:08,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 53 transitions, 122 flow [2025-03-04 09:52:08,408 INFO L124 PetriNetUnfolderBase]: 2/49 cut-off events. [2025-03-04 09:52:08,410 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:52:08,413 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 101 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:08,413 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 53 transitions, 122 flow [2025-03-04 09:52:08,419 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 49 transitions, 110 flow [2025-03-04 09:52:08,424 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:52:08,433 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;@77345459, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:52:08,434 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-04 09:52:08,445 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:52:08,446 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2025-03-04 09:52:08,446 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:52:08,446 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:52:08,447 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:52:08,447 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-04 09:52:08,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:52:08,451 INFO L85 PathProgramCache]: Analyzing trace with hash 963161255, now seen corresponding path program 1 times [2025-03-04 09:52:08,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:52:08,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072416676] [2025-03-04 09:52:08,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:52:08,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:52:08,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 09:52:08,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 09:52:08,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:52:08,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:52:08,891 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:08,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:52:08,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072416676] [2025-03-04 09:52:08,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072416676] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:52:08,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:52:08,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:52:08,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606343648] [2025-03-04 09:52:08,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:52:08,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:52:08,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:52:08,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:52:08,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:52:08,920 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2025-03-04 09:52:08,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 49 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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:08,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:52:08,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2025-03-04 09:52:08,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:52:12,404 INFO L124 PetriNetUnfolderBase]: 43115/57503 cut-off events. [2025-03-04 09:52:12,405 INFO L125 PetriNetUnfolderBase]: For 230/230 co-relation queries the response was YES. [2025-03-04 09:52:12,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114619 conditions, 57503 events. 43115/57503 cut-off events. For 230/230 co-relation queries the response was YES. Maximal size of possible extension queue 1721. Compared 339590 event pairs, 6395 based on Foata normal form. 2592/60070 useless extension candidates. Maximal degree in co-relation 114607. Up to 47521 conditions per place. [2025-03-04 09:52:12,683 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 57 selfloop transitions, 2 changer transitions 2/69 dead transitions. [2025-03-04 09:52:12,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 69 transitions, 272 flow [2025-03-04 09:52:12,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:52:12,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:52:12,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2025-03-04 09:52:12,695 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6415094339622641 [2025-03-04 09:52:12,696 INFO L175 Difference]: Start difference. First operand has 60 places, 49 transitions, 110 flow. Second operand 3 states and 102 transitions. [2025-03-04 09:52:12,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 69 transitions, 272 flow [2025-03-04 09:52:12,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 69 transitions, 268 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 09:52:12,707 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 100 flow [2025-03-04 09:52:12,709 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:12,712 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -4 predicate places. [2025-03-04 09:52:12,712 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 100 flow [2025-03-04 09:52:12,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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:12,714 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:52:12,714 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:12,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 09:52:12,714 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-04 09:52:12,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:52:12,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1977988253, now seen corresponding path program 1 times [2025-03-04 09:52:12,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:52:12,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714324132] [2025-03-04 09:52:12,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:52:12,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:52:12,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 09:52:12,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 09:52:12,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:52:12,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:52:12,787 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:12,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:52:12,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714324132] [2025-03-04 09:52:12,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714324132] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:52:12,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:52:12,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:52:12,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120383537] [2025-03-04 09:52:12,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:52:12,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:52:12,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:52:12,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:52:12,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:52:12,790 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2025-03-04 09:52:12,790 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:12,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:52:12,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2025-03-04 09:52:12,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:52:15,625 INFO L124 PetriNetUnfolderBase]: 38795/54911 cut-off events. [2025-03-04 09:52:15,626 INFO L125 PetriNetUnfolderBase]: For 1944/1944 co-relation queries the response was YES. [2025-03-04 09:52:15,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108353 conditions, 54911 events. 38795/54911 cut-off events. For 1944/1944 co-relation queries the response was YES. Maximal size of possible extension queue 1736. Compared 360575 event pairs, 38795 based on Foata normal form. 1296/56182 useless extension candidates. Maximal degree in co-relation 108343. Up to 50976 conditions per place. [2025-03-04 09:52:15,896 INFO L140 encePairwiseOnDemand]: 51/53 looper letters, 34 selfloop transitions, 1 changer transitions 1/43 dead transitions. [2025-03-04 09:52:15,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 43 transitions, 170 flow [2025-03-04 09:52:15,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:52:15,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:52:15,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2025-03-04 09:52:15,898 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44025157232704404 [2025-03-04 09:52:15,898 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:15,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 43 transitions, 170 flow [2025-03-04 09:52:15,911 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:15,911 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 94 flow [2025-03-04 09:52:15,911 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:15,912 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -6 predicate places. [2025-03-04 09:52:15,912 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 94 flow [2025-03-04 09:52:15,912 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:15,912 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:52:15,912 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:15,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 09:52:15,912 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-04 09:52:15,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:52:15,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1977987467, now seen corresponding path program 1 times [2025-03-04 09:52:15,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:52:15,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597053985] [2025-03-04 09:52:15,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:52:15,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:52:15,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 09:52:15,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 09:52:15,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:52:15,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:52:16,101 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:16,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:52:16,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597053985] [2025-03-04 09:52:16,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597053985] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:52:16,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:52:16,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:52:16,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067499354] [2025-03-04 09:52:16,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:52:16,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:52:16,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:52:16,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:52:16,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:52:16,105 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2025-03-04 09:52:16,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 94 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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:16,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:52:16,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2025-03-04 09:52:16,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:52:19,566 INFO L124 PetriNetUnfolderBase]: 49475/67713 cut-off events. [2025-03-04 09:52:19,566 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:52:19,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133491 conditions, 67713 events. 49475/67713 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2111. Compared 440200 event pairs, 9199 based on Foata normal form. 0/66485 useless extension candidates. Maximal degree in co-relation 133485. Up to 43215 conditions per place. [2025-03-04 09:52:19,848 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 55 selfloop transitions, 3 changer transitions 92/156 dead transitions. [2025-03-04 09:52:19,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 156 transitions, 628 flow [2025-03-04 09:52:19,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 09:52:19,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 09:52:19,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 240 transitions. [2025-03-04 09:52:19,851 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5660377358490566 [2025-03-04 09:52:19,851 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 94 flow. Second operand 8 states and 240 transitions. [2025-03-04 09:52:19,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 156 transitions, 628 flow [2025-03-04 09:52:19,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 156 transitions, 627 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:52:19,855 INFO L231 Difference]: Finished difference. Result has 64 places, 43 transitions, 126 flow [2025-03-04 09:52:19,855 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=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=126, PETRI_PLACES=64, PETRI_TRANSITIONS=43} [2025-03-04 09:52:19,856 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 4 predicate places. [2025-03-04 09:52:19,856 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 43 transitions, 126 flow [2025-03-04 09:52:19,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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:19,857 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:52:19,857 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:19,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 09:52:19,857 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-04 09:52:19,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:52:19,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1220287788, now seen corresponding path program 1 times [2025-03-04 09:52:19,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:52:19,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965244427] [2025-03-04 09:52:19,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:52:19,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:52:19,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 09:52:19,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 09:52:19,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:52:19,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:52:19,986 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:19,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:52:19,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965244427] [2025-03-04 09:52:19,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965244427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:52:19,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:52:19,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 09:52:19,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571367773] [2025-03-04 09:52:19,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:52:19,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 09:52:19,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:52:19,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 09:52:19,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 09:52:19,988 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2025-03-04 09:52:19,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 43 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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:19,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:52:19,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2025-03-04 09:52:19,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:52:21,996 INFO L124 PetriNetUnfolderBase]: 31203/43761 cut-off events. [2025-03-04 09:52:21,996 INFO L125 PetriNetUnfolderBase]: For 15726/15729 co-relation queries the response was YES. [2025-03-04 09:52:22,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99799 conditions, 43761 events. 31203/43761 cut-off events. For 15726/15729 co-relation queries the response was YES. Maximal size of possible extension queue 1391. Compared 276891 event pairs, 3565 based on Foata normal form. 1296/45041 useless extension candidates. Maximal degree in co-relation 99787. Up to 25489 conditions per place. [2025-03-04 09:52:22,294 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 78 selfloop transitions, 6 changer transitions 1/91 dead transitions. [2025-03-04 09:52:22,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 91 transitions, 434 flow [2025-03-04 09:52:22,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 09:52:22,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 09:52:22,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 129 transitions. [2025-03-04 09:52:22,295 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6084905660377359 [2025-03-04 09:52:22,295 INFO L175 Difference]: Start difference. First operand has 64 places, 43 transitions, 126 flow. Second operand 4 states and 129 transitions. [2025-03-04 09:52:22,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 91 transitions, 434 flow [2025-03-04 09:52:22,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 91 transitions, 423 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-04 09:52:22,323 INFO L231 Difference]: Finished difference. Result has 60 places, 47 transitions, 161 flow [2025-03-04 09:52:22,323 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=161, PETRI_PLACES=60, PETRI_TRANSITIONS=47} [2025-03-04 09:52:22,324 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 0 predicate places. [2025-03-04 09:52:22,324 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 47 transitions, 161 flow [2025-03-04 09:52:22,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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,324 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:52:22,325 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:22,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 09:52:22,325 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-04 09:52:22,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:52:22,325 INFO L85 PathProgramCache]: Analyzing trace with hash 89607381, now seen corresponding path program 1 times [2025-03-04 09:52:22,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:52:22,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014923554] [2025-03-04 09:52:22,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:52:22,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:52:22,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 09:52:22,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 09:52:22,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:52:22,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:52:22,499 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,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:52:22,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014923554] [2025-03-04 09:52:22,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014923554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:52:22,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:52:22,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:52:22,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851686531] [2025-03-04 09:52:22,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:52:22,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:52:22,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:52:22,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:52:22,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:52:22,505 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2025-03-04 09:52:22,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 47 transitions, 161 flow. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:52:22,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2025-03-04 09:52:22,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:52:27,134 INFO L124 PetriNetUnfolderBase]: 52473/72415 cut-off events. [2025-03-04 09:52:27,134 INFO L125 PetriNetUnfolderBase]: For 32170/32173 co-relation queries the response was YES. [2025-03-04 09:52:27,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179452 conditions, 72415 events. 52473/72415 cut-off events. For 32170/32173 co-relation queries the response was YES. Maximal size of possible extension queue 2272. Compared 469737 event pairs, 19393 based on Foata normal form. 1432/73827 useless extension candidates. Maximal degree in co-relation 179439. Up to 38601 conditions per place. [2025-03-04 09:52:27,619 INFO L140 encePairwiseOnDemand]: 44/53 looper letters, 68 selfloop transitions, 8 changer transitions 75/157 dead transitions. [2025-03-04 09:52:27,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 157 transitions, 794 flow [2025-03-04 09:52:27,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 09:52:27,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 09:52:27,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 219 transitions. [2025-03-04 09:52:27,620 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5902964959568733 [2025-03-04 09:52:27,620 INFO L175 Difference]: Start difference. First operand has 60 places, 47 transitions, 161 flow. Second operand 7 states and 219 transitions. [2025-03-04 09:52:27,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 157 transitions, 794 flow [2025-03-04 09:52:27,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 157 transitions, 777 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-04 09:52:27,637 INFO L231 Difference]: Finished difference. Result has 70 places, 53 transitions, 244 flow [2025-03-04 09:52:27,637 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=244, PETRI_PLACES=70, PETRI_TRANSITIONS=53} [2025-03-04 09:52:27,638 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 10 predicate places. [2025-03-04 09:52:27,638 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 53 transitions, 244 flow [2025-03-04 09:52:27,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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,638 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:52:27,638 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:27,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 09:52:27,638 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-04 09:52:27,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:52:27,638 INFO L85 PathProgramCache]: Analyzing trace with hash -485655247, now seen corresponding path program 1 times [2025-03-04 09:52:27,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:52:27,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22043804] [2025-03-04 09:52:27,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:52:27,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:52:27,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 09:52:27,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 09:52:27,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:52:27,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:52:27,751 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,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:52:27,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22043804] [2025-03-04 09:52:27,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22043804] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:52:27,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:52:27,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:52:27,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415010888] [2025-03-04 09:52:27,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:52:27,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:52:27,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:52:27,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:52:27,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:52:27,753 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2025-03-04 09:52:27,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 53 transitions, 244 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:27,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:52:27,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2025-03-04 09:52:27,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:52:30,431 INFO L124 PetriNetUnfolderBase]: 32477/45659 cut-off events. [2025-03-04 09:52:30,431 INFO L125 PetriNetUnfolderBase]: For 66597/66603 co-relation queries the response was YES. [2025-03-04 09:52:30,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129662 conditions, 45659 events. 32477/45659 cut-off events. For 66597/66603 co-relation queries the response was YES. Maximal size of possible extension queue 1242. Compared 285579 event pairs, 3229 based on Foata normal form. 1768/47407 useless extension candidates. Maximal degree in co-relation 129643. Up to 18957 conditions per place. [2025-03-04 09:52:30,780 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 119 selfloop transitions, 10 changer transitions 1/136 dead transitions. [2025-03-04 09:52:30,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 136 transitions, 913 flow [2025-03-04 09:52:30,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 09:52:30,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 09:52:30,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 166 transitions. [2025-03-04 09:52:30,781 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6264150943396226 [2025-03-04 09:52:30,781 INFO L175 Difference]: Start difference. First operand has 70 places, 53 transitions, 244 flow. Second operand 5 states and 166 transitions. [2025-03-04 09:52:30,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 136 transitions, 913 flow [2025-03-04 09:52:30,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 136 transitions, 857 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-03-04 09:52:30,869 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 285 flow [2025-03-04 09:52:30,869 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=285, PETRI_PLACES=68, PETRI_TRANSITIONS=57} [2025-03-04 09:52:30,870 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 8 predicate places. [2025-03-04 09:52:30,870 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 285 flow [2025-03-04 09:52:30,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has 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:30,870 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:52:30,870 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] [2025-03-04 09:52:30,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 09:52:30,870 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-04 09:52:30,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:52:30,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1386834075, now seen corresponding path program 1 times [2025-03-04 09:52:30,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:52:30,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177627939] [2025-03-04 09:52:30,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:52:30,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:52:30,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 09:52:30,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 09:52:30,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:52:30,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:52:30,975 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:30,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:52:30,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177627939] [2025-03-04 09:52:30,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177627939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:52:30,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:52:30,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:52:30,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249763728] [2025-03-04 09:52:30,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:52:30,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:52:30,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:52:30,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:52:30,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:52:30,976 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2025-03-04 09:52:30,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 285 flow. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 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:30,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:52:30,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2025-03-04 09:52:30,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:52:33,060 INFO L124 PetriNetUnfolderBase]: 19557/27315 cut-off events. [2025-03-04 09:52:33,060 INFO L125 PetriNetUnfolderBase]: For 45505/45511 co-relation queries the response was YES. [2025-03-04 09:52:33,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82664 conditions, 27315 events. 19557/27315 cut-off events. For 45505/45511 co-relation queries the response was YES. Maximal size of possible extension queue 736. Compared 155904 event pairs, 2329 based on Foata normal form. 944/28239 useless extension candidates. Maximal degree in co-relation 82645. Up to 8360 conditions per place. [2025-03-04 09:52:33,287 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 139 selfloop transitions, 14 changer transitions 2/161 dead transitions. [2025-03-04 09:52:33,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 161 transitions, 1075 flow [2025-03-04 09:52:33,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:52:33,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 09:52:33,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 201 transitions. [2025-03-04 09:52:33,288 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6320754716981132 [2025-03-04 09:52:33,288 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 285 flow. Second operand 6 states and 201 transitions. [2025-03-04 09:52:33,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 161 transitions, 1075 flow [2025-03-04 09:52:33,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 161 transitions, 1045 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-04 09:52:33,583 INFO L231 Difference]: Finished difference. Result has 71 places, 61 transitions, 335 flow [2025-03-04 09:52:33,584 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=335, PETRI_PLACES=71, PETRI_TRANSITIONS=61} [2025-03-04 09:52:33,584 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 11 predicate places. [2025-03-04 09:52:33,584 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 61 transitions, 335 flow [2025-03-04 09:52:33,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 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,584 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:52:33,585 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] [2025-03-04 09:52:33,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 09:52:33,585 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-04 09:52:33,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:52:33,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1956692659, now seen corresponding path program 1 times [2025-03-04 09:52:33,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:52:33,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705648637] [2025-03-04 09:52:33,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:52:33,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:52:33,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 09:52:33,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 09:52:33,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:52:33,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:52:33,831 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:33,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:52:33,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705648637] [2025-03-04 09:52:33,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705648637] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:52:33,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:52:33,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 09:52:33,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074872945] [2025-03-04 09:52:33,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:52:33,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:52:33,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:52:33,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:52:33,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:52:33,837 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2025-03-04 09:52:33,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 61 transitions, 335 flow. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 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,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:52:33,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2025-03-04 09:52:33,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:52:36,443 INFO L124 PetriNetUnfolderBase]: 27041/37701 cut-off events. [2025-03-04 09:52:36,444 INFO L125 PetriNetUnfolderBase]: For 62971/62977 co-relation queries the response was YES. [2025-03-04 09:52:36,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116427 conditions, 37701 events. 27041/37701 cut-off events. For 62971/62977 co-relation queries the response was YES. Maximal size of possible extension queue 1009. Compared 221952 event pairs, 3179 based on Foata normal form. 152/37833 useless extension candidates. Maximal degree in co-relation 116407. Up to 13536 conditions per place. [2025-03-04 09:52:36,659 INFO L140 encePairwiseOnDemand]: 43/53 looper letters, 140 selfloop transitions, 16 changer transitions 71/233 dead transitions. [2025-03-04 09:52:36,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 233 transitions, 1727 flow [2025-03-04 09:52:36,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 09:52:36,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 09:52:36,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 260 transitions. [2025-03-04 09:52:36,660 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6132075471698113 [2025-03-04 09:52:36,660 INFO L175 Difference]: Start difference. First operand has 71 places, 61 transitions, 335 flow. Second operand 8 states and 260 transitions. [2025-03-04 09:52:36,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 233 transitions, 1727 flow [2025-03-04 09:52:37,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 233 transitions, 1538 flow, removed 41 selfloop flow, removed 5 redundant places. [2025-03-04 09:52:37,034 INFO L231 Difference]: Finished difference. Result has 77 places, 68 transitions, 387 flow [2025-03-04 09:52:37,035 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=387, PETRI_PLACES=77, PETRI_TRANSITIONS=68} [2025-03-04 09:52:37,036 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 17 predicate places. [2025-03-04 09:52:37,036 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 68 transitions, 387 flow [2025-03-04 09:52:37,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 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:37,036 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:52:37,036 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] [2025-03-04 09:52:37,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 09:52:37,037 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-04 09:52:37,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:52:37,037 INFO L85 PathProgramCache]: Analyzing trace with hash -742468397, now seen corresponding path program 2 times [2025-03-04 09:52:37,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:52:37,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513852436] [2025-03-04 09:52:37,037 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:52:37,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:52:37,047 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 1 equivalence classes. [2025-03-04 09:52:37,081 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 09:52:37,085 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 09:52:37,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:52:37,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:37,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:52:37,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513852436] [2025-03-04 09:52:37,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513852436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:52:37,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:52:37,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 09:52:37,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305480681] [2025-03-04 09:52:37,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:52:37,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:52:37,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:52:37,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:52:37,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:52:37,224 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2025-03-04 09:52:37,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 68 transitions, 387 flow. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 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:37,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:52:37,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2025-03-04 09:52:37,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:52:38,727 INFO L124 PetriNetUnfolderBase]: 19117/26557 cut-off events. [2025-03-04 09:52:38,728 INFO L125 PetriNetUnfolderBase]: For 50551/50557 co-relation queries the response was YES. [2025-03-04 09:52:38,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80370 conditions, 26557 events. 19117/26557 cut-off events. For 50551/50557 co-relation queries the response was YES. Maximal size of possible extension queue 904. Compared 154381 event pairs, 2427 based on Foata normal form. 392/26935 useless extension candidates. Maximal degree in co-relation 80347. Up to 9196 conditions per place. [2025-03-04 09:52:38,928 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 123 selfloop transitions, 18 changer transitions 17/164 dead transitions. [2025-03-04 09:52:38,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 164 transitions, 1221 flow [2025-03-04 09:52:38,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 09:52:38,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 09:52:38,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 202 transitions. [2025-03-04 09:52:38,929 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5444743935309974 [2025-03-04 09:52:38,929 INFO L175 Difference]: Start difference. First operand has 77 places, 68 transitions, 387 flow. Second operand 7 states and 202 transitions. [2025-03-04 09:52:38,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 164 transitions, 1221 flow [2025-03-04 09:52:39,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 164 transitions, 1135 flow, removed 43 selfloop flow, removed 4 redundant places. [2025-03-04 09:52:39,594 INFO L231 Difference]: Finished difference. Result has 79 places, 64 transitions, 367 flow [2025-03-04 09:52:39,594 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=367, PETRI_PLACES=79, PETRI_TRANSITIONS=64} [2025-03-04 09:52:39,595 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 19 predicate places. [2025-03-04 09:52:39,595 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 64 transitions, 367 flow [2025-03-04 09:52:39,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 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:39,595 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:52:39,595 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] [2025-03-04 09:52:39,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 09:52:39,595 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-04 09:52:39,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:52:39,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1912374027, now seen corresponding path program 1 times [2025-03-04 09:52:39,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:52:39,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057317428] [2025-03-04 09:52:39,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:52:39,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:52:39,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 09:52:39,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 09:52:39,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:52:39,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:52:39,804 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:39,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:52:39,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057317428] [2025-03-04 09:52:39,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057317428] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:52:39,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:52:39,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 09:52:39,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717968320] [2025-03-04 09:52:39,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:52:39,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:52:39,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:52:39,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:52:39,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:52:39,807 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2025-03-04 09:52:39,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 64 transitions, 367 flow. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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:39,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:52:39,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2025-03-04 09:52:39,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand