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-174860111800047.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-17, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r097-smll-174860111800047
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 7.0K 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 4.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K 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 26K 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 16K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K 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 153K 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-17-UpperBounds-00
FORMULA_NAME FireWire-PT-17-UpperBounds-01
FORMULA_NAME FireWire-PT-17-UpperBounds-02
FORMULA_NAME FireWire-PT-17-UpperBounds-03
FORMULA_NAME FireWire-PT-17-UpperBounds-04
FORMULA_NAME FireWire-PT-17-UpperBounds-05
FORMULA_NAME FireWire-PT-17-UpperBounds-06
FORMULA_NAME FireWire-PT-17-UpperBounds-07
FORMULA_NAME FireWire-PT-17-UpperBounds-08
FORMULA_NAME FireWire-PT-17-UpperBounds-09
FORMULA_NAME FireWire-PT-17-UpperBounds-10
FORMULA_NAME FireWire-PT-17-UpperBounds-11
FORMULA_NAME FireWire-PT-17-UpperBounds-12
FORMULA_NAME FireWire-PT-17-UpperBounds-13
FORMULA_NAME FireWire-PT-17-UpperBounds-14
FORMULA_NAME FireWire-PT-17-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748678483356

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-17
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-31 08:01:25] [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:01:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 08:01:26] [INFO ] Load time of PNML (sax parser for PT used): 251 ms
[2025-05-31 08:01:26] [INFO ] Transformed 428 places.
[2025-05-31 08:01:26] [INFO ] Transformed 656 transitions.
[2025-05-31 08:01:26] [INFO ] Found NUPN structural information;
[2025-05-31 08:01:26] [INFO ] Parsed PT model containing 428 places and 656 transitions and 1904 arcs in 815 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 19 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 656 rows 428 cols
[2025-05-31 08:01:27] [INFO ] Computed 9 invariants in 54 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 82 ms. (120 steps per ms)
FORMULA FireWire-PT-17-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-17-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-17-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-17-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-17-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-17-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-17-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90000 steps (32 resets) in 346 ms. (259 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-31 08:01:27] [INFO ] Invariant cache hit.
[2025-05-31 08:01:28] [INFO ] [Real]Absence check using 9 positive place invariants in 25 ms returned sat
[2025-05-31 08:01:28] [INFO ] [Real]Absence check using state equation in 756 ms returned sat
[2025-05-31 08:01:29] [INFO ] Deduced a trap composed of 17 places in 323 ms of which 25 ms to minimize.
[2025-05-31 08:01:29] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:01:29] [INFO ] [Nat]Absence check using 9 positive place invariants in 34 ms returned sat
[2025-05-31 08:01:30] [INFO ] [Nat]Absence check using state equation in 795 ms returned sat
[2025-05-31 08:01:31] [INFO ] Deduced a trap composed of 17 places in 317 ms of which 7 ms to minimize.
[2025-05-31 08:01:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 462 ms
[2025-05-31 08:01:31] [INFO ] Computed and/alt/rep : 585/1578/585 causal constraints (skipped 70 transitions) in 122 ms.
[2025-05-31 08:01:34] [INFO ] Added : 240 causal constraints over 48 iterations in 3457 ms. Result :unknown
[2025-05-31 08:01:34] [INFO ] [Real]Absence check using 9 positive place invariants in 20 ms returned sat
[2025-05-31 08:01:35] [INFO ] [Real]Absence check using state equation in 449 ms returned sat
[2025-05-31 08:01:35] [INFO ] Deduced a trap composed of 111 places in 419 ms of which 7 ms to minimize.
[2025-05-31 08:01:35] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:01:36] [INFO ] [Nat]Absence check using 9 positive place invariants in 21 ms returned sat
[2025-05-31 08:01:36] [INFO ] [Nat]Absence check using state equation in 408 ms returned sat
[2025-05-31 08:01:36] [INFO ] Deduced a trap composed of 111 places in 470 ms of which 6 ms to minimize.
[2025-05-31 08:01:37] [INFO ] Deduced a trap composed of 179 places in 476 ms of which 7 ms to minimize.
[2025-05-31 08:01:37] [INFO ] Deduced a trap composed of 171 places in 459 ms of which 7 ms to minimize.
[2025-05-31 08:01:38] [INFO ] Deduced a trap composed of 91 places in 406 ms of which 6 ms to minimize.
[2025-05-31 08:01:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2076 ms
[2025-05-31 08:01:38] [INFO ] Computed and/alt/rep : 585/1578/585 causal constraints (skipped 70 transitions) in 85 ms.
[2025-05-31 08:01:40] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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:01:41] [INFO ] [Real]Absence check using 9 positive place invariants in 20 ms returned sat
[2025-05-31 08:01:41] [INFO ] [Real]Absence check using state equation in 392 ms returned sat
[2025-05-31 08:01:41] [INFO ] Deduced a trap composed of 111 places in 368 ms of which 6 ms to minimize.
[2025-05-31 08:01:41] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:01:42] [INFO ] [Nat]Absence check using 9 positive place invariants in 18 ms returned sat
[2025-05-31 08:01:42] [INFO ] [Nat]Absence check using state equation in 344 ms returned sat
[2025-05-31 08:01:42] [INFO ] Deduced a trap composed of 111 places in 263 ms of which 4 ms to minimize.
[2025-05-31 08:01:43] [INFO ] Deduced a trap composed of 91 places in 338 ms of which 8 ms to minimize.
[2025-05-31 08:01:43] [INFO ] Deduced a trap composed of 163 places in 430 ms of which 6 ms to minimize.
[2025-05-31 08:01:44] [INFO ] Deduced a trap composed of 145 places in 435 ms of which 6 ms to minimize.
[2025-05-31 08:01:44] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1688 ms
[2025-05-31 08:01:44] [INFO ] Computed and/alt/rep : 585/1578/585 causal constraints (skipped 70 transitions) in 92 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2025-05-31 08:01:47] [INFO ] [Real]Absence check using 9 positive place invariants in 24 ms returned sat
[2025-05-31 08:01:47] [INFO ] [Real]Absence check using state equation in 386 ms returned sat
[2025-05-31 08:01:48] [INFO ] Deduced a trap composed of 79 places in 441 ms of which 7 ms to minimize.
[2025-05-31 08:01:48] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:01:48] [INFO ] [Nat]Absence check using 9 positive place invariants in 21 ms returned sat
[2025-05-31 08:01:48] [INFO ] [Nat]Absence check using state equation in 345 ms returned sat
[2025-05-31 08:01:49] [INFO ] Deduced a trap composed of 79 places in 398 ms of which 6 ms to minimize.
[2025-05-31 08:01:49] [INFO ] Deduced a trap composed of 17 places in 369 ms of which 5 ms to minimize.
[2025-05-31 08:01:50] [INFO ] Deduced a trap composed of 114 places in 330 ms of which 5 ms to minimize.
[2025-05-31 08:01:50] [INFO ] Deduced a trap composed of 103 places in 326 ms of which 5 ms to minimize.
[2025-05-31 08:01:50] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1594 ms
[2025-05-31 08:01:50] [INFO ] Computed and/alt/rep : 585/1578/585 causal constraints (skipped 70 transitions) in 77 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2025-05-31 08:01:53] [INFO ] [Real]Absence check using 9 positive place invariants in 20 ms returned sat
[2025-05-31 08:01:53] [INFO ] [Real]Absence check using state equation in 360 ms returned sat
[2025-05-31 08:01:54] [INFO ] Deduced a trap composed of 17 places in 161 ms of which 4 ms to minimize.
[2025-05-31 08:01:54] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:01:54] [INFO ] [Nat]Absence check using 9 positive place invariants in 19 ms returned sat
[2025-05-31 08:01:54] [INFO ] [Nat]Absence check using state equation in 367 ms returned sat
[2025-05-31 08:01:54] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 3 ms to minimize.
[2025-05-31 08:01:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 209 ms
[2025-05-31 08:01:54] [INFO ] Computed and/alt/rep : 585/1578/585 causal constraints (skipped 70 transitions) in 70 ms.
[2025-05-31 08:01:59] [INFO ] Added : 300 causal constraints over 60 iterations in 4258 ms. Result :unknown
[2025-05-31 08:01:59] [INFO ] [Real]Absence check using 9 positive place invariants in 21 ms returned sat
[2025-05-31 08:01:59] [INFO ] [Real]Absence check using state equation in 423 ms returned sat
[2025-05-31 08:02:00] [INFO ] Deduced a trap composed of 17 places in 443 ms of which 12 ms to minimize.
[2025-05-31 08:02:00] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:02:00] [INFO ] [Nat]Absence check using 9 positive place invariants in 23 ms returned sat
[2025-05-31 08:02:00] [INFO ] [Nat]Absence check using state equation in 423 ms returned sat
[2025-05-31 08:02:01] [INFO ] Deduced a trap composed of 17 places in 413 ms of which 6 ms to minimize.
[2025-05-31 08:02:01] [INFO ] Deduced a trap composed of 105 places in 408 ms of which 7 ms to minimize.
[2025-05-31 08:02:02] [INFO ] Deduced a trap composed of 108 places in 408 ms of which 6 ms to minimize.
[2025-05-31 08:02:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1377 ms
[2025-05-31 08:02:02] [INFO ] Computed and/alt/rep : 585/1578/585 causal constraints (skipped 70 transitions) in 80 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2025-05-31 08:02:05] [INFO ] [Real]Absence check using 9 positive place invariants in 20 ms returned sat
[2025-05-31 08:02:05] [INFO ] [Real]Absence check using state equation in 392 ms returned sat
[2025-05-31 08:02:06] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 2 ms to minimize.
[2025-05-31 08:02:06] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:02:06] [INFO ] [Nat]Absence check using 9 positive place invariants in 20 ms returned sat
[2025-05-31 08:02:06] [INFO ] [Nat]Absence check using state equation in 373 ms returned sat
[2025-05-31 08:02:06] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 2 ms to minimize.
[2025-05-31 08:02:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2025-05-31 08:02:06] [INFO ] Computed and/alt/rep : 585/1578/585 causal constraints (skipped 70 transitions) in 77 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2025-05-31 08:02:11] [INFO ] [Real]Absence check using 9 positive place invariants in 21 ms returned sat
[2025-05-31 08:02:11] [INFO ] [Real]Absence check using state equation in 393 ms returned sat
[2025-05-31 08:02:12] [INFO ] Deduced a trap composed of 17 places in 229 ms of which 5 ms to minimize.
[2025-05-31 08:02:12] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:02:12] [INFO ] [Nat]Absence check using 9 positive place invariants in 20 ms returned sat
[2025-05-31 08:02:12] [INFO ] [Nat]Absence check using state equation in 385 ms returned sat
[2025-05-31 08:02:12] [INFO ] Deduced a trap composed of 17 places in 226 ms of which 5 ms to minimize.
[2025-05-31 08:02:13] [INFO ] Deduced a trap composed of 108 places in 170 ms of which 4 ms to minimize.
[2025-05-31 08:02:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 507 ms
[2025-05-31 08:02:13] [INFO ] Computed and/alt/rep : 585/1578/585 causal constraints (skipped 70 transitions) in 78 ms.
[2025-05-31 08:02:17] [INFO ] Added : 280 causal constraints over 56 iterations in 3919 ms. Result :unknown
[2025-05-31 08:02:17] [INFO ] [Real]Absence check using 9 positive place invariants in 20 ms returned sat
[2025-05-31 08:02:17] [INFO ] [Real]Absence check using state equation in 420 ms returned sat
[2025-05-31 08:02:18] [INFO ] Deduced a trap composed of 79 places in 373 ms of which 5 ms to minimize.
[2025-05-31 08:02:18] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:02:18] [INFO ] [Nat]Absence check using 9 positive place invariants in 18 ms returned sat
[2025-05-31 08:02:18] [INFO ] [Nat]Absence check using state equation in 358 ms returned sat
[2025-05-31 08:02:19] [INFO ] Deduced a trap composed of 79 places in 335 ms of which 5 ms to minimize.
[2025-05-31 08:02:19] [INFO ] Deduced a trap composed of 150 places in 319 ms of which 5 ms to minimize.
[2025-05-31 08:02:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 743 ms
[2025-05-31 08:02:19] [INFO ] Computed and/alt/rep : 585/1578/585 causal constraints (skipped 70 transitions) in 55 ms.
[2025-05-31 08:02:23] [INFO ] Added : 275 causal constraints over 55 iterations in 3733 ms. Result :unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA FireWire-PT-17-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-17-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Support contains 7 out of 428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 656/656 transitions.
Graph (trivial) has 345 edges and 428 vertex of which 19 / 428 are part of one of the 3 SCC in 6 ms
Free SCC test removed 16 places
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Graph (complete) has 1083 edges and 412 vertex of which 406 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 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 123 transitions
Trivial Post-agglo rules discarded 123 transitions
Performed 123 trivial Post agglomeration. Transition count delta: 123
Iterating post reduction 0 with 125 rules applied. Total rules applied 127 place count 406 transition count 511
Reduce places removed 123 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 126 rules applied. Total rules applied 253 place count 283 transition count 508
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 256 place count 281 transition count 507
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 257 place count 280 transition count 507
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 257 place count 280 transition count 499
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 273 place count 272 transition count 499
Discarding 43 places :
Symmetric choice reduction at 4 with 43 rule applications. Total rules 316 place count 229 transition count 454
Iterating global reduction 4 with 43 rules applied. Total rules applied 359 place count 229 transition count 454
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 361 place count 229 transition count 452
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 11 Pre rules applied. Total rules applied 361 place count 229 transition count 441
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 383 place count 218 transition count 441
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 392 place count 209 transition count 390
Iterating global reduction 5 with 9 rules applied. Total rules applied 401 place count 209 transition count 390
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 5 with 5 rules applied. Total rules applied 406 place count 209 transition count 385
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 408 place count 207 transition count 385
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 7 with 70 rules applied. Total rules applied 478 place count 172 transition count 350
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: -74
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 7 with 52 rules applied. Total rules applied 530 place count 146 transition count 424
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 535 place count 146 transition count 419
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 8 with 30 rules applied. Total rules applied 565 place count 146 transition count 389
Free-agglomeration rule applied 23 times.
Iterating global reduction 8 with 23 rules applied. Total rules applied 588 place count 146 transition count 366
Reduce places removed 23 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 28 rules applied. Total rules applied 616 place count 123 transition count 361
Drop transitions (Redundant composition of simpler transitions.) removed 52 transitions
Redundant transition composition rules discarded 52 transitions
Iterating global reduction 9 with 52 rules applied. Total rules applied 668 place count 123 transition count 309
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 670 place count 123 transition count 309
Applied a total of 670 rules in 379 ms. Remains 123 /428 variables (removed 305) and now considering 309/656 (removed 347) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 399 ms. Remains : 123/428 places, 309/656 transitions.
[2025-05-31 08:02:26] [INFO ] Flow matrix only has 274 transitions (discarded 35 similar events)
// Phase 1: matrix 274 rows 123 cols
[2025-05-31 08:02:26] [INFO ] Computed 7 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (57466 resets) in 1597 ms. (625 steps per ms)
FORMULA FireWire-PT-17-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-17-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-17-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-17-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-17-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-17-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (14992 resets) in 526 ms. (1897 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-31 08:02:28] [INFO ] Flow matrix only has 274 transitions (discarded 35 similar events)
[2025-05-31 08:02:28] [INFO ] Invariant cache hit.
[2025-05-31 08:02:28] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-05-31 08:02:28] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2025-05-31 08:02:28] [INFO ] State equation strengthened by 62 read => feed constraints.
[2025-05-31 08:02:28] [INFO ] [Real]Added 62 Read/Feed constraints in 33 ms returned sat
[2025-05-31 08:02:28] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:02:28] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-05-31 08:02:28] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2025-05-31 08:02:28] [INFO ] [Nat]Added 62 Read/Feed constraints in 41 ms returned sat
[2025-05-31 08:02:28] [INFO ] Computed and/alt/rep : 124/663/124 causal constraints (skipped 146 transitions) in 32 ms.
[2025-05-31 08:02:29] [INFO ] Deduced a trap composed of 22 places in 154 ms of which 3 ms to minimize.
[2025-05-31 08:02:29] [INFO ] Deduced a trap composed of 21 places in 136 ms of which 2 ms to minimize.
[2025-05-31 08:02:29] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 2 ms to minimize.
[2025-05-31 08:02:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 469 ms
[2025-05-31 08:02:29] [INFO ] Added : 25 causal constraints over 5 iterations in 732 ms. Result :sat
Minimization took 233 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 123 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p271) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 308/308 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 123 transition count 307
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 122 transition count 307
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 122 transition count 306
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 121 transition count 306
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 2 with 4 rules applied. Total rules applied 8 place count 119 transition count 304
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 116 transition count 309
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 16 place count 116 transition count 307
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 26 place count 116 transition count 297
Applied a total of 26 rules in 66 ms. Remains 116 /123 variables (removed 7) and now considering 297/308 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 116/123 places, 297/308 transitions.
[2025-05-31 08:02:29] [INFO ] Flow matrix only has 261 transitions (discarded 36 similar events)
// Phase 1: matrix 261 rows 116 cols
[2025-05-31 08:02:29] [INFO ] Computed 7 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (57474 resets) in 1837 ms. (544 steps per ms)
BEST_FIRST walk for 1000001 steps (15050 resets) in 552 ms. (1808 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-05-31 08:02:32] [INFO ] Flow matrix only has 261 transitions (discarded 36 similar events)
[2025-05-31 08:02:32] [INFO ] Invariant cache hit.
[2025-05-31 08:02:32] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-05-31 08:02:32] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2025-05-31 08:02:32] [INFO ] State equation strengthened by 62 read => feed constraints.
[2025-05-31 08:02:32] [INFO ] [Real]Added 62 Read/Feed constraints in 45 ms returned sat
[2025-05-31 08:02:32] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:02:32] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-05-31 08:02:32] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2025-05-31 08:02:32] [INFO ] [Nat]Added 62 Read/Feed constraints in 50 ms returned sat
[2025-05-31 08:02:32] [INFO ] Computed and/alt/rep : 112/637/112 causal constraints (skipped 145 transitions) in 33 ms.
[2025-05-31 08:02:33] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 5 ms to minimize.
[2025-05-31 08:02:33] [INFO ] Deduced a trap composed of 37 places in 142 ms of which 2 ms to minimize.
[2025-05-31 08:02:33] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 2 ms to minimize.
[2025-05-31 08:02:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 456 ms
[2025-05-31 08:02:33] [INFO ] Added : 44 causal constraints over 10 iterations in 841 ms. Result :sat
Minimization took 205 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 297/297 transitions.
Applied a total of 0 rules in 11 ms. Remains 116 /116 variables (removed 0) and now considering 297/297 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 116/116 places, 297/297 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 297/297 transitions.
Applied a total of 0 rules in 10 ms. Remains 116 /116 variables (removed 0) and now considering 297/297 (removed 0) transitions.
[2025-05-31 08:02:33] [INFO ] Flow matrix only has 261 transitions (discarded 36 similar events)
[2025-05-31 08:02:33] [INFO ] Invariant cache hit.
[2025-05-31 08:02:34] [INFO ] Implicit Places using invariants in 258 ms returned []
[2025-05-31 08:02:34] [INFO ] Flow matrix only has 261 transitions (discarded 36 similar events)
[2025-05-31 08:02:34] [INFO ] Invariant cache hit.
[2025-05-31 08:02:34] [INFO ] State equation strengthened by 62 read => feed constraints.
[2025-05-31 08:02:34] [INFO ] Implicit Places using invariants and state equation in 503 ms returned []
Implicit Place search using SMT with State Equation took 769 ms to find 0 implicit places.
[2025-05-31 08:02:34] [INFO ] Redundant transitions in 24 ms returned []
Running 293 sub problems to find dead transitions.
[2025-05-31 08:02:34] [INFO ] Flow matrix only has 261 transitions (discarded 36 similar events)
[2025-05-31 08:02:34] [INFO ] Invariant cache hit.
[2025-05-31 08:02:34] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (OVERLAPS) 2/116 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2025-05-31 08:02:38] [INFO ] Deduced a trap composed of 21 places in 131 ms of which 2 ms to minimize.
[2025-05-31 08:02:38] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 2 ms to minimize.
[2025-05-31 08:02:38] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 1 ms to minimize.
[2025-05-31 08:02:38] [INFO ] Deduced a trap composed of 36 places in 201 ms of which 2 ms to minimize.
[2025-05-31 08:02:39] [INFO ] Deduced a trap composed of 36 places in 97 ms of which 2 ms to minimize.
[2025-05-31 08:02:39] [INFO ] Deduced a trap composed of 86 places in 122 ms of which 2 ms to minimize.
[2025-05-31 08:02:40] [INFO ] Deduced a trap composed of 37 places in 101 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (OVERLAPS) 261/377 variables, 116/130 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 62/192 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2025-05-31 08:02:46] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/377 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 8 (OVERLAPS) 0/377 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 293 unsolved
No progress, stopping.
After SMT solving in domain Real declared 377/377 variables, and 193 constraints, problems are : Problem set: 0 solved, 293 unsolved in 20104 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 116/116 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 293 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (OVERLAPS) 2/116 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (OVERLAPS) 261/377 variables, 116/131 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 62/193 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 293/486 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/377 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 8 (OVERLAPS) 0/377 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 293 unsolved
No progress, stopping.
After SMT solving in domain Int declared 377/377 variables, and 486 constraints, problems are : Problem set: 0 solved, 293 unsolved in 26392 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 116/116 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 8/8 constraints]
After SMT, in 46981ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 47009ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47848 ms. Remains : 116/116 places, 297/297 transitions.
RANDOM walk for 40000 steps (2275 resets) in 925 ms. (43 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (600 resets) in 123 ms. (322 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (609 resets) in 107 ms. (370 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 4454 steps, run visited all 2 properties in 95 ms. (steps per millisecond=46 )
Probabilistic random walk after 4454 steps, saw 1625 distinct states, run finished after 103 ms. (steps per millisecond=43 ) properties seen :2
[2025-05-31 08:03:22] [INFO ] Flatten gal took : 121 ms
[2025-05-31 08:03:22] [INFO ] Flatten gal took : 63 ms
[2025-05-31 08:03:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14299541419114211148.gal : 26 ms
[2025-05-31 08:03:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7724961360519562066.prop : 4 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/ReachabilityCardinality14299541419114211148.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7724961360519562066.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:334)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA FireWire-PT-17-UpperBounds-11 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 116907 ms.

BK_STOP 1748678602975

--------------------
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-17"
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-17, 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-174860111800047"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-17.tgz
mv FireWire-PT-17 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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;