Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r044-tall-174854029100779.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 CSRepetitions-PT-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r044-tall-174854029100779
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 22M
-rw-r--r-- 1 mcc users 203K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 741K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 631K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.6M 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.5K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 272K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 694K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 283K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 931K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.3M May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 4.4M May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.7M May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 6.9M May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 57K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 110K 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 1.2M 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 CSRepetitions-PT-10-LTLCardinality-00
FORMULA_NAME CSRepetitions-PT-10-LTLCardinality-01
FORMULA_NAME CSRepetitions-PT-10-LTLCardinality-02
FORMULA_NAME CSRepetitions-PT-10-LTLCardinality-03
FORMULA_NAME CSRepetitions-PT-10-LTLCardinality-04
FORMULA_NAME CSRepetitions-PT-10-LTLCardinality-05
FORMULA_NAME CSRepetitions-PT-10-LTLCardinality-06
FORMULA_NAME CSRepetitions-PT-10-LTLCardinality-07
FORMULA_NAME CSRepetitions-PT-10-LTLCardinality-08
FORMULA_NAME CSRepetitions-PT-10-LTLCardinality-09
FORMULA_NAME CSRepetitions-PT-10-LTLCardinality-10
FORMULA_NAME CSRepetitions-PT-10-LTLCardinality-11
FORMULA_NAME CSRepetitions-PT-10-LTLCardinality-12
FORMULA_NAME CSRepetitions-PT-10-LTLCardinality-13
FORMULA_NAME CSRepetitions-PT-10-LTLCardinality-14
FORMULA_NAME CSRepetitions-PT-10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748654584717

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CSRepetitions-PT-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-05-31 01:23:06] [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-05-31 01:23:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 01:23:06] [INFO ] Load time of PNML (sax parser for PT used): 234 ms
[2025-05-31 01:23:06] [INFO ] Transformed 1311 places.
[2025-05-31 01:23:06] [INFO ] Transformed 2300 transitions.
[2025-05-31 01:23:06] [INFO ] Parsed PT model containing 1311 places and 2300 transitions and 8700 arcs in 387 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 53 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA CSRepetitions-PT-10-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-10-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-10-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-10-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-10-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1211 out of 1311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 55 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
// Phase 1: matrix 2300 rows 1311 cols
[2025-05-31 01:23:07] [INFO ] Computed 110 invariants in 61 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:23:08] [INFO ] Implicit Places using invariants in 571 ms returned []
[2025-05-31 01:23:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:23:09] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-05-31 01:23:09] [INFO ] Implicit Places using invariants and state equation in 1107 ms returned []
Implicit Place search using SMT with State Equation took 1720 ms to find 0 implicit places.
Running 2200 sub problems to find dead transitions.
[2025-05-31 01:23:09] [INFO ] Invariant cache hit.
[2025-05-31 01:23:09] [INFO ] State equation strengthened by 100 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1211 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1211/3611 variables, and 10 constraints, problems are : Problem set: 0 solved, 2200 unsolved in 31028 ms.
Refiners :[Positive P Invariants (semi-flows): 10/110 constraints, State Equation: 0/1311 constraints, ReadFeed: 0/100 constraints, PredecessorRefiner: 2200/2100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2200 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1211 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1211/3611 variables, and 10 constraints, problems are : Problem set: 0 solved, 2200 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 10/110 constraints, State Equation: 0/1311 constraints, ReadFeed: 0/100 constraints, PredecessorRefiner: 100/2100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63630ms problems are : Problem set: 0 solved, 2200 unsolved
Search for dead transitions found 0 dead transitions in 63658ms
Finished structural reductions in LTL mode , in 1 iterations and 65475 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Support contains 1211 out of 1311 places after structural reductions.
[2025-05-31 01:24:13] [INFO ] Flatten gal took : 177 ms
[2025-05-31 01:24:13] [INFO ] Flatten gal took : 126 ms
[2025-05-31 01:24:13] [INFO ] Input system was already deterministic with 2300 transitions.
RANDOM walk for 40000 steps (217 resets) in 3807 ms. (10 steps per ms) remains 7/28 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1217 ms. (32 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 267 ms. (149 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 202 ms. (197 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 101 ms. (392 steps per ms) remains 6/6 properties
[2025-05-31 01:24:15] [INFO ] Invariant cache hit.
[2025-05-31 01:24:15] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp22 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp26 is UNSAT
At refinement iteration 2 (OVERLAPS) 398/504 variables, 101/103 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 0/103 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 2200/2704 variables, 504/607 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2704 variables, 100/707 constraints. Problems are: Problem set: 5 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/2704 variables, 0/707 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 907/3611 variables, 807/1514 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3611 variables, 7/1521 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3611 variables, 0/1521 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/3611 variables, 0/1521 constraints. Problems are: Problem set: 5 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3611/3611 variables, and 1521 constraints, problems are : Problem set: 5 solved, 1 unsolved in 1059 ms.
Refiners :[Positive P Invariants (semi-flows): 110/110 constraints, State Equation: 1311/1311 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 6/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 100/201 variables, 100/100 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 0/100 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2200/2401 variables, 201/301 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2401 variables, 100/401 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2401 variables, 0/401 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1210/3611 variables, 1110/1511 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3611 variables, 10/1521 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3611 variables, 0/1521 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/3611 variables, 0/1521 constraints. Problems are: Problem set: 5 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3611/3611 variables, and 1521 constraints, problems are : Problem set: 5 solved, 1 unsolved in 1087 ms.
Refiners :[Positive P Invariants (semi-flows): 110/110 constraints, State Equation: 1311/1311 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 1/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2179ms problems are : Problem set: 5 solved, 1 unsolved
Finished Parikh walk after 91 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=45 )
Parikh walk visited 1 properties in 7 ms.
Successfully simplified 5 atomic propositions for a total of 11 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA CSRepetitions-PT-10-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-10-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 100 stable transitions
FORMULA CSRepetitions-PT-10-LTLCardinality-12 FALSE 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(p0))'
Support contains 1101 out of 1311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 112 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2025-05-31 01:24:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:24:20] [INFO ] Implicit Places using invariants in 519 ms returned []
[2025-05-31 01:24:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:24:21] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-05-31 01:24:22] [INFO ] Implicit Places using invariants and state equation in 1421 ms returned []
Implicit Place search using SMT with State Equation took 1944 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 01:24:22] [INFO ] Redundant transitions in 155 ms returned []
Running 2200 sub problems to find dead transitions.
[2025-05-31 01:24:22] [INFO ] Invariant cache hit.
[2025-05-31 01:24:22] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1211 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1211/3611 variables, and 10 constraints, problems are : Problem set: 0 solved, 2200 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 10/110 constraints, State Equation: 0/1311 constraints, ReadFeed: 0/100 constraints, PredecessorRefiner: 2200/2100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2200 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1211 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1211/3611 variables, and 10 constraints, problems are : Problem set: 0 solved, 2200 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 10/110 constraints, State Equation: 0/1311 constraints, ReadFeed: 0/100 constraints, PredecessorRefiner: 100/2100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62073ms problems are : Problem set: 0 solved, 2200 unsolved
Search for dead transitions found 0 dead transitions in 62079ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64309 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p0)]
Running random walk in product with property : CSRepetitions-PT-10-LTLCardinality-01
Product exploration explored 100000 steps with 3081 reset in 4066 ms.
Product exploration explored 100000 steps with 3088 reset in 4052 ms.
Computed a total of 0 stabilizing places and 100 stable transitions
Computed a total of 0 stabilizing places and 100 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
RANDOM walk for 166 steps (0 resets) in 11 ms. (13 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2025-05-31 01:25:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 01:25:48] [INFO ] [Real]Absence check using 110 positive place invariants in 3460 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1101 out of 1311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 107 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2025-05-31 01:25:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:25:49] [INFO ] Implicit Places using invariants in 682 ms returned []
[2025-05-31 01:25:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:25:50] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-05-31 01:25:50] [INFO ] Implicit Places using invariants and state equation in 1550 ms returned []
Implicit Place search using SMT with State Equation took 2238 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 01:25:51] [INFO ] Redundant transitions in 89 ms returned []
Running 2200 sub problems to find dead transitions.
[2025-05-31 01:25:51] [INFO ] Invariant cache hit.
[2025-05-31 01:25:51] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 1.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s71 0.0)
(s72 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 1.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s116 0.0)
(s117 1.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s148 1.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s160 0.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 1.0)
(s168 1.0)
(s169 0.0)
(timeout
s170 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1211 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1211/3611 variables, and 10 constraints, problems are : Problem set: 0 solved, 2200 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 10/110 constraints, State Equation: 0/1311 constraints, ReadFeed: 0/100 constraints, PredecessorRefiner: 2200/2100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2200 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1211 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1211/3611 variables, and 10 constraints, problems are : Problem set: 0 solved, 2200 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 10/110 constraints, State Equation: 0/1311 constraints, ReadFeed: 0/100 constraints, PredecessorRefiner: 100/2100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62198ms problems are : Problem set: 0 solved, 2200 unsolved
Search for dead transitions found 0 dead transitions in 62205ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64667 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Computed a total of 0 stabilizing places and 100 stable transitions
Computed a total of 0 stabilizing places and 100 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
RANDOM walk for 394 steps (2 resets) in 23 ms. (16 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
[2025-05-31 01:26:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 01:27:09] [INFO ] [Real]Absence check using 110 positive place invariants in 3606 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:854)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:587)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:619)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:262)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:975)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
[2025-05-31 01:27:09] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 3077 reset in 3947 ms.
Stack based approach found an accepted trace after 61218 steps with 1894 reset with depth 20 and stack size 20 in 2442 ms.
FORMULA CSRepetitions-PT-10-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-PT-10-LTLCardinality-01 finished in 177212 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||G(p1)))))'
Support contains 210 out of 1311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 116 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2025-05-31 01:27:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:27:16] [INFO ] Implicit Places using invariants in 783 ms returned []
[2025-05-31 01:27:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:27:17] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-05-31 01:27:20] [INFO ] Implicit Places using invariants and state equation in 4305 ms returned []
Implicit Place search using SMT with State Equation took 5090 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 01:27:21] [INFO ] Redundant transitions in 169 ms returned []
Running 2200 sub problems to find dead transitions.
[2025-05-31 01:27:21] [INFO ] Invariant cache hit.
[2025-05-31 01:27:21] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 1.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s71 0.0)
(s72 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 1.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s116 0.0)
(s117 1.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s148 1.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s160 0.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 1.0)
(s168 1.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 1.0)
(s184 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 1.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 1.0)
(s210 1.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 1.0)
(s220 0.0)
(s221 0.0)
(s222 1.0)
(s223 1.0)
(s224 0.0)
(s225 0.0)
(s227 1.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s250 1.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 1.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 1.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s280 0.0)
(s282 0.0)
(s283 0.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 0.0)
(s288 1.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 1.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 1.0)
(s324 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1211 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1211/3611 variables, and 10 constraints, problems are : Problem set: 0 solved, 2200 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 10/110 constraints, State Equation: 0/1311 constraints, ReadFeed: 0/100 constraints, PredecessorRefiner: 2200/2100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2200 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1211 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1211/3611 variables, and 10 constraints, problems are : Problem set: 0 solved, 2200 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 10/110 constraints, State Equation: 0/1311 constraints, ReadFeed: 0/100 constraints, PredecessorRefiner: 100/2100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62159ms problems are : Problem set: 0 solved, 2200 unsolved
Search for dead transitions found 0 dead transitions in 62165ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 67566 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CSRepetitions-PT-10-LTLCardinality-03
Product exploration explored 100000 steps with 453 reset in 2034 ms.
Product exploration explored 100000 steps with 454 reset in 2078 ms.
Computed a total of 0 stabilizing places and 100 stable transitions
Computed a total of 0 stabilizing places and 100 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 112 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 608 steps (0 resets) in 29 ms. (20 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0)]
Knowledge based reduction with 9 factoid took 214 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2025-05-31 01:28:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 210 out of 1311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 80 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2025-05-31 01:28:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:28:44] [INFO ] Implicit Places using invariants in 827 ms returned []
[2025-05-31 01:28:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:28:44] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-05-31 01:28:48] [INFO ] Implicit Places using invariants and state equation in 4526 ms returned []
Implicit Place search using SMT with State Equation took 5358 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 01:28:48] [INFO ] Redundant transitions in 90 ms returned []
Running 2200 sub problems to find dead transitions.
[2025-05-31 01:28:48] [INFO ] Invariant cache hit.
[2025-05-31 01:28:48] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1211 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1211/3611 variables, and 10 constraints, problems are : Problem set: 0 solved, 2200 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 10/110 constraints, State Equation: 0/1311 constraints, ReadFeed: 0/100 constraints, PredecessorRefiner: 2200/2100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2200 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1211 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2200 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1211/3611 variables, and 10 constraints, problems are : Problem set: 0 solved, 2200 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 10/110 constraints, State Equation: 0/1311 constraints, ReadFeed: 0/100 constraints, PredecessorRefiner: 100/2100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62030ms problems are : Problem set: 0 solved, 2200 unsolved
Search for dead transitions found 0 dead transitions in 62035ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 67580 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Computed a total of 0 stabilizing places and 100 stable transitions
Computed a total of 0 stabilizing places and 100 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 96 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 730 steps (0 resets) in 29 ms. (24 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0)]
Knowledge based reduction with 9 factoid took 214 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2025-05-31 01:29:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.assertInvariants(DeadlockTester.java:1974)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:841)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:587)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:619)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:262)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:975)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
[2025-05-31 01:30:06] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (AND (NOT p0) (NOT p1))
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 459 reset in 2381 ms.
Product exploration explored 100000 steps with 460 reset in 2395 ms.
Built C files in :
/tmp/ltsmin9430301403956620893
[2025-05-31 01:30:11] [INFO ] Too many transitions (2300) to apply POR reductions. Disabling POR matrices.
[2025-05-31 01:30:11] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9430301403956620893
Running compilation step : cd /tmp/ltsmin9430301403956620893;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9430301403956620893;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9430301403956620893;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 210 out of 1311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 106 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2025-05-31 01:30:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:30:15] [INFO ] Implicit Places using invariants in 838 ms returned []
[2025-05-31 01:30:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:30:16] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-05-31 01:30:20] [INFO ] Implicit Places using invariants and state equation in 4349 ms returned []
Implicit Place search using SMT with State Equation took 5200 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 01:30:20] [INFO ] Redundant transitions in 86 ms returned []
Running 2200 sub problems to find dead transitions.
[2025-05-31 01:30:20] [INFO ] Invariant cache hit.
[2025-05-31 01:30:20] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 1.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s71 0.0)
(s72 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 1.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s116 0.0)
(s117 1.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s148 1.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s160 0.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 1.0)
(s168 1.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 1.0)
(s184 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 1.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 1.0)
(s210 1.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 1.0)
(s220 0.0)
(s221 0.0)
(s222 1.0)
(s223 1.0)
(s224 0.0)
(s225 0.0)
(s227 1.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s250 1.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 1.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 1.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s280 0.0)
(s282 0.0)
(s283 0.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 0.0)
(s288 1.0)
(s289 0.0)
(s290 0.0)timeout

(s291 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1211 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1211/3611 variables, and 10 constraints, problems are : Problem set: 0 solved, 2200 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 10/110 constraints, State Equation: 0/1311 constraints, ReadFeed: 0/100 constraints, PredecessorRefiner: 2200/2100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2200 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1211 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1211/3611 variables, and 10 constraints, problems are : Problem set: 0 solved, 2200 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 10/110 constraints, State Equation: 0/1311 constraints, ReadFeed: 0/100 constraints, PredecessorRefiner: 100/2100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62382ms problems are : Problem set: 0 solved, 2200 unsolved
Search for dead transitions found 0 dead transitions in 62386ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 67789 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Built C files in :
/tmp/ltsmin10322207526198846591
[2025-05-31 01:31:22] [INFO ] Too many transitions (2300) to apply POR reductions. Disabling POR matrices.
[2025-05-31 01:31:22] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10322207526198846591
Running compilation step : cd /tmp/ltsmin10322207526198846591;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10322207526198846591;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10322207526198846591;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-05-31 01:31:25] [INFO ] Flatten gal took : 93 ms
[2025-05-31 01:31:25] [INFO ] Flatten gal took : 89 ms
[2025-05-31 01:31:25] [INFO ] Time to serialize gal into /tmp/LTL1896484887693747608.gal : 23 ms
[2025-05-31 01:31:25] [INFO ] Time to serialize properties into /tmp/LTL1466286504068920578.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1896484887693747608.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6622431427107851835.hoa' '-atoms' '/tmp/LTL1466286504068920578.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...317
Loading property file /tmp/LTL1466286504068920578.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6622431427107851835.hoa
Detected timeout of ITS tools.
[2025-05-31 01:31:41] [INFO ] Flatten gal took : 170 ms
[2025-05-31 01:31:41] [INFO ] Flatten gal took : 132 ms
[2025-05-31 01:31:41] [INFO ] Time to serialize gal into /tmp/LTL10552840093509568025.gal : 14 ms
[2025-05-31 01:31:41] [INFO ] Time to serialize properties into /tmp/LTL10734024296572317761.ltl : 22 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/LTL10552840093509568025.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10734024296572317761.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...277
Read 1 LTL properties
Checking formula 0 : !((G(F(("((((((((Client_Waiting_76+Client_Waiting_74)+(Client_Waiting_67+Client_Waiting_81))+((Client_Waiting_36+Client_Waiting_25)+(C...4220
Formula 0 simplified : G(F!"((((((((Client_Sending_55+Client_Sending_63)+(Client_Sending_97+Client_Sending_78))+((Client_Sending_50+Client_Sending_26)+(Cli...4213
Detected timeout of ITS tools.
[2025-05-31 01:31:56] [INFO ] Flatten gal took : 71 ms
[2025-05-31 01:31:56] [INFO ] Applying decomposition
[2025-05-31 01:31:56] [INFO ] Flatten gal took : 73 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/graph3484924802268107230.txt' '-o' '/tmp/graph3484924802268107230.bin' '-w' '/tmp/graph3484924802268107230.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3484924802268107230.bin' '-l' '-1' '-v' '-w' '/tmp/graph3484924802268107230.weights' '-q' '0' '-e' '0.001'
[2025-05-31 01:31:57] [INFO ] Decomposing Gal with order
[2025-05-31 01:31:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 01:31:59] [INFO ] Removed a total of 1890 redundant transitions.
[2025-05-31 01:32:00] [INFO ] Flatten gal took : 2793 ms
[2025-05-31 01:32:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 1000 labels/synchronizations in 148 ms.
[2025-05-31 01:32:00] [INFO ] Time to serialize gal into /tmp/LTL3302760155120752919.gal : 35 ms
[2025-05-31 01:32:00] [INFO ] Time to serialize properties into /tmp/LTL5774257919865731870.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/LTL3302760155120752919.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5774257919865731870.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...275
Read 1 LTL properties
Checking formula 0 : !((G(F(("((((((((gu1.Client_Waiting_76+gu1.Client_Waiting_74)+(gu1.Client_Waiting_67+gu1.Client_Waiting_81))+((gu1.Client_Waiting_36+g...5060
Formula 0 simplified : G(F!"((((((((gu0.Client_Sending_55+gu0.Client_Sending_63)+(gu0.Client_Sending_97+gu0.Client_Sending_78))+((gu0.Client_Sending_50+gu0...5053
Detected timeout of ITS tools.
Treatment of property CSRepetitions-PT-10-LTLCardinality-03 finished in 300034 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))))&&(p0 U p3)))'
Support contains 1211 out of 1311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 8 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2025-05-31 01:32:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:32:15] [INFO ] Implicit Places using invariants in 289 ms returned []
[2025-05-31 01:32:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:32:16] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-05-31 01:32:16] [INFO ] Implicit Places using invariants and state equation in 759 ms returned []
Implicit Place search using SMT with State Equation took 1050 ms to find 0 implicit places.
Running 2200 sub problems to find dead transitions.
[2025-05-31 01:32:16] [INFO ] Invariant cache hit.
[2025-05-31 01:32:16] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1211 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1211/3611 variables, and 10 constraints, problems are : Problem set: 0 solved, 2200 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 10/110 constraints, State Equation: 0/1311 constraints, ReadFeed: 0/100 constraints, PredecessorRefiner: 2200/2100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2200 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1211 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2200 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1211/3611 variables, and 10 constraints, problems are : Problem set: 0 solved, 2200 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 10/110 constraints, State Equation: 0/1311 constraints, ReadFeed: 0/100 constraints, PredecessorRefiner: 100/2100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62157ms problems are : Problem set: 0 solved, 2200 unsolved
Search for dead transitions found 0 dead transitions in 62161ms
Finished structural reductions in LTL mode , in 1 iterations and 63224 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Stuttering acceptance computed with spot in 309 ms :[(OR (NOT p3) (NOT p0) (NOT p2)), true, (OR (NOT p0) (NOT p2)), (NOT p3), (NOT p2), (NOT p2), (NOT p1)]
Running random walk in product with property : CSRepetitions-PT-10-LTLCardinality-04
Product exploration explored 100000 steps with 443 reset in 6852 ms.
Product exploration explored 100000 steps with 445 reset in 6859 ms.
Computed a total of 0 stabilizing places and 100 stable transitions
Computed a total of 0 stabilizing places and 100 stable transitions
Knowledge obtained : [(AND p3 p0 p1 (NOT p2)), (X p3), (X (NOT (AND (NOT p3) (NOT p0)))), (X p0), (X (AND p0 p1)), (X (NOT (AND (NOT p3) p0))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT p2))), (X (X (AND p1 (NOT p2)))), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p3) p0)))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 104 ms. Reduced automaton from 7 states, 15 edges and 4 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(NOT p2), true, (NOT p2), (NOT p2), (NOT p1)]
RANDOM walk for 40006 steps (216 resets) in 3766 ms. (10 steps per ms) remains 2/4 properties
BEST_FIRST walk for 3360 steps (0 resets) in 253 ms. (13 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p3 p0 p1 (NOT p2)), (X p3), (X (NOT (AND (NOT p3) (NOT p0)))), (X p0), (X (AND p0 p1)), (X (NOT (AND (NOT p3) p0))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT p2))), (X (X (AND p1 (NOT p2)))), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p3) p0)))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F p2), (F (NOT (OR p1 p2))), (F (NOT (AND p1 (NOT p2))))]
Property proved to be false thanks to negative knowledge :(F (NOT p1))
Knowledge based reduction with 16 factoid took 150 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CSRepetitions-PT-10-LTLCardinality-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-PT-10-LTLCardinality-04 finished in 80641 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(X(X(X(G(p0))))))))'
Support contains 200 out of 1311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 73 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2025-05-31 01:33:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:33:37] [INFO ] Implicit Places using invariants in 866 ms returned []
[2025-05-31 01:33:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:33:37] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-05-31 01:33:41] [INFO ] Implicit Places using invariants and state equation in 4090 ms returned []
Implicit Place search using SMT with State Equation took 4965 ms to find 0 implicit places.
Running 2200 sub problems to find dead transitions.
[2025-05-31 01:33:41] [INFO ] Invariant cache hit.
[2025-05-31 01:33:41] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1211 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1211/3611 variables, and 10 constraints, problems are : Problem set: 0 solved, 2200 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 10/110 constraints, State Equation: 0/1311 constraints, ReadFeed: 0/100 constraints, PredecessorRefiner: 2200/2100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2200 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1211 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1211/3611 variables, and 10 constraints, problems are : Problem set: 0 solved, 2200 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 10/110 constraints, State Equation: 0/1311 constraints, ReadFeed: 0/100 constraints, PredecessorRefiner: 100/2100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62363ms problems are : Problem set: 0 solved, 2200 unsolved
Search for dead transitions found 0 dead transitions in 62368ms
Finished structural reductions in LTL mode , in 1 iterations and 67412 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Stuttering acceptance computed with spot in 239 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-10-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 100 steps with 0 reset in 3 ms.
FORMULA CSRepetitions-PT-10-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-10-LTLCardinality-05 finished in 67670 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 1010 out of 1311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 0 with 300 rules applied. Total rules applied 300 place count 1111 transition count 2200
Applied a total of 300 rules in 255 ms. Remains 1111 /1311 variables (removed 200) and now considering 2200/2300 (removed 100) transitions.
// Phase 1: matrix 2200 rows 1111 cols
[2025-05-31 01:34:44] [INFO ] Computed 10 invariants in 23 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:34:44] [INFO ] Implicit Places using invariants in 189 ms returned []
[2025-05-31 01:34:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:34:44] [INFO ] Implicit Places using invariants and state equation in 586 ms returned []
Implicit Place search using SMT with State Equation took 796 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 01:34:45] [INFO ] Redundant transitions in 170 ms returned []
Running 2100 sub problems to find dead transitions.
[2025-05-31 01:34:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1110 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1110/3311 variables, and 10 constraints, problems are : Problem set: 0 solved, 2100 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/1111 constraints, PredecessorRefiner: 2100/2100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2100 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1110 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1110/3311 variables, and 10 constraints, problems are : Problem set: 0 solved, 2100 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/1111 constraints, PredecessorRefiner: 0/2100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61778ms problems are : Problem set: 0 solved, 2100 unsolved
Search for dead transitions found 0 dead transitions in 61783ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1111/1311 places, 2200/2300 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63015 ms. Remains : 1111/1311 places, 2200/2300 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-10-LTLCardinality-06
Product exploration explored 100000 steps with 1328 reset in 2283 ms.
Stack based approach found an accepted trace after 399 steps with 4 reset with depth 63 and stack size 63 in 10 ms.
FORMULA CSRepetitions-PT-10-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-PT-10-LTLCardinality-06 finished in 65406 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(p0)||(F(p1)&&F(p2))))'
Support contains 1201 out of 1311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 46 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
// Phase 1: matrix 2300 rows 1311 cols
[2025-05-31 01:35:49] [INFO ] Computed 110 invariants in 26 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:35:49] [INFO ] Implicit Places using invariants in 216 ms returned []
[2025-05-31 01:35:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:35:50] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-05-31 01:35:50] [INFO ] Implicit Places using invariants and state equation in 1008 ms returned []
Implicit Place search using SMT with State Equation took 1226 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 01:35:50] [INFO ] Redundant transitions in 93 ms returned []
Running 2200 sub problems to find dead transitions.
[2025-05-31 01:35:50] [INFO ] Invariant cache hit.
[2025-05-31 01:35:50] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1211 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1211/3611 variables, and 10 constraints, problems are : Problem set: 0 solved, 2200 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 10/110 constraints, State Equation: 0/1311 constraints, ReadFeed: 0/100 constraints, PredecessorRefiner: 2200/2100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2200 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1211 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2200 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1211/3611 variables, and 10 constraints, problems are : Problem set: 0 solved, 2200 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 10/110 constraints, State Equation: 0/1311 constraints, ReadFeed: 0/100 constraints, PredecessorRefiner: 100/2100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62267ms problems are : Problem set: 0 solved, 2200 unsolved
Search for dead transitions found 0 dead transitions in 62271ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63650 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Stuttering acceptance computed with spot in 199 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : CSRepetitions-PT-10-LTLCardinality-07
Product exploration explored 100000 steps with 4464 reset in 3960 ms.
Product exploration explored 100000 steps with 4536 reset in 4007 ms.
Computed a total of 0 stabilizing places and 100 stable transitions
Computed a total of 0 stabilizing places and 100 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 12 factoid took 412 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 128 steps (0 resets) in 11 ms. (10 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F p1)]
Knowledge based reduction with 12 factoid took 436 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 78 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p1)]
[2025-05-31 01:37:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F p1), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 12 factoid took 399 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CSRepetitions-PT-10-LTLCardinality-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-PT-10-LTLCardinality-07 finished in 84029 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&&(X(p1) U G(p0))&&(p2||F(p1))))))'
Support contains 5 out of 1311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 38 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2025-05-31 01:37:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:37:14] [INFO ] Implicit Places using invariants in 1200 ms returned []
[2025-05-31 01:37:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:37:15] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-05-31 01:37:19] [INFO ] Implicit Places using invariants and state equation in 4396 ms returned []
Implicit Place search using SMT with State Equation took 5598 ms to find 0 implicit places.
Running 2200 sub problems to find dead transitions.
[2025-05-31 01:37:19] [INFO ] Invariant cache hit.
[2025-05-31 01:37:19] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1211 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1211/3611 variables, and 10 constraints, problems are : Problem set: 0 solved, 2200 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 10/110 constraints, State Equation: 0/1311 constraints, ReadFeed: 0/100 constraints, PredecessorRefiner: 2200/2100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2200 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1211 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1211/3611 variables, and 10 constraints, problems are : Problem set: 0 solved, 2200 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 10/110 constraints, State Equation: 0/1311 constraints, ReadFeed: 0/100 constraints, PredecessorRefiner: 100/2100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62499ms problems are : Problem set: 0 solved, 2200 unsolved
Search for dead transitions found 0 dead transitions in 62505ms
Finished structural reductions in LTL mode , in 1 iterations and 68151 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Stuttering acceptance computed with spot in 355 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) p1), (NOT p1)]
Running random walk in product with property : CSRepetitions-PT-10-LTLCardinality-09
Product exploration explored 100000 steps with 20013 reset in 1009 ms.
Product exploration explored 100000 steps with 20024 reset in 1034 ms.
Computed a total of 0 stabilizing places and 100 stable transitions
Computed a total of 0 stabilizing places and 100 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 84 ms. Reduced automaton from 9 states, 17 edges and 3 AP (stutter sensitive) to 8 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 315 ms :[(NOT p0), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) p1), (NOT p1)]
RANDOM walk for 33981 steps (184 resets) in 493 ms. (68 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 5 factoid took 307 ms. Reduced automaton from 8 states, 14 edges and 2 AP (stutter sensitive) to 8 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 327 ms :[(NOT p0), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) p1), (NOT p1)]
Stuttering acceptance computed with spot in 323 ms :[(NOT p0), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) p1), (NOT p1)]
Support contains 4 out of 1311 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 42 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2025-05-31 01:38:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:38:26] [INFO ] Implicit Places using invariants in 1140 ms returned []
[2025-05-31 01:38:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:38:27] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-05-31 01:38:31] [INFO ] Implicit Places using invariants and state equation in 4451 ms returned []
Implicit Place search using SMT with State Equation took 5597 ms to find 0 implicit places.
Running 2200 sub problems to find dead transitions.
[2025-05-31 01:38:31] [INFO ] Invariant cache hit.
[2025-05-31 01:38:31] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1211 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1211/3611 variables, and 10 constraints, problems are : Problem set: 0 solved, 2200 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 10/110 constraints, State Equation: 0/1311 constraints, ReadFeed: 0/100 constraints, PredecessorRefiner: 2200/2100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2200 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1211 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1211/3611 variables, and 10 constraints, problems are : Problem set: 0 solved, 2200 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 10/110 constraints, State Equation: 0/1311 constraints, ReadFeed: 0/100 constraints, PredecessorRefiner: 100/2100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62308ms problems are : Problem set: 0 solved, 2200 unsolved
Search for dead transitions found 0 dead transitions in 62313ms
Finished structural reductions in LTL mode , in 1 iterations and 67959 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Computed a total of 0 stabilizing places and 100 stable transitions
Computed a total of 0 stabilizing places and 100 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 93 ms. Reduced automaton from 8 states, 14 edges and 2 AP (stutter sensitive) to 8 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 329 ms :[(NOT p0), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) p1), (NOT p1)]
RANDOM walk for 34345 steps (183 resets) in 420 ms. (81 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 1 factoid took 269 ms. Reduced automaton from 8 states, 14 edges and 2 AP (stutter sensitive) to 8 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 329 ms :[(NOT p0), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) p1), (NOT p1)]
Stuttering acceptance computed with spot in 330 ms :[(NOT p0), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) p1), (NOT p1)]
Stuttering acceptance computed with spot in 309 ms :[(NOT p0), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) p1), (NOT p1)]
Product exploration explored 100000 steps with 20038 reset in 1003 ms.
Product exploration explored 100000 steps with 20010 reset in 1047 ms.
Applying partial POR strategy [false, false, false, true, true, true, true, true]
Stuttering acceptance computed with spot in 313 ms :[(NOT p0), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) p1), (NOT p1)]
Support contains 4 out of 1311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 171 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 01:39:38] [INFO ] Redundant transitions in 90 ms returned []
Running 2200 sub problems to find dead transitions.
[2025-05-31 01:39:38] [INFO ] Invariant cache hit.
[2025-05-31 01:39:38] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1211 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1211/3611 variables, and 10 constraints, problems are : Problem set: 0 solved, 2200 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 10/110 constraints, State Equation: 0/1311 constraints, ReadFeed: 0/100 constraints, PredecessorRefiner: 2200/2100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2200 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1211 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1211/3611 variables, and 10 constraints, problems are : Problem set: 0 solved, 2200 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 10/110 constraints, State Equation: 0/1311 constraints, ReadFeed: 0/100 constraints, PredecessorRefiner: 100/2100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62385ms problems are : Problem set: 0 solved, 2200 unsolved
Search for dead transitions found 0 dead transitions in 62390ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62666 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Built C files in :
/tmp/ltsmin2706581038192607181
[2025-05-31 01:40:40] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2706581038192607181
Running compilation step : cd /tmp/ltsmin2706581038192607181;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2706581038192607181;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2706581038192607181;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 4 out of 1311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 55 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2025-05-31 01:40:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:40:44] [INFO ] Implicit Places using invariants in 1153 ms returned []
[2025-05-31 01:40:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:40:45] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-05-31 01:40:49] [INFO ] Implicit Places using invariants and state equation in 4305 ms returned []
Implicit Place search using SMT with State Equation took 5463 ms to find 0 implicit places.
Running 2200 sub problems to find dead transitions.
[2025-05-31 01:40:49] [INFO ] Invariant cache hit.
[2025-05-31 01:40:49] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1211 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1211/3611 variables, and 10 constraints, problems are : Problem set: 0 solved, 2200 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 10/110 constraints, State Equation: 0/1311 constraints, ReadFeed: 0/100 constraints, PredecessorRefiner: 2200/2100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2200 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1211 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1211/3611 variables, and 10 constraints, problems are : Problem set: 0 solved, 2200 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 10/110 constraints, State Equation: 0/1311 constraints, ReadFeed: 0/100 constraints, PredecessorRefiner: 100/2100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62088ms problems are : Problem set: 0 solved, 2200 unsolved
Search for dead transitions found 0 dead transitions in 62093ms
Finished structural reductions in LTL mode , in 1 iterations and 67618 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Built C files in :
/tmp/ltsmin13816909225743479703
[2025-05-31 01:41:51] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13816909225743479703
Running compilation step : cd /tmp/ltsmin13816909225743479703;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13816909225743479703;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13816909225743479703;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-05-31 01:41:54] [INFO ] Flatten gal took : 109 ms
[2025-05-31 01:41:54] [INFO ] Flatten gal took : 105 ms
[2025-05-31 01:41:54] [INFO ] Time to serialize gal into /tmp/LTL11842351185252944816.gal : 12 ms
[2025-05-31 01:41:54] [INFO ] Time to serialize properties into /tmp/LTL7627418083289899285.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/LTL11842351185252944816.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12835097039013185946.hoa' '-atoms' '/tmp/LTL7627418083289899285.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...319
Loading property file /tmp/LTL7627418083289899285.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12835097039013185946.hoa
Detected timeout of ITS tools.
[2025-05-31 01:42:09] [INFO ] Flatten gal took : 71 ms
[2025-05-31 01:42:09] [INFO ] Flatten gal took : 72 ms
[2025-05-31 01:42:09] [INFO ] Time to serialize gal into /tmp/LTL13678276672471516838.gal : 12 ms
[2025-05-31 01:42:09] [INFO ] Time to serialize properties into /tmp/LTL10997080046782656641.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/LTL13678276672471516838.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10997080046782656641.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...277
Read 1 LTL properties
Checking formula 0 : !((X(X((("(Server_Anwering_1_2<=Server_Waiting_5)")&&((X("(Client_Sending_48<=RequestBufferSlots)"))U(G("(Server_Anwering_1_2<=Server_...269
Formula 0 simplified : XX(!"(Server_Anwering_1_2<=Server_Waiting_5)" | (X!"(Client_Sending_48<=RequestBufferSlots)" R F!"(Server_Anwering_1_2<=Server_Waiti...256
Detected timeout of ITS tools.
[2025-05-31 01:42:25] [INFO ] Flatten gal took : 66 ms
[2025-05-31 01:42:25] [INFO ] Applying decomposition
[2025-05-31 01:42:25] [INFO ] Flatten gal took : 65 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/graph7316002991884517485.txt' '-o' '/tmp/graph7316002991884517485.bin' '-w' '/tmp/graph7316002991884517485.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7316002991884517485.bin' '-l' '-1' '-v' '-w' '/tmp/graph7316002991884517485.weights' '-q' '0' '-e' '0.001'
[2025-05-31 01:42:25] [INFO ] Decomposing Gal with order
[2025-05-31 01:42:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 01:42:25] [INFO ] Removed a total of 3073 redundant transitions.
[2025-05-31 01:42:25] [INFO ] Flatten gal took : 137 ms
[2025-05-31 01:42:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 1195 labels/synchronizations in 54 ms.
[2025-05-31 01:42:25] [INFO ] Time to serialize gal into /tmp/LTL14487450651867124540.gal : 13 ms
[2025-05-31 01:42:25] [INFO ] Time to serialize properties into /tmp/LTL9740596924688512309.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/LTL14487450651867124540.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9740596924688512309.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 : !((X(X((("(gu80.Server_Anwering_1_2<=gu80.Server_Waiting_5)")&&((X("(gu27.Client_Sending_48<=gu27.RequestBufferSlots)"))U(G("(gu80.Ser...319
Formula 0 simplified : XX(!"(gu80.Server_Anwering_1_2<=gu80.Server_Waiting_5)" | (X!"(gu27.Client_Sending_48<=gu27.RequestBufferSlots)" R F!"(gu80.Server_A...306
Detected timeout of ITS tools.
Treatment of property CSRepetitions-PT-10-LTLCardinality-09 finished in 327477 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((p0 U p1)) U X(p1)) U X(X(p2)))))'
Support contains 4 out of 1311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1311/1311 places, 2300/2300 transitions.
Applied a total of 0 rules in 43 ms. Remains 1311 /1311 variables (removed 0) and now considering 2300/2300 (removed 0) transitions.
[2025-05-31 01:42:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:42:41] [INFO ] Implicit Places using invariants in 1046 ms returned []
[2025-05-31 01:42:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 01:42:42] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-05-31 01:42:46] [INFO ] Implicit Places using invariants and state equation in 4920 ms returned []
Implicit Place search using SMT with State Equation took 5968 ms to find 0 implicit places.
Running 2200 sub problems to find dead transitions.
[2025-05-31 01:42:46] [INFO ] Invariant cache hit.
[2025-05-31 01:42:46] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1211 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1211/3611 variables, and 10 constraints, problems are : Problem set: 0 solved, 2200 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 10/110 constraints, State Equation: 0/1311 constraints, ReadFeed: 0/100 constraints, PredecessorRefiner: 2200/2100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2200 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1211 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2200 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1211/3611 variables, and 10 constraints, problems are : Problem set: 0 solved, 2200 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 10/110 constraints, State Equation: 0/1311 constraints, ReadFeed: 0/100 constraints, PredecessorRefiner: 100/2100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62292ms problems are : Problem set: 0 solved, 2200 unsolved
Search for dead transitions found 0 dead transitions in 62309ms
Finished structural reductions in LTL mode , in 1 iterations and 68330 ms. Remains : 1311/1311 places, 2300/2300 transitions.
Stuttering acceptance computed with spot in 527 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2), true, (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) p0)]
Running random walk in product with property : CSRepetitions-PT-10-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-PT-10-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-10-LTLCardinality-14 finished in 68899 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||G(p1)))))'
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&&(X(p1) U G(p0))&&(p2||F(p1))))))'
[2025-05-31 01:43:50] [INFO ] Flatten gal took : 122 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6779956751788036800
[2025-05-31 01:43:50] [INFO ] Too many transitions (2300) to apply POR reductions. Disabling POR matrices.
[2025-05-31 01:43:50] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6779956751788036800
Running compilation step : cd /tmp/ltsmin6779956751788036800;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' '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-05-31 01:43:50] [INFO ] Applying decomposition
[2025-05-31 01:43:50] [INFO ] Flatten gal took : 131 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/graph13958838933046125096.txt' '-o' '/tmp/graph13958838933046125096.bin' '-w' '/tmp/graph13958838933046125096.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13958838933046125096.bin' '-l' '-1' '-v' '-w' '/tmp/graph13958838933046125096.weights' '-q' '0' '-e' '0.001'
[2025-05-31 01:43:50] [INFO ] Decomposing Gal with order
[2025-05-31 01:43:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 01:43:52] [INFO ] Removed a total of 2619 redundant transitions.
[2025-05-31 01:43:52] [INFO ] Flatten gal took : 1807 ms
[2025-05-31 01:43:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 1206 labels/synchronizations in 68 ms.
[2025-05-31 01:43:52] [INFO ] Time to serialize gal into /tmp/LTLCardinality15209633794962269593.gal : 11 ms
[2025-05-31 01:43:52] [INFO ] Time to serialize properties into /tmp/LTLCardinality15020056766253740798.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/LTLCardinality15209633794962269593.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15020056766253740798.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...299
Read 2 LTL properties
Checking formula 0 : !((G(F(("((((((((gu1.Client_Waiting_76+gu1.Client_Waiting_74)+(gu1.Client_Waiting_67+gu1.Client_Waiting_81))+((gu1.Client_Waiting_36+g...5060
Formula 0 simplified : G(F!"((((((((gu0.Client_Sending_55+gu0.Client_Sending_63)+(gu0.Client_Sending_97+gu0.Client_Sending_78))+((gu0.Client_Sending_50+gu0...5053
Compilation finished in 5738 ms.
Running link step : cd /tmp/ltsmin6779956751788036800;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin6779956751788036800;'/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)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin6779956751788036800;'/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)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin6779956751788036800;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(((LTLAPp2==true)&&(X((LTLAPp3==true)) U []((LTLAPp2==true)))&&((LTLAPp4==true)||<>((LTLAPp3==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2025-05-31 02:10:50] [INFO ] Flatten gal took : 792 ms
[2025-05-31 02:10:50] [INFO ] Time to serialize gal into /tmp/LTLCardinality9915566252037003454.gal : 106 ms
[2025-05-31 02:10:50] [INFO ] Time to serialize properties into /tmp/LTLCardinality11206300915044313582.ltl : 48 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/LTLCardinality9915566252037003454.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11206300915044313582.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 2 LTL properties
Checking formula 0 : !((G(F(("((((((((Client_Waiting_76+Client_Waiting_74)+(Client_Waiting_67+Client_Waiting_81))+((Client_Waiting_36+Client_Waiting_25)+(C...4220
Formula 0 simplified : G(F!"((((((((Client_Sending_55+Client_Sending_63)+(Client_Sending_97+Client_Sending_78))+((Client_Sending_50+Client_Sending_26)+(Cli...4213
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin6779956751788036800;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(((LTLAPp2==true)&&(X((LTLAPp3==true)) U []((LTLAPp2==true)))&&((LTLAPp4==true)||<>((LTLAPp3==true))))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin6779956751788036800;'/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)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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="CSRepetitions-PT-10"
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 CSRepetitions-PT-10, 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 r044-tall-174854029100779"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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