Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r354-tall-178024402800146.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is LastZero-PT-N24, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r354-tall-178024402800146
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.6M
-rw-r--r-- 1 mcc users 8.0K May 27 10:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 27 10:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 27 10:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K May 27 10:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 203K May 27 10:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 751K May 27 10:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 27 10:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 27 10:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 13K May 27 10:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K May 27 10:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 27 10:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K May 27 10:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 18K May 27 10:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 49K May 27 10:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 4 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 5.2M Jun 10 11:58 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1781100134758

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LastZero-PT-N24
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-06-10 14:02:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-06-10 14:02:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-10 14:02:16] [INFO ] Load time of PNML (sax parser for PT used): 357 ms
[2026-06-10 14:02:16] [INFO ] Transformed 1300 places.
[2026-06-10 14:02:16] [INFO ] Transformed 16777 transitions.
[2026-06-10 14:02:16] [INFO ] Parsed PT model containing 1300 places and 16777 transitions and 51483 arcs in 501 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 16 ms.
Deduced a syphon composed of 626 places in 87 ms
Reduce places removed 626 places and 10977 transitions.
Reduce places removed 1 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA LastZero-PT-N24-CTLFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N24-CTLFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N24-CTLFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N24-CTLFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N24-CTLFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 673 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 673/673 places, 5800/5800 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 672 transition count 5800
Applied a total of 1 rules in 83 ms. Remains 672 /673 variables (removed 1) and now considering 5800/5800 (removed 0) transitions.
[2026-06-10 14:02:16] [INFO ] Flow matrix only has 5524 transitions (discarded 276 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4297149779245081864.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17753712272128324050.kers'
[2026-06-10 14:02:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4297149779245081864.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17753712272128324050.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 2 ms.
// Phase 1: matrix 5524 rows 671 cols 15646 entries
Finished phase 1 with 648 SingleSign rule and 0 generalized
[2026-06-10 14:02:16] [INFO ] Computed 24 invariants in 15 ms
Computed 24 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-17753712272128324050.kers
Total runtime 20 ms.
[2026-06-10 14:02:17] [INFO ] Implicit Places using invariants in 849 ms returned []
[2026-06-10 14:02:17] [INFO ] Flow matrix only has 5524 transitions (discarded 276 similar events)
[2026-06-10 14:02:17] [INFO ] Invariant cache hit.
[2026-06-10 14:02:18] [INFO ] State equation strengthened by 600 read => feed constraints.
[2026-06-10 14:02:48] [INFO ] Performed 452/672 implicitness test of which 1 returned IMPLICIT in 30 seconds.
[2026-06-10 14:03:07] [INFO ] Implicit Places using invariants and state equation in 49827 ms returned [255]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 50725 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 671/673 places, 5800/5800 transitions.
Applied a total of 0 rules in 41 ms. Remains 671 /671 variables (removed 0) and now considering 5800/5800 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 50863 ms. Remains : 671/673 places, 5800/5800 transitions.
Starting structural reductions in LTL mode, iteration 0 : 671/671 places, 5800/5800 transitions.
Applied a total of 0 rules in 19 ms. Remains 671 /671 variables (removed 0) and now considering 5800/5800 (removed 0) transitions.
[2026-06-10 14:03:07] [INFO ] Flow matrix only has 5524 transitions (discarded 276 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16802212897863222496.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3552029223060763747.kers'
[2026-06-10 14:03:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16802212897863222496.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3552029223060763747.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 2 ms.
// Phase 1: matrix 5524 rows 670 cols 15622 entries
Finished phase 1 with 648 SingleSign rule and 0 generalized
[2026-06-10 14:03:07] [INFO ] Computed 23 invariants in 15 ms
Computed 23 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-3552029223060763747.kers
Total runtime 22 ms.
[2026-06-10 14:03:08] [INFO ] Implicit Places using invariants in 492 ms returned []
[2026-06-10 14:03:08] [INFO ] Flow matrix only has 5524 transitions (discarded 276 similar events)
[2026-06-10 14:03:08] [INFO ] Invariant cache hit.
[2026-06-10 14:03:08] [INFO ] State equation strengthened by 600 read => feed constraints.
[2026-06-10 14:03:39] [INFO ] Performed 381/671 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-06-10 14:04:09] [INFO ] Performed 529/671 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-06-10 14:04:31] [INFO ] Implicit Places using invariants and state equation in 82994 ms returned []
Implicit Place search using SMT with State Equation took 83491 ms to find 0 implicit places.
Running 5776 sub problems to find dead transitions.
[2026-06-10 14:04:31] [INFO ] Flow matrix only has 5524 transitions (discarded 276 similar events)
[2026-06-10 14:04:31] [INFO ] Invariant cache hit.
[2026-06-10 14:04:31] [INFO ] State equation strengthened by 600 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 5776 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 670/6195 variables, and 23 constraints, problems are : Problem set: 0 solved, 5776 unsolved in 30122 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/671 constraints, ReadFeed: 0/600 constraints, PredecessorRefiner: 5776/5776 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5776 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 5776 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 670/6195 variables, and 23 constraints, problems are : Problem set: 0 solved, 5776 unsolved in 30083 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/671 constraints, ReadFeed: 0/600 constraints, PredecessorRefiner: 0/5776 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64601ms problems are : Problem set: 0 solved, 5776 unsolved
Search for dead transitions found 0 dead transitions in 64664ms
Finished structural reductions in LTL mode , in 1 iterations and 148238 ms. Remains : 671/671 places, 5800/5800 transitions.
Support contains 43 out of 671 places after structural reductions.
[2026-06-10 14:05:36] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2026-06-10 14:05:36] [INFO ] Flatten gal took : 348 ms
[2026-06-10 14:05:36] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA LastZero-PT-N24-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N24-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N24-CTLFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N24-CTLFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-06-10 14:05:36] [INFO ] Flatten gal took : 212 ms
[2026-06-10 14:05:36] [INFO ] Input system was already deterministic with 5800 transitions.
Support contains 27 out of 671 places (down from 43) after GAL structural reductions.
RANDOM walk for 40000 steps (544 resets) in 2450 ms. (16 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (45 resets) in 468 ms. (85 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (45 resets) in 135 ms. (294 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (45 resets) in 167 ms. (238 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (45 resets) in 160 ms. (248 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (44 resets) in 282 ms. (141 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (44 resets) in 192 ms. (207 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (44 resets) in 115 ms. (344 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (45 resets) in 118 ms. (336 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (45 resets) in 114 ms. (347 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (45 resets) in 84 ms. (470 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (44 resets) in 135 ms. (294 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (44 resets) in 96 ms. (412 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 92729 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :0 out of 12
Probabilistic random walk after 92729 steps, saw 20247 distinct states, run finished after 3006 ms. (steps per millisecond=30 ) properties seen :0
[2026-06-10 14:05:41] [INFO ] Flow matrix only has 5524 transitions (discarded 276 similar events)
[2026-06-10 14:05:41] [INFO ] Invariant cache hit.
[2026-06-10 14:05:41] [INFO ] State equation strengthened by 600 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 141/168 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 2838/3006 variables, 168/176 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3006 variables, 23/199 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3006 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
At refinement iteration 6 (OVERLAPS) 895/3901 variables, 186/385 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3901 variables, 239/624 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3901 variables, 0/624 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 4/3905 variables, 2/626 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3905 variables, 0/626 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 4/3909 variables, 2/628 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3909 variables, 2/630 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3909 variables, 0/630 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 4/3913 variables, 2/632 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3913 variables, 1/633 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3913 variables, 0/633 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 4/3917 variables, 2/635 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3917 variables, 0/635 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 4/3921 variables, 2/637 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3921 variables, 1/638 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3921 variables, 0/638 constraints. Problems are: Problem set: 9 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 4/3925 variables, 2/640 constraints. Problems are: Problem set: 9 solved, 3 unsolved
SMT process timed out in 5054ms, After SMT, problems are : Problem set: 9 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 671 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 671/671 places, 5800/5800 transitions.
Graph (complete) has 6097 edges and 671 vertex of which 656 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.11 ms
Discarding 15 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 0 with 120 rules applied. Total rules applied 121 place count 656 transition count 5680
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 121 place count 656 transition count 5679
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 123 place count 655 transition count 5679
Applied a total of 123 rules in 145 ms. Remains 655 /671 variables (removed 16) and now considering 5679/5800 (removed 121) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 655/671 places, 5679/5800 transitions.
RANDOM walk for 40000 steps (700 resets) in 1349 ms. (29 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (48 resets) in 159 ms. (250 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (48 resets) in 111 ms. (357 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (48 resets) in 106 ms. (373 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 109712 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :0 out of 3
Probabilistic random walk after 109712 steps, saw 22956 distinct states, run finished after 3001 ms. (steps per millisecond=36 ) properties seen :0
[2026-06-10 14:05:50] [INFO ] Flow matrix only has 5508 transitions (discarded 171 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17063734689343716805.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16891429659885705141.kers'
[2026-06-10 14:05:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17063734689343716805.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16891429659885705141.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 2 ms.
// Phase 1: matrix 5508 rows 654 cols 15590 entries
Finished phase 1 with 632 SingleSign rule and 0 generalized
[2026-06-10 14:05:50] [INFO ] Computed 23 invariants in 16 ms
Computed 23 P flows in 23 ms.
Exported basis to /tmp/petrispot-output-16891429659885705141.kers
Total runtime 29 ms.
[2026-06-10 14:05:50] [INFO ] State equation strengthened by 585 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 45/53 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 722/775 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/775 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/775 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 134/909 variables, 47/109 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/909 variables, 58/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/909 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2/911 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/911 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/913 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/913 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 2/915 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/915 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 2/917 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/917 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 2/919 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/919 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 2/921 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/921 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 1/922 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/922 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 3514/4436 variables, 64/238 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/4436 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 898/5334 variables, 371/609 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/5334 variables, 8/617 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 27 (INCLUDED_ONLY) 0/5334 variables, 323/940 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/5334 variables, 0/940 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 39/5373 variables, 24/964 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/5373 variables, 1/965 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/5373 variables, 2/967 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/5373 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (OVERLAPS) 121/5494 variables, 11/978 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/5494 variables, 0/978 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (OVERLAPS) 45/5539 variables, 23/1001 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/5539 variables, 1/1002 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/5539 variables, 11/1013 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/5539 variables, 0/1013 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (OVERLAPS) 1/5540 variables, 1/1014 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/5540 variables, 0/1014 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (OVERLAPS) 100/5640 variables, 10/1024 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/5640 variables, 0/1024 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (OVERLAPS) 41/5681 variables, 21/1045 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/5681 variables, 1/1046 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/5681 variables, 10/1056 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/5681 variables, 0/1056 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (OVERLAPS) 1/5682 variables, 1/1057 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/5682 variables, 0/1057 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (OVERLAPS) 81/5763 variables, 9/1066 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/5763 variables, 0/1066 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (OVERLAPS) 37/5800 variables, 19/1085 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/5800 variables, 1/1086 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/5800 variables, 9/1095 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/5800 variables, 0/1095 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (OVERLAPS) 1/5801 variables, 1/1096 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/5801 variables, 0/1096 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (OVERLAPS) 64/5865 variables, 8/1104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/5865 variables, 0/1104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 59 (OVERLAPS) 33/5898 variables, 17/1121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/5898 variables, 1/1122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/5898 variables, 8/1130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/5898 variables, 0/1130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 63 (OVERLAPS) 1/5899 variables, 1/1131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/5899 variables, 0/1131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 65 (OVERLAPS) 49/5948 variables, 7/1138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/5948 variables, 0/1138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 67 (OVERLAPS) 29/5977 variables, 15/1153 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/5977 variables, 1/1154 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/5977 variables, 7/1161 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/5977 variables, 0/1161 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 71 (OVERLAPS) 1/5978 variables, 1/1162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/5978 variables, 0/1162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 73 (OVERLAPS) 36/6014 variables, 6/1168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/6014 variables, 0/1168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 75 (OVERLAPS) 25/6039 variables, 13/1181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/6039 variables, 1/1182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/6039 variables, 6/1188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/6039 variables, 0/1188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 79 (OVERLAPS) 1/6040 variables, 1/1189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/6040 variables, 0/1189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 81 (OVERLAPS) 25/6065 variables, 5/1194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/6065 variables, 0/1194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 83 (OVERLAPS) 21/6086 variables, 11/1205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/6086 variables, 1/1206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/6086 variables, 5/1211 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/6086 variables, 0/1211 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 87 (OVERLAPS) 1/6087 variables, 1/1212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/6087 variables, 0/1212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 89 (OVERLAPS) 16/6103 variables, 4/1216 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/6103 variables, 0/1216 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 91 (OVERLAPS) 17/6120 variables, 9/1225 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/6120 variables, 1/1226 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/6120 variables, 4/1230 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/6120 variables, 0/1230 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 95 (OVERLAPS) 1/6121 variables, 1/1231 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/6121 variables, 0/1231 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 97 (OVERLAPS) 9/6130 variables, 3/1234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/6130 variables, 0/1234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 99 (OVERLAPS) 13/6143 variables, 7/1241 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/6143 variables, 1/1242 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/6143 variables, 3/1245 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/6143 variables, 0/1245 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 103 (OVERLAPS) 1/6144 variables, 1/1246 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/6144 variables, 0/1246 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 105 (OVERLAPS) 4/6148 variables, 2/1248 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/6148 variables, 0/1248 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 107 (OVERLAPS) 9/6157 variables, 5/1253 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/6157 variables, 1/1254 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/6157 variables, 2/1256 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/6157 variables, 0/1256 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 111 (OVERLAPS) 1/6158 variables, 1/1257 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/6158 variables, 0/1257 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 113 (OVERLAPS) 1/6159 variables, 1/1258 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/6159 variables, 0/1258 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 115 (OVERLAPS) 4/6163 variables, 3/1261 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/6163 variables, 1/1262 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/6163 variables, 1/1263 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/6163 variables, 0/1263 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 119 (OVERLAPS) 0/6163 variables, 0/1263 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6163/6163 variables, and 1263 constraints, problems are : Problem set: 0 solved, 3 unsolved in 35119 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 655/655 constraints, ReadFeed: 585/585 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 45/53 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 722/775 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/775 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/775 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/775 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 134/909 variables, 47/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/909 variables, 58/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/909 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/911 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/911 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 2/913 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/913 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 2/915 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/915 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 2/917 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/917 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 2/919 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/919 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 2/921 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/921 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 1/922 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/922 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 3514/4436 variables, 64/239 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/4436 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 898/5334 variables, 371/610 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/5334 variables, 8/618 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/5334 variables, 323/941 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/5334 variables, 2/943 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/5334 variables, 0/943 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 39/5373 variables, 24/967 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/5373 variables, 1/968 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/5373 variables, 2/970 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/5373 variables, 0/970 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (OVERLAPS) 121/5494 variables, 11/981 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/5494 variables, 0/981 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (OVERLAPS) 45/5539 variables, 23/1004 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/5539 variables, 1/1005 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/5539 variables, 11/1016 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/5539 variables, 0/1016 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (OVERLAPS) 1/5540 variables, 1/1017 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/5540 variables, 0/1017 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (OVERLAPS) 100/5640 variables, 10/1027 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/5640 variables, 0/1027 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (OVERLAPS) 41/5681 variables, 21/1048 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/5681 variables, 1/1049 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/5681 variables, 10/1059 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/5681 variables, 0/1059 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (OVERLAPS) 1/5682 variables, 1/1060 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/5682 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (OVERLAPS) 81/5763 variables, 9/1069 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/5763 variables, 0/1069 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (OVERLAPS) 37/5800 variables, 19/1088 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/5800 variables, 1/1089 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/5800 variables, 9/1098 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/5800 variables, 0/1098 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (OVERLAPS) 1/5801 variables, 1/1099 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/5801 variables, 0/1099 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 59 (OVERLAPS) 64/5865 variables, 8/1107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/5865 variables, 0/1107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 61 (OVERLAPS) 33/5898 variables, 17/1124 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/5898 variables, 1/1125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/5898 variables, 8/1133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/5898 variables, 0/1133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 65 (OVERLAPS) 1/5899 variables, 1/1134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/5899 variables, 0/1134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 67 (OVERLAPS) 49/5948 variables, 7/1141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/5948 variables, 0/1141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 69 (OVERLAPS) 29/5977 variables, 15/1156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/5977 variables, 1/1157 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/5977 variables, 7/1164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/5977 variables, 0/1164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 73 (OVERLAPS) 1/5978 variables, 1/1165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/5978 variables, 0/1165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 75 (OVERLAPS) 36/6014 variables, 6/1171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/6014 variables, 0/1171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 77 (OVERLAPS) 25/6039 variables, 13/1184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/6039 variables, 1/1185 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/6039 variables, 6/1191 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/6039 variables, 0/1191 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 81 (OVERLAPS) 1/6040 variables, 1/1192 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/6040 variables, 0/1192 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 83 (OVERLAPS) 25/6065 variables, 5/1197 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/6065 variables, 0/1197 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 85 (OVERLAPS) 21/6086 variables, 11/1208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/6086 variables, 1/1209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/6086 variables, 5/1214 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/6086 variables, 0/1214 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 89 (OVERLAPS) 1/6087 variables, 1/1215 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/6087 variables, 0/1215 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 91 (OVERLAPS) 16/6103 variables, 4/1219 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/6103 variables, 0/1219 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 93 (OVERLAPS) 17/6120 variables, 9/1228 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/6120 variables, 1/1229 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/6120 variables, 4/1233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/6120 variables, 0/1233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 97 (OVERLAPS) 1/6121 variables, 1/1234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/6121 variables, 0/1234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 99 (OVERLAPS) 9/6130 variables, 3/1237 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/6130 variables, 0/1237 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 101 (OVERLAPS) 13/6143 variables, 7/1244 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/6143 variables, 1/1245 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/6143 variables, 3/1248 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/6143 variables, 0/1248 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 105 (OVERLAPS) 1/6144 variables, 1/1249 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/6144 variables, 0/1249 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 107 (OVERLAPS) 4/6148 variables, 2/1251 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/6148 variables, 0/1251 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 109 (OVERLAPS) 9/6157 variables, 5/1256 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/6157 variables, 1/1257 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/6157 variables, 2/1259 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/6157 variables, 0/1259 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 113 (OVERLAPS) 1/6158 variables, 1/1260 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/6158 variables, 0/1260 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 115 (OVERLAPS) 1/6159 variables, 1/1261 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/6159 variables, 0/1261 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 117 (OVERLAPS) 4/6163 variables, 3/1264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/6163 variables, 1/1265 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/6163 variables, 1/1266 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/6163 variables, 0/1266 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 121 (OVERLAPS) 0/6163 variables, 0/1266 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6163/6163 variables, and 1266 constraints, problems are : Problem set: 0 solved, 3 unsolved in 29218 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 655/655 constraints, ReadFeed: 585/585 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64428ms problems are : Problem set: 0 solved, 3 unsolved
Finished Parikh walk after 62 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=62 )
Parikh walk visited 3 properties in 117 ms.
Successfully simplified 9 atomic propositions for a total of 6 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA LastZero-PT-N24-CTLFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N24-CTLFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-06-10 14:06:54] [INFO ] Flatten gal took : 115 ms
[2026-06-10 14:06:55] [INFO ] Flatten gal took : 126 ms
[2026-06-10 14:06:55] [INFO ] Input system was already deterministic with 5800 transitions.
Support contains 6 out of 671 places (down from 8) after GAL structural reductions.
FORMULA LastZero-PT-N24-CTLFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 671 stabilizing places and 5800 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 671 transition count 5800
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Starting structural reductions in LTL mode, iteration 0 : 671/671 places, 5800/5800 transitions.
Applied a total of 0 rules in 15 ms. Remains 671 /671 variables (removed 0) and now considering 5800/5800 (removed 0) transitions.
[2026-06-10 14:06:55] [INFO ] Flow matrix only has 5524 transitions (discarded 276 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11281021758253921497.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6748798672847788829.kers'
[2026-06-10 14:06:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11281021758253921497.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6748798672847788829.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 2 ms.
// Phase 1: matrix 5524 rows 670 cols 15622 entries
Finished phase 1 with 648 SingleSign rule and 0 generalized
[2026-06-10 14:06:55] [INFO ] Computed 23 invariants in 16 ms
Computed 23 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-6748798672847788829.kers
Total runtime 20 ms.
[2026-06-10 14:06:56] [INFO ] Implicit Places using invariants in 805 ms returned []
[2026-06-10 14:06:56] [INFO ] Flow matrix only has 5524 transitions (discarded 276 similar events)
[2026-06-10 14:06:56] [INFO ] Invariant cache hit.
[2026-06-10 14:06:57] [INFO ] State equation strengthened by 600 read => feed constraints.
[2026-06-10 14:07:27] [INFO ] Performed 406/671 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-06-10 14:07:55] [INFO ] Implicit Places using invariants and state equation in 59275 ms returned []
Implicit Place search using SMT with State Equation took 60084 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 60105 ms. Remains : 671/671 places, 5800/5800 transitions.
[2026-06-10 14:07:55] [INFO ] Flatten gal took : 97 ms
[2026-06-10 14:07:55] [INFO ] Flatten gal took : 107 ms
[2026-06-10 14:07:55] [INFO ] Input system was already deterministic with 5800 transitions.
[2026-06-10 14:07:55] [INFO ] Flatten gal took : 95 ms
[2026-06-10 14:07:56] [INFO ] Flatten gal took : 96 ms
[2026-06-10 14:07:56] [INFO ] Time to serialize gal into /tmp/CTLFireability8530163509743509346.gal : 56 ms
[2026-06-10 14:07:56] [INFO ] Time to serialize properties into /tmp/CTLFireability18131468892099534503.ctl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8530163509743509346.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18131468892099534503.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.51918e+13,3.63956,57772,2,22572,5,42035,6,0,8437,18203,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-06-10 14:08:26] [INFO ] Flatten gal took : 94 ms
[2026-06-10 14:08:26] [INFO ] Applying decomposition
[2026-06-10 14:08:26] [INFO ] Flatten gal took : 94 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph16228539428160899048.txt' '-o' '/tmp/graph16228539428160899048.bin' '-w' '/tmp/graph16228539428160899048.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16228539428160899048.bin' '-l' '-1' '-v' '-w' '/tmp/graph16228539428160899048.weights' '-q' '0' '-e' '0.001'
[2026-06-10 14:08:26] [INFO ] Decomposing Gal with order
[2026-06-10 14:08:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-10 14:08:27] [INFO ] Removed a total of 9920 redundant transitions.
[2026-06-10 14:08:27] [INFO ] Flatten gal took : 339 ms
[2026-06-10 14:08:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 79 labels/synchronizations in 57 ms.
[2026-06-10 14:08:27] [INFO ] Time to serialize gal into /tmp/CTLFireability6718661498598522520.gal : 35 ms
[2026-06-10 14:08:27] [INFO ] Time to serialize properties into /tmp/CTLFireability16175180140328708327.ctl : 0 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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6718661498598522520.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16175180140328708327.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.51918e+13,12.2184,286408,46765,223,331298,1240,3125,598417,89,4788,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 671/671 places, 5800/5800 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 111 ms. Remains 670 /671 variables (removed 1) and now considering 5799/5800 (removed 1) transitions.
[2026-06-10 14:08:57] [INFO ] Flow matrix only has 5523 transitions (discarded 276 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9250478783450899813.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1296339479252940614.kers'
[2026-06-10 14:08:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9250478783450899813.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1296339479252940614.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 2 ms.
// Phase 1: matrix 5523 rows 669 cols 15620 entries
Finished phase 1 with 647 SingleSign rule and 0 generalized
[2026-06-10 14:08:57] [INFO ] Computed 23 invariants in 13 ms
Computed 23 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-1296339479252940614.kers
Total runtime 18 ms.
[2026-06-10 14:08:58] [INFO ] Implicit Places using invariants in 656 ms returned []
[2026-06-10 14:08:58] [INFO ] Flow matrix only has 5523 transitions (discarded 276 similar events)
[2026-06-10 14:08:58] [INFO ] Invariant cache hit.
[2026-06-10 14:08:59] [INFO ] State equation strengthened by 600 read => feed constraints.
[2026-06-10 14:09:29] [INFO ] Performed 358/670 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-06-10 14:09:59] [INFO ] Performed 551/670 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-06-10 14:10:16] [INFO ] Implicit Places using invariants and state equation in 78419 ms returned []
Implicit Place search using SMT with State Equation took 79081 ms to find 0 implicit places.
[2026-06-10 14:10:17] [INFO ] Redundant transitions in 487 ms returned []
Running 5775 sub problems to find dead transitions.
[2026-06-10 14:10:17] [INFO ] Flow matrix only has 5523 transitions (discarded 276 similar events)
[2026-06-10 14:10:17] [INFO ] Invariant cache hit.
[2026-06-10 14:10:17] [INFO ] State equation strengthened by 600 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/669 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 5775 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 669/6193 variables, and 22 constraints, problems are : Problem set: 0 solved, 5775 unsolved in 30076 ms.
Refiners :[Positive P Invariants (semi-flows): 22/23 constraints, State Equation: 0/670 constraints, ReadFeed: 0/600 constraints, PredecessorRefiner: 5775/5775 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5775 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/669 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 5775 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 669/6193 variables, and 22 constraints, problems are : Problem set: 0 solved, 5775 unsolved in 30070 ms.
Refiners :[Positive P Invariants (semi-flows): 22/23 constraints, State Equation: 0/670 constraints, ReadFeed: 0/600 constraints, PredecessorRefiner: 0/5775 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63972ms problems are : Problem set: 0 solved, 5775 unsolved
Search for dead transitions found 0 dead transitions in 63988ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 143692 ms. Remains : 670/671 places, 5799/5800 transitions.
[2026-06-10 14:11:21] [INFO ] Flatten gal took : 79 ms
[2026-06-10 14:11:21] [INFO ] Flatten gal took : 90 ms
[2026-06-10 14:11:21] [INFO ] Input system was already deterministic with 5799 transitions.
[2026-06-10 14:11:21] [INFO ] Flatten gal took : 88 ms
[2026-06-10 14:11:21] [INFO ] Flatten gal took : 90 ms
[2026-06-10 14:11:21] [INFO ] Time to serialize gal into /tmp/CTLFireability3567760542205135599.gal : 21 ms
[2026-06-10 14:11:21] [INFO ] Time to serialize properties into /tmp/CTLFireability10682935174754403179.ctl : 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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3567760542205135599.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10682935174754403179.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.50442e+13,3.7658,57660,2,22592,5,42073,6,0,8432,18209,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-06-10 14:11:52] [INFO ] Flatten gal took : 83 ms
[2026-06-10 14:11:52] [INFO ] Applying decomposition
[2026-06-10 14:11:52] [INFO ] Flatten gal took : 84 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph10076867797188170897.txt' '-o' '/tmp/graph10076867797188170897.bin' '-w' '/tmp/graph10076867797188170897.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10076867797188170897.bin' '-l' '-1' '-v' '-w' '/tmp/graph10076867797188170897.weights' '-q' '0' '-e' '0.001'
[2026-06-10 14:11:52] [INFO ] Decomposing Gal with order
[2026-06-10 14:11:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-10 14:11:52] [INFO ] Removed a total of 9929 redundant transitions.
[2026-06-10 14:11:52] [INFO ] Flatten gal took : 134 ms
[2026-06-10 14:11:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 38 ms.
[2026-06-10 14:11:52] [INFO ] Time to serialize gal into /tmp/CTLFireability6321935152330315487.gal : 18 ms
[2026-06-10 14:11:52] [INFO ] Time to serialize properties into /tmp/CTLFireability7857666211982571420.ctl : 0 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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6321935152330315487.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7857666211982571420.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.50442e+13,1.57096,53992,11960,182,51114,1127,3185,175526,80,3428,0


Converting to forward existential form...Done !
original formula: EG((((i3.u53.array_17_17<1)||(u171.lastzero_17<1))||((i3.u211.array_17_4>=1)&&(i3.u211.tmp_17_4>=1))))
=> equivalent forward existential formula: [FwdG(Init,(((i3.u53.array_17_17<1)||(u171.lastzero_17<1))||((i3.u211.array_17_4>=1)&&(i3.u211.tmp_17_4>=1))))] ...163
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,16.0766,487288,1,0,615949,2150,14865,1.59141e+06,296,11671,4437974
FORMULA LastZero-PT-N24-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 671/671 places, 5800/5800 transitions.
Applied a total of 0 rules in 16 ms. Remains 671 /671 variables (removed 0) and now considering 5800/5800 (removed 0) transitions.
[2026-06-10 14:12:08] [INFO ] Flow matrix only has 5524 transitions (discarded 276 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7313697510257364369.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13324325589252279497.kers'
[2026-06-10 14:12:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7313697510257364369.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13324325589252279497.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 5524 rows 670 cols 15622 entries
Finished phase 1 with 648 SingleSign rule and 0 generalized
[2026-06-10 14:12:08] [INFO ] Computed 23 invariants in 23 ms
Computed 23 P flows in 23 ms.
Exported basis to /tmp/petrispot-output-13324325589252279497.kers
Total runtime 27 ms.
[2026-06-10 14:12:09] [INFO ] Implicit Places using invariants in 649 ms returned []
[2026-06-10 14:12:09] [INFO ] Flow matrix only has 5524 transitions (discarded 276 similar events)
[2026-06-10 14:12:09] [INFO ] Invariant cache hit.
[2026-06-10 14:12:10] [INFO ] State equation strengthened by 600 read => feed constraints.
[2026-06-10 14:12:40] [INFO ] Performed 420/671 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-06-10 14:13:06] [INFO ] Implicit Places using invariants and state equation in 57093 ms returned []
Implicit Place search using SMT with State Equation took 57771 ms to find 0 implicit places.
Running 5776 sub problems to find dead transitions.
[2026-06-10 14:13:06] [INFO ] Flow matrix only has 5524 transitions (discarded 276 similar events)
[2026-06-10 14:13:06] [INFO ] Invariant cache hit.
[2026-06-10 14:13:06] [INFO ] State equation strengthened by 600 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 5776 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 670/6195 variables, and 23 constraints, problems are : Problem set: 0 solved, 5776 unsolved in 30077 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/671 constraints, ReadFeed: 0/600 constraints, PredecessorRefiner: 5776/5776 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5776 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 5776 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 670/6195 variables, and 23 constraints, problems are : Problem set: 0 solved, 5776 unsolved in 30076 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/671 constraints, ReadFeed: 0/600 constraints, PredecessorRefiner: 0/5776 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63960ms problems are : Problem set: 0 solved, 5776 unsolved
Search for dead transitions found 0 dead transitions in 63970ms
Finished structural reductions in LTL mode , in 1 iterations and 121780 ms. Remains : 671/671 places, 5800/5800 transitions.
[2026-06-10 14:14:10] [INFO ] Flatten gal took : 73 ms
[2026-06-10 14:14:10] [INFO ] Flatten gal took : 85 ms
[2026-06-10 14:14:10] [INFO ] Input system was already deterministic with 5800 transitions.
[2026-06-10 14:14:11] [INFO ] Flatten gal took : 82 ms
[2026-06-10 14:14:11] [INFO ] Flatten gal took : 83 ms
[2026-06-10 14:14:11] [INFO ] Time to serialize gal into /tmp/CTLFireability8279041335163898547.gal : 18 ms
[2026-06-10 14:14:11] [INFO ] Time to serialize properties into /tmp/CTLFireability9413858369673649230.ctl : 0 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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8279041335163898547.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9413858369673649230.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.51918e+13,3.61655,57720,2,22572,5,42035,6,0,8437,18203,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,5.03306,57720,1,0,6,42035,7,1,12475,18203,1
FORMULA LastZero-PT-N24-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 671/671 places, 5800/5800 transitions.
Applied a total of 0 rules in 14 ms. Remains 671 /671 variables (removed 0) and now considering 5800/5800 (removed 0) transitions.
[2026-06-10 14:14:16] [INFO ] Flow matrix only has 5524 transitions (discarded 276 similar events)
[2026-06-10 14:14:16] [INFO ] Invariant cache hit.
[2026-06-10 14:14:16] [INFO ] Implicit Places using invariants in 466 ms returned []
[2026-06-10 14:14:16] [INFO ] Flow matrix only has 5524 transitions (discarded 276 similar events)
[2026-06-10 14:14:16] [INFO ] Invariant cache hit.
[2026-06-10 14:14:17] [INFO ] State equation strengthened by 600 read => feed constraints.
[2026-06-10 14:14:47] [INFO ] Performed 422/671 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-06-10 14:15:17] [INFO ] Performed 661/671 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-06-10 14:15:18] [INFO ] Implicit Places using invariants and state equation in 62175 ms returned []
Implicit Place search using SMT with State Equation took 62649 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 62665 ms. Remains : 671/671 places, 5800/5800 transitions.
[2026-06-10 14:15:18] [INFO ] Flatten gal took : 83 ms
[2026-06-10 14:15:19] [INFO ] Flatten gal took : 93 ms
[2026-06-10 14:15:19] [INFO ] Input system was already deterministic with 5800 transitions.
[2026-06-10 14:15:19] [INFO ] Flatten gal took : 101 ms
[2026-06-10 14:15:19] [INFO ] Flatten gal took : 109 ms
[2026-06-10 14:15:19] [INFO ] Time to serialize gal into /tmp/CTLFireability1996661426373400033.gal : 22 ms
[2026-06-10 14:15:19] [INFO ] Time to serialize properties into /tmp/CTLFireability4299316442097785420.ctl : 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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1996661426373400033.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4299316442097785420.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.51918e+13,3.60992,57716,2,22572,5,42035,6,0,8437,18203,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-06-10 14:15:49] [INFO ] Flatten gal took : 79 ms
[2026-06-10 14:15:49] [INFO ] Applying decomposition
[2026-06-10 14:15:49] [INFO ] Flatten gal took : 83 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph8613647348351841827.txt' '-o' '/tmp/graph8613647348351841827.bin' '-w' '/tmp/graph8613647348351841827.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8613647348351841827.bin' '-l' '-1' '-v' '-w' '/tmp/graph8613647348351841827.weights' '-q' '0' '-e' '0.001'
[2026-06-10 14:15:50] [INFO ] Decomposing Gal with order
[2026-06-10 14:15:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-10 14:15:50] [INFO ] Removed a total of 9922 redundant transitions.
[2026-06-10 14:15:50] [INFO ] Flatten gal took : 122 ms
[2026-06-10 14:15:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 75 labels/synchronizations in 21 ms.
[2026-06-10 14:15:50] [INFO ] Time to serialize gal into /tmp/CTLFireability1366905018245789272.gal : 18 ms
[2026-06-10 14:15:50] [INFO ] Time to serialize properties into /tmp/CTLFireability14633969695117730774.ctl : 0 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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1366905018245789272.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14633969695117730774.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.51918e+13,6.53202,166580,26283,171,198885,1037,3067,366515,82,3520,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-06-10 14:16:20] [INFO ] Flatten gal took : 81 ms
[2026-06-10 14:16:20] [INFO ] Flatten gal took : 81 ms
[2026-06-10 14:16:20] [INFO ] Applying decomposition
[2026-06-10 14:16:20] [INFO ] Flatten gal took : 84 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph12324435437533985052.txt' '-o' '/tmp/graph12324435437533985052.bin' '-w' '/tmp/graph12324435437533985052.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12324435437533985052.bin' '-l' '-1' '-v' '-w' '/tmp/graph12324435437533985052.weights' '-q' '0' '-e' '0.001'
[2026-06-10 14:16:20] [INFO ] Decomposing Gal with order
[2026-06-10 14:16:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-10 14:16:21] [INFO ] Removed a total of 9921 redundant transitions.
[2026-06-10 14:16:21] [INFO ] Flatten gal took : 114 ms
[2026-06-10 14:16:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 75 labels/synchronizations in 19 ms.
[2026-06-10 14:16:21] [INFO ] Time to serialize gal into /tmp/CTLFireability8221530000963564601.gal : 16 ms
[2026-06-10 14:16:21] [INFO ] Time to serialize properties into /tmp/CTLFireability6335254564881651952.ctl : 0 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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8221530000963564601.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6335254564881651952.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 2 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.51918e+13,2.25213,68440,12376,203,65884,1216,3085,168721,82,4287,0


Converting to forward existential form...Done !
original formula: EG(AX(FALSE))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(FALSE))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions i0.t1297, i0.t1296, i0.t1295, i0.t1294, i0.t1293, i0.t1292, i0.t1291, i0.t1290, i0.t1289, i0....3731
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,61.0143,1998472,1,0,1.9677e+06,2636,20068,2.22018e+06,353,17898,28980046
FORMULA LastZero-PT-N24-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: EF((EX(TRUE) * AG(((i9.u190.array_14_1>=1)&&(i9.u28.tmp_14_9>=1)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * EX(TRUE)) * !(E(TRUE U !(((i9.u190.array_14_1>=1)&&(i9.u28.tmp_14_9>=1))))))] != FALSE
(forward)formula 1,0,61.3245,2003444,1,0,1.97196e+06,2752,20327,2.25194e+06,355,18346,29040778
FORMULA LastZero-PT-N24-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

Total runtime 907230 ms.

BK_STOP 1781101043340

--------------------
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -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="LastZero-PT-N24"
export BK_EXAMINATION="CTLFireability"
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-5973"
echo " Executing tool itstools"
echo " Input is LastZero-PT-N24, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r354-tall-178024402800146"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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