Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r048-tajo-171620399100236.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is BridgeAndVehicles-PT-V50P20N20, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399100236
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.2M
-rw-r--r-- 1 mcc users 25K Apr 13 00:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 153K Apr 13 00:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 226K Apr 13 00:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 875K Apr 13 00:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 11K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 42K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 68K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 195K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Apr 13 01:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Apr 13 01:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 723K Apr 13 01:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.8M Apr 13 01:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.9M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716329066433

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V50P20N20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-21 22:04:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 22:04:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 22:04:28] [INFO ] Load time of PNML (sax parser for PT used): 200 ms
[2024-05-21 22:04:28] [INFO ] Transformed 138 places.
[2024-05-21 22:04:28] [INFO ] Transformed 2348 transitions.
[2024-05-21 22:04:28] [INFO ] Parsed PT model containing 138 places and 2348 transitions and 18090 arcs in 346 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA BridgeAndVehicles-PT-V50P20N20-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N20-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N20-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 136 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 136 transition count 2348
Applied a total of 2 rules in 100 ms. Remains 136 /138 variables (removed 2) and now considering 2348/2348 (removed 0) transitions.
Running 2345 sub problems to find dead transitions.
[2024-05-21 22:04:29] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2024-05-21 22:04:29] [INFO ] Computed 5 invariants in 18 ms
[2024-05-21 22:04:29] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
[2024-05-21 22:04:57] [INFO ] Deduced a trap composed of 5 places in 351 ms of which 12 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/426 variables, and 6 constraints, problems are : Problem set: 0 solved, 2345 unsolved in 20103 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2345/2345 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2345 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
[2024-05-21 22:05:26] [INFO ] Deduced a trap composed of 25 places in 232 ms of which 2 ms to minimize.
Problem TDEAD1248 is UNSAT
Problem TDEAD1269 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 136/426 variables, and 7 constraints, problems are : Problem set: 2 solved, 2343 unsolved in 20064 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2345 constraints, Known Traps: 2/2 constraints]
After SMT, in 58035ms problems are : Problem set: 2 solved, 2343 unsolved
Search for dead transitions found 2 dead transitions in 58147ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
[2024-05-21 22:05:27] [INFO ] Flow matrix only has 290 transitions (discarded 2056 similar events)
// Phase 1: matrix 290 rows 136 cols
[2024-05-21 22:05:27] [INFO ] Computed 5 invariants in 6 ms
[2024-05-21 22:05:27] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-21 22:05:27] [INFO ] Flow matrix only has 290 transitions (discarded 2056 similar events)
[2024-05-21 22:05:27] [INFO ] Invariant cache hit.
[2024-05-21 22:05:27] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 22:05:27] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 136/138 places, 2346/2348 transitions.
Applied a total of 0 rules in 17 ms. Remains 136 /136 variables (removed 0) and now considering 2346/2346 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58656 ms. Remains : 136/138 places, 2346/2348 transitions.
Support contains 136 out of 136 places after structural reductions.
[2024-05-21 22:05:27] [INFO ] Flatten gal took : 264 ms
[2024-05-21 22:05:28] [INFO ] Flatten gal took : 173 ms
[2024-05-21 22:05:28] [INFO ] Input system was already deterministic with 2346 transitions.
Reduction of identical properties reduced properties to check from 25 to 22
RANDOM walk for 40000 steps (92 resets) in 3622 ms. (11 steps per ms) remains 8/22 properties
BEST_FIRST walk for 40004 steps (28 resets) in 750 ms. (53 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (36 resets) in 288 ms. (138 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40003 steps (33 resets) in 307 ms. (129 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (34 resets) in 330 ms. (120 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (36 resets) in 310 ms. (128 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (40 resets) in 281 ms. (141 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (43 resets) in 306 ms. (130 steps per ms) remains 7/7 properties
[2024-05-21 22:05:30] [INFO ] Flow matrix only has 290 transitions (discarded 2056 similar events)
[2024-05-21 22:05:30] [INFO ] Invariant cache hit.
[2024-05-21 22:05:30] [INFO ] State equation strengthened by 42 read => feed constraints.
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 4 unsolved
Problem AtomicPropp22 is UNSAT
At refinement iteration 2 (OVERLAPS) 67/136 variables, 3/5 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/5 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 290/426 variables, 136/141 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/426 variables, 42/183 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/426 variables, 0/183 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/426 variables, 0/183 constraints. Problems are: Problem set: 4 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 183 constraints, problems are : Problem set: 4 solved, 3 unsolved in 536 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 136/136 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 121/130 variables, 4/4 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/4 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 288/418 variables, 130/134 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/418 variables, 42/176 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/418 variables, 0/176 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 8/426 variables, 6/182 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 1/183 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 3/186 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 0/186 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/426 variables, 0/186 constraints. Problems are: Problem set: 4 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 426/426 variables, and 186 constraints, problems are : Problem set: 4 solved, 3 unsolved in 2451 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 136/136 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 3/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 3155ms problems are : Problem set: 4 solved, 3 unsolved
Parikh walk visited 0 properties in 1146 ms.
Support contains 9 out of 136 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 2346/2346 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 135 transition count 2345
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 135 transition count 2345
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 133 transition count 2344
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 132 transition count 2343
Applied a total of 7 rules in 608 ms. Remains 132 /136 variables (removed 4) and now considering 2343/2346 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 610 ms. Remains : 132/136 places, 2343/2346 transitions.
RANDOM walk for 40000 steps (128 resets) in 696 ms. (57 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (60 resets) in 408 ms. (97 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (64 resets) in 411 ms. (97 steps per ms) remains 2/2 properties
[2024-05-21 22:05:36] [INFO ] Flow matrix only has 287 transitions (discarded 2056 similar events)
// Phase 1: matrix 287 rows 132 cols
[2024-05-21 22:05:36] [INFO ] Computed 4 invariants in 12 ms
[2024-05-21 22:05:36] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 121/128 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 287/415 variables, 128/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/415 variables, 42/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/415 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/419 variables, 4/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/419 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/419 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 419/419 variables, and 178 constraints, problems are : Problem set: 0 solved, 2 unsolved in 312 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 132/132 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 121/128 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 287/415 variables, 128/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/415 variables, 42/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/415 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 4/419 variables, 4/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/419 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/419 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/419 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 419/419 variables, and 180 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1871 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 132/132 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 2248ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 444 ms.
Support contains 4 out of 132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 2343/2343 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 131 transition count 2342
Applied a total of 2 rules in 341 ms. Remains 131 /132 variables (removed 1) and now considering 2342/2343 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 341 ms. Remains : 131/132 places, 2342/2343 transitions.
RANDOM walk for 40000 steps (128 resets) in 629 ms. (63 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (61 resets) in 261 ms. (152 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 143859 steps, run visited all 1 properties in 1739 ms. (steps per millisecond=82 )
Probabilistic random walk after 143859 steps, saw 48540 distinct states, run finished after 1752 ms. (steps per millisecond=82 ) properties seen :1
Successfully simplified 4 atomic propositions for a total of 13 simplifications.
FORMULA BridgeAndVehicles-PT-V50P20N20-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N20-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 109 stabilizing places and 204 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X(G(p1)))))'
Support contains 55 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 2346/2346 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 135 transition count 2345
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 135 transition count 2345
Applied a total of 2 rules in 25 ms. Remains 135 /136 variables (removed 1) and now considering 2345/2346 (removed 1) transitions.
Running 2342 sub problems to find dead transitions.
[2024-05-21 22:05:41] [INFO ] Flow matrix only has 289 transitions (discarded 2056 similar events)
// Phase 1: matrix 289 rows 135 cols
[2024-05-21 22:05:41] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 22:05:41] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2342 unsolved
[2024-05-21 22:06:07] [INFO ] Deduced a trap composed of 5 places in 259 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 135/424 variables, and 6 constraints, problems are : Problem set: 0 solved, 2342 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2342/2342 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2342 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2342 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2342 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/424 variables, and 6 constraints, problems are : Problem set: 0 solved, 2342 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2342 constraints, Known Traps: 1/1 constraints]
After SMT, in 58251ms problems are : Problem set: 0 solved, 2342 unsolved
Search for dead transitions found 0 dead transitions in 58288ms
[2024-05-21 22:06:39] [INFO ] Flow matrix only has 289 transitions (discarded 2056 similar events)
[2024-05-21 22:06:39] [INFO ] Invariant cache hit.
[2024-05-21 22:06:40] [INFO ] Implicit Places using invariants in 294 ms returned []
[2024-05-21 22:06:40] [INFO ] Flow matrix only has 289 transitions (discarded 2056 similar events)
[2024-05-21 22:06:40] [INFO ] Invariant cache hit.
[2024-05-21 22:06:40] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 22:06:41] [INFO ] Implicit Places using invariants and state equation in 992 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1294 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 133/136 places, 2345/2346 transitions.
Applied a total of 0 rules in 14 ms. Remains 133 /133 variables (removed 0) and now considering 2345/2345 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 59633 ms. Remains : 133/136 places, 2345/2346 transitions.
Stuttering acceptance computed with spot in 266 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N20-LTLFireability-00
Stuttering criterion allowed to conclude after 8240 steps with 46 reset in 159 ms.
FORMULA BridgeAndVehicles-PT-V50P20N20-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P20N20-LTLFireability-00 finished in 60135 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((p1||G(F(p2))))||p0)))'
Support contains 57 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 2346/2346 transitions.
Applied a total of 0 rules in 12 ms. Remains 136 /136 variables (removed 0) and now considering 2346/2346 (removed 0) transitions.
Running 2343 sub problems to find dead transitions.
[2024-05-21 22:06:41] [INFO ] Flow matrix only has 290 transitions (discarded 2056 similar events)
// Phase 1: matrix 290 rows 136 cols
[2024-05-21 22:06:41] [INFO ] Computed 5 invariants in 4 ms
[2024-05-21 22:06:41] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2343 unsolved
[2024-05-21 22:07:06] [INFO ] Deduced a trap composed of 5 places in 241 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/426 variables, and 6 constraints, problems are : Problem set: 0 solved, 2343 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2343/2343 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2343 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2343 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2343 unsolved
[2024-05-21 22:07:37] [INFO ] Deduced a trap composed of 25 places in 218 ms of which 1 ms to minimize.
Problem TDEAD1288 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1351 is UNSAT
Problem TDEAD1372 is UNSAT
Problem TDEAD1393 is UNSAT
Problem TDEAD1414 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 136/426 variables, and 7 constraints, problems are : Problem set: 7 solved, 2336 unsolved in 20070 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2343 constraints, Known Traps: 2/2 constraints]
After SMT, in 57331ms problems are : Problem set: 7 solved, 2336 unsolved
Search for dead transitions found 7 dead transitions in 57380ms
Found 7 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 7 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 7 transitions.
[2024-05-21 22:07:39] [INFO ] Flow matrix only has 290 transitions (discarded 2049 similar events)
[2024-05-21 22:07:39] [INFO ] Invariant cache hit.
[2024-05-21 22:07:39] [INFO ] Implicit Places using invariants in 243 ms returned []
[2024-05-21 22:07:39] [INFO ] Flow matrix only has 290 transitions (discarded 2049 similar events)
[2024-05-21 22:07:39] [INFO ] Invariant cache hit.
[2024-05-21 22:07:39] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 22:07:40] [INFO ] Implicit Places using invariants and state equation in 812 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1062 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 135/136 places, 2339/2346 transitions.
Applied a total of 0 rules in 17 ms. Remains 135 /135 variables (removed 0) and now considering 2339/2339 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 58478 ms. Remains : 135/136 places, 2339/2346 transitions.
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N20-LTLFireability-01
Product exploration explored 100000 steps with 579 reset in 724 ms.
Product exploration explored 100000 steps with 586 reset in 622 ms.
Computed a total of 108 stabilizing places and 204 stable transitions
Computed a total of 108 stabilizing places and 204 stable transitions
Detected a total of 108/135 stabilizing places and 204/2339 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p1)), (X (X p2)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 169 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 594 steps (0 resets) in 19 ms. (29 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p1)), (X (X p2)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 6 factoid took 196 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 89 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p2), (NOT p2)]
Support contains 3 out of 135 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 2339/2339 transitions.
Applied a total of 0 rules in 609 ms. Remains 135 /135 variables (removed 0) and now considering 2339/2339 (removed 0) transitions.
Running 2336 sub problems to find dead transitions.
[2024-05-21 22:07:43] [INFO ] Flow matrix only has 290 transitions (discarded 2049 similar events)
// Phase 1: matrix 290 rows 135 cols
[2024-05-21 22:07:43] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 22:07:43] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2336 unsolved
[2024-05-21 22:08:08] [INFO ] Deduced a trap composed of 5 places in 265 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 135/425 variables, and 6 constraints, problems are : Problem set: 0 solved, 2336 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2336/2336 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2336 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2336 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2336 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/425 variables, and 6 constraints, problems are : Problem set: 0 solved, 2336 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2336 constraints, Known Traps: 1/1 constraints]
After SMT, in 57749ms problems are : Problem set: 0 solved, 2336 unsolved
Search for dead transitions found 0 dead transitions in 57770ms
[2024-05-21 22:08:40] [INFO ] Flow matrix only has 290 transitions (discarded 2049 similar events)
[2024-05-21 22:08:40] [INFO ] Invariant cache hit.
[2024-05-21 22:08:41] [INFO ] Implicit Places using invariants in 280 ms returned []
[2024-05-21 22:08:41] [INFO ] Flow matrix only has 290 transitions (discarded 2049 similar events)
[2024-05-21 22:08:41] [INFO ] Invariant cache hit.
[2024-05-21 22:08:41] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 22:08:42] [INFO ] Implicit Places using invariants and state equation in 1147 ms returned []
Implicit Place search using SMT with State Equation took 1431 ms to find 0 implicit places.
[2024-05-21 22:08:42] [INFO ] Redundant transitions in 148 ms returned []
Running 2336 sub problems to find dead transitions.
[2024-05-21 22:08:42] [INFO ] Flow matrix only has 290 transitions (discarded 2049 similar events)
[2024-05-21 22:08:42] [INFO ] Invariant cache hit.
[2024-05-21 22:08:42] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2336 unsolved
[2024-05-21 22:09:11] [INFO ] Deduced a trap composed of 5 places in 259 ms of which 1 ms to minimize.
[2024-05-21 22:09:28] [INFO ] Deduced a trap composed of 25 places in 223 ms of which 1 ms to minimize.
Problem TDEAD1428 is UNSAT
Problem TDEAD1449 is UNSAT
Problem TDEAD1470 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1533 is UNSAT
Problem TDEAD1554 is UNSAT
Problem TDEAD1575 is UNSAT
Problem TDEAD1596 is UNSAT
Problem TDEAD1617 is UNSAT
Problem TDEAD1638 is UNSAT
Problem TDEAD1659 is UNSAT
Problem TDEAD1680 is UNSAT
Problem TDEAD1701 is UNSAT
Problem TDEAD1722 is UNSAT
Problem TDEAD1743 is UNSAT
Problem TDEAD1764 is UNSAT
Problem TDEAD1785 is UNSAT
Problem TDEAD1806 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 135/425 variables, and 7 constraints, problems are : Problem set: 19 solved, 2317 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2336/2336 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 19 solved, 2317 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 19 solved, 2317 unsolved
Problem TDEAD1827 is UNSAT
Problem TDEAD1848 is UNSAT
Problem TDEAD1869 is UNSAT
Problem TDEAD1890 is UNSAT
Problem TDEAD1911 is UNSAT
Problem TDEAD1932 is UNSAT
Problem TDEAD1953 is UNSAT
Problem TDEAD1974 is UNSAT
Problem TDEAD1995 is UNSAT
Problem TDEAD2016 is UNSAT
Problem TDEAD2037 is UNSAT
Problem TDEAD2058 is UNSAT
Problem TDEAD2079 is UNSAT
Problem TDEAD2100 is UNSAT
Problem TDEAD2121 is UNSAT
Problem TDEAD2142 is UNSAT
Problem TDEAD2163 is UNSAT
Problem TDEAD2184 is UNSAT
Problem TDEAD2205 is UNSAT
Problem TDEAD2226 is UNSAT
Problem TDEAD2247 is UNSAT
Problem TDEAD2268 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 2/7 constraints. Problems are: Problem set: 41 solved, 2295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/425 variables, and 7 constraints, problems are : Problem set: 41 solved, 2295 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2336 constraints, Known Traps: 2/2 constraints]
After SMT, in 81369ms problems are : Problem set: 41 solved, 2295 unsolved
Search for dead transitions found 41 dead transitions in 81402ms
Found 41 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 41 transitions
Dead transitions reduction (with SMT) removed 41 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 135/135 places, 2298/2339 transitions.
Applied a total of 0 rules in 208 ms. Remains 135 /135 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
[2024-05-21 22:10:04] [INFO ] Redundant transitions in 104 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 141703 ms. Remains : 135/135 places, 2298/2339 transitions.
Computed a total of 108 stabilizing places and 204 stable transitions
Computed a total of 108 stabilizing places and 204 stable transitions
Knowledge obtained : [p2, (X p2), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 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 74 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 576 steps (0 resets) in 12 ms. (44 steps per ms) remains 0/1 properties
Knowledge obtained : [p2, (X p2), (X (X p2))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 3 factoid took 94 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 75 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 569 reset in 648 ms.
Product exploration explored 100000 steps with 565 reset in 631 ms.
Built C files in :
/tmp/ltsmin3087137313929059496
[2024-05-21 22:10:06] [INFO ] Too many transitions (2298) to apply POR reductions. Disabling POR matrices.
[2024-05-21 22:10:06] [INFO ] Built C files in 75ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3087137313929059496
Running compilation step : cd /tmp/ltsmin3087137313929059496;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin3087137313929059496;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin3087137313929059496;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:840)
Support contains 3 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 2298/2298 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 134 transition count 2297
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 134 transition count 2297
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 132 transition count 2296
Applied a total of 5 rules in 307 ms. Remains 132 /135 variables (removed 3) and now considering 2296/2298 (removed 2) transitions.
[2024-05-21 22:10:09] [INFO ] Flow matrix only has 287 transitions (discarded 2009 similar events)
// Phase 1: matrix 287 rows 132 cols
[2024-05-21 22:10:09] [INFO ] Computed 4 invariants in 6 ms
[2024-05-21 22:10:09] [INFO ] Implicit Places using invariants in 303 ms returned []
[2024-05-21 22:10:09] [INFO ] Flow matrix only has 287 transitions (discarded 2009 similar events)
[2024-05-21 22:10:09] [INFO ] Invariant cache hit.
[2024-05-21 22:10:09] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 22:10:10] [INFO ] Implicit Places using invariants and state equation in 1126 ms returned [105]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1441 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 131/135 places, 2296/2298 transitions.
Applied a total of 0 rules in 252 ms. Remains 131 /131 variables (removed 0) and now considering 2296/2296 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2002 ms. Remains : 131/135 places, 2296/2298 transitions.
Built C files in :
/tmp/ltsmin7773257874219828228
[2024-05-21 22:10:11] [INFO ] Too many transitions (2296) to apply POR reductions. Disabling POR matrices.
[2024-05-21 22:10:11] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7773257874219828228
Running compilation step : cd /tmp/ltsmin7773257874219828228;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin7773257874219828228;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin7773257874219828228;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:840)
[2024-05-21 22:10:14] [INFO ] Flatten gal took : 86 ms
[2024-05-21 22:10:14] [INFO ] Flatten gal took : 95 ms
[2024-05-21 22:10:14] [INFO ] Time to serialize gal into /tmp/LTL5885629684998062476.gal : 40 ms
[2024-05-21 22:10:14] [INFO ] Time to serialize properties into /tmp/LTL13186631069358535680.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5885629684998062476.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14147712121914104297.hoa' '-atoms' '/tmp/LTL13186631069358535680.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13186631069358535680.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14147712121914104297.hoa
Detected timeout of ITS tools.
[2024-05-21 22:10:30] [INFO ] Flatten gal took : 89 ms
[2024-05-21 22:10:30] [INFO ] Flatten gal took : 91 ms
[2024-05-21 22:10:30] [INFO ] Time to serialize gal into /tmp/LTL10184893098448405722.gal : 19 ms
[2024-05-21 22:10:30] [INFO ] Time to serialize properties into /tmp/LTL713009424093346666.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10184893098448405722.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL713009424093346666.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(((((((X(("(SUR_PONT_B>=1)")||(G(F("(((CHOIX_1<1)||(COMPTEUR_20<1))&&((CHOIX_2<1)||(COMPTEUR_20<1)))")))))||("(((CAPACITE>=1)&&(CO...4142
Formula 0 simplified : F(!"((((((((CAPACITE>=1)&&(CONTROLEUR_2>=1))&&((NB_ATTENTE_B_13>=1)&&(ATTENTE_B>=1)))||(((CAPACITE>=1)&&(CONTROLEUR_2>=1))&&((NB_ATT...4122
Detected timeout of ITS tools.
[2024-05-21 22:10:45] [INFO ] Flatten gal took : 78 ms
[2024-05-21 22:10:45] [INFO ] Applying decomposition
[2024-05-21 22:10:45] [INFO ] Flatten gal took : 76 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5370822704369683514.txt' '-o' '/tmp/graph5370822704369683514.bin' '-w' '/tmp/graph5370822704369683514.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5370822704369683514.bin' '-l' '-1' '-v' '-w' '/tmp/graph5370822704369683514.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:10:45] [INFO ] Decomposing Gal with order
[2024-05-21 22:10:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:10:46] [INFO ] Removed a total of 4372 redundant transitions.
[2024-05-21 22:10:46] [INFO ] Flatten gal took : 920 ms
[2024-05-21 22:10:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 474 labels/synchronizations in 38 ms.
[2024-05-21 22:10:46] [INFO ] Time to serialize gal into /tmp/LTL936020514773218633.gal : 4 ms
[2024-05-21 22:10:46] [INFO ] Time to serialize properties into /tmp/LTL9862054267356975777.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL936020514773218633.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9862054267356975777.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((G(((((((X(("(u1.SUR_PONT_B>=1)")||(G(F("(((u1.CHOIX_1<1)||(i0.u0.COMPTEUR_20<1))&&((u1.CHOIX_2<1)||(i0.u0.COMPTEUR_20<1)))")))))||(...5213
Formula 0 simplified : F(!"((((((((u1.CAPACITE>=1)&&(i0.u2.CONTROLEUR_2>=1))&&((i1.u3.NB_ATTENTE_B_13>=1)&&(i1.u4.ATTENTE_B>=1)))||(((u1.CAPACITE>=1)&&(i0....5193
Detected timeout of ITS tools.
Treatment of property BridgeAndVehicles-PT-V50P20N20-LTLFireability-01 finished in 260123 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&(F(!p2)||p1)))))'
Support contains 126 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 2346/2346 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 135 transition count 2345
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 135 transition count 2345
Applied a total of 2 rules in 29 ms. Remains 135 /136 variables (removed 1) and now considering 2345/2346 (removed 1) transitions.
Running 2342 sub problems to find dead transitions.
[2024-05-21 22:11:01] [INFO ] Flow matrix only has 289 transitions (discarded 2056 similar events)
// Phase 1: matrix 289 rows 135 cols
[2024-05-21 22:11:01] [INFO ] Computed 5 invariants in 4 ms
[2024-05-21 22:11:01] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2342 unsolved
[2024-05-21 22:11:29] [INFO ] Deduced a trap composed of 5 places in 206 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 135/424 variables, and 6 constraints, problems are : Problem set: 0 solved, 2342 unsolved in 20046 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2342/2342 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2342 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2342 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2342 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/424 variables, and 6 constraints, problems are : Problem set: 0 solved, 2342 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2342 constraints, Known Traps: 1/1 constraints]
After SMT, in 59213ms problems are : Problem set: 0 solved, 2342 unsolved
Search for dead transitions found 0 dead transitions in 59250ms
[2024-05-21 22:12:01] [INFO ] Flow matrix only has 289 transitions (discarded 2056 similar events)
[2024-05-21 22:12:01] [INFO ] Invariant cache hit.
[2024-05-21 22:12:01] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-21 22:12:01] [INFO ] Flow matrix only has 289 transitions (discarded 2056 similar events)
[2024-05-21 22:12:01] [INFO ] Invariant cache hit.
[2024-05-21 22:12:01] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 22:12:01] [INFO ] Implicit Places using invariants and state equation in 517 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 627 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 133/136 places, 2345/2346 transitions.
Applied a total of 0 rules in 9 ms. Remains 133 /133 variables (removed 0) and now considering 2345/2345 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 59924 ms. Remains : 133/136 places, 2345/2346 transitions.
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), true, p2]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N20-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-PT-V50P20N20-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P20N20-LTLFireability-02 finished in 60098 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(X((X((F(p2)||p1)) U p3)))&&p0)))'
Support contains 105 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 2346/2346 transitions.
Applied a total of 0 rules in 13 ms. Remains 136 /136 variables (removed 0) and now considering 2346/2346 (removed 0) transitions.
Running 2343 sub problems to find dead transitions.
[2024-05-21 22:12:02] [INFO ] Flow matrix only has 290 transitions (discarded 2056 similar events)
// Phase 1: matrix 290 rows 136 cols
[2024-05-21 22:12:02] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 22:12:02] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2343 unsolved
[2024-05-21 22:12:31] [INFO ] Deduced a trap composed of 5 places in 229 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/426 variables, and 6 constraints, problems are : Problem set: 0 solved, 2343 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2343/2343 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2343 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2343 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2343 unsolved
[2024-05-21 22:13:00] [INFO ] Deduced a trap composed of 25 places in 247 ms of which 1 ms to minimize.
Problem TDEAD1288 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1351 is UNSAT
Problem TDEAD1372 is UNSAT
Problem TDEAD1393 is UNSAT
Problem TDEAD1414 is UNSAT
Problem TDEAD1435 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 136/426 variables, and 7 constraints, problems are : Problem set: 8 solved, 2335 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2343 constraints, Known Traps: 2/2 constraints]
After SMT, in 60782ms problems are : Problem set: 8 solved, 2335 unsolved
Search for dead transitions found 8 dead transitions in 60812ms
Found 8 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 8 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 8 transitions.
[2024-05-21 22:13:02] [INFO ] Flow matrix only has 290 transitions (discarded 2048 similar events)
[2024-05-21 22:13:02] [INFO ] Invariant cache hit.
[2024-05-21 22:13:02] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-21 22:13:02] [INFO ] Flow matrix only has 290 transitions (discarded 2048 similar events)
[2024-05-21 22:13:02] [INFO ] Invariant cache hit.
[2024-05-21 22:13:03] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 22:13:03] [INFO ] Implicit Places using invariants and state equation in 722 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 923 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 134/136 places, 2338/2346 transitions.
Applied a total of 0 rules in 8 ms. Remains 134 /134 variables (removed 0) and now considering 2338/2338 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61763 ms. Remains : 134/136 places, 2338/2346 transitions.
Stuttering acceptance computed with spot in 437 ms :[(OR (NOT p0) (NOT p3)), (NOT p3), (OR (NOT p3) (AND (NOT p0) (NOT p1) (NOT p2))), (NOT p3), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N20-LTLFireability-05
Product exploration explored 100000 steps with 464 reset in 912 ms.
Product exploration explored 100000 steps with 466 reset in 1078 ms.
Computed a total of 107 stabilizing places and 204 stable transitions
Computed a total of 107 stabilizing places and 204 stable transitions
Detected a total of 107/134 stabilizing places and 204/2338 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p3 p1 (NOT p2)), (X p3), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p3)))), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p3))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 834 ms. Reduced automaton from 8 states, 24 edges and 4 AP (stutter sensitive) to 8 states, 24 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 425 ms :[(OR (NOT p0) (NOT p3)), (NOT p3), (OR (NOT p3) (AND (NOT p0) (NOT p1) (NOT p2))), (NOT p3), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3))]
Reduction of identical properties reduced properties to check from 15 to 11
RANDOM walk for 40000 steps (92 resets) in 915 ms. (43 steps per ms) remains 2/11 properties
BEST_FIRST walk for 40002 steps (37 resets) in 1677 ms. (23 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (37 resets) in 700 ms. (57 steps per ms) remains 2/2 properties
[2024-05-21 22:13:08] [INFO ] Flow matrix only has 290 transitions (discarded 2048 similar events)
// Phase 1: matrix 290 rows 134 cols
[2024-05-21 22:13:08] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 22:13:08] [INFO ] State equation strengthened by 42 read => feed constraints.
Problem apf3 is UNSAT
Problem apf11 is UNSAT
After SMT solving in domain Real declared 105/424 variables, and 0 constraints, problems are : Problem set: 2 solved, 0 unsolved in 58 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/134 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 150ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p3 p1 (NOT p2)), (X p3), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p3)))), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p3))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (OR p0 p1 p2)), (G (OR (NOT p0) p3 (NOT p1) p2))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1 p2))), (F (NOT (OR p0 p3))), (F (NOT (OR p0 p3 p2))), (F p0), (F (NOT p1)), (F (NOT (OR (NOT p0) p3 p2))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) p3))), (F (NOT (OR p1 p2))), (F p2), (F (NOT p3)), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR p0 p3 (NOT p1) p2)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 20 factoid took 4463 ms. Reduced automaton from 8 states, 24 edges and 4 AP (stutter sensitive) to 5 states, 14 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 280 ms :[(OR (NOT p0) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 265 ms :[(OR (NOT p0) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
[2024-05-21 22:13:13] [INFO ] Flow matrix only has 290 transitions (discarded 2048 similar events)
[2024-05-21 22:13:13] [INFO ] Invariant cache hit.
[2024-05-21 22:13:14] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-21 22:13:14] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2024-05-21 22:13:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:13:15] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 22:13:15] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2024-05-21 22:13:15] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 22:13:16] [INFO ] [Nat]Added 42 Read/Feed constraints in 837 ms returned sat
[2024-05-21 22:13:16] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 151 ms.
[2024-05-21 22:13:17] [INFO ] Added : 21 causal constraints over 6 iterations in 677 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 105 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 2338/2338 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 133 transition count 2337
Applied a total of 2 rules in 303 ms. Remains 133 /134 variables (removed 1) and now considering 2337/2338 (removed 1) transitions.
Running 2334 sub problems to find dead transitions.
[2024-05-21 22:13:17] [INFO ] Flow matrix only has 289 transitions (discarded 2048 similar events)
// Phase 1: matrix 289 rows 133 cols
[2024-05-21 22:13:17] [INFO ] Computed 5 invariants in 5 ms
[2024-05-21 22:13:17] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2334 unsolved
[2024-05-21 22:13:47] [INFO ] Deduced a trap composed of 5 places in 287 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 133/422 variables, and 6 constraints, problems are : Problem set: 0 solved, 2334 unsolved in 20046 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2334/2334 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2334 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2334 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2334 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 133/422 variables, and 6 constraints, problems are : Problem set: 0 solved, 2334 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2334 constraints, Known Traps: 1/1 constraints]
After SMT, in 59598ms problems are : Problem set: 0 solved, 2334 unsolved
Search for dead transitions found 0 dead transitions in 59643ms
[2024-05-21 22:14:17] [INFO ] Flow matrix only has 289 transitions (discarded 2048 similar events)
[2024-05-21 22:14:17] [INFO ] Invariant cache hit.
[2024-05-21 22:14:17] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-05-21 22:14:17] [INFO ] Flow matrix only has 289 transitions (discarded 2048 similar events)
[2024-05-21 22:14:17] [INFO ] Invariant cache hit.
[2024-05-21 22:14:17] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 22:14:18] [INFO ] Implicit Places using invariants and state equation in 757 ms returned []
Implicit Place search using SMT with State Equation took 939 ms to find 0 implicit places.
[2024-05-21 22:14:18] [INFO ] Redundant transitions in 104 ms returned []
Running 2334 sub problems to find dead transitions.
[2024-05-21 22:14:18] [INFO ] Flow matrix only has 289 transitions (discarded 2048 similar events)
[2024-05-21 22:14:18] [INFO ] Invariant cache hit.
[2024-05-21 22:14:18] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2334 unsolved
[2024-05-21 22:14:48] [INFO ] Deduced a trap composed of 5 places in 307 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 133/422 variables, and 6 constraints, problems are : Problem set: 0 solved, 2334 unsolved in 30081 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2334/2334 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2334 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2334 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2334 unsolved
[2024-05-21 22:15:37] [INFO ] Deduced a trap composed of 25 places in 168 ms of which 0 ms to minimize.
Problem TDEAD1397 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1439 is UNSAT
Problem TDEAD1460 is UNSAT
Problem TDEAD1481 is UNSAT
Problem TDEAD1502 is UNSAT
Problem TDEAD1523 is UNSAT
Problem TDEAD1544 is UNSAT
Problem TDEAD1565 is UNSAT
Problem TDEAD1586 is UNSAT
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 133/422 variables, and 7 constraints, problems are : Problem set: 10 solved, 2324 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2334 constraints, Known Traps: 2/2 constraints]
After SMT, in 81376ms problems are : Problem set: 10 solved, 2324 unsolved
Search for dead transitions found 10 dead transitions in 81406ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 133/134 places, 2327/2338 transitions.
Applied a total of 0 rules in 176 ms. Remains 133 /133 variables (removed 0) and now considering 2327/2327 (removed 0) transitions.
[2024-05-21 22:15:40] [INFO ] Redundant transitions in 109 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 142727 ms. Remains : 133/134 places, 2327/2338 transitions.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Detected a total of 106/133 stabilizing places and 203/2327 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p3 p1 (NOT p2)), (X (NOT p2)), (X p3), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (OR (AND p1 (NOT p2)) (AND (NOT p2) p3))), (X (NOT p0)), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p3)))), (X p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (OR (AND p1 (NOT p2)) (AND (NOT p2) p3)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 1493 ms. Reduced automaton from 5 states, 14 edges and 4 AP (stutter insensitive) to 5 states, 14 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 264 ms :[(OR (NOT p0) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 2151 steps (4 resets) in 52 ms. (40 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p0) p3 p1 (NOT p2)), (X (NOT p2)), (X p3), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (OR (AND p1 (NOT p2)) (AND (NOT p2) p3))), (X (NOT p0)), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p3)))), (X p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (OR (AND p1 (NOT p2)) (AND (NOT p2) p3)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR (AND p1 (NOT p2)) (AND (NOT p2) p3)))), (F (NOT (OR p1 p2 p3))), (F (NOT (OR (NOT p1) p2 p3))), (F p0), (F (NOT (OR p3 (NOT p0)))), (F (NOT p3)), (F p2), (F (NOT (OR p1 p2))), (F (NOT p1))]
Knowledge based reduction with 23 factoid took 4155 ms. Reduced automaton from 5 states, 14 edges and 4 AP (stutter insensitive) to 5 states, 14 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 242 ms :[(OR (NOT p0) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 277 ms :[(OR (NOT p0) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
[2024-05-21 22:15:46] [INFO ] Flow matrix only has 289 transitions (discarded 2038 similar events)
[2024-05-21 22:15:46] [INFO ] Invariant cache hit.
[2024-05-21 22:15:47] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-21 22:15:47] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-05-21 22:15:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:15:48] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 22:15:48] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2024-05-21 22:15:48] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 22:15:49] [INFO ] [Nat]Added 42 Read/Feed constraints in 1105 ms returned sat
[2024-05-21 22:15:50] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 141 ms.
[2024-05-21 22:15:50] [INFO ] Added : 19 causal constraints over 7 iterations in 443 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 275 ms :[(OR (NOT p0) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 512 reset in 1103 ms.
Product exploration explored 100000 steps with 510 reset in 974 ms.
Built C files in :
/tmp/ltsmin2620534043174453840
[2024-05-21 22:15:52] [INFO ] Too many transitions (2327) to apply POR reductions. Disabling POR matrices.
[2024-05-21 22:15:52] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2620534043174453840
Running compilation step : cd /tmp/ltsmin2620534043174453840;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin2620534043174453840;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin2620534043174453840;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:840)
Support contains 105 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 2327/2327 transitions.
Applied a total of 0 rules in 241 ms. Remains 133 /133 variables (removed 0) and now considering 2327/2327 (removed 0) transitions.
Running 2324 sub problems to find dead transitions.
[2024-05-21 22:15:56] [INFO ] Flow matrix only has 289 transitions (discarded 2038 similar events)
[2024-05-21 22:15:56] [INFO ] Invariant cache hit.
[2024-05-21 22:15:56] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2324 unsolved
[2024-05-21 22:16:25] [INFO ] Deduced a trap composed of 5 places in 256 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 133/422 variables, and 6 constraints, problems are : Problem set: 0 solved, 2324 unsolved in 20051 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2324/2324 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2324 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2324 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2324 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 133/422 variables, and 6 constraints, problems are : Problem set: 0 solved, 2324 unsolved in 20046 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2324 constraints, Known Traps: 1/1 constraints]
After SMT, in 61517ms problems are : Problem set: 0 solved, 2324 unsolved
Search for dead transitions found 0 dead transitions in 61544ms
[2024-05-21 22:16:57] [INFO ] Flow matrix only has 289 transitions (discarded 2038 similar events)
[2024-05-21 22:16:57] [INFO ] Invariant cache hit.
[2024-05-21 22:16:57] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-05-21 22:16:57] [INFO ] Flow matrix only has 289 transitions (discarded 2038 similar events)
[2024-05-21 22:16:57] [INFO ] Invariant cache hit.
[2024-05-21 22:16:57] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 22:16:58] [INFO ] Implicit Places using invariants and state equation in 630 ms returned []
Implicit Place search using SMT with State Equation took 817 ms to find 0 implicit places.
[2024-05-21 22:16:58] [INFO ] Redundant transitions in 74 ms returned []
Running 2324 sub problems to find dead transitions.
[2024-05-21 22:16:58] [INFO ] Flow matrix only has 289 transitions (discarded 2038 similar events)
[2024-05-21 22:16:58] [INFO ] Invariant cache hit.
[2024-05-21 22:16:58] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2324 unsolved
[2024-05-21 22:17:24] [INFO ] Deduced a trap composed of 5 places in 258 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 133/422 variables, and 6 constraints, problems are : Problem set: 0 solved, 2324 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2324/2324 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2324 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2324 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2324 unsolved
[2024-05-21 22:18:14] [INFO ] Deduced a trap composed of 25 places in 208 ms of which 1 ms to minimize.
Problem TDEAD1597 is UNSAT
Problem TDEAD1618 is UNSAT
Problem TDEAD1639 is UNSAT
Problem TDEAD1660 is UNSAT
Problem TDEAD1681 is UNSAT
Problem TDEAD1702 is UNSAT
Problem TDEAD1723 is UNSAT
Problem TDEAD1744 is UNSAT
Problem TDEAD1765 is UNSAT
Problem TDEAD1786 is UNSAT
Problem TDEAD1807 is UNSAT
Problem TDEAD1828 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 133/422 variables, and 7 constraints, problems are : Problem set: 12 solved, 2312 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2324 constraints, Known Traps: 2/2 constraints]
After SMT, in 78664ms problems are : Problem set: 12 solved, 2312 unsolved
Search for dead transitions found 12 dead transitions in 78697ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 133/133 places, 2315/2327 transitions.
Applied a total of 0 rules in 301 ms. Remains 133 /133 variables (removed 0) and now considering 2315/2315 (removed 0) transitions.
[2024-05-21 22:18:17] [INFO ] Redundant transitions in 80 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 141803 ms. Remains : 133/133 places, 2315/2327 transitions.
Built C files in :
/tmp/ltsmin321499901437758530
[2024-05-21 22:18:17] [INFO ] Too many transitions (2315) to apply POR reductions. Disabling POR matrices.
[2024-05-21 22:18:17] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin321499901437758530
Running compilation step : cd /tmp/ltsmin321499901437758530;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin321499901437758530;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin321499901437758530;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:840)
[2024-05-21 22:18:20] [INFO ] Flatten gal took : 64 ms
[2024-05-21 22:18:20] [INFO ] Flatten gal took : 62 ms
[2024-05-21 22:18:20] [INFO ] Time to serialize gal into /tmp/LTL16114653006774362213.gal : 11 ms
[2024-05-21 22:18:20] [INFO ] Time to serialize properties into /tmp/LTL15533116183925932317.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16114653006774362213.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5806222888037238752.hoa' '-atoms' '/tmp/LTL15533116183925932317.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15533116183925932317.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5806222888037238752.hoa
Detected timeout of ITS tools.
[2024-05-21 22:18:36] [INFO ] Flatten gal took : 80 ms
[2024-05-21 22:18:36] [INFO ] Flatten gal took : 80 ms
[2024-05-21 22:18:36] [INFO ] Time to serialize gal into /tmp/LTL1078717712861714074.gal : 15 ms
[2024-05-21 22:18:36] [INFO ] Time to serialize properties into /tmp/LTL2596725940397938092.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1078717712861714074.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2596725940397938092.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(((((((G(X((X(((((((F("(SUR_PONT_A>=1)"))||("((NB_ATTENTE_B_42>=1)&&(ROUTE_B>=1))"))||("(((NB_ATTENTE_B_3>=1)&&(ROUTE_B>=1))||((NB...6097
Formula 0 simplified : G(!"(((((((NB_ATTENTE_B_46<1)||(ROUTE_B<1))&&((NB_ATTENTE_B_27<1)||(ROUTE_B<1)))&&(((NB_ATTENTE_B_8<1)||(ROUTE_B<1))&&((NB_ATTENTE_B...8100
Detected timeout of ITS tools.
[2024-05-21 22:18:51] [INFO ] Flatten gal took : 104 ms
[2024-05-21 22:18:51] [INFO ] Applying decomposition
[2024-05-21 22:18:51] [INFO ] Flatten gal took : 86 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17576908377827284751.txt' '-o' '/tmp/graph17576908377827284751.bin' '-w' '/tmp/graph17576908377827284751.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17576908377827284751.bin' '-l' '-1' '-v' '-w' '/tmp/graph17576908377827284751.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:18:51] [INFO ] Decomposing Gal with order
[2024-05-21 22:18:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:18:52] [INFO ] Removed a total of 4333 redundant transitions.
[2024-05-21 22:18:52] [INFO ] Flatten gal took : 657 ms
[2024-05-21 22:18:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 326 labels/synchronizations in 73 ms.
[2024-05-21 22:18:52] [INFO ] Time to serialize gal into /tmp/LTL4642108593492810659.gal : 16 ms
[2024-05-21 22:18:52] [INFO ] Time to serialize properties into /tmp/LTL5770945661009763962.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4642108593492810659.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5770945661009763962.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(((((((G(X((X(((((((F("(u1.SUR_PONT_A>=1)"))||("((u0.NB_ATTENTE_B_42>=1)&&(u0.ROUTE_B>=1))"))||("(((u0.NB_ATTENTE_B_3>=1)&&(u0.ROU...7327
Formula 0 simplified : G(!"(((((((u0.NB_ATTENTE_B_46<1)||(u0.ROUTE_B<1))&&((u0.NB_ATTENTE_B_27<1)||(u0.ROUTE_B<1)))&&(((u0.NB_ATTENTE_B_8<1)||(u0.ROUTE_B<1...9939
Detected timeout of ITS tools.
Treatment of property BridgeAndVehicles-PT-V50P20N20-LTLFireability-05 finished in 425869 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(!p0))'
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 2346/2346 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 135 transition count 2345
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 135 transition count 2345
Applied a total of 2 rules in 399 ms. Remains 135 /136 variables (removed 1) and now considering 2345/2346 (removed 1) transitions.
Running 2342 sub problems to find dead transitions.
[2024-05-21 22:19:08] [INFO ] Flow matrix only has 289 transitions (discarded 2056 similar events)
// Phase 1: matrix 289 rows 135 cols
[2024-05-21 22:19:08] [INFO ] Computed 5 invariants in 4 ms
[2024-05-21 22:19:08] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2342 unsolved
[2024-05-21 22:19:36] [INFO ] Deduced a trap composed of 5 places in 282 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 135/424 variables, and 6 constraints, problems are : Problem set: 0 solved, 2342 unsolved in 20060 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2342/2342 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2342 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2342 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2342 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/424 variables, and 6 constraints, problems are : Problem set: 0 solved, 2342 unsolved in 20063 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2342 constraints, Known Traps: 1/1 constraints]
After SMT, in 60253ms problems are : Problem set: 0 solved, 2342 unsolved
Search for dead transitions found 0 dead transitions in 60287ms
[2024-05-21 22:20:08] [INFO ] Flow matrix only has 289 transitions (discarded 2056 similar events)
[2024-05-21 22:20:08] [INFO ] Invariant cache hit.
[2024-05-21 22:20:08] [INFO ] Implicit Places using invariants in 388 ms returned []
[2024-05-21 22:20:08] [INFO ] Flow matrix only has 289 transitions (discarded 2056 similar events)
[2024-05-21 22:20:08] [INFO ] Invariant cache hit.
[2024-05-21 22:20:09] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 22:20:09] [INFO ] Implicit Places using invariants and state equation in 1024 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1430 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 133/136 places, 2345/2346 transitions.
Applied a total of 0 rules in 334 ms. Remains 133 /133 variables (removed 0) and now considering 2345/2345 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62461 ms. Remains : 133/136 places, 2345/2346 transitions.
Stuttering acceptance computed with spot in 56 ms :[p0]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N20-LTLFireability-06
Product exploration explored 100000 steps with 944 reset in 699 ms.
Product exploration explored 100000 steps with 967 reset in 504 ms.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 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 :[p0]
RANDOM walk for 437 steps (0 resets) in 8 ms. (48 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 79 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 33 ms :[p0]
Stuttering acceptance computed with spot in 29 ms :[p0]
[2024-05-21 22:20:11] [INFO ] Flow matrix only has 289 transitions (discarded 2056 similar events)
// Phase 1: matrix 289 rows 133 cols
[2024-05-21 22:20:11] [INFO ] Computed 5 invariants in 3 ms
[2024-05-21 22:20:12] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-05-21 22:20:12] [INFO ] [Real]Absence check using state equation in 376 ms returned sat
[2024-05-21 22:20:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:20:12] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 22:20:12] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2024-05-21 22:20:12] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 22:20:13] [INFO ] [Nat]Added 42 Read/Feed constraints in 754 ms returned sat
[2024-05-21 22:20:13] [INFO ] Deduced a trap composed of 5 places in 240 ms of which 1 ms to minimize.
[2024-05-21 22:20:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 461 ms
[2024-05-21 22:20:14] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 106 ms.
[2024-05-21 22:20:14] [INFO ] Added : 20 causal constraints over 5 iterations in 295 ms. Result :sat
Could not prove EG p0
Support contains 3 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 2345/2345 transitions.
Applied a total of 0 rules in 317 ms. Remains 133 /133 variables (removed 0) and now considering 2345/2345 (removed 0) transitions.
Running 2342 sub problems to find dead transitions.
[2024-05-21 22:20:14] [INFO ] Flow matrix only has 289 transitions (discarded 2056 similar events)
[2024-05-21 22:20:14] [INFO ] Invariant cache hit.
[2024-05-21 22:20:14] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2342 unsolved
[2024-05-21 22:20:40] [INFO ] Deduced a trap composed of 5 places in 229 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 133/422 variables, and 6 constraints, problems are : Problem set: 0 solved, 2342 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2342/2342 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2342 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2342 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2342 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 133/422 variables, and 6 constraints, problems are : Problem set: 0 solved, 2342 unsolved in 20045 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2342 constraints, Known Traps: 1/1 constraints]
After SMT, in 58688ms problems are : Problem set: 0 solved, 2342 unsolved
Search for dead transitions found 0 dead transitions in 58714ms
[2024-05-21 22:21:13] [INFO ] Flow matrix only has 289 transitions (discarded 2056 similar events)
[2024-05-21 22:21:13] [INFO ] Invariant cache hit.
[2024-05-21 22:21:13] [INFO ] Implicit Places using invariants in 428 ms returned []
[2024-05-21 22:21:13] [INFO ] Flow matrix only has 289 transitions (discarded 2056 similar events)
[2024-05-21 22:21:13] [INFO ] Invariant cache hit.
[2024-05-21 22:21:14] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 22:21:15] [INFO ] Implicit Places using invariants and state equation in 1591 ms returned []
Implicit Place search using SMT with State Equation took 2026 ms to find 0 implicit places.
[2024-05-21 22:21:15] [INFO ] Redundant transitions in 104 ms returned []
Running 2342 sub problems to find dead transitions.
[2024-05-21 22:21:15] [INFO ] Flow matrix only has 289 transitions (discarded 2056 similar events)
[2024-05-21 22:21:15] [INFO ] Invariant cache hit.
[2024-05-21 22:21:15] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2342 unsolved
[2024-05-21 22:21:41] [INFO ] Deduced a trap composed of 5 places in 261 ms of which 4 ms to minimize.
[2024-05-21 22:21:55] [INFO ] Deduced a trap composed of 25 places in 174 ms of which 1 ms to minimize.
Problem TDEAD1287 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1329 is UNSAT
Problem TDEAD1350 is UNSAT
Problem TDEAD1371 is UNSAT
Problem TDEAD1392 is UNSAT
Problem TDEAD1413 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1455 is UNSAT
Problem TDEAD1476 is UNSAT
Problem TDEAD1497 is UNSAT
Problem TDEAD1518 is UNSAT
Problem TDEAD1539 is UNSAT
Problem TDEAD1560 is UNSAT
Problem TDEAD1581 is UNSAT
Problem TDEAD1602 is UNSAT
Problem TDEAD1623 is UNSAT
Problem TDEAD1644 is UNSAT
Problem TDEAD1665 is UNSAT
Problem TDEAD1686 is UNSAT
Problem TDEAD1707 is UNSAT
Problem TDEAD1728 is UNSAT
Problem TDEAD1749 is UNSAT
Problem TDEAD1770 is UNSAT
Problem TDEAD1791 is UNSAT
Problem TDEAD1812 is UNSAT
Problem TDEAD1833 is UNSAT
Problem TDEAD1854 is UNSAT
Problem TDEAD1875 is UNSAT
Problem TDEAD1896 is UNSAT
Problem TDEAD1917 is UNSAT
Problem TDEAD1938 is UNSAT
Problem TDEAD1959 is UNSAT
Problem TDEAD1980 is UNSAT
Problem TDEAD2001 is UNSAT
Problem TDEAD2022 is UNSAT
Problem TDEAD2043 is UNSAT
Problem TDEAD2064 is UNSAT
Problem TDEAD2085 is UNSAT
Problem TDEAD2106 is UNSAT
Problem TDEAD2127 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 133/422 variables, and 7 constraints, problems are : Problem set: 41 solved, 2301 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2342/2342 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 41 solved, 2301 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 41 solved, 2301 unsolved
Problem TDEAD2148 is UNSAT
Problem TDEAD2169 is UNSAT
Problem TDEAD2190 is UNSAT
Problem TDEAD2211 is UNSAT
Problem TDEAD2232 is UNSAT
Problem TDEAD2253 is UNSAT
Problem TDEAD2274 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 2/7 constraints. Problems are: Problem set: 48 solved, 2294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 133/422 variables, and 7 constraints, problems are : Problem set: 48 solved, 2294 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2342 constraints, Known Traps: 2/2 constraints]
After SMT, in 78433ms problems are : Problem set: 48 solved, 2294 unsolved
Search for dead transitions found 48 dead transitions in 78461ms
Found 48 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 48 transitions
Dead transitions reduction (with SMT) removed 48 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 133/133 places, 2297/2345 transitions.
Applied a total of 0 rules in 240 ms. Remains 133 /133 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
[2024-05-21 22:22:34] [INFO ] Redundant transitions in 48 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 139959 ms. Remains : 133/133 places, 2297/2345 transitions.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 117 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 27 ms :[p0]
RANDOM walk for 447 steps (0 resets) in 7 ms. (55 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 106 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 23 ms :[p0]
Stuttering acceptance computed with spot in 23 ms :[p0]
[2024-05-21 22:22:34] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
// Phase 1: matrix 288 rows 133 cols
[2024-05-21 22:22:34] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 22:22:35] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-21 22:22:35] [INFO ] [Real]Absence check using state equation in 341 ms returned sat
[2024-05-21 22:22:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:22:35] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-21 22:22:35] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2024-05-21 22:22:35] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 22:22:35] [INFO ] [Nat]Added 41 Read/Feed constraints in 204 ms returned sat
[2024-05-21 22:22:36] [INFO ] Deduced a trap composed of 5 places in 244 ms of which 1 ms to minimize.
[2024-05-21 22:22:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 406 ms
[2024-05-21 22:22:36] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 165 transitions) in 63 ms.
[2024-05-21 22:22:36] [INFO ] Added : 18 causal constraints over 6 iterations in 197 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 31 ms :[p0]
Product exploration explored 100000 steps with 956 reset in 491 ms.
Product exploration explored 100000 steps with 966 reset in 502 ms.
Built C files in :
/tmp/ltsmin4650836366568302034
[2024-05-21 22:22:37] [INFO ] Too many transitions (2297) to apply POR reductions. Disabling POR matrices.
[2024-05-21 22:22:37] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4650836366568302034
Running compilation step : cd /tmp/ltsmin4650836366568302034;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin4650836366568302034;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin4650836366568302034;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:840)
Support contains 3 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 2297/2297 transitions.
Applied a total of 0 rules in 227 ms. Remains 133 /133 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
Running 2294 sub problems to find dead transitions.
[2024-05-21 22:22:40] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 22:22:41] [INFO ] Invariant cache hit.
[2024-05-21 22:22:41] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
[2024-05-21 22:23:11] [INFO ] Deduced a trap composed of 5 places in 303 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 133/421 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 20052 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2294/2294 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2294 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 133/421 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 20055 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2294 constraints, Known Traps: 1/1 constraints]
After SMT, in 61748ms problems are : Problem set: 0 solved, 2294 unsolved
Search for dead transitions found 0 dead transitions in 61769ms
[2024-05-21 22:23:42] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 22:23:42] [INFO ] Invariant cache hit.
[2024-05-21 22:23:43] [INFO ] Implicit Places using invariants in 378 ms returned []
[2024-05-21 22:23:43] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 22:23:43] [INFO ] Invariant cache hit.
[2024-05-21 22:23:43] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 22:23:44] [INFO ] Implicit Places using invariants and state equation in 897 ms returned []
Implicit Place search using SMT with State Equation took 1278 ms to find 0 implicit places.
[2024-05-21 22:23:44] [INFO ] Redundant transitions in 87 ms returned []
Running 2294 sub problems to find dead transitions.
[2024-05-21 22:23:44] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-05-21 22:23:44] [INFO ] Invariant cache hit.
[2024-05-21 22:23:44] [INFO ] State equation strengthened by 41 read => feed constraints.

BK_STOP 1716330231719

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -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="BridgeAndVehicles-PT-V50P20N20"
export BK_EXAMINATION="LTLFireability"
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-5568"
echo " Executing tool itstools"
echo " Input is BridgeAndVehicles-PT-V50P20N20, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r048-tajo-171620399100236"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V50P20N20.tgz
mv BridgeAndVehicles-PT-V50P20N20 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;