Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 11K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 78K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 402K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 34K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 21K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 85K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 178K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 53K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 263K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 336K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748902774126

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PermAdmissibility-PT-02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-02 22:19:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 22:19:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 22:19:35] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2025-06-02 22:19:35] [INFO ] Transformed 168 places.
[2025-06-02 22:19:35] [INFO ] Transformed 592 transitions.
[2025-06-02 22:19:35] [INFO ] Parsed PT model containing 168 places and 592 transitions and 3456 arcs in 171 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA PermAdmissibility-PT-02-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 83 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 592/592 transitions.
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 119 transition count 592
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 54 place count 114 transition count 512
Iterating global reduction 1 with 5 rules applied. Total rules applied 59 place count 114 transition count 512
Applied a total of 59 rules in 32 ms. Remains 114 /168 variables (removed 54) and now considering 512/592 (removed 80) transitions.
// Phase 1: matrix 512 rows 114 cols
[2025-06-02 22:19:35] [INFO ] Computed 17 invariants in 23 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:19:35] [INFO ] Implicit Places using invariants in 240 ms returned []
[2025-06-02 22:19:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:19:36] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 644 ms to find 0 implicit places.
Running 508 sub problems to find dead transitions.
[2025-06-02 22:19:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 2 (OVERLAPS) 9/107 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 508 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:19:40] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:19:41] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:19:41] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:19:41] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:19:41] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:19:41] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:19:41] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:19:41] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:19:41] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:19:42] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:19:42] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:19:42] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:19:42] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:19:42] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:19:43] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:19:43] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 16/33 constraints. Problems are: Problem set: 0 solved, 508 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:19:45] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:19:45] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:19:45] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:19:45] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:19:45] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:19:45] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 6/39 constraints. Problems are: Problem set: 0 solved, 508 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:19:47] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:19:47] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:19:47] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:19:48] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 508 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:19:50] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:19:50] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 508 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:19:52] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 9 (OVERLAPS) 512/619 variables, 107/153 constraints. Problems are: Problem set: 0 solved, 508 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 619/626 variables, and 153 constraints, problems are : Problem set: 0 solved, 508 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 107/114 constraints, PredecessorRefiner: 508/508 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 508 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 2 (OVERLAPS) 9/107 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 29/46 constraints. Problems are: Problem set: 0 solved, 508 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:20:08] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:20:09] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:20:09] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:20:09] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:20:09] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 6 (OVERLAPS) 512/619 variables, 107/158 constraints. Problems are: Problem set: 0 solved, 508 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/619 variables, 332/490 constraints. Problems are: Problem set: 0 solved, 508 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 619/626 variables, and 490 constraints, problems are : Problem set: 0 solved, 508 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 107/114 constraints, PredecessorRefiner: 332/508 constraints, Known Traps: 34/34 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60727ms problems are : Problem set: 0 solved, 508 unsolved
Search for dead transitions found 0 dead transitions in 60742ms
Starting structural reductions in LTL mode, iteration 1 : 114/168 places, 512/592 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61443 ms. Remains : 114/168 places, 512/592 transitions.
Support contains 83 out of 114 places after structural reductions.
[2025-06-02 22:20:37] [INFO ] Flatten gal took : 70 ms
[2025-06-02 22:20:37] [INFO ] Flatten gal took : 44 ms
[2025-06-02 22:20:37] [INFO ] Input system was already deterministic with 512 transitions.
Support contains 82 out of 114 places (down from 83) after GAL structural reductions.
RANDOM walk for 40000 steps (852 resets) in 1471 ms. (27 steps per ms) remains 4/31 properties
BEST_FIRST walk for 40003 steps (195 resets) in 296 ms. (134 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (317 resets) in 179 ms. (222 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (234 resets) in 112 ms. (354 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (240 resets) in 106 ms. (373 steps per ms) remains 4/4 properties
[2025-06-02 22:20:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp1 is UNSAT
At refinement iteration 1 (OVERLAPS) 86/100 variables, 16/16 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/108 variables, 1/17 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp25 is UNSAT
After SMT solving in domain Real declared 620/626 variables, and 125 constraints, problems are : Problem set: 4 solved, 0 unsolved in 149 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 108/114 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 166ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA PermAdmissibility-PT-02-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 4 atomic propositions for a total of 14 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA PermAdmissibility-PT-02-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 114 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 114 transition count 512
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA PermAdmissibility-PT-02-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-02-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 5 out of 114 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 114/114 places, 512/512 transitions.
Graph (complete) has 985 edges and 114 vertex of which 32 are kept as prefixes of interest. Removing 82 places using SCC suffix rule.3 ms
Discarding 82 places :
Also discarding 432 output transitions
Drop transitions (Output transitions of discarded places.) removed 432 transitions
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 26 transition count 44
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 26 transition count 44
Applied a total of 13 rules in 13 ms. Remains 26 /114 variables (removed 88) and now considering 44/512 (removed 468) transitions.
// Phase 1: matrix 44 rows 26 cols
[2025-06-02 22:20:38] [INFO ] Computed 8 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:20:38] [INFO ] Implicit Places using invariants in 36 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 38 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/114 places, 44/512 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 44/44 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 54 ms. Remains : 25/114 places, 44/512 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-02-LTLCardinality-00
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 2 ms.
FORMULA PermAdmissibility-PT-02-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-02-LTLCardinality-00 finished in 259 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(G(p0))))&&(X(p0)||G(p1))))'
Support contains 14 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 512/512 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 107 transition count 512
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 21 place count 93 transition count 372
Iterating global reduction 1 with 14 rules applied. Total rules applied 35 place count 93 transition count 372
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 45 place count 83 transition count 262
Iterating global reduction 1 with 10 rules applied. Total rules applied 55 place count 83 transition count 262
Applied a total of 55 rules in 19 ms. Remains 83 /114 variables (removed 31) and now considering 262/512 (removed 250) transitions.
// Phase 1: matrix 262 rows 83 cols
[2025-06-02 22:20:38] [INFO ] Computed 17 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:20:39] [INFO ] Implicit Places using invariants in 100 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 101 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/114 places, 262/512 transitions.
Applied a total of 0 rules in 4 ms. Remains 82 /82 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 124 ms. Remains : 82/114 places, 262/512 transitions.
Stuttering acceptance computed with spot in 276 ms :[true, (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-02-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 20 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-PT-02-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-02-LTLCardinality-02 finished in 426 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 9 out of 114 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 114/114 places, 512/512 transitions.
Graph (complete) has 985 edges and 114 vertex of which 86 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.5 ms
Discarding 28 places :
Also discarding 48 output transitions
Drop transitions (Output transitions of discarded places.) removed 48 transitions
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 80 transition count 368
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 80 transition count 368
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 25 place count 68 transition count 248
Iterating global reduction 0 with 12 rules applied. Total rules applied 37 place count 68 transition count 248
Applied a total of 37 rules in 27 ms. Remains 68 /114 variables (removed 46) and now considering 248/512 (removed 264) transitions.
// Phase 1: matrix 248 rows 68 cols
[2025-06-02 22:20:39] [INFO ] Computed 14 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:20:39] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-02 22:20:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:20:39] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 22:20:39] [INFO ] Redundant transitions in 12 ms returned []
Running 244 sub problems to find dead transitions.
[2025-06-02 22:20:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (OVERLAPS) 1/68 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (OVERLAPS) 248/316 variables, 68/82 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 6 (OVERLAPS) 0/316 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 244 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/316 variables, and 82 constraints, problems are : Problem set: 0 solved, 244 unsolved in 6451 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 244 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (OVERLAPS) 1/68 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (OVERLAPS) 248/316 variables, 68/82 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 244/326 constraints. Problems are: Problem set: 0 solved, 244 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 316/316 variables, and 326 constraints, problems are : Problem set: 0 solved, 244 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36628ms problems are : Problem set: 0 solved, 244 unsolved
Search for dead transitions found 0 dead transitions in 36630ms
Starting structural reductions in SI_LTL mode, iteration 1 : 68/114 places, 248/512 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 36985 ms. Remains : 68/114 places, 248/512 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-02-LTLCardinality-03
Product exploration explored 100000 steps with 5971 reset in 418 ms.
Product exploration explored 100000 steps with 5956 reset in 339 ms.
Computed a total of 68 stabilizing places and 248 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 68 transition count 248
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 83 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
[2025-06-02 22:21:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 22:21:17] [INFO ] [Real]Absence check using 0 positive and 14 generalized place invariants in 6 ms returned sat
[2025-06-02 22:21:17] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2025-06-02 22:21:17] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 22:21:17] [INFO ] [Nat]Absence check using 0 positive and 14 generalized place invariants in 5 ms returned sat
[2025-06-02 22:21:17] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2025-06-02 22:21:17] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 216 transitions) in 24 ms.
[2025-06-02 22:21:18] [INFO ] Added : 11 causal constraints over 3 iterations in 148 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 9 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 248/248 transitions.
Applied a total of 0 rules in 9 ms. Remains 68 /68 variables (removed 0) and now considering 248/248 (removed 0) transitions.
[2025-06-02 22:21:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:21:18] [INFO ] Implicit Places using invariants in 172 ms returned []
[2025-06-02 22:21:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:21:18] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 436 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 22:21:18] [INFO ] Redundant transitions in 4 ms returned []
Running 244 sub problems to find dead transitions.
[2025-06-02 22:21:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (OVERLAPS) 1/68 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (OVERLAPS) 248/316 variables, 68/82 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 6 (OVERLAPS) 0/316 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 244 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/316 variables, and 82 constraints, problems are : Problem set: 0 solved, 244 unsolved in 6414 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 244 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (OVERLAPS) 1/68 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (OVERLAPS) 248/316 variables, 68/82 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 244/326 constraints. Problems are: Problem set: 0 solved, 244 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 316/316 variables, and 326 constraints, problems are : Problem set: 0 solved, 244 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36571ms problems are : Problem set: 0 solved, 244 unsolved
Search for dead transitions found 0 dead transitions in 36573ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 37032 ms. Remains : 68/68 places, 248/248 transitions.
Computed a total of 68 stabilizing places and 248 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 68 transition count 248
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 81 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 128 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
[2025-06-02 22:21:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 22:21:55] [INFO ] [Real]Absence check using 0 positive and 14 generalized place invariants in 9 ms returned sat
[2025-06-02 22:21:55] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2025-06-02 22:21:55] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 22:21:55] [INFO ] [Nat]Absence check using 0 positive and 14 generalized place invariants in 6 ms returned sat
[2025-06-02 22:21:55] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2025-06-02 22:21:55] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 216 transitions) in 24 ms.
[2025-06-02 22:21:56] [INFO ] Added : 11 causal constraints over 3 iterations in 116 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5972 reset in 319 ms.
Product exploration explored 100000 steps with 5962 reset in 313 ms.
Built C files in :
/tmp/ltsmin4912324440824286557
[2025-06-02 22:21:56] [INFO ] Computing symmetric may disable matrix : 248 transitions.
[2025-06-02 22:21:56] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 22:21:56] [INFO ] Computing symmetric may enable matrix : 248 transitions.
[2025-06-02 22:21:56] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 22:21:56] [INFO ] Computing Do-Not-Accords matrix : 248 transitions.
[2025-06-02 22:21:56] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 22:21:56] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4912324440824286557
Running compilation step : cd /tmp/ltsmin4912324440824286557;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 635 ms.
Running link step : cd /tmp/ltsmin4912324440824286557;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin4912324440824286557;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6744520634457213162.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 9 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 248/248 transitions.
Applied a total of 0 rules in 17 ms. Remains 68 /68 variables (removed 0) and now considering 248/248 (removed 0) transitions.
[2025-06-02 22:22:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:22:11] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-06-02 22:22:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:22:12] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 22:22:12] [INFO ] Redundant transitions in 4 ms returned []
Running 244 sub problems to find dead transitions.
[2025-06-02 22:22:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (OVERLAPS) 1/68 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (OVERLAPS) 248/316 variables, 68/82 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 6 (OVERLAPS) 0/316 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 244 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/316 variables, and 82 constraints, problems are : Problem set: 0 solved, 244 unsolved in 6251 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 244 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (OVERLAPS) 1/68 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (OVERLAPS) 248/316 variables, 68/82 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 244/326 constraints. Problems are: Problem set: 0 solved, 244 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 316/316 variables, and 326 constraints, problems are : Problem set: 0 solved, 244 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36372ms problems are : Problem set: 0 solved, 244 unsolved
Search for dead transitions found 0 dead transitions in 36373ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36718 ms. Remains : 68/68 places, 248/248 transitions.
Built C files in :
/tmp/ltsmin8860806757224391508
[2025-06-02 22:22:48] [INFO ] Computing symmetric may disable matrix : 248 transitions.
[2025-06-02 22:22:48] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 22:22:48] [INFO ] Computing symmetric may enable matrix : 248 transitions.
[2025-06-02 22:22:48] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 22:22:48] [INFO ] Computing Do-Not-Accords matrix : 248 transitions.
[2025-06-02 22:22:48] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 22:22:48] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8860806757224391508
Running compilation step : cd /tmp/ltsmin8860806757224391508;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 516 ms.
Running link step : cd /tmp/ltsmin8860806757224391508;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin8860806757224391508;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4831134980680855024.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-02 22:23:03] [INFO ] Flatten gal took : 16 ms
[2025-06-02 22:23:03] [INFO ] Flatten gal took : 16 ms
[2025-06-02 22:23:03] [INFO ] Time to serialize gal into /tmp/LTL10611179965466781345.gal : 3 ms
[2025-06-02 22:23:03] [INFO ] Time to serialize properties into /tmp/LTL10309039846824951998.prop : 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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10611179965466781345.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13607055968427218374.hoa' '-atoms' '/tmp/LTL10309039846824951998.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL10309039846824951998.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13607055968427218374.hoa
Detected timeout of ITS tools.
[2025-06-02 22:23:18] [INFO ] Flatten gal took : 15 ms
[2025-06-02 22:23:18] [INFO ] Flatten gal took : 13 ms
[2025-06-02 22:23:18] [INFO ] Time to serialize gal into /tmp/LTL9261680196077982007.gal : 3 ms
[2025-06-02 22:23:18] [INFO ] Time to serialize properties into /tmp/LTL13850129927367241578.ltl : 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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9261680196077982007.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13850129927367241578.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((((aux15_2+aux15_1)+(aux15_0+aux15_6))+((aux15_5+aux15_4)+(aux15_3+aux15_7)))>c18)"))))
Formula 0 simplified : FG!"((((aux15_2+aux15_1)+(aux15_0+aux15_6))+((aux15_5+aux15_4)+(aux15_3+aux15_7)))>c18)"
Detected timeout of ITS tools.
[2025-06-02 22:23:34] [INFO ] Flatten gal took : 13 ms
[2025-06-02 22:23:34] [INFO ] Applying decomposition
[2025-06-02 22:23:34] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12262285057323036163.txt' '-o' '/tmp/graph12262285057323036163.bin' '-w' '/tmp/graph12262285057323036163.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12262285057323036163.bin' '-l' '-1' '-v' '-w' '/tmp/graph12262285057323036163.weights' '-q' '0' '-e' '0.001'
[2025-06-02 22:23:34] [INFO ] Decomposing Gal with order
[2025-06-02 22:23:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 22:23:34] [INFO ] Removed a total of 121 redundant transitions.
[2025-06-02 22:23:34] [INFO ] Flatten gal took : 183 ms
[2025-06-02 22:23:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 158 labels/synchronizations in 9 ms.
[2025-06-02 22:23:34] [INFO ] Time to serialize gal into /tmp/LTL8595383031397827409.gal : 4 ms
[2025-06-02 22:23:34] [INFO ] Time to serialize properties into /tmp/LTL16470520087930056261.ltl : 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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8595383031397827409.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16470520087930056261.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((((gu0.aux15_2+gu0.aux15_1)+(gu0.aux15_0+gu0.aux15_6))+((gu0.aux15_5+gu0.aux15_4)+(gu0.aux15_3+gu0.aux15_7)))>gu0.c18)"))))
Formula 0 simplified : FG!"((((gu0.aux15_2+gu0.aux15_1)+(gu0.aux15_0+gu0.aux15_6))+((gu0.aux15_5+gu0.aux15_4)+(gu0.aux15_3+gu0.aux15_7)))>gu0.c18)"
Detected timeout of ITS tools.
Treatment of property PermAdmissibility-PT-02-LTLCardinality-03 finished in 190175 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(X(X(X(p1)))||F(p2))))'
Support contains 26 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 512/512 transitions.
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 99 transition count 512
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 30 place count 84 transition count 356
Iterating global reduction 1 with 15 rules applied. Total rules applied 45 place count 84 transition count 356
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 59 place count 70 transition count 230
Iterating global reduction 1 with 14 rules applied. Total rules applied 73 place count 70 transition count 230
Applied a total of 73 rules in 8 ms. Remains 70 /114 variables (removed 44) and now considering 230/512 (removed 282) transitions.
// Phase 1: matrix 230 rows 70 cols
[2025-06-02 22:23:49] [INFO ] Computed 16 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:23:49] [INFO ] Implicit Places using invariants in 59 ms returned [0, 5, 25, 36]
[2025-06-02 22:23:49] [INFO ] Actually due to overlaps returned [5, 0, 25]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 60 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 67/114 places, 230/512 transitions.
Applied a total of 0 rules in 1 ms. Remains 67 /67 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 69 ms. Remains : 67/114 places, 230/512 transitions.
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : PermAdmissibility-PT-02-LTLCardinality-05
Stuttering criterion allowed to conclude after 138 steps with 6 reset in 1 ms.
FORMULA PermAdmissibility-PT-02-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-02-LTLCardinality-05 finished in 278 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U (!((X(F(G(p0)))||p1) U p2) U p1))))'
Support contains 20 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 512/512 transitions.
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 99 transition count 512
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 36 place count 78 transition count 344
Iterating global reduction 1 with 21 rules applied. Total rules applied 57 place count 78 transition count 344
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 69 place count 66 transition count 152
Iterating global reduction 1 with 12 rules applied. Total rules applied 81 place count 66 transition count 152
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 83 place count 64 transition count 136
Iterating global reduction 1 with 2 rules applied. Total rules applied 85 place count 64 transition count 136
Applied a total of 85 rules in 10 ms. Remains 64 /114 variables (removed 50) and now considering 136/512 (removed 376) transitions.
// Phase 1: matrix 136 rows 64 cols
[2025-06-02 22:23:49] [INFO ] Computed 16 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:23:49] [INFO ] Implicit Places using invariants in 59 ms returned [0, 5, 37]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 60 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 61/114 places, 136/512 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 136/136 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 71 ms. Remains : 61/114 places, 136/512 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-02-LTLCardinality-06
Stuttering criterion allowed to conclude after 74 steps with 3 reset in 2 ms.
FORMULA PermAdmissibility-PT-02-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-02-LTLCardinality-06 finished in 222 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 9 out of 114 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 114/114 places, 512/512 transitions.
Graph (complete) has 985 edges and 114 vertex of which 68 are kept as prefixes of interest. Removing 46 places using SCC suffix rule.5 ms
Discarding 46 places :
Also discarding 176 output transitions
Drop transitions (Output transitions of discarded places.) removed 176 transitions
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 22 place count 47 transition count 98
Iterating global reduction 0 with 21 rules applied. Total rules applied 43 place count 47 transition count 98
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 45 place count 45 transition count 84
Iterating global reduction 0 with 2 rules applied. Total rules applied 47 place count 45 transition count 84
Applied a total of 47 rules in 16 ms. Remains 45 /114 variables (removed 69) and now considering 84/512 (removed 428) transitions.
// Phase 1: matrix 84 rows 45 cols
[2025-06-02 22:23:50] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:23:50] [INFO ] Implicit Places using invariants in 50 ms returned [7, 9, 13]
[2025-06-02 22:23:50] [INFO ] Actually due to overlaps returned [9, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 51 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/114 places, 84/512 transitions.
Applied a total of 0 rules in 2 ms. Remains 43 /43 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 69 ms. Remains : 43/114 places, 84/512 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PermAdmissibility-PT-02-LTLCardinality-07
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 2 ms.
FORMULA PermAdmissibility-PT-02-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-02-LTLCardinality-07 finished in 199 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&F(G((p1||X(!p1))))))))'
Support contains 4 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 512/512 transitions.
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 99 transition count 512
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 35 place count 79 transition count 346
Iterating global reduction 1 with 20 rules applied. Total rules applied 55 place count 79 transition count 346
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 77 place count 57 transition count 124
Iterating global reduction 1 with 22 rules applied. Total rules applied 99 place count 57 transition count 124
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 101 place count 55 transition count 108
Iterating global reduction 1 with 2 rules applied. Total rules applied 103 place count 55 transition count 108
Applied a total of 103 rules in 5 ms. Remains 55 /114 variables (removed 59) and now considering 108/512 (removed 404) transitions.
// Phase 1: matrix 108 rows 55 cols
[2025-06-02 22:23:50] [INFO ] Computed 16 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:23:50] [INFO ] Implicit Places using invariants in 58 ms returned [0, 5, 19, 27]
[2025-06-02 22:23:50] [INFO ] Actually due to overlaps returned [5, 0, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 59 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 52/114 places, 108/512 transitions.
Applied a total of 0 rules in 0 ms. Remains 52 /52 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 64 ms. Remains : 52/114 places, 108/512 transitions.
Stuttering acceptance computed with spot in 189 ms :[(NOT p0), (NOT p0), (NOT p0), true, false, false]
Running random walk in product with property : PermAdmissibility-PT-02-LTLCardinality-08
Product exploration explored 100000 steps with 19212 reset in 183 ms.
Product exploration explored 100000 steps with 19291 reset in 177 ms.
Computed a total of 52 stabilizing places and 108 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 52 transition count 108
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 17 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-PT-02-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-02-LTLCardinality-08 finished in 694 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0)||G(p1)) U X(p2)))'
Support contains 6 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 512/512 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 102 transition count 512
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 30 place count 84 transition count 356
Iterating global reduction 1 with 18 rules applied. Total rules applied 48 place count 84 transition count 356
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 65 place count 67 transition count 158
Iterating global reduction 1 with 17 rules applied. Total rules applied 82 place count 67 transition count 158
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 66 transition count 150
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 66 transition count 150
Applied a total of 84 rules in 11 ms. Remains 66 /114 variables (removed 48) and now considering 150/512 (removed 362) transitions.
// Phase 1: matrix 150 rows 66 cols
[2025-06-02 22:23:50] [INFO ] Computed 16 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:23:50] [INFO ] Implicit Places using invariants in 71 ms returned []
[2025-06-02 22:23:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:23:51] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2025-06-02 22:23:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 1/63 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (OVERLAPS) 150/213 variables, 63/79 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 3/216 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 8 (OVERLAPS) 0/216 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 216/216 variables, and 82 constraints, problems are : Problem set: 0 solved, 146 unsolved in 4772 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 1/63 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (OVERLAPS) 150/213 variables, 63/79 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 126/205 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (OVERLAPS) 3/216 variables, 3/208 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 20/228 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/216 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 146 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 216/216 variables, and 228 constraints, problems are : Problem set: 0 solved, 146 unsolved in 30011 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34832ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 34832ms
Starting structural reductions in LTL mode, iteration 1 : 66/114 places, 150/512 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35087 ms. Remains : 66/114 places, 150/512 transitions.
Stuttering acceptance computed with spot in 227 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : PermAdmissibility-PT-02-LTLCardinality-10
Product exploration explored 100000 steps with 50000 reset in 113 ms.
Product exploration explored 100000 steps with 50000 reset in 130 ms.
Computed a total of 66 stabilizing places and 150 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 66 transition count 150
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X p0)), (X (X (AND p1 p2))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 22 factoid took 14 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-PT-02-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-02-LTLCardinality-10 finished in 35632 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0)) U G((p1 U X((p1&&X(G(p2)))))))))'
Support contains 5 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 512/512 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 100 transition count 512
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 34 place count 80 transition count 348
Iterating global reduction 1 with 20 rules applied. Total rules applied 54 place count 80 transition count 348
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 75 place count 59 transition count 122
Iterating global reduction 1 with 21 rules applied. Total rules applied 96 place count 59 transition count 122
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 98 place count 57 transition count 106
Iterating global reduction 1 with 2 rules applied. Total rules applied 100 place count 57 transition count 106
Applied a total of 100 rules in 4 ms. Remains 57 /114 variables (removed 57) and now considering 106/512 (removed 406) transitions.
// Phase 1: matrix 106 rows 57 cols
[2025-06-02 22:24:26] [INFO ] Computed 16 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:24:26] [INFO ] Implicit Places using invariants in 64 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 65 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 56/114 places, 106/512 transitions.
Applied a total of 0 rules in 1 ms. Remains 56 /56 variables (removed 0) and now considering 106/106 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 70 ms. Remains : 56/114 places, 106/512 transitions.
Stuttering acceptance computed with spot in 382 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : PermAdmissibility-PT-02-LTLCardinality-11
Stuttering criterion allowed to conclude after 32 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-PT-02-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-02-LTLCardinality-11 finished in 484 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1))))'
Support contains 3 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 512/512 transitions.
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 99 transition count 512
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 35 place count 79 transition count 346
Iterating global reduction 1 with 20 rules applied. Total rules applied 55 place count 79 transition count 346
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 77 place count 57 transition count 124
Iterating global reduction 1 with 22 rules applied. Total rules applied 99 place count 57 transition count 124
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 100 place count 56 transition count 116
Iterating global reduction 1 with 1 rules applied. Total rules applied 101 place count 56 transition count 116
Applied a total of 101 rules in 9 ms. Remains 56 /114 variables (removed 58) and now considering 116/512 (removed 396) transitions.
// Phase 1: matrix 116 rows 56 cols
[2025-06-02 22:24:27] [INFO ] Computed 16 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:24:27] [INFO ] Implicit Places using invariants in 54 ms returned [0, 6, 20, 28]
[2025-06-02 22:24:27] [INFO ] Actually due to overlaps returned [0, 6, 20]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 65 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 53/114 places, 116/512 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 75 ms. Remains : 53/114 places, 116/512 transitions.
Stuttering acceptance computed with spot in 104 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-PT-02-LTLCardinality-14
Product exploration explored 100000 steps with 50000 reset in 91 ms.
Product exploration explored 100000 steps with 50000 reset in 101 ms.
Computed a total of 53 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 53 transition count 116
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 11 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-PT-02-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-02-LTLCardinality-14 finished in 434 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F(G(p0)) U p1)))))'
Support contains 4 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 512/512 transitions.
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 99 transition count 512
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 36 place count 78 transition count 344
Iterating global reduction 1 with 21 rules applied. Total rules applied 57 place count 78 transition count 344
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 81 place count 54 transition count 108
Iterating global reduction 1 with 24 rules applied. Total rules applied 105 place count 54 transition count 108
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 108 place count 51 transition count 84
Iterating global reduction 1 with 3 rules applied. Total rules applied 111 place count 51 transition count 84
Applied a total of 111 rules in 12 ms. Remains 51 /114 variables (removed 63) and now considering 84/512 (removed 428) transitions.
// Phase 1: matrix 84 rows 51 cols
[2025-06-02 22:24:27] [INFO ] Computed 16 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 22:24:27] [INFO ] Implicit Places using invariants in 48 ms returned [0, 5, 18, 25]
[2025-06-02 22:24:27] [INFO ] Actually due to overlaps returned [0, 5, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 62 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 48/114 places, 84/512 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 75 ms. Remains : 48/114 places, 84/512 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-02-LTLCardinality-15
Stuttering criterion allowed to conclude after 32 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-02-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-02-LTLCardinality-15 finished in 257 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2025-06-02 22:24:27] [INFO ] Flatten gal took : 34 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5541801558222675696
[2025-06-02 22:24:27] [INFO ] Computing symmetric may disable matrix : 512 transitions.
[2025-06-02 22:24:27] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 22:24:27] [INFO ] Computing symmetric may enable matrix : 512 transitions.
[2025-06-02 22:24:27] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 22:24:27] [INFO ] Applying decomposition
[2025-06-02 22:24:28] [INFO ] Computing Do-Not-Accords matrix : 512 transitions.
[2025-06-02 22:24:28] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 22:24:28] [INFO ] Built C files in 70ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5541801558222675696
Running compilation step : cd /tmp/ltsmin5541801558222675696;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-02 22:24:28] [INFO ] Flatten gal took : 69 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16997048684530574805.txt' '-o' '/tmp/graph16997048684530574805.bin' '-w' '/tmp/graph16997048684530574805.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16997048684530574805.bin' '-l' '-1' '-v' '-w' '/tmp/graph16997048684530574805.weights' '-q' '0' '-e' '0.001'
[2025-06-02 22:24:28] [INFO ] Decomposing Gal with order
[2025-06-02 22:24:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 22:24:28] [INFO ] Removed a total of 429 redundant transitions.
[2025-06-02 22:24:28] [INFO ] Flatten gal took : 175 ms
[2025-06-02 22:24:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 206 labels/synchronizations in 8 ms.
[2025-06-02 22:24:28] [INFO ] Time to serialize gal into /tmp/LTLCardinality4642253422778611079.gal : 4 ms
[2025-06-02 22:24:28] [INFO ] Time to serialize properties into /tmp/LTLCardinality13790599205637089540.ltl : 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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality4642253422778611079.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13790599205637089540.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((G(F("((((gu0.aux15_2+gu0.aux15_1)+(gu0.aux15_0+gu0.aux15_6))+((gu0.aux15_5+gu0.aux15_4)+(gu0.aux15_3+gu0.aux15_7)))>gu0.c18)"))))
Formula 0 simplified : FG!"((((gu0.aux15_2+gu0.aux15_1)+(gu0.aux15_0+gu0.aux15_6))+((gu0.aux15_5+gu0.aux15_4)+(gu0.aux15_3+gu0.aux15_7)))>gu0.c18)"
Compilation finished in 1345 ms.
Running link step : cd /tmp/ltsmin5541801558222675696;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin5541801558222675696;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
LTSmin run took 436433 ms.
FORMULA PermAdmissibility-PT-02-LTLCardinality-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 730853 ms.

BK_STOP 1748903506476

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is PermAdmissibility-PT-02, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r142-tall-174876812700507"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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