About the Execution of 2024-gold for FireWire-PT-18
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15687.680 | 175875.00 | 244617.00 | 923.00 | 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r097-smll-174860111800048.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 gold2024
Input is FireWire-PT-18, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r097-smll-174860111800048
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K 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 28K 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 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K 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 168K 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-18-UpperBounds-00
FORMULA_NAME FireWire-PT-18-UpperBounds-01
FORMULA_NAME FireWire-PT-18-UpperBounds-02
FORMULA_NAME FireWire-PT-18-UpperBounds-03
FORMULA_NAME FireWire-PT-18-UpperBounds-04
FORMULA_NAME FireWire-PT-18-UpperBounds-05
FORMULA_NAME FireWire-PT-18-UpperBounds-06
FORMULA_NAME FireWire-PT-18-UpperBounds-07
FORMULA_NAME FireWire-PT-18-UpperBounds-08
FORMULA_NAME FireWire-PT-18-UpperBounds-09
FORMULA_NAME FireWire-PT-18-UpperBounds-10
FORMULA_NAME FireWire-PT-18-UpperBounds-11
FORMULA_NAME FireWire-PT-18-UpperBounds-12
FORMULA_NAME FireWire-PT-18-UpperBounds-13
FORMULA_NAME FireWire-PT-18-UpperBounds-14
FORMULA_NAME FireWire-PT-18-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1748678616850
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-31 08:03:39] [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-05-31 08:03:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 08:03:40] [INFO ] Load time of PNML (sax parser for PT used): 429 ms
[2025-05-31 08:03:40] [INFO ] Transformed 437 places.
[2025-05-31 08:03:40] [INFO ] Transformed 707 transitions.
[2025-05-31 08:03:40] [INFO ] Found NUPN structural information;
[2025-05-31 08:03:40] [INFO ] Parsed PT model containing 437 places and 707 transitions and 2170 arcs in 958 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 29 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 707 rows 437 cols
[2025-05-31 08:03:41] [INFO ] Computed 9 invariants in 66 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 (3 resets) in 113 ms. (87 steps per ms)
FORMULA FireWire-PT-18-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-18-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-18-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 130000 steps (54 resets) in 559 ms. (232 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[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]
[2025-05-31 08:03:41] [INFO ] Invariant cache hit.
[2025-05-31 08:03:42] [INFO ] [Real]Absence check using 9 positive place invariants in 52 ms returned sat
[2025-05-31 08:03:43] [INFO ] [Real]Absence check using state equation in 1270 ms returned sat
[2025-05-31 08:03:44] [INFO ] Deduced a trap composed of 82 places in 759 ms of which 72 ms to minimize.
[2025-05-31 08:03:45] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:03:45] [INFO ] [Nat]Absence check using 9 positive place invariants in 25 ms returned sat
[2025-05-31 08:03:45] [INFO ] [Nat]Absence check using state equation in 559 ms returned sat
[2025-05-31 08:03:46] [INFO ] Deduced a trap composed of 82 places in 402 ms of which 6 ms to minimize.
[2025-05-31 08:03:47] [INFO ] Deduced a trap composed of 61 places in 527 ms of which 6 ms to minimize.
[2025-05-31 08:03:47] [INFO ] Deduced a trap composed of 102 places in 478 ms of which 8 ms to minimize.
[2025-05-31 08:03:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1605 ms
[2025-05-31 08:03:47] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 158 ms.
[2025-05-31 08:03:50] [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 0
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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-31 08:03:50] [INFO ] [Real]Absence check using 9 positive place invariants in 22 ms returned sat
[2025-05-31 08:03:50] [INFO ] [Real]Absence check using state equation in 476 ms returned sat
[2025-05-31 08:03:50] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 2 ms to minimize.
[2025-05-31 08:03:50] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:03:51] [INFO ] [Nat]Absence check using 9 positive place invariants in 22 ms returned sat
[2025-05-31 08:03:51] [INFO ] [Nat]Absence check using state equation in 485 ms returned sat
[2025-05-31 08:03:51] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 3 ms to minimize.
[2025-05-31 08:03:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 204 ms
[2025-05-31 08:03:51] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 81 ms.
[2025-05-31 08:03:55] [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: Broken pipe ... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-31 08:03:56] [INFO ] [Real]Absence check using 9 positive place invariants in 18 ms returned sat
[2025-05-31 08:03:56] [INFO ] [Real]Absence check using state equation in 573 ms returned sat
[2025-05-31 08:03:57] [INFO ] Deduced a trap composed of 28 places in 410 ms of which 5 ms to minimize.
[2025-05-31 08:03:57] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:03:57] [INFO ] [Nat]Absence check using 9 positive place invariants in 30 ms returned sat
[2025-05-31 08:03:57] [INFO ] [Nat]Absence check using state equation in 374 ms returned sat
[2025-05-31 08:03:58] [INFO ] Deduced a trap composed of 28 places in 742 ms of which 6 ms to minimize.
[2025-05-31 08:03:59] [INFO ] Deduced a trap composed of 71 places in 715 ms of which 6 ms to minimize.
[2025-05-31 08:03:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1542 ms
[2025-05-31 08:03:59] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 72 ms.
Maximisation of solution failed !
Minimization took 13 ms.
[2025-05-31 08:04:02] [INFO ] [Real]Absence check using 9 positive place invariants in 35 ms returned sat
[2025-05-31 08:04:03] [INFO ] [Real]Absence check using state equation in 542 ms returned sat
[2025-05-31 08:04:04] [INFO ] Deduced a trap composed of 28 places in 987 ms of which 6 ms to minimize.
[2025-05-31 08:04:04] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:04:04] [INFO ] [Nat]Absence check using 9 positive place invariants in 16 ms returned sat
[2025-05-31 08:04:05] [INFO ] [Nat]Absence check using state equation in 477 ms returned sat
[2025-05-31 08:04:05] [INFO ] Deduced a trap composed of 28 places in 341 ms of which 5 ms to minimize.
[2025-05-31 08:04:05] [INFO ] Deduced a trap composed of 101 places in 345 ms of which 5 ms to minimize.
[2025-05-31 08:04:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 780 ms
[2025-05-31 08:04:06] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 69 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2025-05-31 08:04:09] [INFO ] [Real]Absence check using 9 positive place invariants in 20 ms returned sat
[2025-05-31 08:04:10] [INFO ] [Real]Absence check using state equation in 447 ms returned sat
[2025-05-31 08:04:10] [INFO ] Deduced a trap composed of 74 places in 608 ms of which 9 ms to minimize.
[2025-05-31 08:04:10] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:04:11] [INFO ] [Nat]Absence check using 9 positive place invariants in 20 ms returned sat
[2025-05-31 08:04:11] [INFO ] [Nat]Absence check using state equation in 451 ms returned sat
[2025-05-31 08:04:12] [INFO ] Deduced a trap composed of 74 places in 460 ms of which 7 ms to minimize.
[2025-05-31 08:04:12] [INFO ] Deduced a trap composed of 28 places in 405 ms of which 6 ms to minimize.
[2025-05-31 08:04:12] [INFO ] Deduced a trap composed of 98 places in 364 ms of which 6 ms to minimize.
[2025-05-31 08:04:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1389 ms
[2025-05-31 08:04:13] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 99 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2025-05-31 08:04:16] [INFO ] [Real]Absence check using 9 positive place invariants in 19 ms returned sat
[2025-05-31 08:04:16] [INFO ] [Real]Absence check using state equation in 427 ms returned sat
[2025-05-31 08:04:17] [INFO ] Deduced a trap composed of 28 places in 611 ms of which 7 ms to minimize.
[2025-05-31 08:04:17] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:04:17] [INFO ] [Nat]Absence check using 9 positive place invariants in 21 ms returned sat
[2025-05-31 08:04:17] [INFO ] [Nat]Absence check using state equation in 409 ms returned sat
[2025-05-31 08:04:18] [INFO ] Deduced a trap composed of 28 places in 406 ms of which 6 ms to minimize.
[2025-05-31 08:04:18] [INFO ] Deduced a trap composed of 128 places in 396 ms of which 6 ms to minimize.
[2025-05-31 08:04:19] [INFO ] Deduced a trap composed of 128 places in 396 ms of which 6 ms to minimize.
[2025-05-31 08:04:19] [INFO ] Deduced a trap composed of 98 places in 434 ms of which 6 ms to minimize.
[2025-05-31 08:04:19] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1824 ms
[2025-05-31 08:04:19] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 92 ms.
[2025-05-31 08:04:22] [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 5
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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-31 08:04:22] [INFO ] [Real]Absence check using 9 positive place invariants in 19 ms returned sat
[2025-05-31 08:04:23] [INFO ] [Real]Absence check using state equation in 435 ms returned sat
[2025-05-31 08:04:23] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:04:23] [INFO ] [Nat]Absence check using 9 positive place invariants in 20 ms returned sat
[2025-05-31 08:04:23] [INFO ] [Nat]Absence check using state equation in 443 ms returned sat
[2025-05-31 08:04:24] [INFO ] Deduced a trap composed of 28 places in 399 ms of which 7 ms to minimize.
[2025-05-31 08:04:24] [INFO ] Deduced a trap composed of 98 places in 382 ms of which 6 ms to minimize.
[2025-05-31 08:04:25] [INFO ] Deduced a trap composed of 131 places in 393 ms of which 9 ms to minimize.
[2025-05-31 08:04:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1348 ms
[2025-05-31 08:04:25] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 75 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2025-05-31 08:04:28] [INFO ] [Real]Absence check using 9 positive place invariants in 20 ms returned sat
[2025-05-31 08:04:28] [INFO ] [Real]Absence check using state equation in 409 ms returned sat
[2025-05-31 08:04:28] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:04:29] [INFO ] [Nat]Absence check using 9 positive place invariants in 19 ms returned sat
[2025-05-31 08:04:29] [INFO ] [Nat]Absence check using state equation in 391 ms returned sat
[2025-05-31 08:04:29] [INFO ] Deduced a trap composed of 28 places in 372 ms of which 6 ms to minimize.
[2025-05-31 08:04:30] [INFO ] Deduced a trap composed of 98 places in 387 ms of which 5 ms to minimize.
[2025-05-31 08:04:30] [INFO ] Deduced a trap composed of 131 places in 391 ms of which 6 ms to minimize.
[2025-05-31 08:04:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1304 ms
[2025-05-31 08:04:30] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 70 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2025-05-31 08:04:34] [INFO ] [Real]Absence check using 9 positive place invariants in 20 ms returned sat
[2025-05-31 08:04:34] [INFO ] [Real]Absence check using state equation in 361 ms returned sat
[2025-05-31 08:04:34] [INFO ] Deduced a trap composed of 32 places in 153 ms of which 3 ms to minimize.
[2025-05-31 08:04:34] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:04:34] [INFO ] [Nat]Absence check using 9 positive place invariants in 12 ms returned sat
[2025-05-31 08:04:35] [INFO ] [Nat]Absence check using state equation in 350 ms returned sat
[2025-05-31 08:04:35] [INFO ] Deduced a trap composed of 32 places in 246 ms of which 14 ms to minimize.
[2025-05-31 08:04:35] [INFO ] Deduced a trap composed of 155 places in 183 ms of which 3 ms to minimize.
[2025-05-31 08:04:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 547 ms
[2025-05-31 08:04:35] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 116 ms.
[2025-05-31 08:04:39] [INFO ] Added : 245 causal constraints over 49 iterations in 3984 ms. Result :unknown
[2025-05-31 08:04:39] [INFO ] [Real]Absence check using 9 positive place invariants in 20 ms returned sat
[2025-05-31 08:04:40] [INFO ] [Real]Absence check using state equation in 428 ms returned sat
[2025-05-31 08:04:40] [INFO ] Deduced a trap composed of 28 places in 477 ms of which 6 ms to minimize.
[2025-05-31 08:04:40] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:04:41] [INFO ] [Nat]Absence check using 9 positive place invariants in 20 ms returned sat
[2025-05-31 08:04:41] [INFO ] [Nat]Absence check using state equation in 432 ms returned sat
[2025-05-31 08:04:42] [INFO ] Deduced a trap composed of 28 places in 459 ms of which 6 ms to minimize.
[2025-05-31 08:04:42] [INFO ] Deduced a trap composed of 99 places in 416 ms of which 7 ms to minimize.
[2025-05-31 08:04:42] [INFO ] Deduced a trap composed of 131 places in 438 ms of which 7 ms to minimize.
[2025-05-31 08:04:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1477 ms
[2025-05-31 08:04:43] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 84 ms.
[2025-05-31 08:04:45] [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 9
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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-31 08:04:46] [INFO ] [Real]Absence check using 9 positive place invariants in 19 ms returned sat
[2025-05-31 08:04:46] [INFO ] [Real]Absence check using state equation in 453 ms returned sat
[2025-05-31 08:04:47] [INFO ] Deduced a trap composed of 28 places in 488 ms of which 9 ms to minimize.
[2025-05-31 08:04:47] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:04:47] [INFO ] [Nat]Absence check using 9 positive place invariants in 20 ms returned sat
[2025-05-31 08:04:47] [INFO ] [Nat]Absence check using state equation in 459 ms returned sat
[2025-05-31 08:04:48] [INFO ] Deduced a trap composed of 28 places in 462 ms of which 7 ms to minimize.
[2025-05-31 08:04:48] [INFO ] Deduced a trap composed of 64 places in 463 ms of which 7 ms to minimize.
[2025-05-31 08:04:49] [INFO ] Deduced a trap composed of 141 places in 466 ms of which 7 ms to minimize.
[2025-05-31 08:04:49] [INFO ] Deduced a trap composed of 128 places in 452 ms of which 6 ms to minimize.
[2025-05-31 08:04:50] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2108 ms
[2025-05-31 08:04:50] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 89 ms.
[2025-05-31 08:04:52] [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 10
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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-31 08:04:52] [INFO ] [Real]Absence check using 9 positive place invariants in 18 ms returned sat
[2025-05-31 08:04:52] [INFO ] [Real]Absence check using state equation in 446 ms returned sat
[2025-05-31 08:04:53] [INFO ] Deduced a trap composed of 28 places in 457 ms of which 7 ms to minimize.
[2025-05-31 08:04:53] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:04:53] [INFO ] [Nat]Absence check using 9 positive place invariants in 20 ms returned sat
[2025-05-31 08:04:54] [INFO ] [Nat]Absence check using state equation in 422 ms returned sat
[2025-05-31 08:04:54] [INFO ] Deduced a trap composed of 28 places in 435 ms of which 6 ms to minimize.
[2025-05-31 08:04:55] [INFO ] Deduced a trap composed of 102 places in 446 ms of which 6 ms to minimize.
[2025-05-31 08:04:55] [INFO ] Deduced a trap composed of 131 places in 445 ms of which 7 ms to minimize.
[2025-05-31 08:04:56] [INFO ] Deduced a trap composed of 142 places in 408 ms of which 10 ms to minimize.
[2025-05-31 08:04:56] [INFO ] Deduced a trap composed of 131 places in 427 ms of which 6 ms to minimize.
[2025-05-31 08:04:57] [INFO ] Deduced a trap composed of 68 places in 480 ms of which 6 ms to minimize.
[2025-05-31 08:04:57] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2969 ms
[2025-05-31 08:04:57] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 86 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2025-05-31 08:04:58] [INFO ] [Real]Absence check using 9 positive place invariants in 19 ms returned sat
[2025-05-31 08:04:59] [INFO ] [Real]Absence check using state equation in 472 ms returned sat
[2025-05-31 08:04:59] [INFO ] Deduced a trap composed of 64 places in 448 ms of which 7 ms to minimize.
[2025-05-31 08:04:59] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:05:00] [INFO ] [Nat]Absence check using 9 positive place invariants in 20 ms returned sat
[2025-05-31 08:05:00] [INFO ] [Nat]Absence check using state equation in 443 ms returned sat
[2025-05-31 08:05:00] [INFO ] Deduced a trap composed of 64 places in 406 ms of which 6 ms to minimize.
[2025-05-31 08:05:01] [INFO ] Deduced a trap composed of 28 places in 399 ms of which 6 ms to minimize.
[2025-05-31 08:05:01] [INFO ] Deduced a trap composed of 98 places in 403 ms of which 6 ms to minimize.
[2025-05-31 08:05:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1365 ms
[2025-05-31 08:05:01] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 74 ms.
[2025-05-31 08:05:04] [INFO ] Added : 210 causal constraints over 42 iterations in 3017 ms. Result :unknown
Current structural bounds on expressions (after SMT) : Max Seen:[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]
FORMULA FireWire-PT-18-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-18-UpperBounds-06 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 437 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 437/437 places, 707/707 transitions.
Graph (trivial) has 313 edges and 437 vertex of which 12 / 437 are part of one of the 3 SCC in 8 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 1269 edges and 428 vertex of which 418 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.5 ms
Discarding 10 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 82 rules applied. Total rules applied 84 place count 418 transition count 612
Reduce places removed 80 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 82 rules applied. Total rules applied 166 place count 338 transition count 610
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 169 place count 337 transition count 608
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 171 place count 335 transition count 608
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 171 place count 335 transition count 598
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 191 place count 325 transition count 598
Discarding 59 places :
Symmetric choice reduction at 4 with 59 rule applications. Total rules 250 place count 266 transition count 536
Iterating global reduction 4 with 59 rules applied. Total rules applied 309 place count 266 transition count 536
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 311 place count 266 transition count 534
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 311 place count 266 transition count 530
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 319 place count 262 transition count 530
Discarding 18 places :
Symmetric choice reduction at 5 with 18 rule applications. Total rules 337 place count 244 transition count 450
Iterating global reduction 5 with 18 rules applied. Total rules applied 355 place count 244 transition count 450
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 357 place count 244 transition count 448
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 361 place count 240 transition count 441
Iterating global reduction 6 with 4 rules applied. Total rules applied 365 place count 240 transition count 441
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 6 with 2 rules applied. Total rules applied 367 place count 240 transition count 439
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 368 place count 239 transition count 439
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 369 place count 238 transition count 436
Iterating global reduction 8 with 1 rules applied. Total rules applied 370 place count 238 transition count 436
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 371 place count 237 transition count 434
Iterating global reduction 8 with 1 rules applied. Total rules applied 372 place count 237 transition count 434
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 373 place count 236 transition count 431
Iterating global reduction 8 with 1 rules applied. Total rules applied 374 place count 236 transition count 431
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 375 place count 235 transition count 429
Iterating global reduction 8 with 1 rules applied. Total rules applied 376 place count 235 transition count 429
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 377 place count 234 transition count 426
Iterating global reduction 8 with 1 rules applied. Total rules applied 378 place count 234 transition count 426
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 379 place count 233 transition count 424
Iterating global reduction 8 with 1 rules applied. Total rules applied 380 place count 233 transition count 424
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 381 place count 232 transition count 421
Iterating global reduction 8 with 1 rules applied. Total rules applied 382 place count 232 transition count 421
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 383 place count 231 transition count 419
Iterating global reduction 8 with 1 rules applied. Total rules applied 384 place count 231 transition count 419
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 385 place count 230 transition count 416
Iterating global reduction 8 with 1 rules applied. Total rules applied 386 place count 230 transition count 416
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 387 place count 229 transition count 414
Iterating global reduction 8 with 1 rules applied. Total rules applied 388 place count 229 transition count 414
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 389 place count 228 transition count 412
Iterating global reduction 8 with 1 rules applied. Total rules applied 390 place count 228 transition count 412
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 391 place count 227 transition count 410
Iterating global reduction 8 with 1 rules applied. Total rules applied 392 place count 227 transition count 410
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 8 with 74 rules applied. Total rules applied 466 place count 190 transition count 373
Performed 28 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 8 with 56 rules applied. Total rules applied 522 place count 162 transition count 435
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 524 place count 162 transition count 433
Free-agglomeration rule applied 18 times.
Iterating global reduction 8 with 18 rules applied. Total rules applied 542 place count 162 transition count 415
Reduce places removed 18 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 23 rules applied. Total rules applied 565 place count 144 transition count 410
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 569 place count 140 transition count 406
Iterating global reduction 9 with 4 rules applied. Total rules applied 573 place count 140 transition count 406
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 579 place count 140 transition count 400
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 10 with 17 rules applied. Total rules applied 596 place count 140 transition count 383
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 598 place count 140 transition count 383
Applied a total of 598 rules in 749 ms. Remains 140 /437 variables (removed 297) and now considering 383/707 (removed 324) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 779 ms. Remains : 140/437 places, 383/707 transitions.
[2025-05-31 08:05:06] [INFO ] Flow matrix only has 377 transitions (discarded 6 similar events)
// Phase 1: matrix 377 rows 140 cols
[2025-05-31 08:05:06] [INFO ] Computed 7 invariants in 3 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 (49978 resets) in 2229 ms. (448 steps per ms)
FORMULA FireWire-PT-18-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-18-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-18-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-18-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-18-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-18-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 5000003 steps (62049 resets) in 3294 ms. (1517 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2025-05-31 08:05:12] [INFO ] Flow matrix only has 377 transitions (discarded 6 similar events)
[2025-05-31 08:05:12] [INFO ] Invariant cache hit.
[2025-05-31 08:05:12] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-05-31 08:05:12] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2025-05-31 08:05:12] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:05:12] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-05-31 08:05:12] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2025-05-31 08:05:12] [INFO ] State equation strengthened by 66 read => feed constraints.
[2025-05-31 08:05:12] [INFO ] [Nat]Added 66 Read/Feed constraints in 56 ms returned sat
[2025-05-31 08:05:12] [INFO ] Deduced a trap composed of 77 places in 137 ms of which 2 ms to minimize.
[2025-05-31 08:05:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2025-05-31 08:05:12] [INFO ] Computed and/alt/rep : 148/734/148 causal constraints (skipped 225 transitions) in 43 ms.
[2025-05-31 08:05:13] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 3 ms to minimize.
[2025-05-31 08:05:13] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 1 ms to minimize.
[2025-05-31 08:05:13] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 3 ms to minimize.
[2025-05-31 08:05:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 528 ms
[2025-05-31 08:05:13] [INFO ] Added : 30 causal constraints over 8 iterations in 847 ms. Result :sat
Minimization took 353 ms.
[2025-05-31 08:05:13] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-31 08:05:14] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2025-05-31 08:05:14] [INFO ] [Real]Added 66 Read/Feed constraints in 44 ms returned sat
[2025-05-31 08:05:14] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:05:14] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-31 08:05:14] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2025-05-31 08:05:14] [INFO ] [Nat]Added 66 Read/Feed constraints in 88 ms returned sat
[2025-05-31 08:05:14] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 2 ms to minimize.
[2025-05-31 08:05:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2025-05-31 08:05:14] [INFO ] Computed and/alt/rep : 148/734/148 causal constraints (skipped 225 transitions) in 67 ms.
[2025-05-31 08:05:15] [INFO ] Deduced a trap composed of 36 places in 130 ms of which 2 ms to minimize.
[2025-05-31 08:05:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 194 ms
[2025-05-31 08:05:15] [INFO ] Added : 20 causal constraints over 6 iterations in 755 ms. Result :sat
Minimization took 400 ms.
[2025-05-31 08:05:15] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-05-31 08:05:16] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2025-05-31 08:05:16] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:05:16] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-05-31 08:05:16] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2025-05-31 08:05:16] [INFO ] [Nat]Added 66 Read/Feed constraints in 55 ms returned sat
[2025-05-31 08:05:16] [INFO ] Computed and/alt/rep : 148/734/148 causal constraints (skipped 225 transitions) in 103 ms.
[2025-05-31 08:05:17] [INFO ] Deduced a trap composed of 40 places in 358 ms of which 46 ms to minimize.
[2025-05-31 08:05:17] [INFO ] Deduced a trap composed of 21 places in 214 ms of which 2 ms to minimize.
[2025-05-31 08:05:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 718 ms
[2025-05-31 08:05:17] [INFO ] Added : 16 causal constraints over 6 iterations in 1285 ms. Result :sat
Minimization took 361 ms.
[2025-05-31 08:05:18] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-05-31 08:05:18] [INFO ] [Real]Absence check using state equation in 208 ms returned sat
[2025-05-31 08:05:18] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:05:18] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-31 08:05:18] [INFO ] [Nat]Absence check using state equation in 242 ms returned sat
[2025-05-31 08:05:18] [INFO ] [Nat]Added 66 Read/Feed constraints in 54 ms returned sat
[2025-05-31 08:05:18] [INFO ] Computed and/alt/rep : 148/734/148 causal constraints (skipped 225 transitions) in 81 ms.
[2025-05-31 08:05:19] [INFO ] Deduced a trap composed of 40 places in 229 ms of which 3 ms to minimize.
[2025-05-31 08:05:19] [INFO ] Deduced a trap composed of 22 places in 241 ms of which 26 ms to minimize.
[2025-05-31 08:05:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 595 ms
[2025-05-31 08:05:19] [INFO ] Added : 39 causal constraints over 8 iterations in 1111 ms. Result :sat
Minimization took 274 ms.
[2025-05-31 08:05:20] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-05-31 08:05:20] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2025-05-31 08:05:20] [INFO ] [Real]Added 66 Read/Feed constraints in 36 ms returned sat
[2025-05-31 08:05:20] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:05:20] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-05-31 08:05:20] [INFO ] [Nat]Absence check using state equation in 169 ms returned sat
[2025-05-31 08:05:20] [INFO ] [Nat]Added 66 Read/Feed constraints in 50 ms returned sat
[2025-05-31 08:05:20] [INFO ] Computed and/alt/rep : 148/734/148 causal constraints (skipped 225 transitions) in 48 ms.
[2025-05-31 08:05:21] [INFO ] Deduced a trap composed of 15 places in 198 ms of which 3 ms to minimize.
[2025-05-31 08:05:21] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 1 ms to minimize.
[2025-05-31 08:05:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 385 ms
[2025-05-31 08:05:21] [INFO ] Added : 29 causal constraints over 8 iterations in 786 ms. Result :sat
Minimization took 393 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 383/383 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 140 transition count 381
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 138 transition count 381
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 137 transition count 379
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 137 transition count 379
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 136 transition count 376
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 136 transition count 376
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 11 place count 136 transition count 373
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 15 place count 134 transition count 371
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 133 transition count 372
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 19 place count 133 transition count 370
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 20 place count 133 transition count 369
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 21 place count 133 transition count 369
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 22 place count 133 transition count 368
Applied a total of 22 rules in 88 ms. Remains 133 /140 variables (removed 7) and now considering 368/383 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 133/140 places, 368/383 transitions.
[2025-05-31 08:05:22] [INFO ] Flow matrix only has 362 transitions (discarded 6 similar events)
// Phase 1: matrix 362 rows 133 cols
[2025-05-31 08:05:22] [INFO ] Computed 7 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (49837 resets) in 1926 ms. (518 steps per ms)
BEST_FIRST walk for 5000005 steps (62199 resets) in 2639 ms. (1893 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2025-05-31 08:05:26] [INFO ] Flow matrix only has 362 transitions (discarded 6 similar events)
[2025-05-31 08:05:26] [INFO ] Invariant cache hit.
[2025-05-31 08:05:26] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-05-31 08:05:26] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2025-05-31 08:05:26] [INFO ] State equation strengthened by 64 read => feed constraints.
[2025-05-31 08:05:26] [INFO ] [Real]Added 64 Read/Feed constraints in 21 ms returned sat
[2025-05-31 08:05:26] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:05:26] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-31 08:05:27] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2025-05-31 08:05:27] [INFO ] [Nat]Added 64 Read/Feed constraints in 43 ms returned sat
[2025-05-31 08:05:27] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 2 ms to minimize.
[2025-05-31 08:05:27] [INFO ] Deduced a trap composed of 71 places in 153 ms of which 3 ms to minimize.
[2025-05-31 08:05:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 329 ms
[2025-05-31 08:05:27] [INFO ] Computed and/alt/rep : 157/856/157 causal constraints (skipped 201 transitions) in 59 ms.
[2025-05-31 08:05:28] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 1 ms to minimize.
[2025-05-31 08:05:28] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 1 ms to minimize.
[2025-05-31 08:05:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 230 ms
[2025-05-31 08:05:28] [INFO ] Added : 67 causal constraints over 18 iterations in 977 ms. Result :sat
Minimization took 339 ms.
[2025-05-31 08:05:28] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-31 08:05:28] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2025-05-31 08:05:28] [INFO ] [Real]Added 64 Read/Feed constraints in 43 ms returned sat
[2025-05-31 08:05:29] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:05:29] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2025-05-31 08:05:29] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2025-05-31 08:05:29] [INFO ] [Nat]Added 64 Read/Feed constraints in 45 ms returned sat
[2025-05-31 08:05:29] [INFO ] Computed and/alt/rep : 157/856/157 causal constraints (skipped 201 transitions) in 33 ms.
[2025-05-31 08:05:29] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 2 ms to minimize.
[2025-05-31 08:05:29] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 1 ms to minimize.
[2025-05-31 08:05:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 326 ms
[2025-05-31 08:05:29] [INFO ] Added : 33 causal constraints over 7 iterations in 604 ms. Result :sat
Minimization took 246 ms.
[2025-05-31 08:05:30] [INFO ] [Real]Absence check using 7 positive place invariants in 10 ms returned sat
[2025-05-31 08:05:30] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2025-05-31 08:05:30] [INFO ] [Real]Added 64 Read/Feed constraints in 25 ms returned sat
[2025-05-31 08:05:30] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:05:30] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-31 08:05:30] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2025-05-31 08:05:30] [INFO ] [Nat]Added 64 Read/Feed constraints in 39 ms returned sat
[2025-05-31 08:05:30] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 2 ms to minimize.
[2025-05-31 08:05:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 158 ms
[2025-05-31 08:05:30] [INFO ] Computed and/alt/rep : 157/856/157 causal constraints (skipped 201 transitions) in 37 ms.
[2025-05-31 08:05:31] [INFO ] Deduced a trap composed of 35 places in 130 ms of which 2 ms to minimize.
[2025-05-31 08:05:31] [INFO ] Deduced a trap composed of 43 places in 130 ms of which 2 ms to minimize.
[2025-05-31 08:05:31] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 2 ms to minimize.
[2025-05-31 08:05:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 508 ms
[2025-05-31 08:05:31] [INFO ] Added : 65 causal constraints over 14 iterations in 1003 ms. Result :sat
Minimization took 269 ms.
[2025-05-31 08:05:32] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-31 08:05:32] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2025-05-31 08:05:32] [INFO ] [Real]Added 64 Read/Feed constraints in 25 ms returned sat
[2025-05-31 08:05:32] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:05:32] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-31 08:05:32] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2025-05-31 08:05:32] [INFO ] [Nat]Added 64 Read/Feed constraints in 33 ms returned sat
[2025-05-31 08:05:32] [INFO ] Computed and/alt/rep : 157/856/157 causal constraints (skipped 201 transitions) in 32 ms.
[2025-05-31 08:05:32] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
[2025-05-31 08:05:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2025-05-31 08:05:32] [INFO ] Added : 43 causal constraints over 9 iterations in 431 ms. Result :sat
Minimization took 268 ms.
[2025-05-31 08:05:33] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-31 08:05:33] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2025-05-31 08:05:33] [INFO ] [Real]Added 64 Read/Feed constraints in 48 ms returned sat
[2025-05-31 08:05:33] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:05:33] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-05-31 08:05:33] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2025-05-31 08:05:33] [INFO ] [Nat]Added 64 Read/Feed constraints in 33 ms returned sat
[2025-05-31 08:05:33] [INFO ] Computed and/alt/rep : 157/856/157 causal constraints (skipped 201 transitions) in 31 ms.
[2025-05-31 08:05:34] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 2 ms to minimize.
[2025-05-31 08:05:34] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 1 ms to minimize.
[2025-05-31 08:05:34] [INFO ] Deduced a trap composed of 43 places in 73 ms of which 1 ms to minimize.
[2025-05-31 08:05:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 464 ms
[2025-05-31 08:05:34] [INFO ] Deduced a trap composed of 44 places in 148 ms of which 2 ms to minimize.
[2025-05-31 08:05:34] [INFO ] Deduced a trap composed of 43 places in 114 ms of which 2 ms to minimize.
[2025-05-31 08:05:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 357 ms
[2025-05-31 08:05:34] [INFO ] Added : 35 causal constraints over 10 iterations in 1180 ms. Result :sat
Minimization took 261 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 368/368 transitions.
Applied a total of 0 rules in 9 ms. Remains 133 /133 variables (removed 0) and now considering 368/368 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 133/133 places, 368/368 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 368/368 transitions.
Applied a total of 0 rules in 8 ms. Remains 133 /133 variables (removed 0) and now considering 368/368 (removed 0) transitions.
[2025-05-31 08:05:35] [INFO ] Flow matrix only has 362 transitions (discarded 6 similar events)
[2025-05-31 08:05:35] [INFO ] Invariant cache hit.
[2025-05-31 08:05:35] [INFO ] Implicit Places using invariants in 284 ms returned []
[2025-05-31 08:05:35] [INFO ] Flow matrix only has 362 transitions (discarded 6 similar events)
[2025-05-31 08:05:35] [INFO ] Invariant cache hit.
[2025-05-31 08:05:35] [INFO ] State equation strengthened by 64 read => feed constraints.
[2025-05-31 08:05:36] [INFO ] Implicit Places using invariants and state equation in 473 ms returned []
Implicit Place search using SMT with State Equation took 779 ms to find 0 implicit places.
[2025-05-31 08:05:36] [INFO ] Redundant transitions in 27 ms returned []
Running 364 sub problems to find dead transitions.
[2025-05-31 08:05:36] [INFO ] Flow matrix only has 362 transitions (discarded 6 similar events)
[2025-05-31 08:05:36] [INFO ] Invariant cache hit.
[2025-05-31 08:05:36] [INFO ] State equation strengthened by 64 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2025-05-31 08:05:40] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 2 ms to minimize.
[2025-05-31 08:05:40] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2025-05-31 08:05:40] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2025-05-31 08:05:40] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 3 ms to minimize.
[2025-05-31 08:05:40] [INFO ] Deduced a trap composed of 22 places in 130 ms of which 2 ms to minimize.
[2025-05-31 08:05:40] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 2 ms to minimize.
[2025-05-31 08:05:41] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
[2025-05-31 08:05:41] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 1 ms to minimize.
[2025-05-31 08:05:42] [INFO ] Deduced a trap composed of 99 places in 111 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (OVERLAPS) 362/495 variables, 133/149 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/495 variables, 64/213 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/495 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 7 (OVERLAPS) 0/495 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 364 unsolved
No progress, stopping.
After SMT solving in domain Real declared 495/495 variables, and 213 constraints, problems are : Problem set: 0 solved, 364 unsolved in 20607 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 133/133 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 364 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (OVERLAPS) 362/495 variables, 133/149 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/495 variables, 64/213 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/495 variables, 364/577 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/495 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 364 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 495/495 variables, and 577 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 133/133 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 9/9 constraints]
After SMT, in 51414ms problems are : Problem set: 0 solved, 364 unsolved
Search for dead transitions found 0 dead transitions in 51441ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52292 ms. Remains : 133/133 places, 368/368 transitions.
RANDOM walk for 40000 steps (1985 resets) in 2657 ms. (15 steps per ms) remains 10/10 properties
[2025-05-31 08:06:28] [INFO ] Flatten gal took : 281 ms
[2025-05-31 08:06:28] [INFO ] Flatten gal took : 92 ms
BEST_FIRST walk for 40004 steps (489 resets) in 372 ms. (107 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (479 resets) in 175 ms. (227 steps per ms) remains 10/10 properties
[2025-05-31 08:06:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7102908016230414855.gal : 26 ms
[2025-05-31 08:06:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14254395394243407181.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7102908016230414855.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14254395394243407181.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40003 steps (503 resets) in 204 ms. (195 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (499 resets) in 185 ms. (215 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (485 resets) in 169 ms. (235 steps per ms) remains 10/10 properties
Loading property file /tmp/ReachabilityCardinality14254395394243407181.prop.
BEST_FIRST walk for 40001 steps (481 resets) in 189 ms. (210 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (488 resets) in 167 ms. (238 steps per ms) remains 10/10 properties
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :7 after 8
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :8 after 10
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :10 after 11
BEST_FIRST walk for 40001 steps (496 resets) in 160 ms. (248 steps per ms) remains 10/10 properties
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :11 after 99
BEST_FIRST walk for 40003 steps (500 resets) in 87 ms. (454 steps per ms) remains 10/10 properties
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :99 after 235
BEST_FIRST walk for 40003 steps (482 resets) in 100 ms. (396 steps per ms) remains 10/10 properties
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :235 after 803
Invariant property MIN4 does not hold.
Reachability property MAX4 is true.
Invariant property MIN1 does not hold.
Reachability property MAX1 is true.
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :803 after 1710
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :1710 after 4633
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :4633 after 44204
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :44204 after 81610
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :81610 after 231125
Interrupted probabilistic random walk after 358543 steps, run timeout after 3001 ms. (steps per millisecond=119 ) properties seen :4 out of 10
Probabilistic random walk after 358543 steps, saw 97639 distinct states, run finished after 3009 ms. (steps per millisecond=119 ) properties seen :4
[2025-05-31 08:06:32] [INFO ] Flow matrix only has 362 transitions (discarded 6 similar events)
[2025-05-31 08:06:32] [INFO ] Invariant cache hit.
[2025-05-31 08:06:32] [INFO ] State equation strengthened by 64 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 53/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 69/125 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Invariant property MIN3 does not hold.
Reachability property MAX3 is true.
Invariant property MIN2 does not hold.
Reachability property MAX2 is true.
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 4097 fixpoint passes
[2025-05-31 08:06:32] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 2 ms to minimize.
After SMT solving in domain Real declared 125/495 variables, and 8 constraints, problems are : Problem set: 6 solved, 0 unsolved in 317 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/133 constraints, ReadFeed: 0/64 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 338ms problems are : Problem set: 6 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA FireWire-PT-18-UpperBounds-12 1 TECHNIQUES REACHABILITY_MAX
FORMULA FireWire-PT-18-UpperBounds-07 1 TECHNIQUES REACHABILITY_MAX
FORMULA FireWire-PT-18-UpperBounds-04 1 TECHNIQUES REACHABILITY_MAX
FORMULA FireWire-PT-18-UpperBounds-02 1 TECHNIQUES REACHABILITY_MAX
FORMULA FireWire-PT-18-UpperBounds-01 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 5 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 172827 ms.
BK_STOP 1748678792725
--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-18"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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 gold2024"
echo " Input is FireWire-PT-18, 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 r097-smll-174860111800048"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-18.tgz
mv FireWire-PT-18 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 ;