Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r251-tall-174915604900020.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 Szymanski-PT-b08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r251-tall-174915604900020
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.1M
-rw-r--r-- 1 mcc users 4.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 47K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K 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 4.0K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 3.7M May 29 14:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME Szymanski-PT-b08-UpperBounds-00
FORMULA_NAME Szymanski-PT-b08-UpperBounds-01
FORMULA_NAME Szymanski-PT-b08-UpperBounds-02
FORMULA_NAME Szymanski-PT-b08-UpperBounds-03
FORMULA_NAME Szymanski-PT-b08-UpperBounds-04
FORMULA_NAME Szymanski-PT-b08-UpperBounds-05
FORMULA_NAME Szymanski-PT-b08-UpperBounds-06
FORMULA_NAME Szymanski-PT-b08-UpperBounds-07
FORMULA_NAME Szymanski-PT-b08-UpperBounds-08
FORMULA_NAME Szymanski-PT-b08-UpperBounds-09
FORMULA_NAME Szymanski-PT-b08-UpperBounds-10
FORMULA_NAME Szymanski-PT-b08-UpperBounds-11
FORMULA_NAME Szymanski-PT-b08-UpperBounds-12
FORMULA_NAME Szymanski-PT-b08-UpperBounds-13
FORMULA_NAME Szymanski-PT-b08-UpperBounds-14
FORMULA_NAME Szymanski-PT-b08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1749196462227

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Szymanski-PT-b08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-06 07:54:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-06 07:54:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 07:54:23] [INFO ] Load time of PNML (sax parser for PT used): 323 ms
[2025-06-06 07:54:23] [INFO ] Transformed 568 places.
[2025-06-06 07:54:23] [INFO ] Transformed 8320 transitions.
[2025-06-06 07:54:23] [INFO ] Parsed PT model containing 568 places and 8320 transitions and 33408 arcs in 460 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Deduced a syphon composed of 260 places in 19 ms
Reduce places removed 260 places and 256 transitions.
FORMULA Szymanski-PT-b08-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b08-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b08-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-06 07:54:24] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 308 cols
[2025-06-06 07:54:24] [INFO ] Computed 3 invariants in 77 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 65 ms. (151 steps per ms)
FORMULA Szymanski-PT-b08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-b08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-b08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-b08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-b08-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-b08-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60006 steps (16 resets) in 168 ms. (355 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2025-06-06 07:54:24] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2025-06-06 07:54:24] [INFO ] Invariant cache hit.
[2025-06-06 07:54:24] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2025-06-06 07:54:24] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-06 07:54:25] [INFO ] [Real]Absence check using state equation in 454 ms returned sat
[2025-06-06 07:54:25] [INFO ] State equation strengthened by 147 read => feed constraints.
[2025-06-06 07:54:25] [INFO ] [Real]Added 147 Read/Feed constraints in 69 ms returned sat
[2025-06-06 07:54:25] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:54:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2025-06-06 07:54:25] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-06 07:54:25] [INFO ] [Nat]Absence check using state equation in 394 ms returned sat
[2025-06-06 07:54:26] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-06 07:54:26] [INFO ] [Nat]Added 147 Read/Feed constraints in 656 ms returned sat
[2025-06-06 07:54:27] [INFO ] Deduced a trap composed of 64 places in 659 ms of which 32 ms to minimize.
[2025-06-06 07:54:27] [INFO ] Deduced a trap composed of 39 places in 606 ms of which 3 ms to minimize.
[2025-06-06 07:54:28] [INFO ] Deduced a trap composed of 38 places in 586 ms of which 2 ms to minimize.
[2025-06-06 07:54:29] [INFO ] Deduced a trap composed of 83 places in 541 ms of which 6 ms to minimize.
[2025-06-06 07:54:29] [INFO ] Deduced a trap composed of 81 places in 593 ms of which 6 ms to minimize.
[2025-06-06 07:54:30] [INFO ] Deduced a trap composed of 139 places in 519 ms of which 2 ms to minimize.
[2025-06-06 07:54:30] [INFO ] Deduced a trap composed of 139 places in 510 ms of which 2 ms to minimize.
[2025-06-06 07:54:30] [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.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
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-06-06 07:54:30] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2025-06-06 07:54:30] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-06 07:54:31] [INFO ] [Real]Absence check using state equation in 371 ms returned sat
[2025-06-06 07:54:32] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-06 07:54:32] [INFO ] [Real]Added 147 Read/Feed constraints in 826 ms returned sat
[2025-06-06 07:54:32] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:54:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2025-06-06 07:54:32] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-06 07:54:32] [INFO ] [Nat]Absence check using state equation in 375 ms returned sat
[2025-06-06 07:54:33] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-06 07:54:33] [INFO ] [Nat]Added 147 Read/Feed constraints in 1159 ms returned unknown
[2025-06-06 07:54:33] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2025-06-06 07:54:33] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-06 07:54:34] [INFO ] [Real]Absence check using state equation in 448 ms returned sat
[2025-06-06 07:54:34] [INFO ] [Real]Added 147 Read/Feed constraints in 125 ms returned sat
[2025-06-06 07:54:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:54:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2025-06-06 07:54:34] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-06 07:54:35] [INFO ] [Nat]Absence check using state equation in 398 ms returned sat
[2025-06-06 07:54:35] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-06 07:54:36] [INFO ] [Nat]Added 147 Read/Feed constraints in 1036 ms returned unknown
[2025-06-06 07:54:36] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2025-06-06 07:54:36] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-06 07:54:36] [INFO ] [Real]Absence check using state equation in 373 ms returned sat
[2025-06-06 07:54:36] [INFO ] [Real]Added 147 Read/Feed constraints in 76 ms returned sat
[2025-06-06 07:54:36] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:54:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2025-06-06 07:54:36] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-06 07:54:37] [INFO ] [Nat]Absence check using state equation in 336 ms returned sat
[2025-06-06 07:54:37] [INFO ] [Nat]Added 147 Read/Feed constraints in 506 ms returned sat
[2025-06-06 07:54:38] [INFO ] Deduced a trap composed of 80 places in 483 ms of which 2 ms to minimize.
[2025-06-06 07:54:38] [INFO ] Deduced a trap composed of 79 places in 459 ms of which 2 ms to minimize.
[2025-06-06 07:54:39] [INFO ] Deduced a trap composed of 139 places in 406 ms of which 2 ms to minimize.
[2025-06-06 07:54:39] [INFO ] Deduced a trap composed of 138 places in 380 ms of which 2 ms to minimize.
[2025-06-06 07:54:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2034 ms
[2025-06-06 07:54:40] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2722 transitions) in 583 ms.
[2025-06-06 07:54:40] [INFO ] Added : 0 causal constraints over 0 iterations in 756 ms. Result :sat
Minimization took 599 ms.
[2025-06-06 07:54:41] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2025-06-06 07:54:41] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-06 07:54:41] [INFO ] [Real]Absence check using state equation in 401 ms returned sat
[2025-06-06 07:54:41] [INFO ] [Real]Added 147 Read/Feed constraints in 160 ms returned sat
[2025-06-06 07:54:41] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:54:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2025-06-06 07:54:41] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-06 07:54:42] [INFO ] [Nat]Absence check using state equation in 418 ms returned sat
[2025-06-06 07:54:42] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-06 07:54:43] [INFO ] [Nat]Added 147 Read/Feed constraints in 1039 ms returned unknown
[2025-06-06 07:54:43] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-06 07:54:43] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-06 07:54:44] [INFO ] [Real]Absence check using state equation in 748 ms returned sat
[2025-06-06 07:54:44] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:54:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2025-06-06 07:54:44] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-06 07:54:44] [INFO ] [Nat]Absence check using state equation in 444 ms returned sat
[2025-06-06 07:54:45] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-06 07:54:45] [INFO ] [Nat]Added 147 Read/Feed constraints in 996 ms returned sat
[2025-06-06 07:54:46] [INFO ] Deduced a trap composed of 88 places in 586 ms of which 2 ms to minimize.
[2025-06-06 07:54:46] [INFO ] Deduced a trap composed of 125 places in 523 ms of which 2 ms to minimize.
[2025-06-06 07:54:47] [INFO ] Deduced a trap composed of 136 places in 535 ms of which 2 ms to minimize.
[2025-06-06 07:54:48] [INFO ] Deduced a trap composed of 135 places in 537 ms of which 2 ms to minimize.
[2025-06-06 07:54:48] [INFO ] Deduced a trap composed of 133 places in 554 ms of which 2 ms to minimize.
[2025-06-06 07:54:48] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3122 ms
[2025-06-06 07:54:49] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2722 transitions) in 984 ms.
[2025-06-06 07:54:49] [INFO ] Added : 0 causal constraints over 0 iterations in 985 ms. Result :unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 8064/8064 transitions.
Graph (complete) has 9195 edges and 308 vertex of which 306 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.17 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 0 with 128 rules applied. Total rules applied 129 place count 306 transition count 7936
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 130 place count 305 transition count 7808
Iterating global reduction 1 with 1 rules applied. Total rules applied 131 place count 305 transition count 7808
Applied a total of 131 rules in 476 ms. Remains 305 /308 variables (removed 3) and now considering 7808/8064 (removed 256) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 495 ms. Remains : 305/308 places, 7808/8064 transitions.
[2025-06-06 07:54:50] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2025-06-06 07:54:50] [INFO ] Computed 3 invariants in 26 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
RANDOM walk for 1000007 steps (2 resets) in 1154 ms. (865 steps per ms)
BEST_FIRST walk for 6000004 steps (12 resets) in 5327 ms. (1126 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2025-06-06 07:54:56] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 07:54:56] [INFO ] Invariant cache hit.
[2025-06-06 07:54:56] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-06 07:54:57] [INFO ] [Real]Absence check using state equation in 387 ms returned sat
[2025-06-06 07:54:57] [INFO ] State equation strengthened by 147 read => feed constraints.
[2025-06-06 07:54:57] [INFO ] [Real]Added 147 Read/Feed constraints in 87 ms returned sat
[2025-06-06 07:54:57] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:54:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-06 07:54:57] [INFO ] [Nat]Absence check using state equation in 395 ms returned sat
[2025-06-06 07:54:58] [INFO ] [Nat]Added 147 Read/Feed constraints in 842 ms returned sat
[2025-06-06 07:54:59] [INFO ] Deduced a trap composed of 37 places in 551 ms of which 2 ms to minimize.
[2025-06-06 07:54:59] [INFO ] Deduced a trap composed of 129 places in 500 ms of which 1 ms to minimize.
[2025-06-06 07:55:00] [INFO ] Deduced a trap composed of 129 places in 543 ms of which 2 ms to minimize.
[2025-06-06 07:55:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1834 ms
[2025-06-06 07:55:01] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 352 ms.
[2025-06-06 07:55:01] [INFO ] Added : 0 causal constraints over 0 iterations in 526 ms. Result :sat
Minimization took 4902 ms.
[2025-06-06 07:55:06] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-06 07:55:06] [INFO ] [Real]Absence check using state equation in 388 ms returned sat
[2025-06-06 07:55:06] [INFO ] [Real]Added 147 Read/Feed constraints in 84 ms returned sat
[2025-06-06 07:55:06] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:55:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-06 07:55:07] [INFO ] [Nat]Absence check using state equation in 392 ms returned sat
[2025-06-06 07:55:11] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-06 07:55:11] [INFO ] [Nat]Added 147 Read/Feed constraints in 4801 ms returned sat
[2025-06-06 07:55:12] [INFO ] Deduced a trap composed of 147 places in 471 ms of which 2 ms to minimize.
[2025-06-06 07:55:13] [INFO ] Deduced a trap composed of 45 places in 470 ms of which 2 ms to minimize.
[2025-06-06 07:55:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1110 ms
[2025-06-06 07:55:13] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 329 ms.
[2025-06-06 07:55:13] [INFO ] Added : 0 causal constraints over 0 iterations in 483 ms. Result :sat
Minimization took 4901 ms.
[2025-06-06 07:55:18] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-06 07:55:18] [INFO ] [Real]Absence check using state equation in 361 ms returned sat
[2025-06-06 07:55:19] [INFO ] [Real]Added 147 Read/Feed constraints in 94 ms returned sat
[2025-06-06 07:55:19] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:55:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-06 07:55:19] [INFO ] [Nat]Absence check using state equation in 353 ms returned sat
[2025-06-06 07:55:19] [INFO ] [Nat]Added 147 Read/Feed constraints in 429 ms returned sat
[2025-06-06 07:55:20] [INFO ] Deduced a trap composed of 46 places in 522 ms of which 3 ms to minimize.
[2025-06-06 07:55:21] [INFO ] Deduced a trap composed of 129 places in 513 ms of which 3 ms to minimize.
[2025-06-06 07:55:21] [INFO ] Deduced a trap composed of 129 places in 546 ms of which 2 ms to minimize.
[2025-06-06 07:55:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1811 ms
[2025-06-06 07:55:22] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 325 ms.
[2025-06-06 07:55:22] [INFO ] Added : 0 causal constraints over 0 iterations in 492 ms. Result :sat
Minimization took 4900 ms.
[2025-06-06 07:55:27] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-06 07:55:27] [INFO ] [Real]Absence check using state equation in 368 ms returned sat
[2025-06-06 07:55:27] [INFO ] [Real]Added 147 Read/Feed constraints in 90 ms returned sat
[2025-06-06 07:55:27] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:55:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-06 07:55:28] [INFO ] [Nat]Absence check using state equation in 353 ms returned sat
[2025-06-06 07:55:28] [INFO ] [Nat]Added 147 Read/Feed constraints in 443 ms returned sat
[2025-06-06 07:55:29] [INFO ] Deduced a trap composed of 37 places in 510 ms of which 2 ms to minimize.
[2025-06-06 07:55:29] [INFO ] Deduced a trap composed of 129 places in 493 ms of which 2 ms to minimize.
[2025-06-06 07:55:30] [INFO ] Deduced a trap composed of 129 places in 502 ms of which 3 ms to minimize.
[2025-06-06 07:55:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1738 ms
[2025-06-06 07:55:30] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 335 ms.
[2025-06-06 07:55:30] [INFO ] Added : 0 causal constraints over 0 iterations in 498 ms. Result :sat
Minimization took 4902 ms.
[2025-06-06 07:55:35] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-06 07:55:36] [INFO ] [Real]Absence check using state equation in 351 ms returned sat
[2025-06-06 07:55:36] [INFO ] [Real]Added 147 Read/Feed constraints in 101 ms returned sat
[2025-06-06 07:55:36] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:55:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-06 07:55:36] [INFO ] [Nat]Absence check using state equation in 342 ms returned sat
[2025-06-06 07:55:38] [INFO ] [Nat]Added 147 Read/Feed constraints in 1476 ms returned sat
[2025-06-06 07:55:38] [INFO ] Deduced a trap composed of 50 places in 489 ms of which 3 ms to minimize.
[2025-06-06 07:55:39] [INFO ] Deduced a trap composed of 80 places in 506 ms of which 2 ms to minimize.
[2025-06-06 07:55:39] [INFO ] Deduced a trap composed of 149 places in 488 ms of which 2 ms to minimize.
[2025-06-06 07:55:40] [INFO ] Deduced a trap composed of 137 places in 506 ms of which 2 ms to minimize.
[2025-06-06 07:55:40] [INFO ] Deduced a trap composed of 135 places in 498 ms of which 2 ms to minimize.
[2025-06-06 07:55:40] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2790 ms
[2025-06-06 07:55:41] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 334 ms.
[2025-06-06 07:55:41] [INFO ] Added : 0 causal constraints over 0 iterations in 488 ms. Result :sat
Minimization took 4892 ms.
[2025-06-06 07:55:46] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-06 07:55:46] [INFO ] [Real]Absence check using state equation in 360 ms returned sat
[2025-06-06 07:55:46] [INFO ] [Real]Added 147 Read/Feed constraints in 61 ms returned sat
[2025-06-06 07:55:46] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:55:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-06 07:55:47] [INFO ] [Nat]Absence check using state equation in 363 ms returned sat
[2025-06-06 07:55:48] [INFO ] [Nat]Added 147 Read/Feed constraints in 1380 ms returned sat
[2025-06-06 07:55:49] [INFO ] Deduced a trap composed of 52 places in 516 ms of which 3 ms to minimize.
[2025-06-06 07:55:49] [INFO ] Deduced a trap composed of 78 places in 491 ms of which 2 ms to minimize.
[2025-06-06 07:55:50] [INFO ] Deduced a trap composed of 111 places in 497 ms of which 3 ms to minimize.
[2025-06-06 07:55:50] [INFO ] Deduced a trap composed of 137 places in 497 ms of which 2 ms to minimize.
[2025-06-06 07:55:51] [INFO ] Deduced a trap composed of 135 places in 499 ms of which 2 ms to minimize.
[2025-06-06 07:55:52] [INFO ] Deduced a trap composed of 132 places in 512 ms of which 2 ms to minimize.
[2025-06-06 07:55:52] [INFO ] Deduced a trap composed of 131 places in 499 ms of which 2 ms to minimize.
[2025-06-06 07:55:52] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3929 ms
[2025-06-06 07:55:52] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 336 ms.
[2025-06-06 07:55:53] [INFO ] Added : 0 causal constraints over 0 iterations in 483 ms. Result :sat
Minimization took 4899 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 323 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 324 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 228 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2025-06-06 07:55:58] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 07:55:58] [INFO ] Invariant cache hit.
[2025-06-06 07:55:59] [INFO ] Implicit Places using invariants in 658 ms returned []
[2025-06-06 07:55:59] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 07:55:59] [INFO ] Invariant cache hit.
[2025-06-06 07:55:59] [INFO ] State equation strengthened by 147 read => feed constraints.
[2025-06-06 07:56:20] [INFO ] Implicit Places using invariants and state equation in 21530 ms returned []
Implicit Place search using SMT with State Equation took 22193 ms to find 0 implicit places.
[2025-06-06 07:56:21] [INFO ] Redundant transitions in 942 ms returned []
Running 7806 sub problems to find dead transitions.
[2025-06-06 07:56:21] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 07:56:21] [INFO ] Invariant cache hit.
[2025-06-06 07:56:21] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/2909 variables, and 3 constraints, problems are : Problem set: 0 solved, 7806 unsolved in 30156 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7806/7806 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7806 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
[2025-06-06 07:57:24] [INFO ] Deduced a trap composed of 138 places in 330 ms of which 1 ms to minimize.
[2025-06-06 07:57:26] [INFO ] Deduced a trap composed of 48 places in 326 ms of which 2 ms to minimize.
[2025-06-06 07:57:26] [INFO ] Deduced a trap composed of 86 places in 311 ms of which 2 ms to minimize.
[2025-06-06 07:57:26] [INFO ] Deduced a trap composed of 70 places in 224 ms of which 2 ms to minimize.
[2025-06-06 07:57:27] [INFO ] Deduced a trap composed of 72 places in 296 ms of which 15 ms to minimize.
[2025-06-06 07:57:27] [INFO ] Deduced a trap composed of 77 places in 276 ms of which 1 ms to minimize.
[2025-06-06 07:57:27] [INFO ] Deduced a trap composed of 72 places in 248 ms of which 2 ms to minimize.
[2025-06-06 07:57:27] [INFO ] Deduced a trap composed of 85 places in 237 ms of which 1 ms to minimize.
[2025-06-06 07:57:28] [INFO ] Deduced a trap composed of 99 places in 378 ms of which 2 ms to minimize.
[2025-06-06 07:57:28] [INFO ] Deduced a trap composed of 50 places in 303 ms of which 2 ms to minimize.
[2025-06-06 07:57:29] [INFO ] Deduced a trap composed of 78 places in 368 ms of which 2 ms to minimize.
[2025-06-06 07:57:29] [INFO ] Deduced a trap composed of 107 places in 349 ms of which 3 ms to minimize.
[2025-06-06 07:57:29] [INFO ] Deduced a trap composed of 132 places in 278 ms of which 2 ms to minimize.
[2025-06-06 07:57:30] [INFO ] Deduced a trap composed of 77 places in 356 ms of which 2 ms to minimize.
[2025-06-06 07:57:30] [INFO ] Deduced a trap composed of 122 places in 338 ms of which 2 ms to minimize.
[2025-06-06 07:57:30] [INFO ] Deduced a trap composed of 137 places in 240 ms of which 2 ms to minimize.
[2025-06-06 07:57:31] [INFO ] Deduced a trap composed of 72 places in 339 ms of which 2 ms to minimize.
[2025-06-06 07:57:31] [INFO ] Deduced a trap composed of 122 places in 344 ms of which 6 ms to minimize.
[2025-06-06 07:57:31] [INFO ] Deduced a trap composed of 134 places in 258 ms of which 1 ms to minimize.
[2025-06-06 07:57:35] [INFO ] Deduced a trap composed of 135 places in 451 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/305 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
[2025-06-06 07:57:39] [INFO ] Deduced a trap composed of 195 places in 240 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/2909 variables, and 24 constraints, problems are : Problem set: 0 solved, 7806 unsolved in 30100 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7806 constraints, Known Traps: 21/21 constraints]
After SMT, in 88975ms problems are : Problem set: 0 solved, 7806 unsolved
Search for dead transitions found 0 dead transitions in 89066ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112502 ms. Remains : 305/305 places, 7808/7808 transitions.
RANDOM walk for 40003 steps (8 resets) in 1169 ms. (34 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 234 ms. (170 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 231 ms. (172 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 307 ms. (129 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 140 ms. (283 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 163 ms. (243 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 158 ms. (251 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 125 ms. (317 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 12/12 properties
[2025-06-06 07:57:52] [INFO ] Flatten gal took : 832 ms
[2025-06-06 07:57:52] [INFO ] Flatten gal took : 305 ms
[2025-06-06 07:57:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2404428091334449543.gal : 116 ms
[2025-06-06 07:57:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1448138519713195509.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/ReachabilityCardinality2404428091334449543.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1448138519713195509.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 ...328
Loading property file /tmp/ReachabilityCardinality1448138519713195509.prop.
Interrupted probabilistic random walk after 86578 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :0 out of 12
Probabilistic random walk after 86578 steps, saw 63908 distinct states, run finished after 3004 ms. (steps per millisecond=28 ) properties seen :0
[2025-06-06 07:57:55] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 07:57:55] [INFO ] Invariant cache hit.
[2025-06-06 07:57:55] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 250/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2025-06-06 07:57:56] [INFO ] Deduced a trap composed of 75 places in 437 ms of which 2 ms to minimize.
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :5 after 9
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :9 after 45
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :45 after 495
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :495 after 44355
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :44355 after 114824
SDD proceeding with computation,12 properties remain. new max is 256
SDD size :114824 after 448899
[2025-06-06 07:57:56] [INFO ] Deduced a trap composed of 131 places in 431 ms of which 2 ms to minimize.
[2025-06-06 07:57:56] [INFO ] Deduced a trap composed of 137 places in 427 ms of which 2 ms to minimize.
SDD proceeding with computation,12 properties remain. new max is 512
SDD size :448899 after 1.24607e+06
[2025-06-06 07:57:57] [INFO ] Deduced a trap composed of 130 places in 420 ms of which 2 ms to minimize.
[2025-06-06 07:57:57] [INFO ] Deduced a trap composed of 74 places in 416 ms of which 3 ms to minimize.
[2025-06-06 07:57:58] [INFO ] Deduced a trap composed of 129 places in 425 ms of which 2 ms to minimize.
[2025-06-06 07:57:58] [INFO ] Deduced a trap composed of 77 places in 381 ms of which 2 ms to minimize.
[2025-06-06 07:57:58] [INFO ] Deduced a trap composed of 78 places in 271 ms of which 2 ms to minimize.
[2025-06-06 07:57:59] [INFO ] Deduced a trap composed of 138 places in 256 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 19/305 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
SDD proceeding with computation,12 properties remain. new max is 1024
SDD size :1.24607e+06 after 1.84843e+06
[2025-06-06 07:58:00] [INFO ] Deduced a trap composed of 148 places in 253 ms of which 1 ms to minimize.
SMT process timed out in 5296ms, After SMT, problems are : Problem set: 0 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 219 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 220 ms. Remains : 305/305 places, 7808/7808 transitions.
RANDOM walk for 40013 steps (8 resets) in 172 ms. (231 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 78 ms. (506 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 73 ms. (540 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 84 ms. (470 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 130664 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :0 out of 12
Probabilistic random walk after 130664 steps, saw 85181 distinct states, run finished after 3001 ms. (steps per millisecond=43 ) properties seen :0
[2025-06-06 07:58:04] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 07:58:04] [INFO ] Invariant cache hit.
[2025-06-06 07:58:04] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 250/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2025-06-06 07:58:04] [INFO ] Deduced a trap composed of 75 places in 437 ms of which 2 ms to minimize.
[2025-06-06 07:58:05] [INFO ] Deduced a trap composed of 131 places in 423 ms of which 2 ms to minimize.
[2025-06-06 07:58:05] [INFO ] Deduced a trap composed of 137 places in 429 ms of which 2 ms to minimize.
[2025-06-06 07:58:06] [INFO ] Deduced a trap composed of 130 places in 425 ms of which 2 ms to minimize.
SDD proceeding with computation,12 properties remain. new max is 2048
SDD size :1.84843e+06 after 5.13026e+06
[2025-06-06 07:58:06] [INFO ] Deduced a trap composed of 74 places in 414 ms of which 2 ms to minimize.
[2025-06-06 07:58:07] [INFO ] Deduced a trap composed of 129 places in 428 ms of which 2 ms to minimize.
[2025-06-06 07:58:07] [INFO ] Deduced a trap composed of 77 places in 379 ms of which 2 ms to minimize.
[2025-06-06 07:58:07] [INFO ] Deduced a trap composed of 78 places in 271 ms of which 2 ms to minimize.
[2025-06-06 07:58:08] [INFO ] Deduced a trap composed of 138 places in 258 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 19/305 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2025-06-06 07:58:09] [INFO ] Deduced a trap composed of 148 places in 258 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
SDD proceeding with computation,12 properties remain. new max is 4096
SDD size :5.13026e+06 after 2.56929e+07
At refinement iteration 9 (OVERLAPS) 2604/2909 variables, 305/318 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2909 variables, 147/465 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2909 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2025-06-06 07:58:11] [INFO ] Deduced a trap composed of 103 places in 477 ms of which 3 ms to minimize.
[2025-06-06 07:58:12] [INFO ] Deduced a trap composed of 103 places in 481 ms of which 2 ms to minimize.
[2025-06-06 07:58:12] [INFO ] Deduced a trap composed of 132 places in 480 ms of which 2 ms to minimize.
SDD proceeding with computation,12 properties remain. new max is 8192
SDD size :2.56929e+07 after 4.61265e+07
[2025-06-06 07:58:13] [INFO ] Deduced a trap composed of 129 places in 495 ms of which 2 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/2909 variables, 4/469 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2909 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (OVERLAPS) 0/2909 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2909/2909 variables, and 469 constraints, problems are : Problem set: 0 solved, 12 unsolved in 13037 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 250/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2025-06-06 07:58:17] [INFO ] Deduced a trap composed of 134 places in 248 ms of which 1 ms to minimize.
[2025-06-06 07:58:18] [INFO ] Deduced a trap composed of 154 places in 367 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2025-06-06 07:58:19] [INFO ] Deduced a trap composed of 160 places in 332 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2025-06-06 07:58:19] [INFO ] Deduced a trap composed of 159 places in 350 ms of which 2 ms to minimize.
[2025-06-06 07:58:20] [INFO ] Deduced a trap composed of 170 places in 324 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/286 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/286 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 19/305 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/305 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2025-06-06 07:58:21] [INFO ] Deduced a trap composed of 215 places in 433 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/305 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/305 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 2604/2909 variables, 305/328 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2909 variables, 147/475 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2909 variables, 12/487 constraints. Problems are: Problem set: 0 solved, 12 unsolved
SDD proceeding with computation,12 properties remain. new max is 16384
SDD size :4.61265e+07 after 9.74772e+07
At refinement iteration 16 (INCLUDED_ONLY) 0/2909 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (OVERLAPS) 0/2909 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2909/2909 variables, and 487 constraints, problems are : Problem set: 0 solved, 12 unsolved in 10573 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 20/20 constraints]
After SMT, in 23647ms problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 32 ms.
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 205 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 206 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 205 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2025-06-06 07:58:28] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 07:58:28] [INFO ] Invariant cache hit.
[2025-06-06 07:58:28] [INFO ] Implicit Places using invariants in 601 ms returned []
[2025-06-06 07:58:28] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 07:58:28] [INFO ] Invariant cache hit.
[2025-06-06 07:58:29] [INFO ] State equation strengthened by 147 read => feed constraints.
Detected timeout of ITS tools.
[2025-06-06 07:58:43] [INFO ] Flatten gal took : 223 ms
[2025-06-06 07:58:43] [INFO ] Applying decomposition
[2025-06-06 07:58:43] [INFO ] Flatten gal took : 219 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7181875165363792900.txt' '-o' '/tmp/graph7181875165363792900.bin' '-w' '/tmp/graph7181875165363792900.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7181875165363792900.bin' '-l' '-1' '-v' '-w' '/tmp/graph7181875165363792900.weights' '-q' '0' '-e' '0.001'
[2025-06-06 07:58:44] [INFO ] Decomposing Gal with order
[2025-06-06 07:58:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 07:58:45] [INFO ] Removed a total of 17583 redundant transitions.
[2025-06-06 07:58:45] [INFO ] Flatten gal took : 867 ms
[2025-06-06 07:58:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 1019 labels/synchronizations in 337 ms.
[2025-06-06 07:58:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality390283211281871187.gal : 76 ms
[2025-06-06 07:58:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12925956902410557449.prop : 15 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/ReachabilityCardinality390283211281871187.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12925956902410557449.prop' '--nowitness'

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 ...307
Loading property file /tmp/ReachabilityCardinality12925956902410557449.prop.
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :7 after 37
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :37 after 126
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :126 after 5981
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :5981 after 41835
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :41835 after 60763
SDD proceeding with computation,12 properties remain. new max is 256
SDD size :60763 after 95446
SDD proceeding with computation,12 properties remain. new max is 512
SDD size :95446 after 111823
SDD proceeding with computation,12 properties remain. new max is 1024
SDD size :111823 after 115110
SDD proceeding with computation,12 properties remain. new max is 2048
SDD size :115110 after 116094
[2025-06-06 07:58:51] [INFO ] Implicit Places using invariants and state equation in 22998 ms returned []
Implicit Place search using SMT with State Equation took 23611 ms to find 0 implicit places.
[2025-06-06 07:58:52] [INFO ] Redundant transitions in 656 ms returned []
Running 7806 sub problems to find dead transitions.
[2025-06-06 07:58:52] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 07:58:52] [INFO ] Invariant cache hit.
[2025-06-06 07:58:52] [INFO ] State equation strengthened by 147 read => feed constraints.
SDD proceeding with computation,12 properties remain. new max is 4096
SDD size :116094 after 270720
SDD proceeding with computation,12 properties remain. new max is 8192
SDD size :270720 after 303721
SDD proceeding with computation,12 properties remain. new max is 16384
SDD size :303721 after 325001
SDD proceeding with computation,12 properties remain. new max is 32768
SDD size :325001 after 418774

BK_STOP 1749196758126

--------------------
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="Szymanski-PT-b08"
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 Szymanski-PT-b08, 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 r251-tall-174915604900020"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Szymanski-PT-b08.tgz
mv Szymanski-PT-b08 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 ;