./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.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/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.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 6aeaf730cbe4eb831d189bfd9925d1660c7714b9e685f389bc2495c0943d6472 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:02:21,545 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:02:21,597 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:02:21,603 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:02:21,603 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:02:21,624 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:02:21,625 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:02:21,625 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:02:21,626 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:02:21,626 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:02:21,627 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:02:21,627 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:02:21,627 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:02:21,627 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:02:21,627 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:02:21,628 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:02:21,628 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:02:21,628 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:02:21,628 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:02:21,628 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:02:21,628 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:02:21,628 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:02:21,628 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:02:21,628 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:02:21,628 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:02:21,628 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:02:21,628 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:02:21,628 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:02:21,628 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:02:21,628 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:02:21,628 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:02:21,628 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:02:21,628 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:02:21,628 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:02:21,629 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:02:21,629 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:02:21,629 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:02:21,629 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:02:21,629 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:02:21,630 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:02:21,630 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:02:21,630 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:02:21,630 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 -> 6aeaf730cbe4eb831d189bfd9925d1660c7714b9e685f389bc2495c0943d6472 [2025-03-04 10:02:21,862 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:02:21,869 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:02:21,872 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:02:21,873 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:02:21,874 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:02:21,875 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2025-03-04 10:02:22,973 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8e902584/b235fcba3ccc40d4a4d232711b44b44a/FLAG9de0d1cfc [2025-03-04 10:02:23,272 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:02:23,274 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2025-03-04 10:02:23,288 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8e902584/b235fcba3ccc40d4a4d232711b44b44a/FLAG9de0d1cfc [2025-03-04 10:02:23,548 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8e902584/b235fcba3ccc40d4a4d232711b44b44a [2025-03-04 10:02:23,549 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:02:23,551 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:02:23,552 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:02:23,552 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:02:23,555 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:02:23,557 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:02:23" (1/1) ... [2025-03-04 10:02:23,557 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a1a7767 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:02:23, skipping insertion in model container [2025-03-04 10:02:23,557 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:02:23" (1/1) ... [2025-03-04 10:02:23,586 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:02:23,764 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:02:23,773 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:02:23,809 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:02:23,834 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:02:23,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:02:23 WrapperNode [2025-03-04 10:02:23,835 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:02:23,836 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:02:23,836 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:02:23,836 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:02:23,840 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:02:23" (1/1) ... [2025-03-04 10:02:23,847 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:02:23" (1/1) ... [2025-03-04 10:02:23,862 INFO L138 Inliner]: procedures = 165, calls = 35, calls flagged for inlining = 8, calls inlined = 9, statements flattened = 116 [2025-03-04 10:02:23,862 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:02:23,863 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:02:23,863 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:02:23,863 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:02:23,868 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:02:23" (1/1) ... [2025-03-04 10:02:23,869 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:02:23" (1/1) ... [2025-03-04 10:02:23,871 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:02:23" (1/1) ... [2025-03-04 10:02:23,880 INFO L175 MemorySlicer]: Split 18 memory accesses to 2 slices as follows [2, 16]. 89 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 6]. The 3 writes are split as follows [0, 3]. [2025-03-04 10:02:23,880 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:02:23" (1/1) ... [2025-03-04 10:02:23,880 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:02:23" (1/1) ... [2025-03-04 10:02:23,888 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:02:23" (1/1) ... [2025-03-04 10:02:23,888 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:02:23" (1/1) ... [2025-03-04 10:02:23,889 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:02:23" (1/1) ... [2025-03-04 10:02:23,890 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:02:23" (1/1) ... [2025-03-04 10:02:23,891 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:02:23,892 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:02:23,892 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:02:23,892 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:02:23,892 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:02:23" (1/1) ... [2025-03-04 10:02:23,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:02:23,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:02:23,918 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 10:02:23,923 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 10:02:23,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:02:23,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 10:02:23,936 INFO L130 BoogieDeclarations]: Found specification of procedure worker [2025-03-04 10:02:23,936 INFO L138 BoogieDeclarations]: Found implementation of procedure worker [2025-03-04 10:02:23,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:02:23,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:02:23,936 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 10:02:23,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:02:23,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:02:23,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:02:23,937 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 10:02:23,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:02:23,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:02:23,938 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 10:02:24,026 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:02:24,027 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:02:24,245 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:02:24,245 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:02:24,329 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:02:24,330 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:02:24,330 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:02:24 BoogieIcfgContainer [2025-03-04 10:02:24,331 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:02:24,333 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:02:24,333 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:02:24,335 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:02:24,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:02:23" (1/3) ... [2025-03-04 10:02:24,336 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71f89f70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:02:24, skipping insertion in model container [2025-03-04 10:02:24,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:02:23" (2/3) ... [2025-03-04 10:02:24,336 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71f89f70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:02:24, skipping insertion in model container [2025-03-04 10:02:24,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:02:24" (3/3) ... [2025-03-04 10:02:24,337 INFO L128 eAbstractionObserver]: Analyzing ICFG 13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2025-03-04 10:02:24,345 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:02:24,348 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 13-privatized_68-pfscan_protected_loop_minimal_interval_true.i that has 2 procedures, 66 locations, 1 initial locations, 3 loop locations, and 23 error locations. [2025-03-04 10:02:24,348 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:02:24,392 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 10:02:24,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 75 transitions, 154 flow [2025-03-04 10:02:24,440 INFO L124 PetriNetUnfolderBase]: 10/74 cut-off events. [2025-03-04 10:02:24,444 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:02:24,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78 conditions, 74 events. 10/74 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 206 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2025-03-04 10:02:24,447 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 75 transitions, 154 flow [2025-03-04 10:02:24,450 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 74 transitions, 151 flow [2025-03-04 10:02:24,455 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:02:24,462 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;@51111335, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:02:24,462 INFO L334 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2025-03-04 10:02:24,464 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:02:24,464 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2025-03-04 10:02:24,464 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:02:24,464 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:02:24,465 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-03-04 10:02:24,465 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-03-04 10:02:24,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:02:24,469 INFO L85 PathProgramCache]: Analyzing trace with hash 11907, now seen corresponding path program 1 times [2025-03-04 10:02:24,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:02:24,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158073203] [2025-03-04 10:02:24,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:02:24,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:02:24,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 10:02:24,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 10:02:24,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:02:24,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:02:24,654 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 10:02:24,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:02:24,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158073203] [2025-03-04 10:02:24,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158073203] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:02:24,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:02:24,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:02:24,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550319165] [2025-03-04 10:02:24,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:02:24,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:02:24,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:02:24,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:02:24,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:02:24,710 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 75 [2025-03-04 10:02:24,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 74 transitions, 151 flow. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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 10:02:24,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:02:24,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 75 [2025-03-04 10:02:24,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:02:24,892 INFO L124 PetriNetUnfolderBase]: 212/615 cut-off events. [2025-03-04 10:02:24,892 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:02:24,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 988 conditions, 615 events. 212/615 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3840 event pairs, 147 based on Foata normal form. 54/503 useless extension candidates. Maximal degree in co-relation 976. Up to 368 conditions per place. [2025-03-04 10:02:24,898 INFO L140 encePairwiseOnDemand]: 66/75 looper letters, 28 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2025-03-04 10:02:24,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 65 transitions, 193 flow [2025-03-04 10:02:24,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:02:24,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:02:24,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 145 transitions. [2025-03-04 10:02:24,911 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6444444444444445 [2025-03-04 10:02:24,913 INFO L175 Difference]: Start difference. First operand has 68 places, 74 transitions, 151 flow. Second operand 3 states and 145 transitions. [2025-03-04 10:02:24,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 65 transitions, 193 flow [2025-03-04 10:02:24,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 65 transitions, 192 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:02:24,921 INFO L231 Difference]: Finished difference. Result has 65 places, 65 transitions, 136 flow [2025-03-04 10:02:24,923 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=65, PETRI_TRANSITIONS=65} [2025-03-04 10:02:24,926 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -3 predicate places. [2025-03-04 10:02:24,926 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 65 transitions, 136 flow [2025-03-04 10:02:24,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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 10:02:24,927 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:02:24,927 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-03-04 10:02:24,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:02:24,928 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-03-04 10:02:24,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:02:24,929 INFO L85 PathProgramCache]: Analyzing trace with hash 11908, now seen corresponding path program 1 times [2025-03-04 10:02:24,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:02:24,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647218926] [2025-03-04 10:02:24,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:02:24,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:02:24,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 10:02:24,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 10:02:24,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:02:24,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:02:25,030 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 10:02:25,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:02:25,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647218926] [2025-03-04 10:02:25,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647218926] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:02:25,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:02:25,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:02:25,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568598990] [2025-03-04 10:02:25,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:02:25,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:02:25,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:02:25,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:02:25,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:02:25,060 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 75 [2025-03-04 10:02:25,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 65 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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 10:02:25,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:02:25,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 75 [2025-03-04 10:02:25,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:02:25,160 INFO L124 PetriNetUnfolderBase]: 212/614 cut-off events. [2025-03-04 10:02:25,160 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:02:25,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 989 conditions, 614 events. 212/614 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3822 event pairs, 147 based on Foata normal form. 1/449 useless extension candidates. Maximal degree in co-relation 980. Up to 368 conditions per place. [2025-03-04 10:02:25,167 INFO L140 encePairwiseOnDemand]: 72/75 looper letters, 28 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2025-03-04 10:02:25,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 64 transitions, 194 flow [2025-03-04 10:02:25,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:02:25,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:02:25,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 139 transitions. [2025-03-04 10:02:25,169 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6177777777777778 [2025-03-04 10:02:25,169 INFO L175 Difference]: Start difference. First operand has 65 places, 65 transitions, 136 flow. Second operand 3 states and 139 transitions. [2025-03-04 10:02:25,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 64 transitions, 194 flow [2025-03-04 10:02:25,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 64 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:02:25,170 INFO L231 Difference]: Finished difference. Result has 64 places, 64 transitions, 134 flow [2025-03-04 10:02:25,170 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=64, PETRI_TRANSITIONS=64} [2025-03-04 10:02:25,171 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -4 predicate places. [2025-03-04 10:02:25,171 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 64 transitions, 134 flow [2025-03-04 10:02:25,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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 10:02:25,171 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:02:25,171 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 10:02:25,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:02:25,171 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-03-04 10:02:25,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:02:25,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1874281203, now seen corresponding path program 1 times [2025-03-04 10:02:25,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:02:25,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900873588] [2025-03-04 10:02:25,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:02:25,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:02:25,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:02:25,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:02:25,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:02:25,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:02:25,219 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 10:02:25,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:02:25,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900873588] [2025-03-04 10:02:25,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900873588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:02:25,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:02:25,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:02:25,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858056940] [2025-03-04 10:02:25,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:02:25,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:02:25,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:02:25,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:02:25,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:02:25,240 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 75 [2025-03-04 10:02:25,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 64 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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 10:02:25,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:02:25,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 75 [2025-03-04 10:02:25,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:02:25,320 INFO L124 PetriNetUnfolderBase]: 212/612 cut-off events. [2025-03-04 10:02:25,321 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:02:25,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 987 conditions, 612 events. 212/612 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3828 event pairs, 147 based on Foata normal form. 0/446 useless extension candidates. Maximal degree in co-relation 978. Up to 368 conditions per place. [2025-03-04 10:02:25,323 INFO L140 encePairwiseOnDemand]: 73/75 looper letters, 29 selfloop transitions, 1 changer transitions 0/63 dead transitions. [2025-03-04 10:02:25,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 63 transitions, 192 flow [2025-03-04 10:02:25,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:02:25,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:02:25,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 139 transitions. [2025-03-04 10:02:25,325 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6177777777777778 [2025-03-04 10:02:25,326 INFO L175 Difference]: Start difference. First operand has 64 places, 64 transitions, 134 flow. Second operand 3 states and 139 transitions. [2025-03-04 10:02:25,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 63 transitions, 192 flow [2025-03-04 10:02:25,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 63 transitions, 188 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:02:25,327 INFO L231 Difference]: Finished difference. Result has 63 places, 63 transitions, 130 flow [2025-03-04 10:02:25,327 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=63, PETRI_TRANSITIONS=63} [2025-03-04 10:02:25,327 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -5 predicate places. [2025-03-04 10:02:25,328 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 63 transitions, 130 flow [2025-03-04 10:02:25,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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 10:02:25,328 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:02:25,328 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:02:25,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:02:25,328 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting workerErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-03-04 10:02:25,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:02:25,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1554879625, now seen corresponding path program 1 times [2025-03-04 10:02:25,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:02:25,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501402878] [2025-03-04 10:02:25,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:02:25,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:02:25,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:02:25,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:02:25,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:02:25,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:02:25,398 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 10:02:25,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:02:25,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501402878] [2025-03-04 10:02:25,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501402878] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:02:25,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:02:25,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:02:25,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443629305] [2025-03-04 10:02:25,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:02:25,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:02:25,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:02:25,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:02:25,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:02:25,440 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 75 [2025-03-04 10:02:25,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 63 transitions, 130 flow. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 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 10:02:25,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:02:25,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 75 [2025-03-04 10:02:25,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:02:25,539 INFO L124 PetriNetUnfolderBase]: 192/540 cut-off events. [2025-03-04 10:02:25,540 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:02:25,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 897 conditions, 540 events. 192/540 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3118 event pairs, 8 based on Foata normal form. 20/476 useless extension candidates. Maximal degree in co-relation 891. Up to 319 conditions per place. [2025-03-04 10:02:25,542 INFO L140 encePairwiseOnDemand]: 66/75 looper letters, 37 selfloop transitions, 3 changer transitions 0/67 dead transitions. [2025-03-04 10:02:25,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 67 transitions, 218 flow [2025-03-04 10:02:25,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:02:25,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:02:25,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 170 transitions. [2025-03-04 10:02:25,546 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2025-03-04 10:02:25,547 INFO L175 Difference]: Start difference. First operand has 63 places, 63 transitions, 130 flow. Second operand 4 states and 170 transitions. [2025-03-04 10:02:25,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 67 transitions, 218 flow [2025-03-04 10:02:25,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 67 transitions, 217 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:02:25,548 INFO L231 Difference]: Finished difference. Result has 59 places, 57 transitions, 123 flow [2025-03-04 10:02:25,548 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=123, PETRI_PLACES=59, PETRI_TRANSITIONS=57} [2025-03-04 10:02:25,549 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -9 predicate places. [2025-03-04 10:02:25,549 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 57 transitions, 123 flow [2025-03-04 10:02:25,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 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 10:02:25,549 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:02:25,549 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:02:25,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:02:25,550 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting workerErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-03-04 10:02:25,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:02:25,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1554879624, now seen corresponding path program 1 times [2025-03-04 10:02:25,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:02:25,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485108128] [2025-03-04 10:02:25,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:02:25,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:02:25,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:02:25,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:02:25,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:02:25,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:02:25,682 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 10:02:25,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:02:25,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485108128] [2025-03-04 10:02:25,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485108128] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:02:25,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:02:25,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:02:25,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440334683] [2025-03-04 10:02:25,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:02:25,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:02:25,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:02:25,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:02:25,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:02:25,729 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 75 [2025-03-04 10:02:25,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 57 transitions, 123 flow. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 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 10:02:25,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:02:25,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 75 [2025-03-04 10:02:25,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:02:25,837 INFO L124 PetriNetUnfolderBase]: 206/502 cut-off events. [2025-03-04 10:02:25,837 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-03-04 10:02:25,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 894 conditions, 502 events. 206/502 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2604 event pairs, 60 based on Foata normal form. 22/432 useless extension candidates. Maximal degree in co-relation 887. Up to 324 conditions per place. [2025-03-04 10:02:25,840 INFO L140 encePairwiseOnDemand]: 66/75 looper letters, 37 selfloop transitions, 3 changer transitions 0/61 dead transitions. [2025-03-04 10:02:25,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 61 transitions, 211 flow [2025-03-04 10:02:25,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:02:25,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:02:25,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 170 transitions. [2025-03-04 10:02:25,841 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2025-03-04 10:02:25,841 INFO L175 Difference]: Start difference. First operand has 59 places, 57 transitions, 123 flow. Second operand 4 states and 170 transitions. [2025-03-04 10:02:25,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 61 transitions, 211 flow [2025-03-04 10:02:25,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 61 transitions, 205 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:02:25,842 INFO L231 Difference]: Finished difference. Result has 53 places, 51 transitions, 111 flow [2025-03-04 10:02:25,842 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=111, PETRI_PLACES=53, PETRI_TRANSITIONS=51} [2025-03-04 10:02:25,843 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -15 predicate places. [2025-03-04 10:02:25,843 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 51 transitions, 111 flow [2025-03-04 10:02:25,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 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 10:02:25,843 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:02:25,843 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:02:25,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:02:25,843 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-03-04 10:02:25,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:02:25,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1592926589, now seen corresponding path program 1 times [2025-03-04 10:02:25,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:02:25,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401643905] [2025-03-04 10:02:25,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:02:25,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:02:25,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:02:25,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:02:25,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:02:25,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:02:25,914 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 10:02:25,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:02:25,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401643905] [2025-03-04 10:02:25,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401643905] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:02:25,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:02:25,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:02:25,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958966343] [2025-03-04 10:02:25,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:02:25,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:02:25,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:02:25,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:02:25,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:02:25,946 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 75 [2025-03-04 10:02:25,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 51 transitions, 111 flow. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 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 10:02:25,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:02:25,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 75 [2025-03-04 10:02:25,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:02:26,040 INFO L124 PetriNetUnfolderBase]: 214/523 cut-off events. [2025-03-04 10:02:26,040 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-03-04 10:02:26,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 930 conditions, 523 events. 214/523 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2793 event pairs, 52 based on Foata normal form. 36/461 useless extension candidates. Maximal degree in co-relation 923. Up to 227 conditions per place. [2025-03-04 10:02:26,044 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 44 selfloop transitions, 3 changer transitions 0/65 dead transitions. [2025-03-04 10:02:26,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 65 transitions, 237 flow [2025-03-04 10:02:26,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:02:26,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:02:26,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 186 transitions. [2025-03-04 10:02:26,045 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.62 [2025-03-04 10:02:26,045 INFO L175 Difference]: Start difference. First operand has 53 places, 51 transitions, 111 flow. Second operand 4 states and 186 transitions. [2025-03-04 10:02:26,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 65 transitions, 237 flow [2025-03-04 10:02:26,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 65 transitions, 227 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:02:26,046 INFO L231 Difference]: Finished difference. Result has 50 places, 48 transitions, 105 flow [2025-03-04 10:02:26,047 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=105, PETRI_PLACES=50, PETRI_TRANSITIONS=48} [2025-03-04 10:02:26,047 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -18 predicate places. [2025-03-04 10:02:26,048 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 48 transitions, 105 flow [2025-03-04 10:02:26,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 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 10:02:26,048 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:02:26,048 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:02:26,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:02:26,049 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-03-04 10:02:26,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:02:26,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1592926588, now seen corresponding path program 1 times [2025-03-04 10:02:26,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:02:26,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912554555] [2025-03-04 10:02:26,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:02:26,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:02:26,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:02:26,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:02:26,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:02:26,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:02:26,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:02:26,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:02:26,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912554555] [2025-03-04 10:02:26,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912554555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:02:26,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:02:26,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:02:26,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557070475] [2025-03-04 10:02:26,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:02:26,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:02:26,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:02:26,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:02:26,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:02:26,183 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 75 [2025-03-04 10:02:26,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 48 transitions, 105 flow. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 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 10:02:26,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:02:26,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 75 [2025-03-04 10:02:26,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:02:26,296 INFO L124 PetriNetUnfolderBase]: 214/472 cut-off events. [2025-03-04 10:02:26,297 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-04 10:02:26,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 885 conditions, 472 events. 214/472 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2314 event pairs, 52 based on Foata normal form. 36/461 useless extension candidates. Maximal degree in co-relation 878. Up to 227 conditions per place. [2025-03-04 10:02:26,298 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 44 selfloop transitions, 3 changer transitions 0/62 dead transitions. [2025-03-04 10:02:26,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 62 transitions, 227 flow [2025-03-04 10:02:26,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:02:26,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:02:26,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 186 transitions. [2025-03-04 10:02:26,300 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.62 [2025-03-04 10:02:26,300 INFO L175 Difference]: Start difference. First operand has 50 places, 48 transitions, 105 flow. Second operand 4 states and 186 transitions. [2025-03-04 10:02:26,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 62 transitions, 227 flow [2025-03-04 10:02:26,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 62 transitions, 221 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:02:26,302 INFO L231 Difference]: Finished difference. Result has 47 places, 45 transitions, 99 flow [2025-03-04 10:02:26,302 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=99, PETRI_PLACES=47, PETRI_TRANSITIONS=45} [2025-03-04 10:02:26,303 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -21 predicate places. [2025-03-04 10:02:26,304 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 45 transitions, 99 flow [2025-03-04 10:02:26,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 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 10:02:26,304 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:02:26,304 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:02:26,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:02:26,304 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting workerErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-03-04 10:02:26,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:02:26,305 INFO L85 PathProgramCache]: Analyzing trace with hash 345677444, now seen corresponding path program 1 times [2025-03-04 10:02:26,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:02:26,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702997448] [2025-03-04 10:02:26,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:02:26,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:02:26,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:02:26,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:02:26,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:02:26,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:02:26,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:02:26,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:02:26,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702997448] [2025-03-04 10:02:26,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702997448] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:02:26,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:02:26,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:02:26,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712451400] [2025-03-04 10:02:26,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:02:26,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:02:26,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:02:26,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:02:26,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:02:26,542 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 75 [2025-03-04 10:02:26,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 45 transitions, 99 flow. Second operand has 6 states, 6 states have (on average 35.333333333333336) internal successors, (212), 6 states have internal predecessors, (212), 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 10:02:26,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:02:26,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 75 [2025-03-04 10:02:26,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:02:26,769 INFO L124 PetriNetUnfolderBase]: 457/949 cut-off events. [2025-03-04 10:02:26,769 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-04 10:02:26,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1857 conditions, 949 events. 457/949 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 4967 event pairs, 60 based on Foata normal form. 0/826 useless extension candidates. Maximal degree in co-relation 1850. Up to 427 conditions per place. [2025-03-04 10:02:26,772 INFO L140 encePairwiseOnDemand]: 63/75 looper letters, 79 selfloop transitions, 16 changer transitions 0/107 dead transitions. [2025-03-04 10:02:26,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 107 transitions, 429 flow [2025-03-04 10:02:26,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:02:26,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:02:26,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 335 transitions. [2025-03-04 10:02:26,774 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.638095238095238 [2025-03-04 10:02:26,774 INFO L175 Difference]: Start difference. First operand has 47 places, 45 transitions, 99 flow. Second operand 7 states and 335 transitions. [2025-03-04 10:02:26,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 107 transitions, 429 flow [2025-03-04 10:02:26,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 107 transitions, 407 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:02:26,779 INFO L231 Difference]: Finished difference. Result has 55 places, 57 transitions, 197 flow [2025-03-04 10:02:26,779 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=197, PETRI_PLACES=55, PETRI_TRANSITIONS=57} [2025-03-04 10:02:26,780 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -13 predicate places. [2025-03-04 10:02:26,780 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 57 transitions, 197 flow [2025-03-04 10:02:26,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 35.333333333333336) internal successors, (212), 6 states have internal predecessors, (212), 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 10:02:26,780 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:02:26,780 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:02:26,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 10:02:26,780 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting workerErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-03-04 10:02:26,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:02:26,780 INFO L85 PathProgramCache]: Analyzing trace with hash 346509574, now seen corresponding path program 1 times [2025-03-04 10:02:26,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:02:26,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987426012] [2025-03-04 10:02:26,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:02:26,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:02:26,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:02:26,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:02:26,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:02:26,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:02:26,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:02:26,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:02:26,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987426012] [2025-03-04 10:02:26,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987426012] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:02:26,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:02:26,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:02:26,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998201649] [2025-03-04 10:02:26,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:02:26,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:02:26,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:02:26,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:02:26,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:02:26,933 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 75 [2025-03-04 10:02:26,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 57 transitions, 197 flow. Second operand has 5 states, 5 states have (on average 34.8) internal successors, (174), 5 states have internal predecessors, (174), 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 10:02:26,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:02:26,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 75 [2025-03-04 10:02:26,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:02:27,136 INFO L124 PetriNetUnfolderBase]: 578/1185 cut-off events. [2025-03-04 10:02:27,136 INFO L125 PetriNetUnfolderBase]: For 312/312 co-relation queries the response was YES. [2025-03-04 10:02:27,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2723 conditions, 1185 events. 578/1185 cut-off events. For 312/312 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 6488 event pairs, 123 based on Foata normal form. 29/1053 useless extension candidates. Maximal degree in co-relation 2711. Up to 584 conditions per place. [2025-03-04 10:02:27,142 INFO L140 encePairwiseOnDemand]: 63/75 looper letters, 85 selfloop transitions, 24 changer transitions 0/120 dead transitions. [2025-03-04 10:02:27,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 120 transitions, 589 flow [2025-03-04 10:02:27,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:02:27,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:02:27,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 290 transitions. [2025-03-04 10:02:27,144 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6444444444444445 [2025-03-04 10:02:27,144 INFO L175 Difference]: Start difference. First operand has 55 places, 57 transitions, 197 flow. Second operand 6 states and 290 transitions. [2025-03-04 10:02:27,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 120 transitions, 589 flow [2025-03-04 10:02:27,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 120 transitions, 587 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:02:27,148 INFO L231 Difference]: Finished difference. Result has 64 places, 73 transitions, 387 flow [2025-03-04 10:02:27,148 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=387, PETRI_PLACES=64, PETRI_TRANSITIONS=73} [2025-03-04 10:02:27,149 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -4 predicate places. [2025-03-04 10:02:27,149 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 73 transitions, 387 flow [2025-03-04 10:02:27,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.8) internal successors, (174), 5 states have internal predecessors, (174), 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 10:02:27,149 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:02:27,149 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:02:27,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 10:02:27,150 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting workerErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-03-04 10:02:27,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:02:27,150 INFO L85 PathProgramCache]: Analyzing trace with hash 177706135, now seen corresponding path program 1 times [2025-03-04 10:02:27,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:02:27,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959001323] [2025-03-04 10:02:27,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:02:27,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:02:27,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 10:02:27,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:02:27,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:02:27,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:02:27,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:02:27,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:02:27,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959001323] [2025-03-04 10:02:27,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959001323] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:02:27,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:02:27,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 10:02:27,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702716302] [2025-03-04 10:02:27,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:02:27,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:02:27,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:02:27,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:02:27,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:02:27,652 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 75 [2025-03-04 10:02:27,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 73 transitions, 387 flow. Second operand has 9 states, 9 states have (on average 34.666666666666664) internal successors, (312), 9 states have internal predecessors, (312), 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 10:02:27,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:02:27,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 75 [2025-03-04 10:02:27,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:02:28,372 INFO L124 PetriNetUnfolderBase]: 1060/2151 cut-off events. [2025-03-04 10:02:28,372 INFO L125 PetriNetUnfolderBase]: For 2513/2513 co-relation queries the response was YES. [2025-03-04 10:02:28,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6116 conditions, 2151 events. 1060/2151 cut-off events. For 2513/2513 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 13561 event pairs, 179 based on Foata normal form. 20/1946 useless extension candidates. Maximal degree in co-relation 6100. Up to 751 conditions per place. [2025-03-04 10:02:28,383 INFO L140 encePairwiseOnDemand]: 59/75 looper letters, 166 selfloop transitions, 124 changer transitions 0/301 dead transitions. [2025-03-04 10:02:28,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 301 transitions, 2143 flow [2025-03-04 10:02:28,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 10:02:28,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-04 10:02:28,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 871 transitions. [2025-03-04 10:02:28,386 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5806666666666667 [2025-03-04 10:02:28,386 INFO L175 Difference]: Start difference. First operand has 64 places, 73 transitions, 387 flow. Second operand 20 states and 871 transitions. [2025-03-04 10:02:28,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 301 transitions, 2143 flow [2025-03-04 10:02:28,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 301 transitions, 2143 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 10:02:28,399 INFO L231 Difference]: Finished difference. Result has 100 places, 190 transitions, 1744 flow [2025-03-04 10:02:28,399 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=387, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1744, PETRI_PLACES=100, PETRI_TRANSITIONS=190} [2025-03-04 10:02:28,401 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 32 predicate places. [2025-03-04 10:02:28,401 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 190 transitions, 1744 flow [2025-03-04 10:02:28,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 34.666666666666664) internal successors, (312), 9 states have internal predecessors, (312), 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 10:02:28,402 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:02:28,402 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:02:28,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 10:02:28,402 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting workerErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-03-04 10:02:28,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:02:28,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1252382769, now seen corresponding path program 2 times [2025-03-04 10:02:28,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:02:28,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154508417] [2025-03-04 10:02:28,403 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:02:28,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:02:28,410 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-04 10:02:28,417 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 21 statements. [2025-03-04 10:02:28,417 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:02:28,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:02:28,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:02:28,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:02:28,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154508417] [2025-03-04 10:02:28,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154508417] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:02:28,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:02:28,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 10:02:28,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818781608] [2025-03-04 10:02:28,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:02:28,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:02:28,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:02:28,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:02:28,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:02:28,826 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 75 [2025-03-04 10:02:28,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 190 transitions, 1744 flow. Second operand has 9 states, 9 states have (on average 34.666666666666664) internal successors, (312), 9 states have internal predecessors, (312), 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 10:02:28,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:02:28,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 75 [2025-03-04 10:02:28,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:02:29,594 INFO L124 PetriNetUnfolderBase]: 1412/2869 cut-off events. [2025-03-04 10:02:29,595 INFO L125 PetriNetUnfolderBase]: For 8872/8882 co-relation queries the response was YES. [2025-03-04 10:02:29,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10506 conditions, 2869 events. 1412/2869 cut-off events. For 8872/8882 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 19224 event pairs, 163 based on Foata normal form. 26/2669 useless extension candidates. Maximal degree in co-relation 10472. Up to 898 conditions per place. [2025-03-04 10:02:29,613 INFO L140 encePairwiseOnDemand]: 59/75 looper letters, 240 selfloop transitions, 175 changer transitions 0/426 dead transitions. [2025-03-04 10:02:29,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 426 transitions, 4286 flow [2025-03-04 10:02:29,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 10:02:29,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-04 10:02:29,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 835 transitions. [2025-03-04 10:02:29,616 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5859649122807018 [2025-03-04 10:02:29,616 INFO L175 Difference]: Start difference. First operand has 100 places, 190 transitions, 1744 flow. Second operand 19 states and 835 transitions. [2025-03-04 10:02:29,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 426 transitions, 4286 flow [2025-03-04 10:02:29,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 426 transitions, 4234 flow, removed 26 selfloop flow, removed 0 redundant places. [2025-03-04 10:02:29,656 INFO L231 Difference]: Finished difference. Result has 133 places, 307 transitions, 3649 flow [2025-03-04 10:02:29,657 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=1692, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=3649, PETRI_PLACES=133, PETRI_TRANSITIONS=307} [2025-03-04 10:02:29,657 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 65 predicate places. [2025-03-04 10:02:29,657 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 307 transitions, 3649 flow [2025-03-04 10:02:29,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 34.666666666666664) internal successors, (312), 9 states have internal predecessors, (312), 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 10:02:29,658 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:02:29,658 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:02:29,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 10:02:29,658 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting workerErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-03-04 10:02:29,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:02:29,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1511205959, now seen corresponding path program 3 times [2025-03-04 10:02:29,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:02:29,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96072195] [2025-03-04 10:02:29,659 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:02:29,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:02:29,665 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-03-04 10:02:29,668 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 20 of 21 statements. [2025-03-04 10:02:29,668 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 10:02:29,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:02:29,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:02:29,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:02:29,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96072195] [2025-03-04 10:02:29,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96072195] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:02:29,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:02:29,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 10:02:29,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326592241] [2025-03-04 10:02:29,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:02:29,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:02:29,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:02:29,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:02:29,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:02:30,090 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 75 [2025-03-04 10:02:30,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 307 transitions, 3649 flow. Second operand has 10 states, 10 states have (on average 33.6) internal successors, (336), 10 states have internal predecessors, (336), 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 10:02:30,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:02:30,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 75 [2025-03-04 10:02:30,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:02:31,038 INFO L124 PetriNetUnfolderBase]: 1884/3713 cut-off events. [2025-03-04 10:02:31,039 INFO L125 PetriNetUnfolderBase]: For 21584/21598 co-relation queries the response was YES. [2025-03-04 10:02:31,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16308 conditions, 3713 events. 1884/3713 cut-off events. For 21584/21598 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 25361 event pairs, 181 based on Foata normal form. 26/3452 useless extension candidates. Maximal degree in co-relation 16259. Up to 1366 conditions per place. [2025-03-04 10:02:31,065 INFO L140 encePairwiseOnDemand]: 56/75 looper letters, 291 selfloop transitions, 241 changer transitions 0/542 dead transitions. [2025-03-04 10:02:31,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 542 transitions, 6642 flow [2025-03-04 10:02:31,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 10:02:31,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-04 10:02:31,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 780 transitions. [2025-03-04 10:02:31,067 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5777777777777777 [2025-03-04 10:02:31,067 INFO L175 Difference]: Start difference. First operand has 133 places, 307 transitions, 3649 flow. Second operand 18 states and 780 transitions. [2025-03-04 10:02:31,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 542 transitions, 6642 flow [2025-03-04 10:02:31,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 542 transitions, 6556 flow, removed 43 selfloop flow, removed 0 redundant places. [2025-03-04 10:02:31,180 INFO L231 Difference]: Finished difference. Result has 163 places, 391 transitions, 5537 flow [2025-03-04 10:02:31,181 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=3563, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=159, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=5537, PETRI_PLACES=163, PETRI_TRANSITIONS=391} [2025-03-04 10:02:31,181 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 95 predicate places. [2025-03-04 10:02:31,181 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 391 transitions, 5537 flow [2025-03-04 10:02:31,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 33.6) internal successors, (336), 10 states have internal predecessors, (336), 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 10:02:31,182 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:02:31,182 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:02:31,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 10:02:31,182 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting workerErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-03-04 10:02:31,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:02:31,183 INFO L85 PathProgramCache]: Analyzing trace with hash 280738959, now seen corresponding path program 4 times [2025-03-04 10:02:31,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:02:31,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748492622] [2025-03-04 10:02:31,183 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:02:31,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:02:31,192 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-03-04 10:02:31,194 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 18 of 21 statements. [2025-03-04 10:02:31,194 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 10:02:31,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:02:31,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:02:31,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:02:31,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748492622] [2025-03-04 10:02:31,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748492622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:02:31,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:02:31,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 10:02:31,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921532274] [2025-03-04 10:02:31,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:02:31,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:02:31,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:02:31,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:02:31,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:02:31,622 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 75 [2025-03-04 10:02:31,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 391 transitions, 5537 flow. Second operand has 9 states, 9 states have (on average 34.666666666666664) internal successors, (312), 9 states have internal predecessors, (312), 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 10:02:31,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:02:31,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 75 [2025-03-04 10:02:31,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:02:32,648 INFO L124 PetriNetUnfolderBase]: 2279/4560 cut-off events. [2025-03-04 10:02:32,648 INFO L125 PetriNetUnfolderBase]: For 41577/41599 co-relation queries the response was YES. [2025-03-04 10:02:32,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24227 conditions, 4560 events. 2279/4560 cut-off events. For 41577/41599 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 33882 event pairs, 423 based on Foata normal form. 36/4218 useless extension candidates. Maximal degree in co-relation 24164. Up to 1433 conditions per place. [2025-03-04 10:02:32,690 INFO L140 encePairwiseOnDemand]: 59/75 looper letters, 318 selfloop transitions, 305 changer transitions 0/636 dead transitions. [2025-03-04 10:02:32,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 636 transitions, 9781 flow [2025-03-04 10:02:32,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 10:02:32,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-04 10:02:32,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 745 transitions. [2025-03-04 10:02:32,694 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5843137254901961 [2025-03-04 10:02:32,694 INFO L175 Difference]: Start difference. First operand has 163 places, 391 transitions, 5537 flow. Second operand 17 states and 745 transitions. [2025-03-04 10:02:32,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 636 transitions, 9781 flow [2025-03-04 10:02:32,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 636 transitions, 9215 flow, removed 111 selfloop flow, removed 4 redundant places. [2025-03-04 10:02:32,879 INFO L231 Difference]: Finished difference. Result has 189 places, 518 transitions, 8418 flow [2025-03-04 10:02:32,879 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=5158, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=181, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=8418, PETRI_PLACES=189, PETRI_TRANSITIONS=518} [2025-03-04 10:02:32,880 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 121 predicate places. [2025-03-04 10:02:32,880 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 518 transitions, 8418 flow [2025-03-04 10:02:32,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 34.666666666666664) internal successors, (312), 9 states have internal predecessors, (312), 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 10:02:32,880 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:02:32,880 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:02:32,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 10:02:32,880 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting workerErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-03-04 10:02:32,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:02:32,881 INFO L85 PathProgramCache]: Analyzing trace with hash -157096297, now seen corresponding path program 1 times [2025-03-04 10:02:32,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:02:32,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379362021] [2025-03-04 10:02:32,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:02:32,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:02:32,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 10:02:32,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:02:32,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:02:32,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:02:33,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:02:33,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:02:33,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379362021] [2025-03-04 10:02:33,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379362021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:02:33,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:02:33,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 10:02:33,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109130282] [2025-03-04 10:02:33,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:02:33,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:02:33,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:02:33,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:02:33,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:02:33,395 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 75 [2025-03-04 10:02:33,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 518 transitions, 8418 flow. Second operand has 10 states, 10 states have (on average 34.5) internal successors, (345), 10 states have internal predecessors, (345), 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 10:02:33,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:02:33,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 75 [2025-03-04 10:02:33,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:02:34,666 INFO L124 PetriNetUnfolderBase]: 2771/5534 cut-off events. [2025-03-04 10:02:34,667 INFO L125 PetriNetUnfolderBase]: For 59959/59992 co-relation queries the response was YES. [2025-03-04 10:02:34,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32271 conditions, 5534 events. 2771/5534 cut-off events. For 59959/59992 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 41225 event pairs, 516 based on Foata normal form. 103/5190 useless extension candidates. Maximal degree in co-relation 32194. Up to 2920 conditions per place. [2025-03-04 10:02:34,706 INFO L140 encePairwiseOnDemand]: 58/75 looper letters, 549 selfloop transitions, 302 changer transitions 0/865 dead transitions. [2025-03-04 10:02:34,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 865 transitions, 14673 flow [2025-03-04 10:02:34,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 10:02:34,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-04 10:02:34,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 751 transitions. [2025-03-04 10:02:34,708 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5890196078431372 [2025-03-04 10:02:34,708 INFO L175 Difference]: Start difference. First operand has 189 places, 518 transitions, 8418 flow. Second operand 17 states and 751 transitions. [2025-03-04 10:02:34,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 865 transitions, 14673 flow [2025-03-04 10:02:35,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 865 transitions, 14222 flow, removed 186 selfloop flow, removed 1 redundant places. [2025-03-04 10:02:35,115 INFO L231 Difference]: Finished difference. Result has 215 places, 627 transitions, 10986 flow [2025-03-04 10:02:35,115 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=8092, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=518, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=193, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=10986, PETRI_PLACES=215, PETRI_TRANSITIONS=627} [2025-03-04 10:02:35,116 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 147 predicate places. [2025-03-04 10:02:35,116 INFO L471 AbstractCegarLoop]: Abstraction has has 215 places, 627 transitions, 10986 flow [2025-03-04 10:02:35,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 34.5) internal successors, (345), 10 states have internal predecessors, (345), 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 10:02:35,116 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:02:35,116 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:02:35,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 10:02:35,116 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting workerErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-03-04 10:02:35,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:02:35,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1440088577, now seen corresponding path program 2 times [2025-03-04 10:02:35,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:02:35,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863992907] [2025-03-04 10:02:35,117 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:02:35,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:02:35,121 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-04 10:02:35,124 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 21 statements. [2025-03-04 10:02:35,125 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:02:35,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:02:35,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:02:35,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:02:35,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863992907] [2025-03-04 10:02:35,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863992907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:02:35,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:02:35,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:02:35,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811851045] [2025-03-04 10:02:35,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:02:35,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:02:35,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:02:35,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:02:35,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:02:35,247 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 75 [2025-03-04 10:02:35,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 627 transitions, 10986 flow. Second operand has 5 states, 5 states have (on average 39.6) internal successors, (198), 5 states have internal predecessors, (198), 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 10:02:35,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:02:35,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 75 [2025-03-04 10:02:35,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:02:36,185 INFO L124 PetriNetUnfolderBase]: 2321/5082 cut-off events. [2025-03-04 10:02:36,185 INFO L125 PetriNetUnfolderBase]: For 60876/60964 co-relation queries the response was YES. [2025-03-04 10:02:36,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30621 conditions, 5082 events. 2321/5082 cut-off events. For 60876/60964 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 39711 event pairs, 255 based on Foata normal form. 90/4761 useless extension candidates. Maximal degree in co-relation 30532. Up to 1485 conditions per place. [2025-03-04 10:02:36,230 INFO L140 encePairwiseOnDemand]: 66/75 looper letters, 380 selfloop transitions, 208 changer transitions 0/761 dead transitions. [2025-03-04 10:02:36,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 761 transitions, 13875 flow [2025-03-04 10:02:36,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:02:36,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:02:36,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 269 transitions. [2025-03-04 10:02:36,232 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7173333333333334 [2025-03-04 10:02:36,232 INFO L175 Difference]: Start difference. First operand has 215 places, 627 transitions, 10986 flow. Second operand 5 states and 269 transitions. [2025-03-04 10:02:36,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 761 transitions, 13875 flow [2025-03-04 10:02:36,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 761 transitions, 13527 flow, removed 11 selfloop flow, removed 4 redundant places. [2025-03-04 10:02:36,558 INFO L231 Difference]: Finished difference. Result has 217 places, 656 transitions, 11557 flow [2025-03-04 10:02:36,558 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=10199, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=605, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=157, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=440, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=11557, PETRI_PLACES=217, PETRI_TRANSITIONS=656} [2025-03-04 10:02:36,559 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 149 predicate places. [2025-03-04 10:02:36,559 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 656 transitions, 11557 flow [2025-03-04 10:02:36,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.6) internal successors, (198), 5 states have internal predecessors, (198), 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 10:02:36,559 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:02:36,559 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:02:36,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 10:02:36,559 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting workerErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-03-04 10:02:36,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:02:36,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1131426853, now seen corresponding path program 5 times [2025-03-04 10:02:36,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:02:36,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747528126] [2025-03-04 10:02:36,560 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:02:36,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:02:36,569 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-04 10:02:36,576 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:02:36,576 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:02:36,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:02:36,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:02:36,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:02:36,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747528126] [2025-03-04 10:02:36,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747528126] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:02:36,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:02:36,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 10:02:36,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268923776] [2025-03-04 10:02:36,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:02:36,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:02:36,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:02:36,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:02:36,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:02:37,024 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 75 [2025-03-04 10:02:37,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 656 transitions, 11557 flow. Second operand has 9 states, 9 states have (on average 34.666666666666664) internal successors, (312), 9 states have internal predecessors, (312), 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 10:02:37,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:02:37,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 75 [2025-03-04 10:02:37,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:02:38,584 INFO L124 PetriNetUnfolderBase]: 2891/5978 cut-off events. [2025-03-04 10:02:38,584 INFO L125 PetriNetUnfolderBase]: For 83922/83979 co-relation queries the response was YES. [2025-03-04 10:02:38,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40323 conditions, 5978 events. 2891/5978 cut-off events. For 83922/83979 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 45644 event pairs, 537 based on Foata normal form. 51/5542 useless extension candidates. Maximal degree in co-relation 40232. Up to 2778 conditions per place. [2025-03-04 10:02:38,635 INFO L140 encePairwiseOnDemand]: 59/75 looper letters, 406 selfloop transitions, 488 changer transitions 0/907 dead transitions. [2025-03-04 10:02:38,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 907 transitions, 16724 flow [2025-03-04 10:02:38,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 10:02:38,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-04 10:02:38,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 898 transitions. [2025-03-04 10:02:38,637 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5701587301587302 [2025-03-04 10:02:38,637 INFO L175 Difference]: Start difference. First operand has 217 places, 656 transitions, 11557 flow. Second operand 21 states and 898 transitions. [2025-03-04 10:02:38,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 907 transitions, 16724 flow [2025-03-04 10:02:39,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 907 transitions, 16456 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-03-04 10:02:39,027 INFO L231 Difference]: Finished difference. Result has 253 places, 778 transitions, 15511 flow [2025-03-04 10:02:39,027 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=11331, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=656, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=373, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=15511, PETRI_PLACES=253, PETRI_TRANSITIONS=778} [2025-03-04 10:02:39,027 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 185 predicate places. [2025-03-04 10:02:39,027 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 778 transitions, 15511 flow [2025-03-04 10:02:39,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 34.666666666666664) internal successors, (312), 9 states have internal predecessors, (312), 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 10:02:39,028 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:02:39,028 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:02:39,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 10:02:39,028 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting workerErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-03-04 10:02:39,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:02:39,028 INFO L85 PathProgramCache]: Analyzing trace with hash -2071128495, now seen corresponding path program 3 times [2025-03-04 10:02:39,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:02:39,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490598945] [2025-03-04 10:02:39,028 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:02:39,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:02:39,033 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-03-04 10:02:39,035 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 20 of 21 statements. [2025-03-04 10:02:39,036 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 10:02:39,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:02:39,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:02:39,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:02:39,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490598945] [2025-03-04 10:02:39,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490598945] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:02:39,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:02:39,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:02:39,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349524825] [2025-03-04 10:02:39,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:02:39,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:02:39,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:02:39,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:02:39,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:02:39,145 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 75 [2025-03-04 10:02:39,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 778 transitions, 15511 flow. Second operand has 5 states, 5 states have (on average 39.6) internal successors, (198), 5 states have internal predecessors, (198), 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 10:02:39,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:02:39,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 75 [2025-03-04 10:02:39,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:02:40,598 INFO L124 PetriNetUnfolderBase]: 2595/5672 cut-off events. [2025-03-04 10:02:40,599 INFO L125 PetriNetUnfolderBase]: For 94105/94246 co-relation queries the response was YES. [2025-03-04 10:02:40,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39921 conditions, 5672 events. 2595/5672 cut-off events. For 94105/94246 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 45214 event pairs, 438 based on Foata normal form. 115/5281 useless extension candidates. Maximal degree in co-relation 39813. Up to 2593 conditions per place. [2025-03-04 10:02:40,658 INFO L140 encePairwiseOnDemand]: 66/75 looper letters, 477 selfloop transitions, 170 changer transitions 0/872 dead transitions. [2025-03-04 10:02:40,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 872 transitions, 18124 flow [2025-03-04 10:02:40,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:02:40,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:02:40,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 276 transitions. [2025-03-04 10:02:40,659 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.736 [2025-03-04 10:02:40,659 INFO L175 Difference]: Start difference. First operand has 253 places, 778 transitions, 15511 flow. Second operand 5 states and 276 transitions. [2025-03-04 10:02:40,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 872 transitions, 18124 flow [2025-03-04 10:02:41,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 872 transitions, 17718 flow, removed 203 selfloop flow, removed 0 redundant places. [2025-03-04 10:02:41,281 INFO L231 Difference]: Finished difference. Result has 259 places, 804 transitions, 15915 flow [2025-03-04 10:02:41,282 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=15161, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=778, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=144, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=627, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=15915, PETRI_PLACES=259, PETRI_TRANSITIONS=804} [2025-03-04 10:02:41,282 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 191 predicate places. [2025-03-04 10:02:41,282 INFO L471 AbstractCegarLoop]: Abstraction has has 259 places, 804 transitions, 15915 flow [2025-03-04 10:02:41,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.6) internal successors, (198), 5 states have internal predecessors, (198), 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 10:02:41,282 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:02:41,282 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:02:41,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 10:02:41,283 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting workerErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-03-04 10:02:41,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:02:41,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1526866525, now seen corresponding path program 6 times [2025-03-04 10:02:41,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:02:41,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110785973] [2025-03-04 10:02:41,283 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:02:41,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:02:41,291 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 2 equivalence classes. [2025-03-04 10:02:41,294 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 20 of 21 statements. [2025-03-04 10:02:41,294 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 10:02:41,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:02:41,462 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:02:41,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:02:41,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110785973] [2025-03-04 10:02:41,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110785973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:02:41,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:02:41,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 10:02:41,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305558936] [2025-03-04 10:02:41,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:02:41,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:02:41,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:02:41,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:02:41,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:02:41,720 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 75 [2025-03-04 10:02:41,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 804 transitions, 15915 flow. Second operand has 10 states, 10 states have (on average 33.6) internal successors, (336), 10 states have internal predecessors, (336), 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 10:02:41,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:02:41,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 75 [2025-03-04 10:02:41,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:02:44,491 INFO L124 PetriNetUnfolderBase]: 5004/10098 cut-off events. [2025-03-04 10:02:44,491 INFO L125 PetriNetUnfolderBase]: For 189192/189228 co-relation queries the response was YES. [2025-03-04 10:02:44,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76799 conditions, 10098 events. 5004/10098 cut-off events. For 189192/189228 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 81925 event pairs, 801 based on Foata normal form. 32/9328 useless extension candidates. Maximal degree in co-relation 76688. Up to 3496 conditions per place. [2025-03-04 10:02:44,599 INFO L140 encePairwiseOnDemand]: 56/75 looper letters, 683 selfloop transitions, 810 changer transitions 0/1503 dead transitions. [2025-03-04 10:02:44,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 1503 transitions, 32210 flow [2025-03-04 10:02:44,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 10:02:44,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-04 10:02:44,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1008 transitions. [2025-03-04 10:02:44,601 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5843478260869566 [2025-03-04 10:02:44,601 INFO L175 Difference]: Start difference. First operand has 259 places, 804 transitions, 15915 flow. Second operand 23 states and 1008 transitions. [2025-03-04 10:02:44,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 1503 transitions, 32210 flow [2025-03-04 10:02:46,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 1503 transitions, 31698 flow, removed 42 selfloop flow, removed 2 redundant places. [2025-03-04 10:02:46,216 INFO L231 Difference]: Finished difference. Result has 298 places, 1276 transitions, 29991 flow [2025-03-04 10:02:46,217 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=15639, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=804, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=349, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=29991, PETRI_PLACES=298, PETRI_TRANSITIONS=1276} [2025-03-04 10:02:46,217 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 230 predicate places. [2025-03-04 10:02:46,217 INFO L471 AbstractCegarLoop]: Abstraction has has 298 places, 1276 transitions, 29991 flow [2025-03-04 10:02:46,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 33.6) internal successors, (336), 10 states have internal predecessors, (336), 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 10:02:46,218 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:02:46,218 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:02:46,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 10:02:46,218 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting workerErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-03-04 10:02:46,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:02:46,218 INFO L85 PathProgramCache]: Analyzing trace with hash -896953199, now seen corresponding path program 4 times [2025-03-04 10:02:46,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:02:46,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966482202] [2025-03-04 10:02:46,218 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:02:46,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:02:46,224 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-03-04 10:02:46,226 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 18 of 21 statements. [2025-03-04 10:02:46,226 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 10:02:46,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:02:46,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:02:46,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:02:46,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966482202] [2025-03-04 10:02:46,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966482202] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:02:46,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:02:46,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:02:46,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863666763] [2025-03-04 10:02:46,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:02:46,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:02:46,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:02:46,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:02:46,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:02:46,323 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 75 [2025-03-04 10:02:46,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 1276 transitions, 29991 flow. Second operand has 5 states, 5 states have (on average 39.6) internal successors, (198), 5 states have internal predecessors, (198), 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 10:02:46,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:02:46,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 75 [2025-03-04 10:02:46,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:02:48,628 INFO L124 PetriNetUnfolderBase]: 3122/6997 cut-off events. [2025-03-04 10:02:48,628 INFO L125 PetriNetUnfolderBase]: For 159497/159666 co-relation queries the response was YES. [2025-03-04 10:02:48,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54789 conditions, 6997 events. 3122/6997 cut-off events. For 159497/159666 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 55447 event pairs, 394 based on Foata normal form. 133/6616 useless extension candidates. Maximal degree in co-relation 54660. Up to 2120 conditions per place. [2025-03-04 10:02:48,712 INFO L140 encePairwiseOnDemand]: 67/75 looper letters, 684 selfloop transitions, 237 changer transitions 0/1178 dead transitions. [2025-03-04 10:02:48,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 1178 transitions, 28066 flow [2025-03-04 10:02:48,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:02:48,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:02:48,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 257 transitions. [2025-03-04 10:02:48,713 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6853333333333333 [2025-03-04 10:02:48,713 INFO L175 Difference]: Start difference. First operand has 298 places, 1276 transitions, 29991 flow. Second operand 5 states and 257 transitions. [2025-03-04 10:02:48,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 1178 transitions, 28066 flow [2025-03-04 10:02:49,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 1178 transitions, 27407 flow, removed 231 selfloop flow, removed 1 redundant places. [2025-03-04 10:02:49,631 INFO L231 Difference]: Finished difference. Result has 302 places, 1062 transitions, 24074 flow [2025-03-04 10:02:49,635 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=23448, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1054, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=230, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=818, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=24074, PETRI_PLACES=302, PETRI_TRANSITIONS=1062} [2025-03-04 10:02:49,636 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 234 predicate places. [2025-03-04 10:02:49,636 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 1062 transitions, 24074 flow [2025-03-04 10:02:49,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.6) internal successors, (198), 5 states have internal predecessors, (198), 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 10:02:49,636 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:02:49,636 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 10:02:49,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 10:02:49,636 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting workerErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-03-04 10:02:49,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:02:49,637 INFO L85 PathProgramCache]: Analyzing trace with hash -422605262, now seen corresponding path program 1 times [2025-03-04 10:02:49,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:02:49,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327507219] [2025-03-04 10:02:49,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:02:49,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:02:49,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 10:02:49,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:02:49,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:02:49,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:02:49,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:02:49,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:02:49,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327507219] [2025-03-04 10:02:49,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327507219] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:02:49,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:02:49,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 10:02:49,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201702864] [2025-03-04 10:02:49,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:02:49,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:02:49,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:02:49,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:02:49,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:02:50,220 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 75 [2025-03-04 10:02:50,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 1062 transitions, 24074 flow. Second operand has 10 states, 10 states have (on average 36.6) internal successors, (366), 10 states have internal predecessors, (366), 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 10:02:50,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:02:50,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 75 [2025-03-04 10:02:50,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:02:53,082 INFO L124 PetriNetUnfolderBase]: 3654/7993 cut-off events. [2025-03-04 10:02:53,082 INFO L125 PetriNetUnfolderBase]: For 175231/175307 co-relation queries the response was YES. [2025-03-04 10:02:53,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64472 conditions, 7993 events. 3654/7993 cut-off events. For 175231/175307 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 64213 event pairs, 1024 based on Foata normal form. 51/7424 useless extension candidates. Maximal degree in co-relation 64341. Up to 5122 conditions per place. [2025-03-04 10:02:53,168 INFO L140 encePairwiseOnDemand]: 63/75 looper letters, 981 selfloop transitions, 264 changer transitions 0/1374 dead transitions. [2025-03-04 10:02:53,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 1374 transitions, 32465 flow [2025-03-04 10:02:53,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 10:02:53,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 10:02:53,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 608 transitions. [2025-03-04 10:02:53,169 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6235897435897436 [2025-03-04 10:02:53,169 INFO L175 Difference]: Start difference. First operand has 302 places, 1062 transitions, 24074 flow. Second operand 13 states and 608 transitions. [2025-03-04 10:02:53,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 1374 transitions, 32465 flow [2025-03-04 10:02:54,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 1374 transitions, 32114 flow, removed 21 selfloop flow, removed 1 redundant places. [2025-03-04 10:02:54,150 INFO L231 Difference]: Finished difference. Result has 321 places, 1190 transitions, 27804 flow [2025-03-04 10:02:54,151 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=23835, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1062, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=142, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=814, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=27804, PETRI_PLACES=321, PETRI_TRANSITIONS=1190} [2025-03-04 10:02:54,151 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 253 predicate places. [2025-03-04 10:02:54,151 INFO L471 AbstractCegarLoop]: Abstraction has has 321 places, 1190 transitions, 27804 flow [2025-03-04 10:02:54,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 36.6) internal successors, (366), 10 states have internal predecessors, (366), 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 10:02:54,152 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:02:54,152 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 10:02:54,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 10:02:54,152 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting workerErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-03-04 10:02:54,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:02:54,152 INFO L85 PathProgramCache]: Analyzing trace with hash -330454798, now seen corresponding path program 2 times [2025-03-04 10:02:54,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:02:54,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076993385] [2025-03-04 10:02:54,152 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:02:54,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:02:54,157 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 10:02:54,160 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:02:54,160 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:02:54,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:02:54,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:02:54,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:02:54,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076993385] [2025-03-04 10:02:54,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076993385] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:02:54,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:02:54,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 10:02:54,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541610805] [2025-03-04 10:02:54,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:02:54,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:02:54,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:02:54,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:02:54,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:02:54,561 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 75 [2025-03-04 10:02:54,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 1190 transitions, 27804 flow. Second operand has 10 states, 10 states have (on average 36.6) internal successors, (366), 10 states have internal predecessors, (366), 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 10:02:54,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:02:54,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 75 [2025-03-04 10:02:54,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:02:57,972 INFO L124 PetriNetUnfolderBase]: 4153/9061 cut-off events. [2025-03-04 10:02:57,972 INFO L125 PetriNetUnfolderBase]: For 211825/211897 co-relation queries the response was YES. [2025-03-04 10:02:58,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74088 conditions, 9061 events. 4153/9061 cut-off events. For 211825/211897 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 74791 event pairs, 1297 based on Foata normal form. 49/8393 useless extension candidates. Maximal degree in co-relation 73948. Up to 5917 conditions per place. [2025-03-04 10:02:58,085 INFO L140 encePairwiseOnDemand]: 63/75 looper letters, 1128 selfloop transitions, 237 changer transitions 0/1494 dead transitions. [2025-03-04 10:02:58,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 1494 transitions, 36146 flow [2025-03-04 10:02:58,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 10:02:58,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 10:02:58,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 613 transitions. [2025-03-04 10:02:58,087 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6287179487179487 [2025-03-04 10:02:58,087 INFO L175 Difference]: Start difference. First operand has 321 places, 1190 transitions, 27804 flow. Second operand 13 states and 613 transitions. [2025-03-04 10:02:58,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 1494 transitions, 36146 flow [2025-03-04 10:02:59,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 1494 transitions, 35816 flow, removed 131 selfloop flow, removed 2 redundant places. [2025-03-04 10:02:59,453 INFO L231 Difference]: Finished difference. Result has 340 places, 1313 transitions, 31023 flow [2025-03-04 10:02:59,454 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=27474, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=962, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=31023, PETRI_PLACES=340, PETRI_TRANSITIONS=1313} [2025-03-04 10:02:59,455 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 272 predicate places. [2025-03-04 10:02:59,455 INFO L471 AbstractCegarLoop]: Abstraction has has 340 places, 1313 transitions, 31023 flow [2025-03-04 10:02:59,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 36.6) internal successors, (366), 10 states have internal predecessors, (366), 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 10:02:59,455 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:02:59,455 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 10:02:59,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 10:02:59,455 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting workerErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-03-04 10:02:59,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:02:59,456 INFO L85 PathProgramCache]: Analyzing trace with hash -146155628, now seen corresponding path program 3 times [2025-03-04 10:02:59,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:02:59,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362616214] [2025-03-04 10:02:59,456 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:02:59,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:02:59,464 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-03-04 10:02:59,468 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:02:59,468 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:02:59,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:02:59,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:02:59,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:02:59,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362616214] [2025-03-04 10:02:59,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362616214] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:02:59,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:02:59,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 10:02:59,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58878758] [2025-03-04 10:02:59,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:02:59,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:02:59,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:02:59,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:02:59,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:02:59,744 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 75 [2025-03-04 10:02:59,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 1313 transitions, 31023 flow. Second operand has 10 states, 10 states have (on average 36.6) internal successors, (366), 10 states have internal predecessors, (366), 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 10:02:59,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:02:59,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 75 [2025-03-04 10:02:59,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:03:04,926 INFO L124 PetriNetUnfolderBase]: 5944/12825 cut-off events. [2025-03-04 10:03:04,926 INFO L125 PetriNetUnfolderBase]: For 309061/309172 co-relation queries the response was YES. [2025-03-04 10:03:05,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106192 conditions, 12825 events. 5944/12825 cut-off events. For 309061/309172 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 112563 event pairs, 1499 based on Foata normal form. 118/11902 useless extension candidates. Maximal degree in co-relation 106042. Up to 5629 conditions per place. [2025-03-04 10:03:05,096 INFO L140 encePairwiseOnDemand]: 63/75 looper letters, 1326 selfloop transitions, 623 changer transitions 0/2078 dead transitions. [2025-03-04 10:03:05,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 2078 transitions, 50832 flow [2025-03-04 10:03:05,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 10:03:05,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-04 10:03:05,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 819 transitions. [2025-03-04 10:03:05,097 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6423529411764706 [2025-03-04 10:03:05,097 INFO L175 Difference]: Start difference. First operand has 340 places, 1313 transitions, 31023 flow. Second operand 17 states and 819 transitions. [2025-03-04 10:03:05,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 2078 transitions, 50832 flow [2025-03-04 10:03:07,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 2078 transitions, 50520 flow, removed 155 selfloop flow, removed 1 redundant places. [2025-03-04 10:03:07,588 INFO L231 Difference]: Finished difference. Result has 366 places, 1717 transitions, 43378 flow [2025-03-04 10:03:07,589 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=30715, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=305, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=796, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=43378, PETRI_PLACES=366, PETRI_TRANSITIONS=1717} [2025-03-04 10:03:07,589 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 298 predicate places. [2025-03-04 10:03:07,589 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 1717 transitions, 43378 flow [2025-03-04 10:03:07,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 36.6) internal successors, (366), 10 states have internal predecessors, (366), 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 10:03:07,590 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:03:07,590 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 10:03:07,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 10:03:07,590 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting workerErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-03-04 10:03:07,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:03:07,590 INFO L85 PathProgramCache]: Analyzing trace with hash 2019890516, now seen corresponding path program 4 times [2025-03-04 10:03:07,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:03:07,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922306321] [2025-03-04 10:03:07,590 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:03:07,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:03:07,595 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-03-04 10:03:07,599 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:03:07,599 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:03:07,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:03:07,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:03:07,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:03:07,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922306321] [2025-03-04 10:03:07,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922306321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:03:07,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:03:07,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 10:03:07,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213365839] [2025-03-04 10:03:07,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:03:07,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:03:07,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:03:07,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:03:07,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:03:07,927 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 75 [2025-03-04 10:03:07,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 1717 transitions, 43378 flow. Second operand has 10 states, 10 states have (on average 36.6) internal successors, (366), 10 states have internal predecessors, (366), 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 10:03:07,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:03:07,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 75 [2025-03-04 10:03:07,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:03:13,208 INFO L124 PetriNetUnfolderBase]: 5883/12716 cut-off events. [2025-03-04 10:03:13,209 INFO L125 PetriNetUnfolderBase]: For 341904/342006 co-relation queries the response was YES. [2025-03-04 10:03:13,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109293 conditions, 12716 events. 5883/12716 cut-off events. For 341904/342006 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 111688 event pairs, 1831 based on Foata normal form. 64/11738 useless extension candidates. Maximal degree in co-relation 109131. Up to 8899 conditions per place. [2025-03-04 10:03:13,383 INFO L140 encePairwiseOnDemand]: 63/75 looper letters, 1570 selfloop transitions, 262 changer transitions 0/1961 dead transitions. [2025-03-04 10:03:13,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 1961 transitions, 51618 flow [2025-03-04 10:03:13,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 10:03:13,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 10:03:13,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 658 transitions. [2025-03-04 10:03:13,384 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6266666666666667 [2025-03-04 10:03:13,384 INFO L175 Difference]: Start difference. First operand has 366 places, 1717 transitions, 43378 flow. Second operand 14 states and 658 transitions. [2025-03-04 10:03:13,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 1961 transitions, 51618 flow [2025-03-04 10:03:16,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 1961 transitions, 50561 flow, removed 435 selfloop flow, removed 4 redundant places. [2025-03-04 10:03:16,079 INFO L231 Difference]: Finished difference. Result has 382 places, 1760 transitions, 44169 flow [2025-03-04 10:03:16,080 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=42250, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1713, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=216, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1452, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=44169, PETRI_PLACES=382, PETRI_TRANSITIONS=1760} [2025-03-04 10:03:16,081 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 314 predicate places. [2025-03-04 10:03:16,081 INFO L471 AbstractCegarLoop]: Abstraction has has 382 places, 1760 transitions, 44169 flow [2025-03-04 10:03:16,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 36.6) internal successors, (366), 10 states have internal predecessors, (366), 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 10:03:16,081 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:03:16,081 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:03:16,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 10:03:16,081 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting workerErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-03-04 10:03:16,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:03:16,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1633828432, now seen corresponding path program 1 times [2025-03-04 10:03:16,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:03:16,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025402791] [2025-03-04 10:03:16,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:03:16,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:03:16,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 10:03:16,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 10:03:16,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:03:16,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:03:16,182 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:03:16,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:03:16,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025402791] [2025-03-04 10:03:16,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025402791] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:03:16,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:03:16,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:03:16,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397244371] [2025-03-04 10:03:16,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:03:16,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:03:16,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:03:16,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:03:16,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:03:16,238 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 75 [2025-03-04 10:03:16,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 1760 transitions, 44169 flow. Second operand has 6 states, 6 states have (on average 38.333333333333336) internal successors, (230), 6 states have internal predecessors, (230), 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 10:03:16,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:03:16,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 75 [2025-03-04 10:03:16,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:03:21,420 INFO L124 PetriNetUnfolderBase]: 5432/11570 cut-off events. [2025-03-04 10:03:21,420 INFO L125 PetriNetUnfolderBase]: For 300899/300995 co-relation queries the response was YES. [2025-03-04 10:03:21,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98954 conditions, 11570 events. 5432/11570 cut-off events. For 300899/300995 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 96837 event pairs, 1791 based on Foata normal form. 36/10614 useless extension candidates. Maximal degree in co-relation 98786. Up to 9532 conditions per place. [2025-03-04 10:03:21,637 INFO L140 encePairwiseOnDemand]: 68/75 looper letters, 1383 selfloop transitions, 11 changer transitions 58/1550 dead transitions. [2025-03-04 10:03:21,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 1550 transitions, 40222 flow [2025-03-04 10:03:21,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:03:21,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:03:21,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 276 transitions. [2025-03-04 10:03:21,638 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6133333333333333 [2025-03-04 10:03:21,638 INFO L175 Difference]: Start difference. First operand has 382 places, 1760 transitions, 44169 flow. Second operand 6 states and 276 transitions. [2025-03-04 10:03:21,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 1550 transitions, 40222 flow [2025-03-04 10:03:24,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 1550 transitions, 38679 flow, removed 580 selfloop flow, removed 8 redundant places. [2025-03-04 10:03:24,324 INFO L231 Difference]: Finished difference. Result has 377 places, 1478 transitions, 34214 flow [2025-03-04 10:03:24,325 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=35413, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1520, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1509, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=34214, PETRI_PLACES=377, PETRI_TRANSITIONS=1478} [2025-03-04 10:03:24,325 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 309 predicate places. [2025-03-04 10:03:24,325 INFO L471 AbstractCegarLoop]: Abstraction has has 377 places, 1478 transitions, 34214 flow [2025-03-04 10:03:24,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.333333333333336) internal successors, (230), 6 states have internal predecessors, (230), 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 10:03:24,325 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:03:24,325 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:03:24,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 10:03:24,325 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting workerErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-03-04 10:03:24,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:03:24,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1304804182, now seen corresponding path program 1 times [2025-03-04 10:03:24,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:03:24,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999946899] [2025-03-04 10:03:24,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:03:24,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:03:24,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 10:03:24,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:03:24,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:03:24,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:03:24,465 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:03:24,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:03:24,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999946899] [2025-03-04 10:03:24,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999946899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:03:24,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:03:24,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 10:03:24,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149738631] [2025-03-04 10:03:24,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:03:24,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:03:24,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:03:24,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:03:24,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:03:24,622 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 75 [2025-03-04 10:03:24,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 1478 transitions, 34214 flow. Second operand has 9 states, 9 states have (on average 35.44444444444444) internal successors, (319), 9 states have internal predecessors, (319), 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 10:03:24,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:03:24,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 75 [2025-03-04 10:03:24,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:03:29,242 INFO L124 PetriNetUnfolderBase]: 5987/12306 cut-off events. [2025-03-04 10:03:29,243 INFO L125 PetriNetUnfolderBase]: For 305614/305701 co-relation queries the response was YES. [2025-03-04 10:03:29,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103644 conditions, 12306 events. 5987/12306 cut-off events. For 305614/305701 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 101469 event pairs, 935 based on Foata normal form. 40/11332 useless extension candidates. Maximal degree in co-relation 103477. Up to 3462 conditions per place. [2025-03-04 10:03:29,522 INFO L140 encePairwiseOnDemand]: 59/75 looper letters, 761 selfloop transitions, 976 changer transitions 0/1752 dead transitions. [2025-03-04 10:03:29,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 1752 transitions, 43396 flow [2025-03-04 10:03:29,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 10:03:29,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 10:03:29,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 658 transitions. [2025-03-04 10:03:29,524 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5848888888888889 [2025-03-04 10:03:29,524 INFO L175 Difference]: Start difference. First operand has 377 places, 1478 transitions, 34214 flow. Second operand 15 states and 658 transitions. [2025-03-04 10:03:29,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 1752 transitions, 43396 flow [2025-03-04 10:03:31,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 1752 transitions, 42938 flow, removed 92 selfloop flow, removed 15 redundant places. [2025-03-04 10:03:31,988 INFO L231 Difference]: Finished difference. Result has 378 places, 1597 transitions, 40699 flow [2025-03-04 10:03:31,989 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=33875, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1478, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=866, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=593, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=40699, PETRI_PLACES=378, PETRI_TRANSITIONS=1597} [2025-03-04 10:03:31,989 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 310 predicate places. [2025-03-04 10:03:31,989 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 1597 transitions, 40699 flow [2025-03-04 10:03:31,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 35.44444444444444) internal successors, (319), 9 states have internal predecessors, (319), 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 10:03:31,989 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:03:31,989 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:03:31,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 10:03:31,990 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting workerErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-03-04 10:03:31,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:03:31,990 INFO L85 PathProgramCache]: Analyzing trace with hash 2072110458, now seen corresponding path program 2 times [2025-03-04 10:03:31,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:03:31,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212166727] [2025-03-04 10:03:31,990 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:03:31,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:03:31,995 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-04 10:03:31,997 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 30 statements. [2025-03-04 10:03:31,997 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:03:31,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:03:32,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:03:32,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:03:32,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212166727] [2025-03-04 10:03:32,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212166727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:03:32,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:03:32,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 10:03:32,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878411950] [2025-03-04 10:03:32,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:03:32,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:03:32,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:03:32,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:03:32,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:03:32,296 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 75 [2025-03-04 10:03:32,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 1597 transitions, 40699 flow. Second operand has 10 states, 10 states have (on average 34.4) internal successors, (344), 10 states have internal predecessors, (344), 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 10:03:32,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:03:32,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 75 [2025-03-04 10:03:32,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:03:41,244 INFO L124 PetriNetUnfolderBase]: 10155/20340 cut-off events. [2025-03-04 10:03:41,245 INFO L125 PetriNetUnfolderBase]: For 575516/575636 co-relation queries the response was YES. [2025-03-04 10:03:41,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180925 conditions, 20340 events. 10155/20340 cut-off events. For 575516/575636 co-relation queries the response was YES. Maximal size of possible extension queue 540. Compared 173206 event pairs, 1091 based on Foata normal form. 86/18785 useless extension candidates. Maximal degree in co-relation 180760. Up to 3603 conditions per place. [2025-03-04 10:03:41,611 INFO L140 encePairwiseOnDemand]: 56/75 looper letters, 973 selfloop transitions, 2165 changer transitions 0/3148 dead transitions. [2025-03-04 10:03:41,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 3148 transitions, 84780 flow [2025-03-04 10:03:41,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-04 10:03:41,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-03-04 10:03:41,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 1197 transitions. [2025-03-04 10:03:41,612 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.57 [2025-03-04 10:03:41,612 INFO L175 Difference]: Start difference. First operand has 378 places, 1597 transitions, 40699 flow. Second operand 28 states and 1197 transitions. [2025-03-04 10:03:41,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 405 places, 3148 transitions, 84780 flow [2025-03-04 10:03:47,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 3148 transitions, 82737 flow, removed 594 selfloop flow, removed 2 redundant places. [2025-03-04 10:03:47,900 INFO L231 Difference]: Finished difference. Result has 419 places, 2835 transitions, 79373 flow [2025-03-04 10:03:47,902 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=39760, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1597, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1011, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=79373, PETRI_PLACES=419, PETRI_TRANSITIONS=2835} [2025-03-04 10:03:47,902 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 351 predicate places. [2025-03-04 10:03:47,902 INFO L471 AbstractCegarLoop]: Abstraction has has 419 places, 2835 transitions, 79373 flow [2025-03-04 10:03:47,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 34.4) internal successors, (344), 10 states have internal predecessors, (344), 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 10:03:47,902 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:03:47,902 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:03:47,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 10:03:47,903 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting workerErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 35 more)] === [2025-03-04 10:03:47,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:03:47,903 INFO L85 PathProgramCache]: Analyzing trace with hash 556625852, now seen corresponding path program 3 times [2025-03-04 10:03:47,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:03:47,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367763459] [2025-03-04 10:03:47,903 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:03:47,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:03:47,910 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 2 equivalence classes. [2025-03-04 10:03:47,913 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 20 of 30 statements. [2025-03-04 10:03:47,913 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 10:03:47,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:03:48,035 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:03:48,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:03:48,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367763459] [2025-03-04 10:03:48,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367763459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:03:48,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:03:48,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 10:03:48,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931468851] [2025-03-04 10:03:48,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:03:48,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:03:48,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:03:48,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:03:48,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:03:48,210 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 75 [2025-03-04 10:03:48,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 419 places, 2835 transitions, 79373 flow. Second operand has 9 states, 9 states have (on average 35.44444444444444) internal successors, (319), 9 states have internal predecessors, (319), 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 10:03:48,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:03:48,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 75 [2025-03-04 10:03:48,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand