fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r156-tall-174881254300592
Last Updated
June 24, 2025

About the Execution of ITS-Tools for PolyORBNT-COL-S05J80

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 3600000.00 0.00 0.00 [undef] Time out reached

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r156-tall-174881254300592.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is PolyORBNT-COL-S05J80, examination is StateSpace
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-tall-174881254300592
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 10K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 94K May 29 14:32 model.pnml

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

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

no data necessary for post analysis


=== Now, execution of the tool begins

BK_START 1749059121907

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StateSpace
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S05J80
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
StateSpace COL
Running Version 202505121319
[2025-06-04 17:45:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StateSpace, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-04 17:45:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 17:45:23] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-04 17:45:23] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-04 17:45:23] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 689 ms
[2025-06-04 17:45:23] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 1269 PT places and 2592.0 transition bindings in 21 ms.
[2025-06-04 17:45:23] [INFO ] Unfolded HLPN to a Petri net with 1269 places and 2430 transitions 14624 arcs in 58 ms.
[2025-06-04 17:45:23] [INFO ] Unfolded 0 HLPN properties in 0 ms.
Deduced a syphon composed of 80 places in 13 ms
Reduce places removed 80 places and 80 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Starting structural reductions in STATESPACE mode, iteration 0 : 1189/1189 places, 1695/1695 transitions.
Running 1689 sub problems to find dead transitions.
[2025-06-04 17:45:24] [INFO ] Flow matrix only has 1691 transitions (discarded 4 similar events)
// Phase 1: matrix 1691 rows 1189 cols
[2025-06-04 17:45:24] [INFO ] Computed 182 invariants in 161 ms
[2025-06-04 17:45:24] [INFO ] State equation strengthened by 1 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1178 variables, 166/166 constraints. Problems are: Problem set: 0 solved, 1689 unsolved
SMT process timed out in 22603ms, After SMT, problems are : Problem set: 0 solved, 1689 unsolved
Search for dead transitions found 0 dead transitions in 22636ms
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 17:45:46] [INFO ] Redundant transitions in 72 ms returned []
Running 1689 sub problems to find dead transitions.
[2025-06-04 17:45:46] [INFO ] Flow matrix only has 1691 transitions (discarded 4 similar events)
[2025-06-04 17:45:46] [INFO ] Invariant cache hit.
[2025-06-04 17:45:46] [INFO ] State equation strengthened by 1 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1178 variables, 166/166 constraints. Problems are: Problem set: 0 solved, 1689 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1178 variables, 5/171 constraints. Problems are: Problem set: 0 solved, 1689 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1178/2880 variables, and 171 constraints, problems are : Problem set: 0 solved, 1689 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 166/175 constraints, Generalized P Invariants (flows): 5/7 constraints, State Equation: 0/1189 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1689/1446 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1689 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1178 variables, 166/166 constraints. Problems are: Problem set: 0 solved, 1689 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1178 variables, 5/171 constraints. Problems are: Problem set: 0 solved, 1689 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:46:41] [INFO ] Deduced a trap composed of 12 places in 370 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 17:46:42] [INFO ] Deduced a trap composed of 14 places in 311 ms of which 31 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1178/2880 variables, and 173 constraints, problems are : Problem set: 0 solved, 1689 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 166/175 constraints, Generalized P Invariants (flows): 5/7 constraints, State Equation: 0/1189 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 243/1446 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61821ms problems are : Problem set: 0 solved, 1689 unsolved
Search for dead transitions found 0 dead transitions in 61826ms
Finished structural reductions in STATESPACE mode , in 1 iterations and 84645 ms. Remains : 1189/1189 places, 1695/1695 transitions.
Final net has 1189 places and 1695 transitions.
[2025-06-04 17:46:48] [INFO ] Flatten gal took : 201 ms
[2025-06-04 17:46:49] [INFO ] Applying decomposition
[2025-06-04 17:46:49] [INFO ] Flatten gal took : 123 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4321380833958645548.txt' '-o' '/tmp/graph4321380833958645548.bin' '-w' '/tmp/graph4321380833958645548.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4321380833958645548.bin' '-l' '-1' '-v' '-w' '/tmp/graph4321380833958645548.weights' '-q' '0' '-e' '0.001'
[2025-06-04 17:46:49] [INFO ] Decomposing Gal with order
[2025-06-04 17:46:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 17:46:50] [INFO ] Removed a total of 2159 redundant transitions.
[2025-06-04 17:46:50] [INFO ] Flatten gal took : 494 ms
[2025-06-04 17:46:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 338 labels/synchronizations in 77 ms.
[2025-06-04 17:46:50] [INFO ] Time to serialize gal into /tmp/StateSpace15688102540831267312.gal : 33 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/StateSpace15688102540831267312.gal' '-t' 'CGAL' '--stats'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...220
ITS-tools command line returned an error code 137
[2025-06-04 18:05:03] [INFO ] Applying decomposition
[2025-06-04 18:05:04] [INFO ] Flatten gal took : 551 ms
[2025-06-04 18:05:04] [INFO ] Decomposing Gal with order
[2025-06-04 18:05:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 18:05:05] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to block in partition [CreatedJobs_0],[CreatedJobs_1],[CreatedJobs_2],[CreatedJobs_3],[CreatedJobs_4],[CreatedJobs_5],[CreatedJobs_6],[CreatedJobs_7],[CreatedJobs_8],[CreatedJobs_9],[CreatedJobs_10],[CreatedJobs_11],[CreatedJobs_12],[CreatedJobs_13],[CreatedJobs_14],[CreatedJobs_15],[CreatedJobs_16],[CreatedJobs_17],[CreatedJobs_18],[CreatedJobs_19],[CreatedJobs_20],[CreatedJobs_21],[CreatedJobs_22],[CreatedJobs_23],[CreatedJobs_24],[CreatedJobs_25],[CreatedJobs_26],[CreatedJobs_27],[CreatedJobs_28],[CreatedJobs_29],[CreatedJobs_30],[CreatedJobs_31],[CreatedJobs_32],[CreatedJobs_33],[CreatedJobs_34],[CreatedJobs_35],[CreatedJobs_36],[CreatedJobs_37],[CreatedJobs_38],[CreatedJobs_39],[CreatedJobs_40],[CreatedJobs_41],[CreatedJobs_42],[CreatedJobs_43],[CreatedJobs_44],[CreatedJobs_45],[CreatedJobs_46],[CreatedJobs_47],[CreatedJobs_48],[CreatedJobs_49],[CreatedJobs_50],[CreatedJobs_51],[CreatedJobs_52],[CreatedJobs_53],[CreatedJobs_54],[CreatedJobs_55],[CreatedJobs_56],[CreatedJobs_57],[CreatedJobs_58],[CreatedJobs_59],[CreatedJobs_60],[CreatedJobs_61],[CreatedJobs_62],[CreatedJobs_63],[CreatedJobs_64],[CreatedJobs_65],[CreatedJobs_66],[CreatedJobs_67],[CreatedJobs_68],[CreatedJobs_69],[CreatedJobs_70],[CreatedJobs_71],[CreatedJobs_72],[CreatedJobs_73],[CreatedJobs_74],[CreatedJobs_75],[CreatedJobs_76],[CreatedJobs_77],[CreatedJobs_78],[CreatedJobs_79],[CreatedJobs_80],[CreatedJobs_81],[CreatedJobs_82],[CreatedJobs_83],[CreatedJobs_84],[CreatedJobs_85],[CreatedJobs_86],[CreatedJobs_87],[CreatedJobs_88],[CreatedJobs_89],[CreatedJobs_90],[CreatedJobs_91],[CreatedJobs_92],[CreatedJobs_93],[CreatedJobs_94],[CreatedJobs_95],[CreatedJobs_96],[CreatedJobs_97],[CreatedJobs_98],[CreatedJobs_99],[CreatedJobs_100],[CreatedJobs_101],[CreatedJobs_102],[CreatedJobs_103],[CreatedJobs_104],[CreatedJobs_105],[CreatedJobs_106],[CreatedJobs_107],[CreatedJobs_108],[CreatedJobs_109],[CreatedJobs_110],[CreatedJobs_111],[CreatedJobs_112],[CreatedJobs_113],[CreatedJobs_114],[CreatedJobs_115],[CreatedJobs_116],[CreatedJobs_117],[CreatedJobs_118],[CreatedJobs_119],[CreatedJobs_120],[CreatedJobs_121],[CreatedJobs_122],[CreatedJobs_123],[CreatedJobs_124],[CreatedJobs_125],[CreatedJobs_126],[CreatedJobs_127],[CreatedJobs_128],[CreatedJobs_129],[CreatedJobs_130],[CreatedJobs_131],[CreatedJobs_132],[CreatedJobs_133],[CreatedJobs_134],[CreatedJobs_135],[CreatedJobs_136],[CreatedJobs_137],[CreatedJobs_138],[CreatedJobs_139],[CreatedJobs_140],[CreatedJobs_141],[CreatedJobs_142],[CreatedJobs_143],[CreatedJobs_144],[CreatedJobs_145],[CreatedJobs_146],[CreatedJobs_147],[CreatedJobs_148],[CreatedJobs_149],[CreatedJobs_150],[CreatedJobs_151],[CreatedJobs_152],[CreatedJobs_153],[CreatedJobs_154],[CreatedJobs_155],[CreatedJobs_156],[CreatedJobs_157],[CreatedJobs_158],[CreatedJobs_159],[CreatedJobs_160],[CreatedJobs_161],[CreatedJobs_162],[CreatedJobs_163],[CreatedJobs_164],[CreatedJobs_165],[CreatedJobs_166],[CreatedJobs_167],[CreatedJobs_168],[CreatedJobs_169],[CreatedJobs_170],[CreatedJobs_171],[CreatedJobs_172],[CreatedJobs_173],[CreatedJobs_174],[CreatedJobs_175],[CreatedJobs_176],[CreatedJobs_177],[CreatedJobs_178],[CreatedJobs_179],[CreatedJobs_180],[CreatedJobs_181],[CreatedJobs_182],[CreatedJobs_183],[CreatedJobs_184],[CreatedJobs_185],[CreatedJobs_186],[CreatedJobs_187],[CreatedJobs_188],[CreatedJobs_189],[CreatedJobs_190],[CreatedJobs_191],[CreatedJobs_192],[CreatedJobs_193],[CreatedJobs_194],[CreatedJobs_195],[CreatedJobs_196],[CreatedJobs_197],[CreatedJobs_198],[CreatedJobs_199],[CreatedJobs_200],[CreatedJobs_201],[CreatedJobs_202],[CreatedJobs_203],[CreatedJobs_204],[CreatedJobs_205],[CreatedJobs_206],[CreatedJobs_207],[CreatedJobs_208],[CreatedJobs_209],[CreatedJobs_210],[CreatedJobs_211],[CreatedJobs_212],[CreatedJobs_213],[CreatedJobs_214],[CreatedJobs_215],[CreatedJobs_216],[CreatedJobs_217],[CreatedJobs_218],[CreatedJobs_219],[CreatedJobs_220],[CreatedJobs_221],[CreatedJobs_222],[CreatedJobs_223],[CreatedJobs_224],[CreatedJobs_225],[CreatedJobs_226],[CreatedJobs_227],[CreatedJobs_228],[CreatedJobs_229],[CreatedJobs_230],[CreatedJobs_231],[CreatedJobs_232],[CreatedJobs_233],[CreatedJobs_234],[CreatedJobs_235],[CreatedJobs_236],[CreatedJobs_237],[CreatedJobs_238],[CreatedJobs_239],[CreatedJobs_240],[CreatedJobs_241],[CreatedJobs_242],[CreatedJobs_243],[CreatedJobs_244],[CreatedJobs_245],[CreatedJobs_246],[CreatedJobs_247],[CreatedJobs_248],[CreatedJobs_249],[CreatedJobs_250],[CreatedJobs_251],[CreatedJobs_252],[CreatedJobs_253],[CreatedJobs_254],[CreatedJobs_255],[CreatedJobs_256],[CreatedJobs_257],[CreatedJobs_258],[CreatedJobs_259],[CreatedJobs_260],[CreatedJobs_261],[CreatedJobs_262],[CreatedJobs_263],[CreatedJobs_264],[CreatedJobs_265],[CreatedJobs_266],[CreatedJobs_267],[CreatedJobs_268],[CreatedJobs_269],[CreatedJobs_270],[CreatedJobs_271],[CreatedJobs_272],[CreatedJobs_273],[CreatedJobs_274],[CreatedJobs_275],[CreatedJobs_276],[CreatedJobs_277],[CreatedJobs_278],[CreatedJobs_279],[CreatedJobs_280],[CreatedJobs_281],[CreatedJobs_282],[CreatedJobs_283],[CreatedJobs_284],[CreatedJobs_285],[CreatedJobs_286],[CreatedJobs_287],[CreatedJobs_288],[CreatedJobs_289],[CreatedJobs_290],[CreatedJobs_291],[CreatedJobs_292],[CreatedJobs_293],[CreatedJobs_294],[CreatedJobs_295],[CreatedJobs_296],[CreatedJobs_297],[CreatedJobs_298],[CreatedJobs_299],[CreatedJobs_300],[CreatedJobs_301],[CreatedJobs_302],[CreatedJobs_303],[CreatedJobs_304],[CreatedJobs_305],[CreatedJobs_306],[CreatedJobs_307],[CreatedJobs_308],[CreatedJobs_309],[CreatedJobs_310],[CreatedJobs_311],[CreatedJobs_312],[CreatedJobs_313],[CreatedJobs_314],[CreatedJobs_315],[CreatedJobs_316],[CreatedJobs_317],[CreatedJobs_318],[CreatedJobs_319],[CreatedJobs_320],[CreatedJobs_321],[CreatedJobs_322],[CreatedJobs_323],[CreatedJobs_324],[CreatedJobs_325],[CreatedJobs_326],[CreatedJobs_327],[CreatedJobs_328],[CreatedJobs_329],[CreatedJobs_330],[CreatedJobs_331],[CreatedJobs_332],[CreatedJobs_333],[CreatedJobs_334],[CreatedJobs_335],[CreatedJobs_336],[CreatedJobs_337],[CreatedJobs_338],[CreatedJobs_339],[CreatedJobs_340],[CreatedJobs_341],[CreatedJobs_342],[CreatedJobs_343],[CreatedJobs_344],[CreatedJobs_345],[CreatedJobs_346],[CreatedJobs_347],[CreatedJobs_348],[CreatedJobs_349],[CreatedJobs_350],[CreatedJobs_351],[CreatedJobs_352],[CreatedJobs_353],[CreatedJobs_354],[CreatedJobs_355],[CreatedJobs_356],[CreatedJobs_357],[CreatedJobs_358],[CreatedJobs_359],[CreatedJobs_360],[CreatedJobs_361],[CreatedJobs_362],[CreatedJobs_363],[CreatedJobs_364],[CreatedJobs_365],[CreatedJobs_366],[CreatedJobs_367],[CreatedJobs_368],[CreatedJobs_369],[CreatedJobs_370],[CreatedJobs_371],[CreatedJobs_372],[CreatedJobs_373],[CreatedJobs_374],[CreatedJobs_375],[CreatedJobs_376],[CreatedJobs_377],[CreatedJobs_378],[CreatedJobs_379],[CreatedJobs_380],[CreatedJobs_381],[CreatedJobs_382],[CreatedJobs_383],[CreatedJobs_384],[CreatedJobs_385],[CreatedJobs_386],[CreatedJobs_387],[CreatedJobs_388],[CreatedJobs_389],[CreatedJobs_390],[CreatedJobs_391],[CreatedJobs_392],[CreatedJobs_393],[CreatedJobs_394],[CreatedJobs_395],[CreatedJobs_396],[CreatedJobs_397],[CreatedJobs_398],[CreatedJobs_399],[CreatedJobs_400],[CreatedJobs_401],[CreatedJobs_402],[CreatedJobs_403],[CreatedJobs_404],[Schedule_Task_E_0],[Schedule_Task_E_1],[Schedule_Task_E_2],[Schedule_Task_E_3],[Schedule_Task_E_4],[Schedule_Task_E_5],[Schedule_Task_E_6],[Schedule_Task_E_7],[Schedule_Task_E_8],[Schedule_Task_E_9],[Schedule_Task_E_10],[Schedule_Task_E_11],[Schedule_Task_E_12],[Schedule_Task_E_13],[Schedule_Task_E_14],[Schedule_Task_E_15],[Schedule_Task_E_16],[Schedule_Task_E_17],[Schedule_Task_E_18],[Schedule_Task_E_19],[Schedule_Task_E_20],[Schedule_Task_E_21],[Schedule_Task_E_22],[Schedule_Task_E_23],[Schedule_Task_E_24],[Schedule_Task_E_25],[Schedule_Task_E_26],[Schedule_Task_E_27],[Schedule_Task_E_28],[Schedule_Task_E_29],[Schedule_Task_E_30],[Schedule_Task_E_31],[Schedule_Task_E_32],[Schedule_Task_E_33],[Schedule_Task_E_34],[Schedule_Task_E_35],[Schedule_Task_E_36],[Schedule_Task_E_37],[Schedule_Task_E_38],[Schedule_Task_E_39],[Schedule_Task_E_40],[Schedule_Task_E_41],[Schedule_Task_E_42],[Schedule_Task_E_43],[Schedule_Task_E_44],[Schedule_Task_E_45],[Schedule_Task_E_46],[Schedule_Task_E_47],[Schedule_Task_E_48],[Schedule_Task_E_49],[Schedule_Task_E_50],[Schedule_Task_E_51],[Schedule_Task_E_52],[Schedule_Task_E_53],[Schedule_Task_E_54],[Schedule_Task_E_55],[Schedule_Task_E_56],[Schedule_Task_E_57],[Schedule_Task_E_58],[Schedule_Task_E_59],[Schedule_Task_E_60],[Schedule_Task_E_61],[Schedule_Task_E_62],[Schedule_Task_E_63],[Schedule_Task_E_64],[Schedule_Task_E_65],[Schedule_Task_E_66],[Schedule_Task_E_67],[Schedule_Task_E_68],[Schedule_Task_E_69],[Schedule_Task_E_70],[Schedule_Task_E_71],[Schedule_Task_E_72],[Schedule_Task_E_73],[Schedule_Task_E_74],[Schedule_Task_E_75],[Schedule_Task_E_76],[Schedule_Task_E_77],[Schedule_Task_E_78],[Schedule_Task_E_79],[Schedule_Task_E_80],[Schedule_Task_E_81],[f3_0, f2_0, f1_0, AvailableJobId_0],[f3_1, f2_1, f1_1, AvailableJobId_1],[f3_2, f2_2, f1_2, AvailableJobId_2],[f3_3, f2_3, f1_3, AvailableJobId_3],[f3_4, f2_4, f1_4, AvailableJobId_4],[f3_5, f2_5, f1_5, AvailableJobId_5],[f3_6, f2_6, f1_6, AvailableJobId_6],[f3_7, f2_7, f1_7, AvailableJobId_7],[f3_8, f2_8, f1_8, AvailableJobId_8],[f3_9, f2_9, f1_9, AvailableJobId_9],[f3_10, f2_10, f1_10, AvailableJobId_10],[f3_11, f2_11, f1_11, AvailableJobId_11],[f3_12, f2_12, f1_12, AvailableJobId_12],[f3_13, f2_13, f1_13, AvailableJobId_13],[f3_14, f2_14, f1_14, AvailableJobId_14],[f3_15, f2_15, f1_15, AvailableJobId_15],[f3_16, f2_16, f1_16, AvailableJobId_16],[f3_17, f2_17, f1_17, AvailableJobId_17],[f3_18, f2_18, f1_18, AvailableJobId_18],[f3_19, f2_19, f1_19, AvailableJobId_19],[f3_20, f2_20, f1_20, AvailableJobId_20],[f3_21, f2_21, f1_21, AvailableJobId_21],[f3_22, f2_22, f1_22, AvailableJobId_22],[f3_23, f2_23, f1_23, AvailableJobId_23],[f3_24, f2_24, f1_24, AvailableJobId_24],[f3_25, f2_25, f1_25, AvailableJobId_25],[f3_26, f2_26, f1_26, AvailableJobId_26],[f3_27, f2_27, f1_27, AvailableJobId_27],[f3_28, f2_28, f1_28, AvailableJobId_28],[f3_29, f2_29, f1_29, AvailableJobId_29],[f3_30, f2_30, f1_30, AvailableJobId_30],[f3_31, f2_31, f1_31, AvailableJobId_31],[f3_32, f2_32, f1_32, AvailableJobId_32],[f3_33, f2_33, f1_33, AvailableJobId_33],[f3_34, f2_34, f1_34, AvailableJobId_34],[f3_35, f2_35, f1_35, AvailableJobId_35],[f3_36, f2_36, f1_36, AvailableJobId_36],[f3_37, f2_37, f1_37, AvailableJobId_37],[f3_38, f2_38, f1_38, AvailableJobId_38],[f3_39, f2_39, f1_39, AvailableJobId_39],[f3_40, f2_40, f1_40, AvailableJobId_40],[f3_41, f2_41, f1_41, AvailableJobId_41],[f3_42, f2_42, f1_42, AvailableJobId_42],[f3_43, f2_43, f1_43, AvailableJobId_43],[f3_44, f2_44, f1_44, AvailableJobId_44],[f3_45, f2_45, f1_45, AvailableJobId_45],[f3_46, f2_46, f1_46, AvailableJobId_46],[f3_47, f2_47, f1_47, AvailableJobId_47],[f3_48, f2_48, f1_48, AvailableJobId_48],[f3_49, f2_49, f1_49, AvailableJobId_49],[f3_50, f2_50, f1_50, AvailableJobId_50],[f3_51, f2_51, f1_51, AvailableJobId_51],[f3_52, f2_52, f1_52, AvailableJobId_52],[f3_53, f2_53, f1_53, AvailableJobId_53],[f3_54, f2_54, f1_54, AvailableJobId_54],[f3_55, f2_55, f1_55, AvailableJobId_55],[f3_56, f2_56, f1_56, AvailableJobId_56],[f3_57, f2_57, f1_57, AvailableJobId_57],[f3_58, f2_58, f1_58, AvailableJobId_58],[f3_59, f2_59, f1_59, AvailableJobId_59],[f3_60, f2_60, f1_60, AvailableJobId_60],[f3_61, f2_61, f1_61, AvailableJobId_61],[f3_62, f2_62, f1_62, AvailableJobId_62],[f3_63, f2_63, f1_63, AvailableJobId_63],[f3_64, f2_64, f1_64, AvailableJobId_64],[f3_65, f2_65, f1_65, AvailableJobId_65],[f3_66, f2_66, f1_66, AvailableJobId_66],[f3_67, f2_67, f1_67, AvailableJobId_67],[f3_68, f2_68, f1_68, AvailableJobId_68],[f3_69, f2_69, f1_69, AvailableJobId_69],[f3_70, f2_70, f1_70, AvailableJobId_70],[f3_71, f2_71, f1_71, AvailableJobId_71],[f3_72, f2_72, f1_72, AvailableJobId_72],[f3_73, f2_73, f1_73, AvailableJobId_73],[f3_74, f2_74, f1_74, AvailableJobId_74],[f3_75, f2_75, f1_75, AvailableJobId_75],[f3_76, f2_76, f1_76, AvailableJobId_76],[f3_77, f2_77, f1_77, AvailableJobId_77],[f3_78, f2_78, f1_78, AvailableJobId_78],[f3_79, f2_79, f1_79, AvailableJobId_79],[f3_80, f2_80, f1_80, AvailableJobId_80],[FetchJobE_0, QueueJobB_0, NotifyEventJobQueuedB_0, Perform_Work_B_0],[FetchJobE_1, QueueJobB_1, NotifyEventJobQueuedB_1, Perform_Work_B_1],[FetchJobE_2, QueueJobB_2, NotifyEventJobQueuedB_2, Perform_Work_B_2],[FetchJobE_3, QueueJobB_3, NotifyEventJobQueuedB_3, Perform_Work_B_3],[FetchJobE_4, QueueJobB_4, NotifyEventJobQueuedB_4, Perform_Work_B_4],[FetchJobE_5, QueueJobB_5, NotifyEventJobQueuedB_5, Perform_Work_B_5],[FetchJobE_6, QueueJobB_6, NotifyEventJobQueuedB_6, Perform_Work_B_6],[FetchJobE_7, QueueJobB_7, NotifyEventJobQueuedB_7, Perform_Work_B_7],[FetchJobE_8, QueueJobB_8, NotifyEventJobQueuedB_8, Perform_Work_B_8],[FetchJobE_9, QueueJobB_9, NotifyEventJobQueuedB_9, Perform_Work_B_9],[FetchJobE_10, QueueJobB_10, NotifyEventJobQueuedB_10, Perform_Work_B_10],[FetchJobE_11, QueueJobB_11, NotifyEventJobQueuedB_11, Perform_Work_B_11],[FetchJobE_12, QueueJobB_12, NotifyEventJobQueuedB_12, Perform_Work_B_12],[FetchJobE_13, QueueJobB_13, NotifyEventJobQueuedB_13, Perform_Work_B_13],[FetchJobE_14, QueueJobB_14, NotifyEventJobQueuedB_14, Perform_Work_B_14],[FetchJobE_15, QueueJobB_15, NotifyEventJobQueuedB_15, Perform_Work_B_15],[FetchJobE_16, QueueJobB_16, NotifyEventJobQueuedB_16, Perform_Work_B_16],[FetchJobE_17, QueueJobB_17, NotifyEventJobQueuedB_17, Perform_Work_B_17],[FetchJobE_18, QueueJobB_18, NotifyEventJobQueuedB_18, Perform_Work_B_18],[FetchJobE_19, QueueJobB_19, NotifyEventJobQueuedB_19, Perform_Work_B_19],[FetchJobE_20, QueueJobB_20, NotifyEventJobQueuedB_20, Perform_Work_B_20],[FetchJobE_21, QueueJobB_21, NotifyEventJobQueuedB_21, Perform_Work_B_21],[FetchJobE_22, QueueJobB_22, NotifyEventJobQueuedB_22, Perform_Work_B_22],[FetchJobE_23, QueueJobB_23, NotifyEventJobQueuedB_23, Perform_Work_B_23],[FetchJobE_24, QueueJobB_24, NotifyEventJobQueuedB_24, Perform_Work_B_24],[FetchJobE_25, QueueJobB_25, NotifyEventJobQueuedB_25, Perform_Work_B_25],[FetchJobE_26, QueueJobB_26, NotifyEventJobQueuedB_26, Perform_Work_B_26],[FetchJobE_27, QueueJobB_27, NotifyEventJobQueuedB_27, Perform_Work_B_27],[FetchJobE_28, QueueJobB_28, NotifyEventJobQueuedB_28, Perform_Work_B_28],[FetchJobE_29, QueueJobB_29, NotifyEventJobQueuedB_29, Perform_Work_B_29],[FetchJobE_30, QueueJobB_30, NotifyEventJobQueuedB_30, Perform_Work_B_30],[FetchJobE_31, QueueJobB_31, NotifyEventJobQueuedB_31, Perform_Work_B_31],[FetchJobE_32, QueueJobB_32, NotifyEventJobQueuedB_32, Perform_Work_B_32],[FetchJobE_33, QueueJobB_33, NotifyEventJobQueuedB_33, Perform_Work_B_33],[FetchJobE_34, QueueJobB_34, NotifyEventJobQueuedB_34, Perform_Work_B_34],[FetchJobE_35, QueueJobB_35, NotifyEventJobQueuedB_35, Perform_Work_B_35],[FetchJobE_36, QueueJobB_36, NotifyEventJobQueuedB_36, Perform_Work_B_36],[FetchJobE_37, QueueJobB_37, NotifyEventJobQueuedB_37, Perform_Work_B_37],[FetchJobE_38, QueueJobB_38, NotifyEventJobQueuedB_38, Perform_Work_B_38],[FetchJobE_39, QueueJobB_39, NotifyEventJobQueuedB_39, Perform_Work_B_39],[FetchJobE_40, QueueJobB_40, NotifyEventJobQueuedB_40, Perform_Work_B_40],[FetchJobE_41, QueueJobB_41, NotifyEventJobQueuedB_41, Perform_Work_B_41],[FetchJobE_42, QueueJobB_42, NotifyEventJobQueuedB_42, Perform_Work_B_42],[FetchJobE_43, QueueJobB_43, NotifyEventJobQueuedB_43, Perform_Work_B_43],[FetchJobE_44, QueueJobB_44, NotifyEventJobQueuedB_44, Perform_Work_B_44],[FetchJobE_45, QueueJobB_45, NotifyEventJobQueuedB_45, Perform_Work_B_45],[FetchJobE_46, QueueJobB_46, NotifyEventJobQueuedB_46, Perform_Work_B_46],[FetchJobE_47, QueueJobB_47, NotifyEventJobQueuedB_47, Perform_Work_B_47],[FetchJobE_48, QueueJobB_48, NotifyEventJobQueuedB_48, Perform_Work_B_48],[FetchJobE_49, QueueJobB_49, NotifyEventJobQueuedB_49, Perform_Work_B_49],[FetchJobE_50, QueueJobB_50, NotifyEventJobQueuedB_50, Perform_Work_B_50],[FetchJobE_51, QueueJobB_51, NotifyEventJobQueuedB_51, Perform_Work_B_51],[FetchJobE_52, QueueJobB_52, NotifyEventJobQueuedB_52, Perform_Work_B_52],[FetchJobE_53, QueueJobB_53, NotifyEventJobQueuedB_53, Perform_Work_B_53],[FetchJobE_54, QueueJobB_54, NotifyEventJobQueuedB_54, Perform_Work_B_54],[FetchJobE_55, QueueJobB_55, NotifyEventJobQueuedB_55, Perform_Work_B_55],[FetchJobE_56, QueueJobB_56, NotifyEventJobQueuedB_56, Perform_Work_B_56],[FetchJobE_57, QueueJobB_57, NotifyEventJobQueuedB_57, Perform_Work_B_57],[FetchJobE_58, QueueJobB_58, NotifyEventJobQueuedB_58, Perform_Work_B_58],[FetchJobE_59, QueueJobB_59, NotifyEventJobQueuedB_59, Perform_Work_B_59],[FetchJobE_60, QueueJobB_60, NotifyEventJobQueuedB_60, Perform_Work_B_60],[FetchJobE_61, QueueJobB_61, NotifyEventJobQueuedB_61, Perform_Work_B_61],[FetchJobE_62, QueueJobB_62, NotifyEventJobQueuedB_62, Perform_Work_B_62],[FetchJobE_63, QueueJobB_63, NotifyEventJobQueuedB_63, Perform_Work_B_63],[FetchJobE_64, QueueJobB_64, NotifyEventJobQueuedB_64, Perform_Work_B_64],[FetchJobE_65, QueueJobB_65, NotifyEventJobQueuedB_65, Perform_Work_B_65],[FetchJobE_66, QueueJobB_66, NotifyEventJobQueuedB_66, Perform_Work_B_66],[FetchJobE_67, QueueJobB_67, NotifyEventJobQueuedB_67, Perform_Work_B_67],[FetchJobE_68, QueueJobB_68, NotifyEventJobQueuedB_68, Perform_Work_B_68],[FetchJobE_69, QueueJobB_69, NotifyEventJobQueuedB_69, Perform_Work_B_69],[FetchJobE_70, QueueJobB_70, NotifyEventJobQueuedB_70, Perform_Work_B_70],[FetchJobE_71, QueueJobB_71, NotifyEventJobQueuedB_71, Perform_Work_B_71],[FetchJobE_72, QueueJobB_72, NotifyEventJobQueuedB_72, Perform_Work_B_72],[FetchJobE_73, QueueJobB_73, NotifyEventJobQueuedB_73, Perform_Work_B_73],[FetchJobE_74, QueueJobB_74, NotifyEventJobQueuedB_74, Perform_Work_B_74],[FetchJobE_75, QueueJobB_75, NotifyEventJobQueuedB_75, Perform_Work_B_75],[FetchJobE_76, QueueJobB_76, NotifyEventJobQueuedB_76, Perform_Work_B_76],[FetchJobE_77, QueueJobB_77, NotifyEventJobQueuedB_77, Perform_Work_B_77],[FetchJobE_78, QueueJobB_78, NotifyEventJobQueuedB_78, Perform_Work_B_78],[FetchJobE_79, QueueJobB_79, NotifyEventJobQueuedB_79, Perform_Work_B_79],[FetchJobE_80, QueueJobB_80, NotifyEventJobQueuedB_80, Perform_Work_B_80],[place_482_0],[place_482_1],[place_482_2],[place_482_3],[place_482_4],[ModifiedSrc_0, DataOnSrc_0, TheSour_0],[ModifiedSrc_1, DataOnSrc_1, TheSour_1],[ModifiedSrc_2, DataOnSrc_2, TheSour_2],[ModifiedSrc_3, DataOnSrc_3, TheSour_3],[ModifiedSrc_4, DataOnSrc_4, TheSour_4],

at fr.lip6.move.gal.instantiate.CompositeBuilder$Partition.getIndex(CompositeBuilder.java:1421)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:556)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:133)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:124)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:536)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
[2025-06-04 18:05:05] [INFO ] Flatten gal took : 343 ms
[2025-06-04 18:05:05] [INFO ] Time to serialize gal into /tmp/StateSpace1191591611907071552.gal : 43 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/StateSpace1191591611907071552.gal' '-t' 'CGAL' '--stats' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...240
Detected timeout of ITS tools.
[2025-06-04 18:25:37] [INFO ] Flatten gal took : 420 ms
[2025-06-04 18:25:42] [INFO ] Input system was already deterministic with 1695 transitions.
[2025-06-04 18:25:42] [INFO ] Transformed 1189 places.
[2025-06-04 18:25:42] [INFO ] Transformed 1695 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-06-04 18:26:22] [INFO ] Time to serialize gal into /tmp/StateSpace3274731016233636958.gal : 24 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/StateSpace3274731016233636958.gal' '-t' 'CGAL' '--stats' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...285
Successfully loaded order from file /home/mcc/execution/model.ord

BK_TIME_CONFINEMENT_REACHED

--------------------
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
+ [[ StateSpace = StateSpace ]]
+ [[ -f modelMain.xml ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution StateSpace -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination StateSpace -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="PolyORBNT-COL-S05J80"
export BK_EXAMINATION="StateSpace"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is PolyORBNT-COL-S05J80, examination is StateSpace"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r156-tall-174881254300592"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S05J80.tgz
mv PolyORBNT-COL-S05J80 execution
cd execution
if [ "StateSpace" = "ReachabilityDeadlock" ] || [ "StateSpace" = "UpperBounds" ] || [ "StateSpace" = "QuasiLiveness" ] || [ "StateSpace" = "StableMarking" ] || [ "StateSpace" = "Liveness" ] || [ "StateSpace" = "OneSafe" ] || [ "StateSpace" = "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 [ "StateSpace" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StateSpace" != "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 "StateSpace.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 '' StateSpace.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StateSpace" = "ReachabilityDeadlock" ] || [ "StateSpace" = "QuasiLiveness" ] || [ "StateSpace" = "StableMarking" ] || [ "StateSpace" = "Liveness" ] || [ "StateSpace" = "OneSafe" ] ; then
echo "FORMULA_NAME StateSpace"
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 ;