About the Execution of ITS-Tools for ShieldPPPt-PT-100B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 628126.00 | 0.00 | 0.00 | 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r198-tall-174894533700949.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is ShieldPPPt-PT-100B, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r198-tall-174894533700949
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.3M
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 1.9M May 29 14:33 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-00
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-01
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-02
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-03
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-04
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-05
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-06
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-07
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-08
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-09
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-10
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-11
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-12
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-13
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-14
FORMULA_NAME ShieldPPPt-PT-100B-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1749350216970
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-100B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-06-08 02:36:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-08 02:36:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-08 02:36:58] [INFO ] Load time of PNML (sax parser for PT used): 319 ms
[2025-06-08 02:36:58] [INFO ] Transformed 7803 places.
[2025-06-08 02:36:58] [INFO ] Transformed 7103 transitions.
[2025-06-08 02:36:58] [INFO ] Found NUPN structural information;
[2025-06-08 02:36:58] [INFO ] Parsed PT model containing 7803 places and 7103 transitions and 17806 arcs in 779 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 7103 rows 7803 cols
[2025-06-08 02:36:59] [INFO ] Computed 1101 invariants in 153 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 291 ms. (34 steps per ms)
FORMULA ShieldPPPt-PT-100B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 120011 steps (24 resets) in 209 ms. (571 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-06-08 02:37:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-08 02:37:03] [INFO ] [Real]Absence check using 1101 positive place invariants in 1037 ms returned sat
[2025-06-08 02:37:05] [INFO ] [Real]Absence check using state equation in 1598 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-08 02:37:07] [INFO ] [Real]Absence check using 1101 positive place invariants in 802 ms returned sat
[2025-06-08 02:37:10] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:854)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2252)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-08 02:37:12] [INFO ] [Real]Absence check using 1101 positive place invariants in 772 ms returned sat
[2025-06-08 02:37:15] [INFO ] [Real]Absence check using state equation in 2830 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-08 02:37:17] [INFO ] [Real]Absence check using 1101 positive place invariants in 778 ms returned sat
[2025-06-08 02:37:20] [INFO ] [Real]Absence check using state equation in 3063 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-08 02:37:22] [INFO ] [Real]Absence check using 1101 positive place invariants in 751 ms returned sat
[2025-06-08 02:37:25] [INFO ] [Real]Absence check using state equation in 3078 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-08 02:37:27] [INFO ] [Real]Absence check using 1101 positive place invariants in 761 ms returned sat
[2025-06-08 02:37:30] [INFO ] [Real]Absence check using state equation in 3150 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-08 02:37:32] [INFO ] [Real]Absence check using 1101 positive place invariants in 753 ms returned sat
[2025-06-08 02:37:35] [INFO ] [Real]Absence check using state equation in 3168 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-08 02:37:37] [INFO ] [Real]Absence check using 1101 positive place invariants in 740 ms returned sat
[2025-06-08 02:37:40] [INFO ] [Real]Absence check using state equation in 3154 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-08 02:37:42] [INFO ] [Real]Absence check using 1101 positive place invariants in 752 ms returned sat
[2025-06-08 02:37:45] [INFO ] [Real]Absence check using state equation in 3167 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-08 02:37:47] [INFO ] [Real]Absence check using 1101 positive place invariants in 763 ms returned sat
[2025-06-08 02:37:50] [INFO ] [Real]Absence check using state equation in 3160 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-08 02:37:52] [INFO ] [Real]Absence check using 1101 positive place invariants in 750 ms returned sat
[2025-06-08 02:37:55] [INFO ] [Real]Absence check using state equation in 3188 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-08 02:37:57] [INFO ] [Real]Absence check using 1101 positive place invariants in 731 ms returned sat
[2025-06-08 02:38:00] [INFO ] [Real]Absence check using state equation in 3020 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 12 out of 7803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7803/7803 places, 7103/7103 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1895 transitions
Trivial Post-agglo rules discarded 1895 transitions
Performed 1895 trivial Post agglomeration. Transition count delta: 1895
Iterating post reduction 0 with 1895 rules applied. Total rules applied 1895 place count 7803 transition count 5208
Reduce places removed 1895 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 1897 rules applied. Total rules applied 3792 place count 5908 transition count 5206
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 4 rules applied. Total rules applied 3796 place count 5907 transition count 5203
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 3799 place count 5904 transition count 5203
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 399 Pre rules applied. Total rules applied 3799 place count 5904 transition count 4804
Deduced a syphon composed of 399 places in 21 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 4 with 798 rules applied. Total rules applied 4597 place count 5505 transition count 4804
Discarding 697 places :
Symmetric choice reduction at 4 with 697 rule applications. Total rules 5294 place count 4808 transition count 4107
Iterating global reduction 4 with 697 rules applied. Total rules applied 5991 place count 4808 transition count 4107
Performed 296 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 296 Pre rules applied. Total rules applied 5991 place count 4808 transition count 3811
Deduced a syphon composed of 296 places in 41 ms
Reduce places removed 296 places and 0 transitions.
Iterating global reduction 4 with 592 rules applied. Total rules applied 6583 place count 4512 transition count 3811
Performed 1701 Post agglomeration using F-continuation condition.Transition count delta: 1701
Deduced a syphon composed of 1701 places in 8 ms
Reduce places removed 1701 places and 0 transitions.
Iterating global reduction 4 with 3402 rules applied. Total rules applied 9985 place count 2811 transition count 2110
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 10 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 10187 place count 2710 transition count 2110
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 22 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 10389 place count 2609 transition count 2110
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 92 places in 21 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 4 with 184 rules applied. Total rules applied 10573 place count 2517 transition count 2110
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 10574 place count 2517 transition count 2109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 10575 place count 2516 transition count 2109
Partial Free-agglomeration rule applied 299 times.
Drop transitions (Partial Free agglomeration) removed 299 transitions
Iterating global reduction 5 with 299 rules applied. Total rules applied 10874 place count 2516 transition count 2109
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 10875 place count 2515 transition count 2108
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 10876 place count 2514 transition count 2108
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 10876 place count 2514 transition count 2106
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 10880 place count 2512 transition count 2106
Applied a total of 10880 rules in 3840 ms. Remains 2512 /7803 variables (removed 5291) and now considering 2106/7103 (removed 4997) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3866 ms. Remains : 2512/7803 places, 2106/7103 transitions.
// Phase 1: matrix 2106 rows 2512 cols
[2025-06-08 02:38:04] [INFO ] Computed 1100 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 14815 ms. (67 steps per ms)
FORMULA ShieldPPPt-PT-100B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 3945368 steps (9 resets) in 45009 ms. (87 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-06-08 02:39:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-08 02:39:04] [INFO ] [Real]Absence check using 1100 positive place invariants in 178 ms returned sat
[2025-06-08 02:39:05] [INFO ] [Real]Absence check using state equation in 810 ms returned sat
[2025-06-08 02:39:05] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-06-08 02:39:05] [INFO ] [Real]Added 3 Read/Feed constraints in 15 ms returned sat
[2025-06-08 02:39:05] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-08 02:39:06] [INFO ] [Nat]Absence check using 1100 positive place invariants in 160 ms returned sat
[2025-06-08 02:39:06] [INFO ] [Nat]Absence check using state equation in 790 ms returned sat
[2025-06-08 02:39:06] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:39:07] [INFO ] Deduced a trap composed of 5 places in 333 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:39:07] [INFO ] Deduced a trap composed of 5 places in 257 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:39:08] [INFO ] Deduced a trap composed of 6 places in 271 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:39:08] [INFO ] Deduced a trap composed of 5 places in 246 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:39:08] [INFO ] Deduced a trap composed of 5 places in 250 ms of which 9 ms to minimize.
[2025-06-08 02:39:08] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1953 ms
[2025-06-08 02:39:09] [INFO ] Computed and/alt/rep : 2102/4961/2102 causal constraints (skipped 0 transitions) in 103 ms.
[2025-06-08 02:39:28] [INFO ] Added : 860 causal constraints over 172 iterations in 20039 ms.(timeout) Result :sat
Minimization took 696 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-08 02:39:30] [INFO ] [Real]Absence check using 1100 positive place invariants in 174 ms returned sat
[2025-06-08 02:39:31] [INFO ] [Real]Absence check using state equation in 904 ms returned sat
[2025-06-08 02:39:31] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-08 02:39:31] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-08 02:39:31] [INFO ] [Nat]Absence check using 1100 positive place invariants in 176 ms returned sat
[2025-06-08 02:39:32] [INFO ] [Nat]Absence check using state equation in 874 ms returned sat
[2025-06-08 02:39:32] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:39:33] [INFO ] Deduced a trap composed of 5 places in 360 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:39:33] [INFO ] Deduced a trap composed of 5 places in 228 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:39:33] [INFO ] Deduced a trap composed of 5 places in 213 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:39:33] [INFO ] Deduced a trap composed of 5 places in 221 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:39:34] [INFO ] Deduced a trap composed of 5 places in 221 ms of which 9 ms to minimize.
[2025-06-08 02:39:34] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1679 ms
[2025-06-08 02:39:34] [INFO ] Computed and/alt/rep : 2102/4961/2102 causal constraints (skipped 0 transitions) in 86 ms.
[2025-06-08 02:39:54] [INFO ] Added : 845 causal constraints over 169 iterations in 20170 ms.(timeout) Result :sat
Minimization took 667 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-08 02:39:55] [INFO ] [Real]Absence check using 1100 positive place invariants in 196 ms returned sat
[2025-06-08 02:39:56] [INFO ] [Real]Absence check using state equation in 815 ms returned sat
[2025-06-08 02:39:56] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-08 02:39:57] [INFO ] [Nat]Absence check using 1100 positive place invariants in 176 ms returned sat
[2025-06-08 02:39:57] [INFO ] [Nat]Absence check using state equation in 862 ms returned sat
[2025-06-08 02:39:57] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:39:58] [INFO ] Deduced a trap composed of 5 places in 245 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:39:58] [INFO ] Deduced a trap composed of 5 places in 251 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:39:58] [INFO ] Deduced a trap composed of 5 places in 374 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:39:59] [INFO ] Deduced a trap composed of 5 places in 332 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:39:59] [INFO ] Deduced a trap composed of 5 places in 452 ms of which 44 ms to minimize.
[2025-06-08 02:39:59] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2102 ms
[2025-06-08 02:40:00] [INFO ] Computed and/alt/rep : 2102/4961/2102 causal constraints (skipped 0 transitions) in 86 ms.
[2025-06-08 02:40:20] [INFO ] Added : 850 causal constraints over 170 iterations in 20102 ms.(timeout) Result :sat
Minimization took 670 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-08 02:40:21] [INFO ] [Real]Absence check using 1100 positive place invariants in 172 ms returned sat
[2025-06-08 02:40:22] [INFO ] [Real]Absence check using state equation in 875 ms returned sat
[2025-06-08 02:40:22] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-08 02:40:22] [INFO ] [Nat]Absence check using 1100 positive place invariants in 170 ms returned sat
[2025-06-08 02:40:23] [INFO ] [Nat]Absence check using state equation in 804 ms returned sat
[2025-06-08 02:40:23] [INFO ] [Nat]Added 3 Read/Feed constraints in 4 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:40:23] [INFO ] Deduced a trap composed of 5 places in 244 ms of which 9 ms to minimize.
[2025-06-08 02:40:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 391 ms
[2025-06-08 02:40:23] [INFO ] Computed and/alt/rep : 2102/4961/2102 causal constraints (skipped 0 transitions) in 105 ms.
[2025-06-08 02:40:43] [INFO ] Added : 870 causal constraints over 174 iterations in 20085 ms.(timeout) Result :sat
Minimization took 766 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-08 02:40:45] [INFO ] [Real]Absence check using 1100 positive place invariants in 170 ms returned sat
[2025-06-08 02:40:45] [INFO ] [Real]Absence check using state equation in 769 ms returned sat
[2025-06-08 02:40:46] [INFO ] [Real]Added 3 Read/Feed constraints in 2 ms returned sat
[2025-06-08 02:40:46] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-08 02:40:46] [INFO ] [Nat]Absence check using 1100 positive place invariants in 172 ms returned sat
[2025-06-08 02:40:47] [INFO ] [Nat]Absence check using state equation in 803 ms returned sat
[2025-06-08 02:40:47] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:40:47] [INFO ] Deduced a trap composed of 5 places in 217 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:40:47] [INFO ] Deduced a trap composed of 5 places in 280 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:40:48] [INFO ] Deduced a trap composed of 5 places in 248 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:40:48] [INFO ] Deduced a trap composed of 5 places in 211 ms of which 17 ms to minimize.
[2025-06-08 02:40:48] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1328 ms
[2025-06-08 02:40:48] [INFO ] Computed and/alt/rep : 2102/4961/2102 causal constraints (skipped 0 transitions) in 88 ms.
[2025-06-08 02:41:08] [INFO ] Added : 860 causal constraints over 172 iterations in 20042 ms.(timeout) Result :sat
Minimization took 489 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-08 02:41:09] [INFO ] [Real]Absence check using 1100 positive place invariants in 172 ms returned sat
[2025-06-08 02:41:10] [INFO ] [Real]Absence check using state equation in 832 ms returned sat
[2025-06-08 02:41:10] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-08 02:41:10] [INFO ] [Nat]Absence check using 1100 positive place invariants in 170 ms returned sat
[2025-06-08 02:41:11] [INFO ] [Nat]Absence check using state equation in 786 ms returned sat
[2025-06-08 02:41:11] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:41:12] [INFO ] Deduced a trap composed of 4 places in 253 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:41:12] [INFO ] Deduced a trap composed of 5 places in 221 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:41:12] [INFO ] Deduced a trap composed of 5 places in 224 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:41:12] [INFO ] Deduced a trap composed of 5 places in 240 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:41:13] [INFO ] Deduced a trap composed of 6 places in 226 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:41:13] [INFO ] Deduced a trap composed of 5 places in 226 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:41:13] [INFO ] Deduced a trap composed of 5 places in 213 ms of which 9 ms to minimize.
[2025-06-08 02:41:13] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2169 ms
[2025-06-08 02:41:14] [INFO ] Computed and/alt/rep : 2102/4961/2102 causal constraints (skipped 0 transitions) in 98 ms.
[2025-06-08 02:41:34] [INFO ] Added : 835 causal constraints over 167 iterations in 20108 ms.(timeout) Result :sat
Minimization took 766 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-08 02:41:35] [INFO ] [Real]Absence check using 1100 positive place invariants in 188 ms returned sat
[2025-06-08 02:41:36] [INFO ] [Real]Absence check using state equation in 825 ms returned sat
[2025-06-08 02:41:36] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-08 02:41:36] [INFO ] [Nat]Absence check using 1100 positive place invariants in 176 ms returned sat
[2025-06-08 02:41:37] [INFO ] [Nat]Absence check using state equation in 793 ms returned sat
[2025-06-08 02:41:37] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:41:37] [INFO ] Deduced a trap composed of 5 places in 276 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:41:38] [INFO ] Deduced a trap composed of 5 places in 241 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:41:38] [INFO ] Deduced a trap composed of 5 places in 236 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:41:38] [INFO ] Deduced a trap composed of 5 places in 224 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:41:39] [INFO ] Deduced a trap composed of 6 places in 297 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:41:39] [INFO ] Deduced a trap composed of 5 places in 231 ms of which 27 ms to minimize.
[2025-06-08 02:41:39] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1993 ms
[2025-06-08 02:41:39] [INFO ] Computed and/alt/rep : 2102/4961/2102 causal constraints (skipped 0 transitions) in 88 ms.
[2025-06-08 02:41:59] [INFO ] Added : 855 causal constraints over 171 iterations in 20200 ms.(timeout) Result :sat
Minimization took 677 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-08 02:42:00] [INFO ] [Real]Absence check using 1100 positive place invariants in 175 ms returned sat
[2025-06-08 02:42:01] [INFO ] [Real]Absence check using state equation in 780 ms returned sat
[2025-06-08 02:42:01] [INFO ] [Real]Added 3 Read/Feed constraints in 2 ms returned sat
[2025-06-08 02:42:01] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-08 02:42:02] [INFO ] [Nat]Absence check using 1100 positive place invariants in 173 ms returned sat
[2025-06-08 02:42:02] [INFO ] [Nat]Absence check using state equation in 783 ms returned sat
[2025-06-08 02:42:02] [INFO ] [Nat]Added 3 Read/Feed constraints in 4 ms returned sat
[2025-06-08 02:42:03] [INFO ] Computed and/alt/rep : 2102/4961/2102 causal constraints (skipped 0 transitions) in 80 ms.
[2025-06-08 02:42:23] [INFO ] Added : 860 causal constraints over 172 iterations in 20092 ms.(timeout) Result :sat
Minimization took 748 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-08 02:42:24] [INFO ] [Real]Absence check using 1100 positive place invariants in 176 ms returned sat
[2025-06-08 02:42:25] [INFO ] [Real]Absence check using state equation in 794 ms returned sat
[2025-06-08 02:42:25] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-08 02:42:25] [INFO ] [Nat]Absence check using 1100 positive place invariants in 184 ms returned sat
[2025-06-08 02:42:26] [INFO ] [Nat]Absence check using state equation in 837 ms returned sat
[2025-06-08 02:42:26] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:42:26] [INFO ] Deduced a trap composed of 5 places in 263 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:42:27] [INFO ] Deduced a trap composed of 5 places in 236 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:42:27] [INFO ] Deduced a trap composed of 5 places in 238 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:42:27] [INFO ] Deduced a trap composed of 5 places in 257 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:42:28] [INFO ] Deduced a trap composed of 6 places in 232 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:42:28] [INFO ] Deduced a trap composed of 5 places in 241 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:42:28] [INFO ] Deduced a trap composed of 5 places in 220 ms of which 9 ms to minimize.
[2025-06-08 02:42:28] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2265 ms
[2025-06-08 02:42:28] [INFO ] Computed and/alt/rep : 2102/4961/2102 causal constraints (skipped 0 transitions) in 86 ms.
[2025-06-08 02:42:49] [INFO ] Added : 860 causal constraints over 172 iterations in 20300 ms.(timeout) Result :sat
Minimization took 616 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA ShieldPPPt-PT-100B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-100B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 2512 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2512/2512 places, 2106/2106 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 2512 transition count 2102
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 2508 transition count 2102
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 8 place count 2508 transition count 2099
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 2505 transition count 2099
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 2503 transition count 2097
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 5 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 26 place count 2499 transition count 2097
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 2499 transition count 2096
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 2498 transition count 2096
Applied a total of 28 rules in 473 ms. Remains 2498 /2512 variables (removed 14) and now considering 2096/2106 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 487 ms. Remains : 2498/2512 places, 2096/2106 transitions.
// Phase 1: matrix 2096 rows 2498 cols
[2025-06-08 02:43:21] [INFO ] Computed 1100 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (2 resets) in 14596 ms. (68 steps per ms)
BEST_FIRST walk for 883162 steps (2 resets) in 10002 ms. (88 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2025-06-08 02:43:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-08 02:43:46] [INFO ] [Real]Absence check using 1100 positive place invariants in 173 ms returned sat
[2025-06-08 02:43:47] [INFO ] [Real]Absence check using state equation in 763 ms returned sat
[2025-06-08 02:43:47] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-06-08 02:43:47] [INFO ] [Real]Added 3 Read/Feed constraints in 11 ms returned sat
[2025-06-08 02:43:47] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-08 02:43:48] [INFO ] [Nat]Absence check using 1100 positive place invariants in 178 ms returned sat
[2025-06-08 02:43:48] [INFO ] [Nat]Absence check using state equation in 812 ms returned sat
[2025-06-08 02:43:48] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:43:49] [INFO ] Deduced a trap composed of 5 places in 267 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:43:49] [INFO ] Deduced a trap composed of 6 places in 244 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:43:49] [INFO ] Deduced a trap composed of 5 places in 254 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:43:50] [INFO ] Deduced a trap composed of 5 places in 240 ms of which 11 ms to minimize.
[2025-06-08 02:43:50] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1356 ms
[2025-06-08 02:43:50] [INFO ] Computed and/alt/rep : 2092/4969/2092 causal constraints (skipped 0 transitions) in 169 ms.
[2025-06-08 02:44:10] [INFO ] Added : 840 causal constraints over 168 iterations in 20187 ms.(timeout) Result :sat
Minimization took 699 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-08 02:44:11] [INFO ] [Real]Absence check using 1100 positive place invariants in 171 ms returned sat
[2025-06-08 02:44:12] [INFO ] [Real]Absence check using state equation in 834 ms returned sat
[2025-06-08 02:44:12] [INFO ] [Real]Added 3 Read/Feed constraints in 2 ms returned sat
[2025-06-08 02:44:12] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-08 02:44:13] [INFO ] [Nat]Absence check using 1100 positive place invariants in 195 ms returned sat
[2025-06-08 02:44:13] [INFO ] [Nat]Absence check using state equation in 779 ms returned sat
[2025-06-08 02:44:13] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:44:14] [INFO ] Deduced a trap composed of 5 places in 269 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:44:14] [INFO ] Deduced a trap composed of 5 places in 250 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:44:14] [INFO ] Deduced a trap composed of 5 places in 245 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:44:15] [INFO ] Deduced a trap composed of 5 places in 257 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:44:15] [INFO ] Deduced a trap composed of 5 places in 233 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:44:15] [INFO ] Deduced a trap composed of 5 places in 235 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:44:16] [INFO ] Deduced a trap composed of 5 places in 240 ms of which 10 ms to minimize.
[2025-06-08 02:44:16] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2310 ms
[2025-06-08 02:44:16] [INFO ] Computed and/alt/rep : 2092/4969/2092 causal constraints (skipped 0 transitions) in 82 ms.
[2025-06-08 02:44:36] [INFO ] Added : 860 causal constraints over 172 iterations in 20184 ms.(timeout) Result :sat
Minimization took 791 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 2498 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2498/2498 places, 2096/2096 transitions.
Applied a total of 0 rules in 91 ms. Remains 2498 /2498 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 2498/2498 places, 2096/2096 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2498/2498 places, 2096/2096 transitions.
Applied a total of 0 rules in 91 ms. Remains 2498 /2498 variables (removed 0) and now considering 2096/2096 (removed 0) transitions.
[2025-06-08 02:44:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 02:44:43] [INFO ] Implicit Places using invariants in 1708 ms returned [2481, 2485]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1710 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2496/2498 places, 2096/2096 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2494 transition count 2094
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2494 transition count 2094
Applied a total of 4 rules in 163 ms. Remains 2494 /2496 variables (removed 2) and now considering 2094/2096 (removed 2) transitions.
// Phase 1: matrix 2094 rows 2494 cols
[2025-06-08 02:44:44] [INFO ] Computed 1098 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 02:44:45] [INFO ] Implicit Places using invariants in 1677 ms returned []
[2025-06-08 02:44:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 02:44:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-08 02:44:48] [INFO ] Implicit Places using invariants and state equation in 3008 ms returned []
Implicit Place search using SMT with State Equation took 4708 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2494/2498 places, 2094/2096 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 6675 ms. Remains : 2494/2498 places, 2094/2096 transitions.
[2025-06-08 02:44:48] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (2 resets) in 14619 ms. (68 steps per ms)
BEST_FIRST walk for 873280 steps (2 resets) in 10002 ms. (87 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2025-06-08 02:45:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-08 02:45:13] [INFO ] [Real]Absence check using 1098 positive place invariants in 168 ms returned sat
[2025-06-08 02:45:14] [INFO ] [Real]Absence check using state equation in 790 ms returned sat
[2025-06-08 02:45:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-08 02:45:14] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:45:15] [INFO ] Deduced a trap composed of 5 places in 264 ms of which 14 ms to minimize.
[2025-06-08 02:45:15] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-08 02:45:15] [INFO ] [Nat]Absence check using 1098 positive place invariants in 172 ms returned sat
[2025-06-08 02:45:16] [INFO ] [Nat]Absence check using state equation in 798 ms returned sat
[2025-06-08 02:45:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:45:16] [INFO ] Deduced a trap composed of 5 places in 259 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:45:17] [INFO ] Deduced a trap composed of 5 places in 252 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:45:17] [INFO ] Deduced a trap composed of 5 places in 280 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:45:17] [INFO ] Deduced a trap composed of 5 places in 277 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:45:18] [INFO ] Deduced a trap composed of 5 places in 303 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:45:18] [INFO ] Deduced a trap composed of 5 places in 236 ms of which 10 ms to minimize.
[2025-06-08 02:45:18] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2145 ms
[2025-06-08 02:45:18] [INFO ] Computed and/alt/rep : 2090/4956/2090 causal constraints (skipped 0 transitions) in 83 ms.
[2025-06-08 02:45:38] [INFO ] Added : 860 causal constraints over 172 iterations in 20144 ms.(timeout) Result :sat
Minimization took 687 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-08 02:45:39] [INFO ] [Real]Absence check using 1098 positive place invariants in 173 ms returned sat
[2025-06-08 02:45:40] [INFO ] [Real]Absence check using state equation in 790 ms returned sat
[2025-06-08 02:45:40] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:45:41] [INFO ] Deduced a trap composed of 5 places in 260 ms of which 12 ms to minimize.
[2025-06-08 02:45:41] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-08 02:45:41] [INFO ] [Nat]Absence check using 1098 positive place invariants in 180 ms returned sat
[2025-06-08 02:45:42] [INFO ] [Nat]Absence check using state equation in 798 ms returned sat
[2025-06-08 02:45:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:45:42] [INFO ] Deduced a trap composed of 5 places in 258 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:45:43] [INFO ] Deduced a trap composed of 5 places in 238 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:45:43] [INFO ] Deduced a trap composed of 5 places in 250 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:45:43] [INFO ] Deduced a trap composed of 5 places in 243 ms of which 11 ms to minimize.
[2025-06-08 02:45:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1349 ms
[2025-06-08 02:45:43] [INFO ] Computed and/alt/rep : 2090/4956/2090 causal constraints (skipped 0 transitions) in 80 ms.
[2025-06-08 02:46:04] [INFO ] Added : 845 causal constraints over 169 iterations in 20176 ms.(timeout) Result :sat
Minimization took 785 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 2494 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2494/2494 places, 2094/2094 transitions.
Applied a total of 0 rules in 105 ms. Remains 2494 /2494 variables (removed 0) and now considering 2094/2094 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 2494/2494 places, 2094/2094 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2494/2494 places, 2094/2094 transitions.
Applied a total of 0 rules in 85 ms. Remains 2494 /2494 variables (removed 0) and now considering 2094/2094 (removed 0) transitions.
[2025-06-08 02:46:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 02:46:11] [INFO ] Implicit Places using invariants in 1601 ms returned []
[2025-06-08 02:46:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 02:46:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-08 02:46:14] [INFO ] Implicit Places using invariants and state equation in 3083 ms returned []
Implicit Place search using SMT with State Equation took 4718 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 02:46:15] [INFO ] Redundant transitions in 120 ms returned []
Running 2090 sub problems to find dead transitions.
[2025-06-08 02:46:15] [INFO ] Invariant cache hit.
[2025-06-08 02:46:15] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2492 variables, 1096/1096 constraints. Problems are: Problem set: 0 solved, 2090 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2492/4588 variables, and 1096 constraints, problems are : Problem set: 0 solved, 2090 unsolved in 30073 ms.
Refiners :[Positive P Invariants (semi-flows): 1096/1098 constraints, State Equation: 0/2494 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2090/2090 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2090 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2492 variables, 1096/1096 constraints. Problems are: Problem set: 0 solved, 2090 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:46:48] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:46:48] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:46:48] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:46:48] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:46:49] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:46:49] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:46:49] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:46:49] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:46:49] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:46:49] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:46:50] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:46:50] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:46:50] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:46:50] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:46:51] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:46:51] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:46:51] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:46:51] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:46:51] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:46:52] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/2492 variables, 20/1116 constraints. Problems are: Problem set: 0 solved, 2090 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:46:54] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:46:54] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:46:55] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:46:55] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:46:55] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:46:56] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:46:56] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:46:56] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:46:56] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:46:56] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:46:57] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:46:57] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:46:57] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:46:58] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:46:58] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:46:58] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:46:58] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:46:58] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:46:59] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:46:59] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2492 variables, 20/1136 constraints. Problems are: Problem set: 0 solved, 2090 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:47:02] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:47:03] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:47:03] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:47:05] [INFO ] Deduced a trap composed of 6 places in 126 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:47:05] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:47:05] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:47:05] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:47:06] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:47:06] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:47:06] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:47:06] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:47:07] [INFO ] Deduced a trap composed of 6 places in 102 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:47:07] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:47:07] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:47:07] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:47:08] [INFO ] Deduced a trap composed of 5 places in 120 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:47:08] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:47:08] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:47:08] [INFO ] Deduced a trap composed of 6 places in 105 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:47:09] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2492 variables, 20/1156 constraints. Problems are: Problem set: 0 solved, 2090 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:47:12] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:47:13] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 02:47:15] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2492/4588 variables, and 1159 constraints, problems are : Problem set: 0 solved, 2090 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 1096/1098 constraints, State Equation: 0/2494 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/2090 constraints, Known Traps: 63/63 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61182ms problems are : Problem set: 0 solved, 2090 unsolved
Search for dead transitions found 0 dead transitions in 61217ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66190 ms. Remains : 2494/2494 places, 2094/2094 transitions.
RANDOM walk for 40000 steps (8 resets) in 2272 ms. (17 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1506 ms. (26 steps per ms) remains 4/4 properties
[2025-06-08 02:47:17] [INFO ] Flatten gal took : 510 ms
BEST_FIRST walk for 40004 steps (8 resets) in 1715 ms. (23 steps per ms) remains 4/4 properties
[2025-06-08 02:47:18] [INFO ] Flatten gal took : 276 ms
[2025-06-08 02:47:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1279119315033304809.gal : 133 ms
BEST_FIRST walk for 40002 steps (8 resets) in 1374 ms. (29 steps per ms) remains 4/4 properties
[2025-06-08 02:47:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2502632703365481207.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1279119315033304809.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2502632703365481207.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
BEST_FIRST walk for 40003 steps (8 resets) in 1304 ms. (30 steps per ms) remains 4/4 properties
Loading property file /tmp/ReachabilityCardinality2502632703365481207.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :7 after 15
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :15 after 28
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :28 after 54
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :54 after 103
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :103 after 201
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :201 after 579
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :579 after 18906
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :18906 after 2.12602e+06
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :2.12602e+06 after 1.75438e+08
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :1.75438e+08 after 1.59862e+10
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1.59862e+10 after 1.84541e+13
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.84541e+13 after 1.97122e+16
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :1.97122e+16 after 3.43183e+19
Invariant property MIN1 does not hold.
Reachability property MAX1 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 16385 fixpoint passes
Interrupted probabilistic random walk after 77059 steps, run timeout after 6001 ms. (steps per millisecond=12 ) properties seen :0 out of 4
Probabilistic random walk after 77059 steps, saw 61227 distinct states, run finished after 6025 ms. (steps per millisecond=12 ) properties seen :0
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA ShieldPPPt-PT-100B-UpperBounds-14 1 TECHNIQUES REACHABILITY_MAX
FORMULA ShieldPPPt-PT-100B-UpperBounds-06 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 2 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 626822 ms.
BK_STOP 1749350845096
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPt-PT-100B"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is ShieldPPPt-PT-100B, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r198-tall-174894533700949"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-100B.tgz
mv ShieldPPPt-PT-100B execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;