About the Execution of ITS-Tools for FireWire-PT-15
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 291532.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.r086-smll-174860102400357.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 FireWire-PT-15, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086-smll-174860102400357
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K 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 6.7K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 90K May 29 14:32 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 FireWire-PT-15-UpperBounds-00
FORMULA_NAME FireWire-PT-15-UpperBounds-01
FORMULA_NAME FireWire-PT-15-UpperBounds-02
FORMULA_NAME FireWire-PT-15-UpperBounds-03
FORMULA_NAME FireWire-PT-15-UpperBounds-04
FORMULA_NAME FireWire-PT-15-UpperBounds-05
FORMULA_NAME FireWire-PT-15-UpperBounds-06
FORMULA_NAME FireWire-PT-15-UpperBounds-07
FORMULA_NAME FireWire-PT-15-UpperBounds-08
FORMULA_NAME FireWire-PT-15-UpperBounds-09
FORMULA_NAME FireWire-PT-15-UpperBounds-10
FORMULA_NAME FireWire-PT-15-UpperBounds-11
FORMULA_NAME FireWire-PT-15-UpperBounds-12
FORMULA_NAME FireWire-PT-15-UpperBounds-13
FORMULA_NAME FireWire-PT-15-UpperBounds-14
FORMULA_NAME FireWire-PT-15-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1748886133699
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-06-02 17:42:16] [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-02 17:42:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 17:42:17] [INFO ] Load time of PNML (sax parser for PT used): 194 ms
[2025-06-02 17:42:17] [INFO ] Transformed 248 places.
[2025-06-02 17:42:17] [INFO ] Transformed 383 transitions.
[2025-06-02 17:42:17] [INFO ] Found NUPN structural information;
[2025-06-02 17:42:17] [INFO ] Parsed PT model containing 248 places and 383 transitions and 1144 arcs in 608 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 16 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 383 rows 248 cols
[2025-06-02 17:42:17] [INFO ] Computed 5 invariants in 36 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 62 ms. (158 steps per ms)
FORMULA FireWire-PT-15-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-15-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-15-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-15-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 120000 steps (30 resets) in 331 ms. (361 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-02 17:42:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 17:42:18] [INFO ] [Real]Absence check using 5 positive place invariants in 23 ms returned sat
[2025-06-02 17:42:18] [INFO ] [Real]Absence check using state equation in 379 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:42:19] [INFO ] Deduced a trap composed of 75 places in 404 ms of which 60 ms to minimize.
[2025-06-02 17:42:19] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 17:42:19] [INFO ] [Nat]Absence check using 5 positive place invariants in 16 ms returned sat
[2025-06-02 17:42:19] [INFO ] [Nat]Absence check using state equation in 248 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:42:19] [INFO ] Deduced a trap composed of 57 places in 274 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:42:20] [INFO ] Deduced a trap composed of 58 places in 266 ms of which 26 ms to minimize.
[2025-06-02 17:42:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 679 ms
[2025-06-02 17:42:20] [INFO ] Computed and/alt/rep : 330/889/330 causal constraints (skipped 52 transitions) in 65 ms.
[2025-06-02 17:42:24] [INFO ] Added : 245 causal constraints over 49 iterations in 3913 ms. Result :unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 17:42:24] [INFO ] [Real]Absence check using 5 positive place invariants in 12 ms returned sat
[2025-06-02 17:42:24] [INFO ] [Real]Absence check using state equation in 225 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:42:24] [INFO ] Deduced a trap composed of 58 places in 303 ms of which 58 ms to minimize.
[2025-06-02 17:42:24] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 17:42:25] [INFO ] [Nat]Absence check using 5 positive place invariants in 8 ms returned sat
[2025-06-02 17:42:25] [INFO ] [Nat]Absence check using state equation in 201 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:42:25] [INFO ] Deduced a trap composed of 58 places in 351 ms of which 54 ms to minimize.
[2025-06-02 17:42:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 406 ms
[2025-06-02 17:42:25] [INFO ] Computed and/alt/rep : 330/889/330 causal constraints (skipped 52 transitions) in 33 ms.
[2025-06-02 17:42:28] [INFO ] Added : 266 causal constraints over 54 iterations in 3105 ms. Result :sat
Minimization took 402 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 17:42:29] [INFO ] [Real]Absence check using 5 positive place invariants in 13 ms returned sat
[2025-06-02 17:42:29] [INFO ] [Real]Absence check using state equation in 249 ms returned sat
[2025-06-02 17:42:29] [INFO ] Computed and/alt/rep : 330/889/330 causal constraints (skipped 52 transitions) in 53 ms.
[2025-06-02 17:42:29] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 17:42:29] [INFO ] [Nat]Absence check using 5 positive place invariants in 14 ms returned sat
[2025-06-02 17:42:30] [INFO ] [Nat]Absence check using state equation in 242 ms returned sat
[2025-06-02 17:42:30] [INFO ] Computed and/alt/rep : 330/889/330 causal constraints (skipped 52 transitions) in 53 ms.
[2025-06-02 17:42:34] [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 2
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.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
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-02 17:42:34] [INFO ] [Real]Absence check using 5 positive place invariants in 13 ms returned sat
[2025-06-02 17:42:35] [INFO ] [Real]Absence check using state equation in 261 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:42:35] [INFO ] Deduced a trap composed of 57 places in 306 ms of which 25 ms to minimize.
[2025-06-02 17:42:35] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 17:42:35] [INFO ] [Nat]Absence check using 5 positive place invariants in 14 ms returned sat
[2025-06-02 17:42:36] [INFO ] [Nat]Absence check using state equation in 256 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:42:36] [INFO ] Deduced a trap composed of 57 places in 326 ms of which 51 ms to minimize.
[2025-06-02 17:42:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 393 ms
[2025-06-02 17:42:36] [INFO ] Computed and/alt/rep : 330/889/330 causal constraints (skipped 52 transitions) in 51 ms.
[2025-06-02 17:42:40] [INFO ] Added : 263 causal constraints over 53 iterations in 3735 ms. Result :sat
Minimization took 406 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 17:42:40] [INFO ] [Real]Absence check using 5 positive place invariants in 13 ms returned sat
[2025-06-02 17:42:40] [INFO ] [Real]Absence check using state equation in 231 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:42:41] [INFO ] Deduced a trap composed of 27 places in 324 ms of which 40 ms to minimize.
[2025-06-02 17:42:41] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 17:42:41] [INFO ] [Nat]Absence check using 5 positive place invariants in 14 ms returned sat
[2025-06-02 17:42:41] [INFO ] [Nat]Absence check using state equation in 229 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:42:42] [INFO ] Deduced a trap composed of 27 places in 304 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:42:42] [INFO ] Deduced a trap composed of 57 places in 356 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:42:42] [INFO ] Deduced a trap composed of 61 places in 336 ms of which 57 ms to minimize.
[2025-06-02 17:42:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1097 ms
[2025-06-02 17:42:42] [INFO ] Computed and/alt/rep : 330/889/330 causal constraints (skipped 52 transitions) in 50 ms.
[2025-06-02 17:42:46] [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 4
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.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
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-02 17:42:46] [INFO ] [Real]Absence check using 5 positive place invariants in 13 ms returned sat
[2025-06-02 17:42:46] [INFO ] [Real]Absence check using state equation in 254 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:42:47] [INFO ] Deduced a trap composed of 75 places in 343 ms of which 56 ms to minimize.
[2025-06-02 17:42:47] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 17:42:47] [INFO ] [Nat]Absence check using 5 positive place invariants in 15 ms returned sat
[2025-06-02 17:42:47] [INFO ] [Nat]Absence check using state equation in 244 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:42:47] [INFO ] Deduced a trap composed of 57 places in 350 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:42:48] [INFO ] Deduced a trap composed of 58 places in 317 ms of which 54 ms to minimize.
[2025-06-02 17:42:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 745 ms
[2025-06-02 17:42:48] [INFO ] Computed and/alt/rep : 330/889/330 causal constraints (skipped 52 transitions) in 45 ms.
[2025-06-02 17:42:52] [INFO ] Added : 255 causal constraints over 51 iterations in 3891 ms. Result :unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 17:42:52] [INFO ] [Real]Absence check using 5 positive place invariants in 11 ms returned sat
[2025-06-02 17:42:52] [INFO ] [Real]Absence check using state equation in 200 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:42:52] [INFO ] Deduced a trap composed of 124 places in 303 ms of which 37 ms to minimize.
[2025-06-02 17:42:52] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 17:42:53] [INFO ] [Nat]Absence check using 5 positive place invariants in 14 ms returned sat
[2025-06-02 17:42:53] [INFO ] [Nat]Absence check using state equation in 236 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:42:53] [INFO ] Deduced a trap composed of 124 places in 352 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:42:54] [INFO ] Deduced a trap composed of 116 places in 357 ms of which 64 ms to minimize.
[2025-06-02 17:42:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 796 ms
[2025-06-02 17:42:54] [INFO ] Computed and/alt/rep : 330/889/330 causal constraints (skipped 52 transitions) in 45 ms.
[2025-06-02 17:42:57] [INFO ] Added : 255 causal constraints over 51 iterations in 3853 ms. Result :unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 17:42:58] [INFO ] [Real]Absence check using 5 positive place invariants in 13 ms returned sat
[2025-06-02 17:42:58] [INFO ] [Real]Absence check using state equation in 247 ms returned sat
[2025-06-02 17:42:58] [INFO ] Computed and/alt/rep : 330/889/330 causal constraints (skipped 52 transitions) in 47 ms.
[2025-06-02 17:42:58] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 17:42:58] [INFO ] [Nat]Absence check using 5 positive place invariants in 14 ms returned sat
[2025-06-02 17:42:58] [INFO ] [Nat]Absence check using state equation in 218 ms returned sat
[2025-06-02 17:42:58] [INFO ] Computed and/alt/rep : 330/889/330 causal constraints (skipped 52 transitions) in 40 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:43:01] [INFO ] Deduced a trap composed of 57 places in 206 ms of which 36 ms to minimize.
[2025-06-02 17:43:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 306 ms
[2025-06-02 17:43:01] [INFO ] Added : 256 causal constraints over 52 iterations in 2958 ms. Result :sat
Minimization took 316 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 17:43:02] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned sat
[2025-06-02 17:43:02] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:43:02] [INFO ] Deduced a trap composed of 75 places in 231 ms of which 35 ms to minimize.
[2025-06-02 17:43:02] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 17:43:02] [INFO ] [Nat]Absence check using 5 positive place invariants in 14 ms returned sat
[2025-06-02 17:43:03] [INFO ] [Nat]Absence check using state equation in 208 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:43:03] [INFO ] Deduced a trap composed of 63 places in 262 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:43:03] [INFO ] Deduced a trap composed of 66 places in 290 ms of which 56 ms to minimize.
[2025-06-02 17:43:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 620 ms
[2025-06-02 17:43:03] [INFO ] Computed and/alt/rep : 330/889/330 causal constraints (skipped 52 transitions) in 42 ms.
[2025-06-02 17:43:07] [INFO ] Added : 220 causal constraints over 44 iterations in 4064 ms. Result :unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 17:43:07] [INFO ] [Real]Absence check using 5 positive place invariants in 13 ms returned sat
[2025-06-02 17:43:08] [INFO ] [Real]Absence check using state equation in 236 ms returned sat
[2025-06-02 17:43:08] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 17:43:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 13 ms returned sat
[2025-06-02 17:43:08] [INFO ] [Nat]Absence check using state equation in 220 ms returned sat
[2025-06-02 17:43:08] [INFO ] Computed and/alt/rep : 330/889/330 causal constraints (skipped 52 transitions) in 43 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:43:10] [INFO ] Deduced a trap composed of 71 places in 239 ms of which 30 ms to minimize.
[2025-06-02 17:43:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 332 ms
[2025-06-02 17:43:11] [INFO ] Added : 186 causal constraints over 39 iterations in 2517 ms. Result :sat
Minimization took 322 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 17:43:11] [INFO ] [Real]Absence check using 5 positive place invariants in 13 ms returned sat
[2025-06-02 17:43:11] [INFO ] [Real]Absence check using state equation in 221 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:43:12] [INFO ] Deduced a trap composed of 57 places in 301 ms of which 47 ms to minimize.
[2025-06-02 17:43:12] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 17:43:12] [INFO ] [Nat]Absence check using 5 positive place invariants in 15 ms returned sat
[2025-06-02 17:43:12] [INFO ] [Nat]Absence check using state equation in 230 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:43:12] [INFO ] Deduced a trap composed of 57 places in 300 ms of which 43 ms to minimize.
[2025-06-02 17:43:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 346 ms
[2025-06-02 17:43:12] [INFO ] Computed and/alt/rep : 330/889/330 causal constraints (skipped 52 transitions) in 41 ms.
Maximisation of solution failed !
Minimization took 1 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 17:43:17] [INFO ] [Real]Absence check using 5 positive place invariants in 12 ms returned sat
[2025-06-02 17:43:17] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:43:17] [INFO ] Deduced a trap composed of 57 places in 162 ms of which 31 ms to minimize.
[2025-06-02 17:43:17] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 17:43:17] [INFO ] [Nat]Absence check using 5 positive place invariants in 13 ms returned sat
[2025-06-02 17:43:18] [INFO ] [Nat]Absence check using state equation in 236 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:43:18] [INFO ] Deduced a trap composed of 57 places in 319 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:43:18] [INFO ] Deduced a trap composed of 75 places in 299 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:43:19] [INFO ] Deduced a trap composed of 87 places in 321 ms of which 55 ms to minimize.
[2025-06-02 17:43:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1031 ms
[2025-06-02 17:43:19] [INFO ] Computed and/alt/rep : 330/889/330 causal constraints (skipped 52 transitions) in 30 ms.
[2025-06-02 17:43:22] [INFO ] Added : 274 causal constraints over 55 iterations in 2986 ms. Result :sat
Minimization took 286 ms.
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]
FORMULA FireWire-PT-15-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 11 out of 248 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 248/248 places, 383/383 transitions.
Graph (trivial) has 180 edges and 248 vertex of which 12 / 248 are part of one of the 3 SCC in 3 ms
Free SCC test removed 9 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (complete) has 667 edges and 239 vertex of which 234 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 46 rules applied. Total rules applied 48 place count 234 transition count 324
Reduce places removed 45 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 47 rules applied. Total rules applied 95 place count 189 transition count 322
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 96 place count 188 transition count 322
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 96 place count 188 transition count 316
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 108 place count 182 transition count 316
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 138 place count 152 transition count 285
Iterating global reduction 3 with 30 rules applied. Total rules applied 168 place count 152 transition count 285
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 169 place count 152 transition count 284
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 169 place count 152 transition count 282
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 173 place count 150 transition count 282
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 181 place count 142 transition count 245
Iterating global reduction 4 with 8 rules applied. Total rules applied 189 place count 142 transition count 245
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 191 place count 142 transition count 243
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 192 place count 141 transition count 241
Iterating global reduction 5 with 1 rules applied. Total rules applied 193 place count 141 transition count 241
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 194 place count 140 transition count 238
Iterating global reduction 5 with 1 rules applied. Total rules applied 195 place count 140 transition count 238
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 196 place count 139 transition count 236
Iterating global reduction 5 with 1 rules applied. Total rules applied 197 place count 139 transition count 236
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 239 place count 118 transition count 215
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 269 place count 103 transition count 254
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 270 place count 103 transition count 253
Free-agglomeration rule applied 11 times.
Iterating global reduction 5 with 11 rules applied. Total rules applied 281 place count 103 transition count 242
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 292 place count 92 transition count 242
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 294 place count 90 transition count 240
Iterating global reduction 6 with 2 rules applied. Total rules applied 296 place count 90 transition count 240
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 299 place count 90 transition count 237
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 303 place count 90 transition count 233
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 305 place count 90 transition count 233
Applied a total of 305 rules in 197 ms. Remains 90 /248 variables (removed 158) and now considering 233/383 (removed 150) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 209 ms. Remains : 90/248 places, 233/383 transitions.
[2025-06-02 17:43:23] [INFO ] Flow matrix only has 228 transitions (discarded 5 similar events)
// Phase 1: matrix 228 rows 90 cols
[2025-06-02 17:43:23] [INFO ] Computed 4 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (98031 resets) in 1255 ms. (796 steps per ms)
FORMULA FireWire-PT-15-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 10000006 steps (328388 resets) in 4865 ms. (2055 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-06-02 17:43:30] [INFO ] Flow matrix only has 228 transitions (discarded 5 similar events)
[2025-06-02 17:43:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:43:30] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-06-02 17:43:30] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2025-06-02 17:43:30] [INFO ] State equation strengthened by 19 read => feed constraints.
[2025-06-02 17:43:30] [INFO ] [Real]Added 19 Read/Feed constraints in 14 ms returned sat
[2025-06-02 17:43:30] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:43:30] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-06-02 17:43:30] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2025-06-02 17:43:30] [INFO ] [Nat]Added 19 Read/Feed constraints in 11 ms returned sat
[2025-06-02 17:43:30] [INFO ] Computed and/alt/rep : 125/683/125 causal constraints (skipped 101 transitions) in 14 ms.
[2025-06-02 17:43:30] [INFO ] Added : 47 causal constraints over 10 iterations in 244 ms. Result :sat
Minimization took 125 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:43:30] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-06-02 17:43:30] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2025-06-02 17:43:30] [INFO ] [Real]Added 19 Read/Feed constraints in 11 ms returned sat
[2025-06-02 17:43:30] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:43:30] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-06-02 17:43:30] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2025-06-02 17:43:30] [INFO ] [Nat]Added 19 Read/Feed constraints in 9 ms returned sat
[2025-06-02 17:43:30] [INFO ] Computed and/alt/rep : 125/683/125 causal constraints (skipped 101 transitions) in 17 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:43:31] [INFO ] Deduced a trap composed of 31 places in 148 ms of which 22 ms to minimize.
[2025-06-02 17:43:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 219 ms
[2025-06-02 17:43:31] [INFO ] Added : 42 causal constraints over 9 iterations in 550 ms. Result :sat
Minimization took 209 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:43:31] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2025-06-02 17:43:31] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2025-06-02 17:43:31] [INFO ] [Real]Added 19 Read/Feed constraints in 10 ms returned sat
[2025-06-02 17:43: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-02 17:43:31] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2025-06-02 17:43:32] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2025-06-02 17:43:32] [INFO ] [Nat]Added 19 Read/Feed constraints in 13 ms returned sat
[2025-06-02 17:43:32] [INFO ] Computed and/alt/rep : 125/683/125 causal constraints (skipped 101 transitions) in 30 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:43:32] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 17 ms to minimize.
[2025-06-02 17:43:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 194 ms
[2025-06-02 17:43:32] [INFO ] Added : 41 causal constraints over 9 iterations in 548 ms. Result :sat
Minimization took 200 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:43:32] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2025-06-02 17:43:33] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2025-06-02 17:43:33] [INFO ] [Real]Added 19 Read/Feed constraints in 27 ms returned sat
[2025-06-02 17:43:33] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:43:33] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2025-06-02 17:43:33] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2025-06-02 17:43:33] [INFO ] [Nat]Added 19 Read/Feed constraints in 32 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:43:33] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 14 ms to minimize.
[2025-06-02 17:43:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2025-06-02 17:43:33] [INFO ] Computed and/alt/rep : 125/683/125 causal constraints (skipped 101 transitions) in 25 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:43:34] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 17 ms to minimize.
[2025-06-02 17:43:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2025-06-02 17:43:34] [INFO ] Added : 66 causal constraints over 14 iterations in 830 ms. Result :sat
Minimization took 255 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:43:34] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-06-02 17:43:34] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2025-06-02 17:43:34] [INFO ] [Real]Added 19 Read/Feed constraints in 16 ms returned sat
[2025-06-02 17:43:34] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:43:34] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-06-02 17:43:34] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2025-06-02 17:43:34] [INFO ] [Nat]Added 19 Read/Feed constraints in 19 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:43:35] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:43:35] [INFO ] Deduced a trap composed of 31 places in 157 ms of which 20 ms to minimize.
[2025-06-02 17:43:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 337 ms
[2025-06-02 17:43:35] [INFO ] Computed and/alt/rep : 125/683/125 causal constraints (skipped 101 transitions) in 33 ms.
[2025-06-02 17:43:35] [INFO ] Added : 42 causal constraints over 12 iterations in 434 ms. Result :sat
Minimization took 216 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:43:35] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2025-06-02 17:43:36] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2025-06-02 17:43:36] [INFO ] [Real]Added 19 Read/Feed constraints in 8 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:43:36] [INFO ] Deduced a trap composed of 36 places in 139 ms of which 18 ms to minimize.
[2025-06-02 17:43: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-02 17:43:36] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-06-02 17:43:36] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2025-06-02 17:43:36] [INFO ] [Nat]Added 19 Read/Feed constraints in 10 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:43:36] [INFO ] Deduced a trap composed of 36 places in 162 ms of which 17 ms to minimize.
[2025-06-02 17:43:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2025-06-02 17:43:36] [INFO ] Computed and/alt/rep : 125/683/125 causal constraints (skipped 101 transitions) in 25 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:43:37] [INFO ] Deduced a trap composed of 38 places in 166 ms of which 23 ms to minimize.
[2025-06-02 17:43:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 248 ms
[2025-06-02 17:43:37] [INFO ] Added : 43 causal constraints over 10 iterations in 801 ms. Result :sat
Minimization took 205 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:43:37] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-06-02 17:43:37] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2025-06-02 17:43:37] [INFO ] [Real]Added 19 Read/Feed constraints in 19 ms returned sat
[2025-06-02 17:43:37] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:43:37] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-06-02 17:43:38] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2025-06-02 17:43:38] [INFO ] [Nat]Added 19 Read/Feed constraints in 40 ms returned sat
[2025-06-02 17:43:38] [INFO ] Computed and/alt/rep : 125/683/125 causal constraints (skipped 101 transitions) in 22 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:43:38] [INFO ] Deduced a trap composed of 31 places in 154 ms of which 21 ms to minimize.
[2025-06-02 17:43:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 217 ms
[2025-06-02 17:43:38] [INFO ] Added : 36 causal constraints over 9 iterations in 575 ms. Result :sat
Minimization took 200 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:43:38] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-06-02 17:43:39] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2025-06-02 17:43:39] [INFO ] [Real]Added 19 Read/Feed constraints in 16 ms returned sat
[2025-06-02 17:43:39] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:43:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-06-02 17:43:39] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2025-06-02 17:43:39] [INFO ] [Nat]Added 19 Read/Feed constraints in 16 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:43:39] [INFO ] Deduced a trap composed of 48 places in 128 ms of which 12 ms to minimize.
[2025-06-02 17:43:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2025-06-02 17:43:39] [INFO ] Computed and/alt/rep : 125/683/125 causal constraints (skipped 101 transitions) in 21 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:43:40] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 9 ms to minimize.
[2025-06-02 17:43:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 185 ms
[2025-06-02 17:43:40] [INFO ] Added : 67 causal constraints over 15 iterations in 791 ms. Result :sat
Minimization took 246 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:43:40] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2025-06-02 17:43:40] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2025-06-02 17:43:40] [INFO ] [Real]Added 19 Read/Feed constraints in 9 ms returned sat
[2025-06-02 17:43:40] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:43:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-06-02 17:43:40] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2025-06-02 17:43:40] [INFO ] [Nat]Added 19 Read/Feed constraints in 8 ms returned sat
[2025-06-02 17:43:40] [INFO ] Computed and/alt/rep : 125/683/125 causal constraints (skipped 101 transitions) in 26 ms.
[2025-06-02 17:43:40] [INFO ] Added : 5 causal constraints over 2 iterations in 105 ms. Result :sat
Minimization took 140 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:43:41] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-06-02 17:43:41] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2025-06-02 17:43:41] [INFO ] [Real]Added 19 Read/Feed constraints in 10 ms returned sat
[2025-06-02 17:43: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-02 17:43:41] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-06-02 17:43:41] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2025-06-02 17:43:41] [INFO ] [Nat]Added 19 Read/Feed constraints in 11 ms returned sat
[2025-06-02 17:43:41] [INFO ] Computed and/alt/rep : 125/683/125 causal constraints (skipped 101 transitions) in 26 ms.
[2025-06-02 17:43:41] [INFO ] Added : 7 causal constraints over 2 iterations in 108 ms. Result :sat
Minimization took 153 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA FireWire-PT-15-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-15-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-15-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-15-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 233/233 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 88 transition count 228
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 88 transition count 228
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 87 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 87 transition count 226
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 86 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 86 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 85 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 85 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 84 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 84 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 83 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 83 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 82 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 82 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 81 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 81 transition count 208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 80 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 80 transition count 206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 79 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 79 transition count 204
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 78 transition count 203
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 76 transition count 198
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 76 transition count 198
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 29 place count 76 transition count 197
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 30 place count 75 transition count 197
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 75 transition count 242
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 35 place count 74 transition count 239
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 2 with 16 rules applied. Total rules applied 51 place count 74 transition count 223
Applied a total of 51 rules in 108 ms. Remains 74 /90 variables (removed 16) and now considering 223/233 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 74/90 places, 223/233 transitions.
[2025-06-02 17:43:42] [INFO ] Flow matrix only has 218 transitions (discarded 5 similar events)
// Phase 1: matrix 218 rows 74 cols
[2025-06-02 17:43:42] [INFO ] Computed 4 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (94428 resets) in 1373 ms. (727 steps per ms)
BEST_FIRST walk for 6000003 steps (196551 resets) in 2700 ms. (2221 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2025-06-02 17:43:46] [INFO ] Flow matrix only has 218 transitions (discarded 5 similar events)
[2025-06-02 17:43:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:43:46] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-06-02 17:43:46] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2025-06-02 17:43: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-02 17:43:46] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-06-02 17:43:46] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2025-06-02 17:43:46] [INFO ] State equation strengthened by 34 read => feed constraints.
[2025-06-02 17:43:46] [INFO ] [Nat]Added 34 Read/Feed constraints in 27 ms returned sat
[2025-06-02 17:43:46] [INFO ] Computed and/alt/rep : 76/418/76 causal constraints (skipped 140 transitions) in 23 ms.
[2025-06-02 17:43:46] [INFO ] Added : 9 causal constraints over 4 iterations in 130 ms. Result :sat
Minimization took 114 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:43:47] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-06-02 17:43:47] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2025-06-02 17: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-02 17:43:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-06-02 17:43:47] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2025-06-02 17:43:47] [INFO ] [Nat]Added 34 Read/Feed constraints in 45 ms returned sat
[2025-06-02 17:43:47] [INFO ] Computed and/alt/rep : 76/418/76 causal constraints (skipped 140 transitions) in 23 ms.
[2025-06-02 17:43:47] [INFO ] Added : 2 causal constraints over 2 iterations in 92 ms. Result :sat
Minimization took 98 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:43:47] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-06-02 17:43:47] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2025-06-02 17: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-02 17:43:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-06-02 17:43:47] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2025-06-02 17:43:47] [INFO ] [Nat]Added 34 Read/Feed constraints in 27 ms returned sat
[2025-06-02 17:43:47] [INFO ] Computed and/alt/rep : 76/418/76 causal constraints (skipped 140 transitions) in 22 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:43:48] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:43:48] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 16 ms to minimize.
[2025-06-02 17:43:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 279 ms
[2025-06-02 17:43:48] [INFO ] Added : 16 causal constraints over 4 iterations in 466 ms. Result :sat
Minimization took 134 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:43:48] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-06-02 17:43:48] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2025-06-02 17:43:48] [INFO ] [Real]Added 34 Read/Feed constraints in 12 ms returned sat
[2025-06-02 17:43:48] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:43:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-06-02 17:43:48] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2025-06-02 17:43:48] [INFO ] [Nat]Added 34 Read/Feed constraints in 46 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:43:48] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:43:49] [INFO ] Deduced a trap composed of 40 places in 117 ms of which 11 ms to minimize.
[2025-06-02 17:43:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 285 ms
[2025-06-02 17:43:49] [INFO ] Computed and/alt/rep : 76/418/76 causal constraints (skipped 140 transitions) in 24 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:43:49] [INFO ] Deduced a trap composed of 24 places in 146 ms of which 18 ms to minimize.
[2025-06-02 17:43:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2025-06-02 17:43:49] [INFO ] Added : 41 causal constraints over 9 iterations in 520 ms. Result :sat
Minimization took 163 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:43:49] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-06-02 17:43:49] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2025-06-02 17:43:49] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:43:50] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-06-02 17:43:50] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2025-06-02 17:43:50] [INFO ] [Nat]Added 34 Read/Feed constraints in 39 ms returned sat
[2025-06-02 17:43:50] [INFO ] Computed and/alt/rep : 76/418/76 causal constraints (skipped 140 transitions) in 26 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:43:50] [INFO ] Deduced a trap composed of 24 places in 131 ms of which 11 ms to minimize.
[2025-06-02 17:43:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2025-06-02 17:43:50] [INFO ] Added : 36 causal constraints over 8 iterations in 475 ms. Result :sat
Minimization took 153 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:43:50] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-06-02 17:43:50] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2025-06-02 17:43:50] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:43:50] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-06-02 17:43:51] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2025-06-02 17:43:51] [INFO ] [Nat]Added 34 Read/Feed constraints in 44 ms returned sat
[2025-06-02 17:43:51] [INFO ] Computed and/alt/rep : 76/418/76 causal constraints (skipped 140 transitions) in 26 ms.
[2025-06-02 17:43:51] [INFO ] Added : 2 causal constraints over 2 iterations in 130 ms. Result :sat
Minimization took 126 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 223/223 transitions.
Applied a total of 0 rules in 11 ms. Remains 74 /74 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 74/74 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 223/223 transitions.
Applied a total of 0 rules in 16 ms. Remains 74 /74 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2025-06-02 17:43:51] [INFO ] Flow matrix only has 218 transitions (discarded 5 similar events)
[2025-06-02 17:43:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:43:51] [INFO ] Implicit Places using invariants in 170 ms returned []
[2025-06-02 17:43:51] [INFO ] Flow matrix only has 218 transitions (discarded 5 similar events)
[2025-06-02 17:43:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:43:51] [INFO ] State equation strengthened by 34 read => feed constraints.
[2025-06-02 17:43:52] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:43:52] [INFO ] Redundant transitions in 18 ms returned []
Running 221 sub problems to find dead transitions.
[2025-06-02 17:43:52] [INFO ] Flow matrix only has 218 transitions (discarded 5 similar events)
[2025-06-02 17:43:52] [INFO ] Invariant cache hit.
[2025-06-02 17:43:52] [INFO ] State equation strengthened by 34 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/74 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:43:55] [INFO ] Deduced a trap composed of 28 places in 125 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:43:55] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:43:55] [INFO ] Deduced a trap composed of 42 places in 93 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:43:55] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 16 ms to minimize.
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD37 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:43:55] [INFO ] Deduced a trap composed of 47 places in 84 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:43:55] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 9 ms to minimize.
Problem TDEAD58 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:43:56] [INFO ] Deduced a trap composed of 33 places in 113 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:43:56] [INFO ] Deduced a trap composed of 40 places in 112 ms of which 8 ms to minimize.
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:43:56] [INFO ] Deduced a trap composed of 49 places in 102 ms of which 13 ms to minimize.
Problem TDEAD118 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:43:56] [INFO ] Deduced a trap composed of 29 places in 126 ms of which 15 ms to minimize.
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 10/14 constraints. Problems are: Problem set: 27 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/14 constraints. Problems are: Problem set: 27 solved, 194 unsolved
At refinement iteration 4 (OVERLAPS) 218/292 variables, 74/88 constraints. Problems are: Problem set: 27 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 34/122 constraints. Problems are: Problem set: 27 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/122 constraints. Problems are: Problem set: 27 solved, 194 unsolved
At refinement iteration 7 (OVERLAPS) 0/292 variables, 0/122 constraints. Problems are: Problem set: 27 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 292/292 variables, and 122 constraints, problems are : Problem set: 27 solved, 194 unsolved in 12817 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 74/74 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 27 solved, 194 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 27 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/74 variables, 4/4 constraints. Problems are: Problem set: 27 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 10/14 constraints. Problems are: Problem set: 27 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/14 constraints. Problems are: Problem set: 27 solved, 194 unsolved
At refinement iteration 4 (OVERLAPS) 218/292 variables, 74/88 constraints. Problems are: Problem set: 27 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 34/122 constraints. Problems are: Problem set: 27 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 194/316 constraints. Problems are: Problem set: 27 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 0/316 constraints. Problems are: Problem set: 27 solved, 194 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 292/292 variables, and 316 constraints, problems are : Problem set: 27 solved, 194 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 74/74 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 194/221 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43163ms problems are : Problem set: 27 solved, 194 unsolved
Search for dead transitions found 27 dead transitions in 43183ms
Found 27 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 27 transitions
Dead transitions reduction (with SMT) removed 27 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 74/74 places, 196/223 transitions.
Applied a total of 0 rules in 9 ms. Remains 74 /74 variables (removed 0) and now considering 196/196 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:44:35] [INFO ] Redundant transitions in 14 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 43772 ms. Remains : 74/74 places, 196/223 transitions.
[2025-06-02 17:44:35] [INFO ] Flow matrix only has 192 transitions (discarded 4 similar events)
// Phase 1: matrix 192 rows 74 cols
[2025-06-02 17:44:35] [INFO ] Computed 4 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (94230 resets) in 1355 ms. (737 steps per ms)
BEST_FIRST walk for 6000004 steps (196894 resets) in 2874 ms. (2086 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2025-06-02 17:44:39] [INFO ] Flow matrix only has 192 transitions (discarded 4 similar events)
[2025-06-02 17:44:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:44:39] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-06-02 17:44:39] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2025-06-02 17:44:39] [INFO ] State equation strengthened by 34 read => feed constraints.
[2025-06-02 17:44:39] [INFO ] [Real]Added 34 Read/Feed constraints in 12 ms returned sat
[2025-06-02 17:44:39] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:44:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-06-02 17:44:39] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2025-06-02 17:44:39] [INFO ] [Nat]Added 34 Read/Feed constraints in 26 ms returned sat
[2025-06-02 17:44:40] [INFO ] Computed and/alt/rep : 86/435/86 causal constraints (skipped 104 transitions) in 19 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:44:40] [INFO ] Deduced a trap composed of 40 places in 117 ms of which 7 ms to minimize.
[2025-06-02 17:44:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2025-06-02 17:44:40] [INFO ] Added : 40 causal constraints over 8 iterations in 426 ms. Result :sat
Minimization took 139 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:44:40] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-06-02 17:44:40] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2025-06-02 17:44:40] [INFO ] [Real]Added 34 Read/Feed constraints in 17 ms returned sat
[2025-06-02 17:44:40] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:44:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-06-02 17:44:40] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2025-06-02 17:44:40] [INFO ] [Nat]Added 34 Read/Feed constraints in 29 ms returned sat
[2025-06-02 17:44:40] [INFO ] Computed and/alt/rep : 86/435/86 causal constraints (skipped 104 transitions) in 24 ms.
[2025-06-02 17:44:41] [INFO ] Added : 2 causal constraints over 2 iterations in 90 ms. Result :sat
Minimization took 93 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:44:41] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-06-02 17:44:41] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2025-06-02 17:44:41] [INFO ] [Real]Added 34 Read/Feed constraints in 21 ms returned sat
[2025-06-02 17:44: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-02 17:44:41] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-06-02 17:44:41] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2025-06-02 17:44:41] [INFO ] [Nat]Added 34 Read/Feed constraints in 23 ms returned sat
[2025-06-02 17:44:41] [INFO ] Computed and/alt/rep : 86/435/86 causal constraints (skipped 104 transitions) in 23 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:44:41] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 20 ms to minimize.
[2025-06-02 17:44:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2025-06-02 17:44:41] [INFO ] Added : 27 causal constraints over 7 iterations in 397 ms. Result :sat
Minimization took 142 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:44:42] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-06-02 17:44:42] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2025-06-02 17:44:42] [INFO ] [Real]Added 34 Read/Feed constraints in 18 ms returned sat
[2025-06-02 17:44:42] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:44:42] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-06-02 17:44:42] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2025-06-02 17:44:42] [INFO ] [Nat]Added 34 Read/Feed constraints in 23 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:44:42] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:44:42] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 10 ms to minimize.
[2025-06-02 17:44:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 267 ms
[2025-06-02 17:44:42] [INFO ] Computed and/alt/rep : 86/435/86 causal constraints (skipped 104 transitions) in 20 ms.
[2025-06-02 17:44:42] [INFO ] Added : 50 causal constraints over 10 iterations in 302 ms. Result :sat
Minimization took 139 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:44:43] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-06-02 17:44:43] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2025-06-02 17:44:43] [INFO ] [Real]Added 34 Read/Feed constraints in 16 ms returned sat
[2025-06-02 17:44:43] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:44:43] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-06-02 17:44:43] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2025-06-02 17:44:43] [INFO ] [Nat]Added 34 Read/Feed constraints in 29 ms returned sat
[2025-06-02 17:44:43] [INFO ] Computed and/alt/rep : 86/435/86 causal constraints (skipped 104 transitions) in 23 ms.
[2025-06-02 17:44:43] [INFO ] Added : 2 causal constraints over 1 iterations in 70 ms. Result :sat
Minimization took 103 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:44:43] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-06-02 17:44:43] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2025-06-02 17:44:43] [INFO ] [Real]Added 34 Read/Feed constraints in 17 ms returned sat
[2025-06-02 17:44:43] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:44:43] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-06-02 17:44:43] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2025-06-02 17:44:43] [INFO ] [Nat]Added 34 Read/Feed constraints in 19 ms returned sat
[2025-06-02 17:44:43] [INFO ] Computed and/alt/rep : 86/435/86 causal constraints (skipped 104 transitions) in 22 ms.
[2025-06-02 17:44:44] [INFO ] Added : 2 causal constraints over 2 iterations in 81 ms. Result :sat
Minimization took 101 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
FORMULA FireWire-PT-15-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-15-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 196/196 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 0 with 1 rules applied. Total rules applied 1 place count 74 transition count 195
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 73 transition count 195
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 72 transition count 194
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 72 transition count 194
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 71 transition count 196
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 10 place count 71 transition count 192
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 14 place count 71 transition count 188
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 71 transition count 188
Applied a total of 15 rules in 28 ms. Remains 71 /74 variables (removed 3) and now considering 188/196 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 71/74 places, 188/196 transitions.
[2025-06-02 17:44:44] [INFO ] Flow matrix only has 184 transitions (discarded 4 similar events)
// Phase 1: matrix 184 rows 71 cols
[2025-06-02 17:44:44] [INFO ] Computed 4 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (94353 resets) in 1175 ms. (850 steps per ms)
BEST_FIRST walk for 4000003 steps (130981 resets) in 1807 ms. (2212 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2025-06-02 17:44:47] [INFO ] Flow matrix only has 184 transitions (discarded 4 similar events)
[2025-06-02 17:44:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:44:47] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-06-02 17:44:47] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2025-06-02 17:44:47] [INFO ] State equation strengthened by 32 read => feed constraints.
[2025-06-02 17:44:47] [INFO ] [Real]Added 32 Read/Feed constraints in 22 ms returned sat
[2025-06-02 17:44: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-02 17:44:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-06-02 17:44:47] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2025-06-02 17:44:47] [INFO ] [Nat]Added 32 Read/Feed constraints in 19 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:44:47] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 14 ms to minimize.
[2025-06-02 17:44:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2025-06-02 17:44:47] [INFO ] Computed and/alt/rep : 80/410/80 causal constraints (skipped 102 transitions) in 23 ms.
[2025-06-02 17:44:47] [INFO ] Added : 32 causal constraints over 7 iterations in 215 ms. Result :sat
Minimization took 137 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:44:48] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-06-02 17:44:48] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2025-06-02 17:44:48] [INFO ] [Real]Added 32 Read/Feed constraints in 15 ms returned sat
[2025-06-02 17:44:48] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:44:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-06-02 17:44:48] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2025-06-02 17:44:48] [INFO ] [Nat]Added 32 Read/Feed constraints in 32 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:44:48] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 13 ms to minimize.
[2025-06-02 17:44:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2025-06-02 17:44:48] [INFO ] Computed and/alt/rep : 80/410/80 causal constraints (skipped 102 transitions) in 21 ms.
[2025-06-02 17:44:48] [INFO ] Added : 2 causal constraints over 2 iterations in 86 ms. Result :sat
Minimization took 105 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:44:48] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-06-02 17:44:48] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2025-06-02 17:44:48] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:44:49] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-06-02 17:44:49] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2025-06-02 17:44:49] [INFO ] [Nat]Added 32 Read/Feed constraints in 25 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:44:49] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:44:49] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 12 ms to minimize.
[2025-06-02 17:44:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 240 ms
[2025-06-02 17:44:49] [INFO ] Computed and/alt/rep : 80/410/80 causal constraints (skipped 102 transitions) in 15 ms.
[2025-06-02 17:44:49] [INFO ] Added : 32 causal constraints over 7 iterations in 203 ms. Result :sat
Minimization took 134 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:44:49] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-06-02 17:44:49] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2025-06-02 17:44:49] [INFO ] [Real]Added 32 Read/Feed constraints in 18 ms returned sat
[2025-06-02 17:44:49] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:44:49] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-06-02 17:44:50] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2025-06-02 17:44:50] [INFO ] [Nat]Added 32 Read/Feed constraints in 25 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:44:50] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 11 ms to minimize.
[2025-06-02 17:44:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2025-06-02 17:44:50] [INFO ] Computed and/alt/rep : 80/410/80 causal constraints (skipped 102 transitions) in 23 ms.
[2025-06-02 17:44:50] [INFO ] Added : 3 causal constraints over 2 iterations in 86 ms. Result :sat
Minimization took 103 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 71 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 188/188 transitions.
Applied a total of 0 rules in 7 ms. Remains 71 /71 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 71/71 places, 188/188 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 188/188 transitions.
Applied a total of 0 rules in 7 ms. Remains 71 /71 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2025-06-02 17:44:50] [INFO ] Flow matrix only has 184 transitions (discarded 4 similar events)
[2025-06-02 17:44:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:44:50] [INFO ] Implicit Places using invariants in 131 ms returned []
[2025-06-02 17:44:50] [INFO ] Flow matrix only has 184 transitions (discarded 4 similar events)
[2025-06-02 17:44:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:44:50] [INFO ] State equation strengthened by 32 read => feed constraints.
[2025-06-02 17:44:50] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:44:50] [INFO ] Redundant transitions in 4 ms returned []
Running 186 sub problems to find dead transitions.
[2025-06-02 17:44:50] [INFO ] Flow matrix only has 184 transitions (discarded 4 similar events)
[2025-06-02 17:44:50] [INFO ] Invariant cache hit.
[2025-06-02 17:44:50] [INFO ] State equation strengthened by 32 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 186 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:44:53] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:44:53] [INFO ] Deduced a trap composed of 37 places in 91 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:44:53] [INFO ] Deduced a trap composed of 38 places in 107 ms of which 14 ms to minimize.
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:44:53] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 15 ms to minimize.
Problem TDEAD25 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:44:53] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 17 ms to minimize.
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:44:53] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:44:53] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 9 ms to minimize.
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:44:54] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 15 ms to minimize.
Problem TDEAD121 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 8/12 constraints. Problems are: Problem set: 24 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/12 constraints. Problems are: Problem set: 24 solved, 162 unsolved
At refinement iteration 4 (OVERLAPS) 184/255 variables, 71/83 constraints. Problems are: Problem set: 24 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 32/115 constraints. Problems are: Problem set: 24 solved, 162 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 0/115 constraints. Problems are: Problem set: 24 solved, 162 unsolved
At refinement iteration 7 (OVERLAPS) 0/255 variables, 0/115 constraints. Problems are: Problem set: 24 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Real declared 255/255 variables, and 115 constraints, problems are : Problem set: 24 solved, 162 unsolved in 10041 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 71/71 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 162 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 4/4 constraints. Problems are: Problem set: 24 solved, 162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 8/12 constraints. Problems are: Problem set: 24 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/12 constraints. Problems are: Problem set: 24 solved, 162 unsolved
At refinement iteration 4 (OVERLAPS) 184/255 variables, 71/83 constraints. Problems are: Problem set: 24 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 32/115 constraints. Problems are: Problem set: 24 solved, 162 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 162/277 constraints. Problems are: Problem set: 24 solved, 162 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:45:09] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 1/278 constraints. Problems are: Problem set: 24 solved, 162 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:45:18] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/255 variables, 1/279 constraints. Problems are: Problem set: 24 solved, 162 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 255/255 variables, and 279 constraints, problems are : Problem set: 24 solved, 162 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 71/71 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 162/186 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40180ms problems are : Problem set: 24 solved, 162 unsolved
Search for dead transitions found 24 dead transitions in 40182ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 71/71 places, 164/188 transitions.
Applied a total of 0 rules in 6 ms. Remains 71 /71 variables (removed 0) and now considering 164/164 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:45:31] [INFO ] Redundant transitions in 3 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 40655 ms. Remains : 71/71 places, 164/188 transitions.
[2025-06-02 17:45:31] [INFO ] Flow matrix only has 160 transitions (discarded 4 similar events)
// Phase 1: matrix 160 rows 71 cols
[2025-06-02 17:45:31] [INFO ] Computed 4 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (94391 resets) in 1119 ms. (892 steps per ms)
BEST_FIRST walk for 4000003 steps (131182 resets) in 1674 ms. (2388 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2025-06-02 17:45:33] [INFO ] Flow matrix only has 160 transitions (discarded 4 similar events)
[2025-06-02 17:45:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:45:33] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-06-02 17:45:34] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2025-06-02 17:45:34] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-06-02 17:45:34] [INFO ] [Real]Added 25 Read/Feed constraints in 13 ms returned sat
[2025-06-02 17:45:34] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:45:34] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-06-02 17:45:34] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2025-06-02 17:45:34] [INFO ] [Nat]Added 25 Read/Feed constraints in 26 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:45:34] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 10 ms to minimize.
[2025-06-02 17:45:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2025-06-02 17:45:34] [INFO ] Computed and/alt/rep : 71/378/71 causal constraints (skipped 87 transitions) in 16 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:45:34] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 11 ms to minimize.
[2025-06-02 17:45:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2025-06-02 17:45:34] [INFO ] Added : 26 causal constraints over 7 iterations in 298 ms. Result :sat
Minimization took 115 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:45:34] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-06-02 17:45:34] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2025-06-02 17:45:34] [INFO ] [Real]Added 25 Read/Feed constraints in 17 ms returned sat
[2025-06-02 17:45:34] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:45:34] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-06-02 17:45:35] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2025-06-02 17:45:35] [INFO ] [Nat]Added 25 Read/Feed constraints in 16 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:45:35] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 11 ms to minimize.
[2025-06-02 17:45:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2025-06-02 17:45:35] [INFO ] Computed and/alt/rep : 71/378/71 causal constraints (skipped 87 transitions) in 18 ms.
[2025-06-02 17:45:35] [INFO ] Added : 2 causal constraints over 2 iterations in 72 ms. Result :sat
Minimization took 84 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:45:35] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-06-02 17:45:35] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2025-06-02 17:45:35] [INFO ] [Real]Added 25 Read/Feed constraints in 11 ms returned sat
[2025-06-02 17:45:35] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:45:35] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-06-02 17:45:35] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2025-06-02 17:45:35] [INFO ] [Nat]Added 25 Read/Feed constraints in 17 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:45:35] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 7 ms to minimize.
[2025-06-02 17:45:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2025-06-02 17:45:35] [INFO ] Computed and/alt/rep : 71/378/71 causal constraints (skipped 87 transitions) in 20 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:45:36] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 17 ms to minimize.
[2025-06-02 17:45:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 155 ms
[2025-06-02 17:45:36] [INFO ] Added : 39 causal constraints over 8 iterations in 396 ms. Result :sat
Minimization took 108 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:45:36] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-06-02 17:45:36] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2025-06-02 17:45:36] [INFO ] [Real]Added 25 Read/Feed constraints in 18 ms returned sat
[2025-06-02 17:45: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-02 17:45:36] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-06-02 17:45:36] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2025-06-02 17:45:36] [INFO ] [Nat]Added 25 Read/Feed constraints in 21 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:45:36] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 12 ms to minimize.
[2025-06-02 17:45:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2025-06-02 17:45:36] [INFO ] Computed and/alt/rep : 71/378/71 causal constraints (skipped 87 transitions) in 18 ms.
[2025-06-02 17:45:36] [INFO ] Added : 2 causal constraints over 2 iterations in 75 ms. Result :sat
Minimization took 85 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 71 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 164/164 transitions.
Applied a total of 0 rules in 6 ms. Remains 71 /71 variables (removed 0) and now considering 164/164 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 71/71 places, 164/164 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 164/164 transitions.
Applied a total of 0 rules in 4 ms. Remains 71 /71 variables (removed 0) and now considering 164/164 (removed 0) transitions.
[2025-06-02 17:45:37] [INFO ] Flow matrix only has 160 transitions (discarded 4 similar events)
[2025-06-02 17:45:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:45:37] [INFO ] Implicit Places using invariants in 138 ms returned []
[2025-06-02 17:45:37] [INFO ] Flow matrix only has 160 transitions (discarded 4 similar events)
[2025-06-02 17:45:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:45:37] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-06-02 17:45:37] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:45:37] [INFO ] Redundant transitions in 2 ms returned []
Running 162 sub problems to find dead transitions.
[2025-06-02 17:45:37] [INFO ] Flow matrix only has 160 transitions (discarded 4 similar events)
[2025-06-02 17:45:37] [INFO ] Invariant cache hit.
[2025-06-02 17:45:37] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 162 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:45:39] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:45:39] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:45:39] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 12 ms to minimize.
Problem TDEAD8 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:45:39] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:45:39] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:45:39] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:45:40] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:45:40] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 8 ms to minimize.
Problem TDEAD142 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 8/12 constraints. Problems are: Problem set: 2 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 160/231 variables, 71/83 constraints. Problems are: Problem set: 2 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 25/108 constraints. Problems are: Problem set: 2 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/108 constraints. Problems are: Problem set: 2 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 0/231 variables, 0/108 constraints. Problems are: Problem set: 2 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 231/231 variables, and 108 constraints, problems are : Problem set: 2 solved, 160 unsolved in 9731 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 71/71 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 160 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 160 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 160 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 8/12 constraints. Problems are: Problem set: 2 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 160/231 variables, 71/83 constraints. Problems are: Problem set: 2 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 25/108 constraints. Problems are: Problem set: 2 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 160/268 constraints. Problems are: Problem set: 2 solved, 160 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 0/268 constraints. Problems are: Problem set: 2 solved, 160 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 231/231 variables, and 268 constraints, problems are : Problem set: 2 solved, 160 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 71/71 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 160/162 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39820ms problems are : Problem set: 2 solved, 160 unsolved
Search for dead transitions found 2 dead transitions in 39824ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 71/71 places, 162/164 transitions.
Applied a total of 0 rules in 6 ms. Remains 71 /71 variables (removed 0) and now considering 162/162 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:46:17] [INFO ] Redundant transitions in 0 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 40270 ms. Remains : 71/71 places, 162/164 transitions.
[2025-06-02 17:46:17] [INFO ] Flow matrix only has 158 transitions (discarded 4 similar events)
// Phase 1: matrix 158 rows 71 cols
[2025-06-02 17:46:17] [INFO ] Computed 4 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (94194 resets) in 1074 ms. (930 steps per ms)
BEST_FIRST walk for 4000003 steps (130983 resets) in 1664 ms. (2402 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2025-06-02 17:46:20] [INFO ] Flow matrix only has 158 transitions (discarded 4 similar events)
[2025-06-02 17:46:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:46:20] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-06-02 17:46:20] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2025-06-02 17:46:20] [INFO ] State equation strengthened by 24 read => feed constraints.
[2025-06-02 17:46:20] [INFO ] [Real]Added 24 Read/Feed constraints in 17 ms returned sat
[2025-06-02 17:46:20] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:46:20] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-06-02 17:46:20] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2025-06-02 17:46:20] [INFO ] [Nat]Added 24 Read/Feed constraints in 25 ms returned sat
[2025-06-02 17:46:20] [INFO ] Computed and/alt/rep : 69/367/69 causal constraints (skipped 87 transitions) in 18 ms.
[2025-06-02 17:46:20] [INFO ] Added : 16 causal constraints over 4 iterations in 110 ms. Result :sat
Minimization took 100 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:46:20] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-06-02 17:46:20] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2025-06-02 17:46:20] [INFO ] [Real]Added 24 Read/Feed constraints in 12 ms returned sat
[2025-06-02 17:46:20] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:46:20] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-06-02 17:46:20] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2025-06-02 17:46:20] [INFO ] [Nat]Added 24 Read/Feed constraints in 28 ms returned sat
[2025-06-02 17:46:20] [INFO ] Computed and/alt/rep : 69/367/69 causal constraints (skipped 87 transitions) in 19 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:21] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 10 ms to minimize.
[2025-06-02 17:46:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2025-06-02 17:46:21] [INFO ] Added : 14 causal constraints over 4 iterations in 267 ms. Result :sat
Minimization took 107 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:46:21] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-06-02 17:46:21] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2025-06-02 17:46:21] [INFO ] [Real]Added 24 Read/Feed constraints in 13 ms returned sat
[2025-06-02 17:46:21] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:46:21] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-06-02 17:46:21] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2025-06-02 17:46:21] [INFO ] [Nat]Added 24 Read/Feed constraints in 21 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:21] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 6 ms to minimize.
[2025-06-02 17:46:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2025-06-02 17:46:21] [INFO ] Computed and/alt/rep : 69/367/69 causal constraints (skipped 87 transitions) in 16 ms.
[2025-06-02 17:46:21] [INFO ] Added : 19 causal constraints over 5 iterations in 144 ms. Result :sat
Minimization took 105 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 17:46:21] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-06-02 17:46:22] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2025-06-02 17:46:22] [INFO ] [Real]Added 24 Read/Feed constraints in 14 ms returned sat
[2025-06-02 17:46: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-02 17:46:22] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-06-02 17:46:22] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2025-06-02 17:46:22] [INFO ] [Nat]Added 24 Read/Feed constraints in 30 ms returned sat
[2025-06-02 17:46:22] [INFO ] Computed and/alt/rep : 69/367/69 causal constraints (skipped 87 transitions) in 20 ms.
[2025-06-02 17:46:22] [INFO ] Added : 39 causal constraints over 9 iterations in 235 ms. Result :sat
Minimization took 122 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 71 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 162/162 transitions.
Applied a total of 0 rules in 4 ms. Remains 71 /71 variables (removed 0) and now considering 162/162 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 71/71 places, 162/162 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 162/162 transitions.
Applied a total of 0 rules in 3 ms. Remains 71 /71 variables (removed 0) and now considering 162/162 (removed 0) transitions.
[2025-06-02 17:46:22] [INFO ] Flow matrix only has 158 transitions (discarded 4 similar events)
[2025-06-02 17:46:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:46:22] [INFO ] Implicit Places using invariants in 124 ms returned []
[2025-06-02 17:46:22] [INFO ] Flow matrix only has 158 transitions (discarded 4 similar events)
[2025-06-02 17:46:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:46:22] [INFO ] State equation strengthened by 24 read => feed constraints.
[2025-06-02 17:46:23] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:46:23] [INFO ] Redundant transitions in 1 ms returned []
Running 160 sub problems to find dead transitions.
[2025-06-02 17:46:23] [INFO ] Flow matrix only has 158 transitions (discarded 4 similar events)
[2025-06-02 17:46:23] [INFO ] Invariant cache hit.
[2025-06-02 17:46:23] [INFO ] State equation strengthened by 24 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:24] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:24] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:25] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:25] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:25] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:25] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:25] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 158/229 variables, 71/82 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 24/106 constraints. Problems are: Problem set: 0 solved, 160 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:28] [INFO ] Deduced a trap composed of 37 places in 107 ms of which 16 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 8 (OVERLAPS) 0/229 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 229/229 variables, and 107 constraints, problems are : Problem set: 0 solved, 160 unsolved in 10530 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 71/71 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 158/229 variables, 71/83 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 24/107 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 160/267 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 8 (OVERLAPS) 0/229 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 229/229 variables, and 267 constraints, problems are : Problem set: 0 solved, 160 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 71/71 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40601ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 40603ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40992 ms. Remains : 71/71 places, 162/162 transitions.
RANDOM walk for 40000 steps (3759 resets) in 1711 ms. (23 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (1323 resets) in 488 ms. (81 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1301 resets) in 295 ms. (135 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1315 resets) in 125 ms. (317 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (1303 resets) in 85 ms. (465 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1332 resets) in 94 ms. (421 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1303 resets) in 113 ms. (350 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (1298 resets) in 129 ms. (307 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (1311 resets) in 235 ms. (169 steps per ms) remains 8/8 properties
[2025-06-02 17:47:04] [INFO ] Flatten gal took : 164 ms
[2025-06-02 17:47:04] [INFO ] Flatten gal took : 70 ms
[2025-06-02 17:47:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10291270770451398123.gal : 16 ms
[2025-06-02 17:47:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9379857715255761881.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/ReachabilityCardinality10291270770451398123.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9379857715255761881.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 ...329
Loading property file /tmp/ReachabilityCardinality9379857715255761881.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :7 after 53
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :53 after 65
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :65 after 137
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :137 after 313
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :313 after 486
Finished probabilistic random walk after 21042 steps, run visited all 8 properties in 308 ms. (steps per millisecond=68 )
Probabilistic random walk after 21042 steps, saw 7142 distinct states, run finished after 338 ms. (steps per millisecond=62 ) properties seen :8
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA FireWire-PT-15-UpperBounds-14 1 TECHNIQUES REACHABILITY_MAX
FORMULA FireWire-PT-15-UpperBounds-12 1 TECHNIQUES REACHABILITY_MAX
FORMULA FireWire-PT-15-UpperBounds-03 1 TECHNIQUES REACHABILITY_MAX
FORMULA FireWire-PT-15-UpperBounds-01 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 4 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 288780 ms.
BK_STOP 1748886425231
--------------------
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="FireWire-PT-15"
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 FireWire-PT-15, 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 r086-smll-174860102400357"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-15.tgz
mv FireWire-PT-15 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 ;