fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r048-tajo-171620398600019
Last Updated
July 7, 2024

About the Execution of ITS-Tools for BridgeAndVehicles-COL-V20P10N10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
6838.647 1651018.00 3205430.00 485.50 FTTTTFTFFTFTFTTF normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r048-tajo-171620398600019.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-COL-V20P10N10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620398600019
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 9.2K Apr 13 01:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 13 01:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 13 01:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 13 01:23 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 4.5K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Apr 13 01:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 13 01:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 13 01:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Apr 13 01:37 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_pt
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 39K 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-COL-V20P10N10-LTLCardinality-00
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-LTLCardinality-01
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-LTLCardinality-02
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-LTLCardinality-03
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-LTLCardinality-04
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-LTLCardinality-05
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-LTLCardinality-06
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-LTLCardinality-07
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-LTLCardinality-08
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-LTLCardinality-09
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-LTLCardinality-10
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-LTLCardinality-11
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-LTLCardinality-12
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-LTLCardinality-13
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-LTLCardinality-14
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716320747547

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V20P10N10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202405141337
[2024-05-21 19:45:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 19:45:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 19:45:48] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-21 19:45:49] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-21 19:45:49] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 648 ms
[2024-05-21 19:45:49] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 68 PT places and 19578.0 transition bindings in 26 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
[2024-05-21 19:45:49] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 8 ms.
[2024-05-21 19:45:49] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Initial state reduction rules removed 4 formulas.
FORMULA BridgeAndVehicles-COL-V20P10N10-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N10-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N10-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N10-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 12 stabilizing places and 6 stable transitions
Graph (complete) has 51 edges and 15 vertex of which 13 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Remains 12 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA BridgeAndVehicles-COL-V20P10N10-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N10-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N10-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N10-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 9 stabilizing places and 6 stable transitions
Graph (complete) has 22 edges and 12 vertex of which 10 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
RANDOM walk for 40000 steps (8 resets) in 1423 ms. (28 steps per ms) remains 2/17 properties
BEST_FIRST walk for 40002 steps (8 resets) in 504 ms. (79 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 216 ms. (184 steps per ms) remains 1/2 properties
// Phase 1: matrix 10 rows 12 cols
[2024-05-21 19:45:50] [INFO ] Computed 4 invariants in 7 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp0 is UNSAT
After SMT solving in domain Real declared 3/22 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 149 ms.
Refiners :[Positive P Invariants (semi-flows): 1/4 constraints, State Equation: 0/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 192ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
[2024-05-21 19:45:50] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2024-05-21 19:45:50] [INFO ] Flatten gal took : 14 ms
[2024-05-21 19:45:50] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA BridgeAndVehicles-COL-V20P10N10-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N10-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 19:45:50] [INFO ] Flatten gal took : 2 ms
Arc [1:1*[(MOD (ADD $cA 1) 21)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 21) 21) 21)]] contains successor/predecessor on variables of sort voitureB
Arc [13:1*[(MOD (ADD $cpt 1) 11)]] contains successor/predecessor on variables of sort compteur
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2024-05-21 19:45:50] [INFO ] Unfolded HLPN to a Petri net with 68 places and 548 transitions 4070 arcs in 31 ms.
[2024-05-21 19:45:50] [INFO ] Unfolded 6 HLPN properties in 1 ms.
Support contains 12 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Applied a total of 0 rules in 16 ms. Remains 68 /68 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Running 545 sub problems to find dead transitions.
[2024-05-21 19:45:50] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 68 cols
[2024-05-21 19:45:50] [INFO ] Computed 7 invariants in 10 ms
[2024-05-21 19:45:50] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 545 unsolved
[2024-05-21 19:45:53] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 9 ms to minimize.
[2024-05-21 19:45:54] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 2 ms to minimize.
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
[2024-05-21 19:45:55] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 3/8 constraints. Problems are: Problem set: 40 solved, 505 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 40 solved, 505 unsolved
At refinement iteration 3 (OVERLAPS) 2/68 variables, 2/10 constraints. Problems are: Problem set: 40 solved, 505 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/10 constraints. Problems are: Problem set: 40 solved, 505 unsolved
Problem TDEAD20 is UNSAT
Problem TDEAD65 is UNSAT
At refinement iteration 5 (OVERLAPS) 130/198 variables, 68/78 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 22/100 constraints. Problems are: Problem set: 42 solved, 503 unsolved
[2024-05-21 19:46:01] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 1/101 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 0/101 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 9 (OVERLAPS) 0/198 variables, 0/101 constraints. Problems are: Problem set: 42 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 101 constraints, problems are : Problem set: 42 solved, 503 unsolved in 15133 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 68/68 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 545/545 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 42 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 5/5 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 3/8 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 3 (OVERLAPS) 2/68 variables, 2/10 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 1/11 constraints. Problems are: Problem set: 42 solved, 503 unsolved
[2024-05-21 19:46:09] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 1/12 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/12 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 130/198 variables, 68/80 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 22/102 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 503/605 constraints. Problems are: Problem set: 42 solved, 503 unsolved
[2024-05-21 19:46:20] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 1/606 constraints. Problems are: Problem set: 42 solved, 503 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 198/198 variables, and 606 constraints, problems are : Problem set: 42 solved, 503 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 68/68 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 503/545 constraints, Known Traps: 6/6 constraints]
After SMT, in 36566ms problems are : Problem set: 42 solved, 503 unsolved
Search for dead transitions found 42 dead transitions in 36585ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 42 transitions.
[2024-05-21 19:46:27] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
// Phase 1: matrix 126 rows 68 cols
[2024-05-21 19:46:27] [INFO ] Computed 9 invariants in 3 ms
[2024-05-21 19:46:27] [INFO ] Implicit Places using invariants in 139 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 146 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 67/68 places, 506/548 transitions.
Applied a total of 0 rules in 7 ms. Remains 67 /67 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 36772 ms. Remains : 67/68 places, 506/548 transitions.
Support contains 12 out of 67 places after structural reductions.
[2024-05-21 19:46:27] [INFO ] Flatten gal took : 44 ms
[2024-05-21 19:46:27] [INFO ] Flatten gal took : 39 ms
[2024-05-21 19:46:27] [INFO ] Input system was already deterministic with 506 transitions.
Support contains 11 out of 67 places (down from 12) after GAL structural reductions.
RANDOM walk for 40000 steps (224 resets) in 836 ms. (47 steps per ms) remains 1/14 properties
BEST_FIRST walk for 905 steps (0 resets) in 5 ms. (150 steps per ms) remains 0/1 properties
Computed a total of 50 stabilizing places and 82 stable transitions
Graph (complete) has 1096 edges and 67 vertex of which 65 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 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(((X(p0)||G(p1)) U (p2&&X(p3)&&F(p0)))))'
Support contains 8 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 506/506 transitions.
Applied a total of 0 rules in 5 ms. Remains 67 /67 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Running 503 sub problems to find dead transitions.
[2024-05-21 19:46:28] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
// Phase 1: matrix 126 rows 67 cols
[2024-05-21 19:46:28] [INFO ] Computed 8 invariants in 2 ms
[2024-05-21 19:46:28] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 19:46:30] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 2/67 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 19:46:34] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 1 ms to minimize.
[2024-05-21 19:46:34] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/193 variables, 67/78 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 19:46:38] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 11 (OVERLAPS) 0/193 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 99 constraints, problems are : Problem set: 0 solved, 503 unsolved in 14743 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 2/67 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/193 variables, 67/79 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 503/602 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 19:46:53] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 1/603 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 19:47:03] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 193/193 variables, and 604 constraints, problems are : Problem set: 0 solved, 503 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 6/6 constraints]
After SMT, in 35840ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 35847ms
[2024-05-21 19:47:04] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-05-21 19:47:04] [INFO ] Invariant cache hit.
[2024-05-21 19:47:04] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-21 19:47:04] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-05-21 19:47:04] [INFO ] Invariant cache hit.
[2024-05-21 19:47:04] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 19:47:04] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
Running 503 sub problems to find dead transitions.
[2024-05-21 19:47:04] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-05-21 19:47:04] [INFO ] Invariant cache hit.
[2024-05-21 19:47:04] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 19:47:06] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 2/67 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 19:47:10] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 0 ms to minimize.
[2024-05-21 19:47:10] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/193 variables, 67/78 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 19:47:14] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 11 (OVERLAPS) 0/193 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 99 constraints, problems are : Problem set: 0 solved, 503 unsolved in 14039 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 2/67 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/193 variables, 67/79 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 503/602 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 19:47:31] [INFO ] Deduced a trap composed of 6 places in 100 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 1/603 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 19:47:38] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/193 variables, 1/604 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 193/193 variables, and 604 constraints, problems are : Problem set: 0 solved, 503 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 6/6 constraints]
After SMT, in 45118ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 45127ms
Finished structural reductions in LTL mode , in 1 iterations and 81300 ms. Remains : 67/67 places, 506/506 transitions.
Stuttering acceptance computed with spot in 664 ms :[(OR (NOT p0) (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p3), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p3)), true, (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-COL-V20P10N10-LTLCardinality-05
Product exploration explored 100000 steps with 30400 reset in 535 ms.
Product exploration explored 100000 steps with 30439 reset in 387 ms.
Computed a total of 50 stabilizing places and 82 stable transitions
Graph (complete) has 1096 edges and 67 vertex of which 65 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 ms
Computed a total of 50 stabilizing places and 82 stable transitions
Detected a total of 50/67 stabilizing places and 82/506 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/4 atomic propositions.
Knowledge obtained : [(AND p2 p1 p0 p3), (X (NOT (AND (NOT p2) (NOT p1)))), (X p2), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 (NOT p1)))), (X (AND p2 p1)), (X p0), (X p1), (X (NOT (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p2 p1))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p3))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND p2 p1 (NOT p3)))), (X (X (NOT (AND p2 p1 (NOT p3)))))]
Knowledge based reduction with 30 factoid took 746 ms. Reduced automaton from 10 states, 25 edges and 4 AP (stutter sensitive) to 10 states, 25 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 473 ms :[(OR (NOT p0) (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p3), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p3)), true, (NOT p1)]
RANDOM walk for 40001 steps (224 resets) in 1111 ms. (35 steps per ms) remains 8/21 properties
BEST_FIRST walk for 1191 steps (0 resets) in 13 ms. (85 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND p2 p1 p0 p3), (X (NOT (AND (NOT p2) (NOT p1)))), (X p2), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 (NOT p1)))), (X (AND p2 p1)), (X p0), (X p1), (X (NOT (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p2 p1))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p3))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND p2 p1 (NOT p3)))), (X (X (NOT (AND p2 p1 (NOT p3))))), (F (NOT p2)), (F (NOT (OR p1 p2 p3))), (F (NOT (OR p2 p3))), (F (NOT (OR (NOT p2) p3))), (F (NOT (OR p1 p0))), (F (NOT (OR p1 (NOT p2) p3))), (F (NOT (OR p1 p2))), (F (NOT (OR (NOT p1) p0))), (F (NOT (OR p0 p3))), (F (NOT (OR (NOT p1) p2 p3))), (F (NOT (OR (NOT p1) (NOT p2) p3))), (F (NOT p1)), (F (NOT p3)), (F (NOT p0)), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR p1 p0 p3))), (F (NOT (OR p1 (NOT p2)))), (F (NOT (AND p1 p2))), (F (NOT (OR (NOT p2) p0))), (F (NOT (OR (NOT p1) p0 p3))), (F (NOT (OR (NOT p2) p0 p3)))]
Knowledge based reduction with 30 factoid took 2600 ms. Reduced automaton from 10 states, 25 edges and 4 AP (stutter sensitive) to 10 states, 25 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 362 ms :[(OR (NOT p0) (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p3), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p3)), true, (NOT p1)]
Stuttering acceptance computed with spot in 337 ms :[(OR (NOT p0) (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p3), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p3)), true, (NOT p1)]
Support contains 8 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 506/506 transitions.
Applied a total of 0 rules in 7 ms. Remains 67 /67 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Running 503 sub problems to find dead transitions.
[2024-05-21 19:47:56] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-05-21 19:47:56] [INFO ] Invariant cache hit.
[2024-05-21 19:47:56] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 19:47:58] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 2/67 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 19:48:02] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 0 ms to minimize.
[2024-05-21 19:48:02] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/193 variables, 67/78 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 19:48:06] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 11 (OVERLAPS) 0/193 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 99 constraints, problems are : Problem set: 0 solved, 503 unsolved in 13949 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 2/67 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/193 variables, 67/79 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 503/602 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 19:48:22] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 1/603 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 19:48:28] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 193/193 variables, and 604 constraints, problems are : Problem set: 0 solved, 503 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 6/6 constraints]
After SMT, in 34979ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 34987ms
[2024-05-21 19:48:31] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-05-21 19:48:31] [INFO ] Invariant cache hit.
[2024-05-21 19:48:31] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-21 19:48:31] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-05-21 19:48:31] [INFO ] Invariant cache hit.
[2024-05-21 19:48:31] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 19:48:31] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
Running 503 sub problems to find dead transitions.
[2024-05-21 19:48:31] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-05-21 19:48:31] [INFO ] Invariant cache hit.
[2024-05-21 19:48:31] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 19:48:33] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 2/67 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 19:48:37] [INFO ] Deduced a trap composed of 6 places in 88 ms of which 0 ms to minimize.
[2024-05-21 19:48:37] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/193 variables, 67/78 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 19:48:41] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 11 (OVERLAPS) 0/193 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 99 constraints, problems are : Problem set: 0 solved, 503 unsolved in 15162 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 2/67 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/193 variables, 67/79 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 503/602 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 19:48:58] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 1/603 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 19:49:06] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/193 variables, 1/604 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 193/193 variables, and 604 constraints, problems are : Problem set: 0 solved, 503 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 6/6 constraints]
After SMT, in 46112ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 46119ms
Finished structural reductions in LTL mode , in 1 iterations and 81335 ms. Remains : 67/67 places, 506/506 transitions.
Computed a total of 50 stabilizing places and 82 stable transitions
Graph (complete) has 1096 edges and 67 vertex of which 65 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Computed a total of 50 stabilizing places and 82 stable transitions
Detected a total of 50/67 stabilizing places and 82/506 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/4 atomic propositions.
Knowledge obtained : [(AND p2 p1 p0 p3), (X (AND p1 p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 (NOT p2)))), (X p2), (X (NOT (AND p2 (NOT p0)))), (X p0), (X p1), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND p2 (NOT p0) (NOT p3))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND p1 p2 (NOT p3)))), (X (X (NOT (AND p1 p2 (NOT p3)))))]
Knowledge based reduction with 30 factoid took 976 ms. Reduced automaton from 10 states, 25 edges and 4 AP (stutter sensitive) to 10 states, 25 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 397 ms :[(OR (NOT p0) (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p3), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p3)), true, (NOT p1)]
RANDOM walk for 40000 steps (224 resets) in 454 ms. (87 steps per ms) remains 8/21 properties
BEST_FIRST walk for 1186 steps (0 resets) in 7 ms. (148 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND p2 p1 p0 p3), (X (AND p1 p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 (NOT p2)))), (X p2), (X (NOT (AND p2 (NOT p0)))), (X p0), (X p1), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND p2 (NOT p0) (NOT p3))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND p1 p2 (NOT p3)))), (X (X (NOT (AND p1 p2 (NOT p3))))), (F (NOT p2)), (F (NOT (OR p1 p2 p3))), (F (NOT (OR p2 p3))), (F (NOT (OR (NOT p2) p3))), (F (NOT (OR p1 p0))), (F (NOT (OR p1 (NOT p2) p3))), (F (NOT (OR p1 p2))), (F (NOT (OR (NOT p1) p0))), (F (NOT (OR p0 p3))), (F (NOT (OR (NOT p1) p2 p3))), (F (NOT (OR (NOT p1) (NOT p2) p3))), (F (NOT p1)), (F (NOT p3)), (F (NOT p0)), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR p1 p0 p3))), (F (NOT (OR p1 (NOT p2)))), (F (NOT (AND p1 p2))), (F (NOT (OR (NOT p2) p0))), (F (NOT (OR (NOT p1) p0 p3))), (F (NOT (OR (NOT p2) p0 p3)))]
Knowledge based reduction with 30 factoid took 3093 ms. Reduced automaton from 10 states, 25 edges and 4 AP (stutter sensitive) to 10 states, 25 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 446 ms :[(OR (NOT p0) (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p3), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p3)), true, (NOT p1)]
Stuttering acceptance computed with spot in 374 ms :[(OR (NOT p0) (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p3), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p3)), true, (NOT p1)]
Stuttering acceptance computed with spot in 384 ms :[(OR (NOT p0) (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p3), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p3)), true, (NOT p1)]
Product exploration explored 100000 steps with 30446 reset in 270 ms.
Product exploration explored 100000 steps with 30441 reset in 361 ms.
Applying partial POR strategy [false, false, true, true, false, true, true, true, true, true]
Stuttering acceptance computed with spot in 460 ms :[(OR (NOT p0) (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p3), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p3)), true, (NOT p1)]
Support contains 8 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 506/506 transitions.
Applied a total of 0 rules in 112 ms. Remains 67 /67 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Running 503 sub problems to find dead transitions.
[2024-05-21 19:49:24] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-05-21 19:49:24] [INFO ] Invariant cache hit.
[2024-05-21 19:49:24] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 19:49:26] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 2/67 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 19:49:31] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 1 ms to minimize.
[2024-05-21 19:49:31] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/193 variables, 67/78 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 19:49:35] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 11 (OVERLAPS) 0/193 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 99 constraints, problems are : Problem set: 0 solved, 503 unsolved in 15370 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 2/67 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/193 variables, 67/79 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 503/602 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 19:49:52] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 1/603 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 19:49:59] [INFO ] Deduced a trap composed of 5 places in 132 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 193/193 variables, and 604 constraints, problems are : Problem set: 0 solved, 503 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 6/6 constraints]
After SMT, in 36280ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 36286ms
[2024-05-21 19:50:01] [INFO ] Redundant transitions in 35 ms returned []
Running 503 sub problems to find dead transitions.
[2024-05-21 19:50:01] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-05-21 19:50:01] [INFO ] Invariant cache hit.
[2024-05-21 19:50:01] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 19:50:03] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 2/67 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 19:50:06] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 1 ms to minimize.
[2024-05-21 19:50:06] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/193 variables, 67/78 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 19:50:09] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 11 (OVERLAPS) 0/193 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 99 constraints, problems are : Problem set: 0 solved, 503 unsolved in 13905 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 2/67 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/193 variables, 67/79 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 503/602 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 19:50:27] [INFO ] Deduced a trap composed of 6 places in 117 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 1/603 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 19:50:35] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/193 variables, 1/604 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 193/193 variables, and 604 constraints, problems are : Problem set: 0 solved, 503 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 6/6 constraints]
After SMT, in 44774ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 44782ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 81226 ms. Remains : 67/67 places, 506/506 transitions.
Built C files in :
/tmp/ltsmin16778961813532761883
[2024-05-21 19:50:46] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16778961813532761883
Running compilation step : cd /tmp/ltsmin16778961813532761883;'/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'
Compilation finished in 1405 ms.
Running link step : cd /tmp/ltsmin16778961813532761883;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin16778961813532761883;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8713337686722737972.hoa' '--buchi-type=spotba'
LTSmin run took 8721 ms.
FORMULA BridgeAndVehicles-COL-V20P10N10-LTLCardinality-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BridgeAndVehicles-COL-V20P10N10-LTLCardinality-05 finished in 267981 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(p0)||F(p1)))'
Support contains 7 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 506/506 transitions.
Applied a total of 0 rules in 18 ms. Remains 67 /67 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Running 503 sub problems to find dead transitions.
[2024-05-21 19:50:56] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-05-21 19:50:56] [INFO ] Invariant cache hit.
[2024-05-21 19:50:56] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 19:50:58] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 2/67 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 19:51:01] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 0 ms to minimize.
[2024-05-21 19:51:01] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/193 variables, 67/78 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 19:51:04] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 11 (OVERLAPS) 0/193 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 99 constraints, problems are : Problem set: 0 solved, 503 unsolved in 12611 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 2/67 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/193 variables, 67/79 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 503/602 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 19:51:21] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 1/603 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 19:51:28] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 193/193 variables, and 604 constraints, problems are : Problem set: 0 solved, 503 unsolved in 20013 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 6/6 constraints]
After SMT, in 33362ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 33370ms
[2024-05-21 19:51:29] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-05-21 19:51:29] [INFO ] Invariant cache hit.
[2024-05-21 19:51:29] [INFO ] Implicit Places using invariants in 85 ms returned [24]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 99 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/67 places, 506/506 transitions.
Applied a total of 0 rules in 22 ms. Remains 66 /66 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 33518 ms. Remains : 66/67 places, 506/506 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-COL-V20P10N10-LTLCardinality-06
Product exploration explored 100000 steps with 1426 reset in 256 ms.
Product exploration explored 100000 steps with 1432 reset in 198 ms.
Computed a total of 49 stabilizing places and 82 stable transitions
Graph (complete) has 1053 edges and 66 vertex of which 64 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 49 stabilizing places and 82 stable transitions
Detected a total of 49/66 stabilizing places and 82/506 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 229 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 244 steps (0 resets) in 5 ms. (40 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 10 factoid took 402 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 7 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 506/506 transitions.
Applied a total of 0 rules in 28 ms. Remains 66 /66 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Running 503 sub problems to find dead transitions.
[2024-05-21 19:51:31] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
// Phase 1: matrix 126 rows 66 cols
[2024-05-21 19:51:31] [INFO ] Computed 7 invariants in 7 ms
[2024-05-21 19:51:31] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 19:51:33] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (OVERLAPS) 2/66 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 19:51:37] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 1 ms to minimize.
[2024-05-21 19:51:37] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 19:51:39] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/192 variables, 66/77 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 19:51:42] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 11 (OVERLAPS) 0/192 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 98 constraints, problems are : Problem set: 0 solved, 503 unsolved in 15769 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 66/66 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (OVERLAPS) 2/66 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (OVERLAPS) 126/192 variables, 66/78 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 503/601 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 19:51:56] [INFO ] Deduced a trap composed of 5 places in 150 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 1/602 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 192/192 variables, and 602 constraints, problems are : Problem set: 0 solved, 503 unsolved in 20053 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 66/66 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 6/6 constraints]
After SMT, in 37001ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 37012ms
[2024-05-21 19:52:08] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-05-21 19:52:08] [INFO ] Invariant cache hit.
[2024-05-21 19:52:08] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-21 19:52:08] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-05-21 19:52:08] [INFO ] Invariant cache hit.
[2024-05-21 19:52:08] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 19:52:08] [INFO ] Implicit Places using invariants and state equation in 392 ms returned []
Implicit Place search using SMT with State Equation took 497 ms to find 0 implicit places.
[2024-05-21 19:52:08] [INFO ] Redundant transitions in 7 ms returned []
Running 503 sub problems to find dead transitions.
[2024-05-21 19:52:08] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-05-21 19:52:08] [INFO ] Invariant cache hit.
[2024-05-21 19:52:08] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 19:52:10] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (OVERLAPS) 2/66 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 19:52:14] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 1 ms to minimize.
[2024-05-21 19:52:14] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 19:52:15] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/192 variables, 66/77 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 19:52:18] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 11 (OVERLAPS) 0/192 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 98 constraints, problems are : Problem set: 0 solved, 503 unsolved in 14863 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 66/66 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (OVERLAPS) 2/66 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (OVERLAPS) 126/192 variables, 66/78 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 503/601 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 19:52:32] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 1/602 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 11 (OVERLAPS) 0/192 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 602 constraints, problems are : Problem set: 0 solved, 503 unsolved in 26105 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 66/66 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 6/6 constraints]
After SMT, in 41757ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 41763ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 79331 ms. Remains : 66/66 places, 506/506 transitions.
Computed a total of 49 stabilizing places and 82 stable transitions
Graph (complete) has 1053 edges and 66 vertex of which 64 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 49 stabilizing places and 82 stable transitions
Detected a total of 49/66 stabilizing places and 82/506 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 163 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 301 steps (0 resets) in 6 ms. (43 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 10 factoid took 199 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 63 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 48 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1432 reset in 214 ms.
Product exploration explored 100000 steps with 1428 reset in 211 ms.
Built C files in :
/tmp/ltsmin7362175847275063352
[2024-05-21 19:52:51] [INFO ] Computing symmetric may disable matrix : 506 transitions.
[2024-05-21 19:52:51] [INFO ] Computation of Complete disable matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:52:51] [INFO ] Computing symmetric may enable matrix : 506 transitions.
[2024-05-21 19:52:51] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:52:51] [INFO ] Computing Do-Not-Accords matrix : 506 transitions.
[2024-05-21 19:52:51] [INFO ] Computation of Completed DNA matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:52:51] [INFO ] Built C files in 143ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7362175847275063352
Running compilation step : cd /tmp/ltsmin7362175847275063352;'/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'
Compilation finished in 1738 ms.
Running link step : cd /tmp/ltsmin7362175847275063352;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin7362175847275063352;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10708291860702347948.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 506/506 transitions.
Applied a total of 0 rules in 19 ms. Remains 66 /66 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Running 503 sub problems to find dead transitions.
[2024-05-21 19:53:06] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-05-21 19:53:06] [INFO ] Invariant cache hit.
[2024-05-21 19:53:06] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 19:53:09] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (OVERLAPS) 2/66 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 19:53:12] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 1 ms to minimize.
[2024-05-21 19:53:12] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 19:53:14] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/192 variables, 66/77 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 19:53:17] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 11 (OVERLAPS) 0/192 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 98 constraints, problems are : Problem set: 0 solved, 503 unsolved in 15887 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 66/66 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (OVERLAPS) 2/66 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (OVERLAPS) 126/192 variables, 66/78 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 503/601 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 19:53:31] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 1/602 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 192/192 variables, and 602 constraints, problems are : Problem set: 0 solved, 503 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 66/66 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 6/6 constraints]
After SMT, in 36981ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 36990ms
[2024-05-21 19:53:43] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-05-21 19:53:43] [INFO ] Invariant cache hit.
[2024-05-21 19:53:43] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-21 19:53:43] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-05-21 19:53:43] [INFO ] Invariant cache hit.
[2024-05-21 19:53:44] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 19:53:44] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
[2024-05-21 19:53:44] [INFO ] Redundant transitions in 4 ms returned []
Running 503 sub problems to find dead transitions.
[2024-05-21 19:53:44] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-05-21 19:53:44] [INFO ] Invariant cache hit.
[2024-05-21 19:53:44] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 19:53:46] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (OVERLAPS) 2/66 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 19:53:49] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 1 ms to minimize.
[2024-05-21 19:53:49] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 19:53:51] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/192 variables, 66/77 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 19:53:54] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 11 (OVERLAPS) 0/192 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 98 constraints, problems are : Problem set: 0 solved, 503 unsolved in 13846 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 66/66 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (OVERLAPS) 2/66 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (OVERLAPS) 126/192 variables, 66/78 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 503/601 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 19:54:06] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 1/602 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 11 (OVERLAPS) 0/192 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 602 constraints, problems are : Problem set: 0 solved, 503 unsolved in 25854 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 66/66 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 6/6 constraints]
After SMT, in 40758ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 40765ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 78215 ms. Remains : 66/66 places, 506/506 transitions.
Built C files in :
/tmp/ltsmin15449862079138366658
[2024-05-21 19:54:25] [INFO ] Computing symmetric may disable matrix : 506 transitions.
[2024-05-21 19:54:25] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:54:25] [INFO ] Computing symmetric may enable matrix : 506 transitions.
[2024-05-21 19:54:25] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:54:25] [INFO ] Computing Do-Not-Accords matrix : 506 transitions.
[2024-05-21 19:54:25] [INFO ] Computation of Completed DNA matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:54:25] [INFO ] Built C files in 98ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15449862079138366658
Running compilation step : cd /tmp/ltsmin15449862079138366658;'/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'
Compilation finished in 1541 ms.
Running link step : cd /tmp/ltsmin15449862079138366658;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin15449862079138366658;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5503136583148261180.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 19:54:40] [INFO ] Flatten gal took : 50 ms
[2024-05-21 19:54:40] [INFO ] Flatten gal took : 48 ms
[2024-05-21 19:54:40] [INFO ] Time to serialize gal into /tmp/LTL14714923858212423569.gal : 30 ms
[2024-05-21 19:54:40] [INFO ] Time to serialize properties into /tmp/LTL6324570322447872491.prop : 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/LTL14714923858212423569.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15225164377215904375.hoa' '-atoms' '/tmp/LTL6324570322447872491.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/LTL6324570322447872491.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15225164377215904375.hoa
Detected timeout of ITS tools.
[2024-05-21 19:54:55] [INFO ] Flatten gal took : 28 ms
[2024-05-21 19:54:55] [INFO ] Flatten gal took : 26 ms
[2024-05-21 19:54:55] [INFO ] Time to serialize gal into /tmp/LTL8006712071464035902.gal : 8 ms
[2024-05-21 19:54:55] [INFO ] Time to serialize properties into /tmp/LTL11231003260913590886.ltl : 5 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/LTL8006712071464035902.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11231003260913590886.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...276
Read 1 LTL properties
Checking formula 0 : !(((G("(((SORTI_B>ROUTE_B)&&((CHOIX_0+CHOIX_1)>SORTI_A))||(CAPACITE<=ROUTE_A))"))||(F("(SORTI_B>ROUTE_B)"))))
Formula 0 simplified : F!"(((SORTI_B>ROUTE_B)&&((CHOIX_0+CHOIX_1)>SORTI_A))||(CAPACITE<=ROUTE_A))" & G!"(SORTI_B>ROUTE_B)"
Detected timeout of ITS tools.
[2024-05-21 19:55:10] [INFO ] Flatten gal took : 38 ms
[2024-05-21 19:55:10] [INFO ] Applying decomposition
[2024-05-21 19:55:10] [INFO ] Flatten gal took : 32 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/graph7873779218654396169.txt' '-o' '/tmp/graph7873779218654396169.bin' '-w' '/tmp/graph7873779218654396169.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7873779218654396169.bin' '-l' '-1' '-v' '-w' '/tmp/graph7873779218654396169.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:55:11] [INFO ] Decomposing Gal with order
[2024-05-21 19:55:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:55:11] [INFO ] Removed a total of 139 redundant transitions.
[2024-05-21 19:55:11] [INFO ] Flatten gal took : 77 ms
[2024-05-21 19:55:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 102 labels/synchronizations in 7 ms.
[2024-05-21 19:55:11] [INFO ] Time to serialize gal into /tmp/LTL5696499725293409677.gal : 8 ms
[2024-05-21 19:55:11] [INFO ] Time to serialize properties into /tmp/LTL14072207603002814660.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/LTL5696499725293409677.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14072207603002814660.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...276
Read 1 LTL properties
Checking formula 0 : !(((G("(((gu2.SORTI_B>gu2.ROUTE_B)&&((gu0.CHOIX_0+gu0.CHOIX_1)>gu0.SORTI_A))||(gu1.CAPACITE<=gu1.ROUTE_A))"))||(F("(gu2.SORTI_B>gu2.RO...166
Formula 0 simplified : F!"(((gu2.SORTI_B>gu2.ROUTE_B)&&((gu0.CHOIX_0+gu0.CHOIX_1)>gu0.SORTI_A))||(gu1.CAPACITE<=gu1.ROUTE_A))" & G!"(gu2.SORTI_B>gu2.ROUTE_...158
Detected timeout of ITS tools.
Treatment of property BridgeAndVehicles-COL-V20P10N10-LTLCardinality-06 finished in 269923 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(p0)&&(F(p0) U p1))) U G((!p1||X(p2)))))'
Support contains 6 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 506/506 transitions.
Applied a total of 0 rules in 6 ms. Remains 67 /67 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Running 503 sub problems to find dead transitions.
[2024-05-21 19:55:26] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
// Phase 1: matrix 126 rows 67 cols
[2024-05-21 19:55:26] [INFO ] Computed 8 invariants in 4 ms
[2024-05-21 19:55:26] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 19:55:28] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 2/67 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 19:55:31] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 1 ms to minimize.
[2024-05-21 19:55:32] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/193 variables, 67/78 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 19:55:35] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 11 (OVERLAPS) 0/193 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 99 constraints, problems are : Problem set: 0 solved, 503 unsolved in 14107 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 2/67 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/193 variables, 67/79 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 503/602 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 19:55:49] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 1/603 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 19:55:59] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 193/193 variables, and 604 constraints, problems are : Problem set: 0 solved, 503 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 6/6 constraints]
After SMT, in 35012ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 35024ms
[2024-05-21 19:56:01] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-05-21 19:56:01] [INFO ] Invariant cache hit.
[2024-05-21 19:56:01] [INFO ] Implicit Places using invariants in 127 ms returned [24]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 142 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 66/67 places, 506/506 transitions.
Applied a total of 0 rules in 3 ms. Remains 66 /66 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 35177 ms. Remains : 66/67 places, 506/506 transitions.
Stuttering acceptance computed with spot in 252 ms :[(AND p1 (NOT p2)), false, (NOT p2), (AND p0 (NOT p2)), (AND p1 p0 (NOT p2)), true, (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-COL-V20P10N10-LTLCardinality-08
Product exploration explored 100000 steps with 25001 reset in 280 ms.
Entered a terminal (fully accepting) state of product in 45962 steps with 11466 reset in 122 ms.
FORMULA BridgeAndVehicles-COL-V20P10N10-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V20P10N10-LTLCardinality-08 finished in 35851 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(F(p0)))'
Support contains 1 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 506/506 transitions.
Graph (complete) has 1096 edges and 67 vertex of which 65 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 64 transition count 505
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 64 transition count 505
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 62 transition count 504
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 60 transition count 502
Applied a total of 10 rules in 79 ms. Remains 60 /67 variables (removed 7) and now considering 502/506 (removed 4) transitions.
[2024-05-21 19:56:02] [INFO ] Flow matrix only has 122 transitions (discarded 380 similar events)
// Phase 1: matrix 122 rows 60 cols
[2024-05-21 19:56:02] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 19:56:02] [INFO ] Implicit Places using invariants in 177 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 179 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/67 places, 502/506 transitions.
Applied a total of 0 rules in 28 ms. Remains 59 /59 variables (removed 0) and now considering 502/502 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 311 ms. Remains : 59/67 places, 502/506 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V20P10N10-LTLCardinality-10
Stuttering criterion allowed to conclude after 125 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-COL-V20P10N10-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V20P10N10-LTLCardinality-10 finished in 423 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(F((p0&&G(p1)))))'
Support contains 2 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 506/506 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 66 transition count 506
Applied a total of 1 rules in 5 ms. Remains 66 /67 variables (removed 1) and now considering 506/506 (removed 0) transitions.
Running 503 sub problems to find dead transitions.
[2024-05-21 19:56:02] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
// Phase 1: matrix 126 rows 66 cols
[2024-05-21 19:56:02] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 19:56:02] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 19:56:04] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 1/66 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 19:56:07] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/192 variables, 66/75 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (OVERLAPS) 0/192 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 95 constraints, problems are : Problem set: 0 solved, 503 unsolved in 11432 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 66/66 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 1/66 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/192 variables, 66/75 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 503/598 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 19:56:21] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 0 ms to minimize.
[2024-05-21 19:56:24] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 14 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 2/600 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/192 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 192/192 variables, and 600 constraints, problems are : Problem set: 0 solved, 503 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 66/66 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 4/4 constraints]
After SMT, in 32372ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 32378ms
[2024-05-21 19:56:34] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-05-21 19:56:34] [INFO ] Invariant cache hit.
[2024-05-21 19:56:35] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-21 19:56:35] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-05-21 19:56:35] [INFO ] Invariant cache hit.
[2024-05-21 19:56:35] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 19:56:35] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
Running 503 sub problems to find dead transitions.
[2024-05-21 19:56:35] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-05-21 19:56:35] [INFO ] Invariant cache hit.
[2024-05-21 19:56:35] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 19:56:37] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 1/66 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 19:56:40] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/192 variables, 66/75 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (OVERLAPS) 0/192 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 95 constraints, problems are : Problem set: 0 solved, 503 unsolved in 11343 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 66/66 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 1/66 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/192 variables, 66/75 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 503/598 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 19:57:02] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 1 ms to minimize.
[2024-05-21 19:57:02] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/192 variables, 2/600 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/192 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 192/192 variables, and 600 constraints, problems are : Problem set: 0 solved, 503 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 66/66 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 4/4 constraints]
After SMT, in 42491ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 42504ms
Starting structural reductions in LTL mode, iteration 1 : 66/67 places, 506/506 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75173 ms. Remains : 66/67 places, 506/506 transitions.
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-COL-V20P10N10-LTLCardinality-13
Product exploration explored 100000 steps with 586 reset in 275 ms.
Product exploration explored 100000 steps with 585 reset in 321 ms.
Computed a total of 49 stabilizing places and 82 stable transitions
Graph (complete) has 1095 edges and 66 vertex of which 65 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 49 stabilizing places and 82 stable transitions
Detected a total of 49/66 stabilizing places and 82/506 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 534 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 618 steps (0 resets) in 10 ms. (56 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 658 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
[2024-05-21 19:57:20] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-05-21 19:57:20] [INFO ] Invariant cache hit.
[2024-05-21 19:57:20] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-21 19:57:20] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 19:57:20] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-05-21 19:57:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 19:57:20] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-21 19:57:20] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 19:57:20] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-05-21 19:57:20] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 19:57:20] [INFO ] [Nat]Added 20 Read/Feed constraints in 50 ms returned sat
[2024-05-21 19:57:20] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 1 ms to minimize.
[2024-05-21 19:57:21] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 1 ms to minimize.
[2024-05-21 19:57:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 307 ms
[2024-05-21 19:57:21] [INFO ] Computed and/alt/rep : 48/96/48 causal constraints (skipped 75 transitions) in 45 ms.
[2024-05-21 19:57:21] [INFO ] Added : 18 causal constraints over 6 iterations in 144 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 506/506 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 65 transition count 505
Applied a total of 2 rules in 26 ms. Remains 65 /66 variables (removed 1) and now considering 505/506 (removed 1) transitions.
Running 502 sub problems to find dead transitions.
[2024-05-21 19:57:21] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
// Phase 1: matrix 125 rows 65 cols
[2024-05-21 19:57:21] [INFO ] Computed 7 invariants in 0 ms
[2024-05-21 19:57:21] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-05-21 19:57:23] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 1/65 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-05-21 19:57:26] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-05-21 19:57:27] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (OVERLAPS) 125/190 variables, 65/75 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-05-21 19:57:31] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-05-21 19:57:31] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 11 (OVERLAPS) 0/190 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 97 constraints, problems are : Problem set: 0 solved, 502 unsolved in 14947 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 1/65 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (OVERLAPS) 125/190 variables, 65/77 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 502/599 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 11 (OVERLAPS) 0/190 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 599 constraints, problems are : Problem set: 0 solved, 502 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 5/5 constraints]
After SMT, in 35887ms problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 35894ms
[2024-05-21 19:57:57] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-05-21 19:57:57] [INFO ] Invariant cache hit.
[2024-05-21 19:57:57] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-21 19:57:57] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-05-21 19:57:57] [INFO ] Invariant cache hit.
[2024-05-21 19:57:57] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 19:57:57] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
[2024-05-21 19:57:57] [INFO ] Redundant transitions in 3 ms returned []
Running 502 sub problems to find dead transitions.
[2024-05-21 19:57:57] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-05-21 19:57:57] [INFO ] Invariant cache hit.
[2024-05-21 19:57:57] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-05-21 19:57:59] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 1/65 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-05-21 19:58:02] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-21 19:58:02] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (OVERLAPS) 125/190 variables, 65/75 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-05-21 19:58:07] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 11 (OVERLAPS) 0/190 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 96 constraints, problems are : Problem set: 0 solved, 502 unsolved in 13209 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 1/65 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (OVERLAPS) 125/190 variables, 65/76 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 502/598 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 11 (OVERLAPS) 0/190 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 598 constraints, problems are : Problem set: 0 solved, 502 unsolved in 26071 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 4/4 constraints]
After SMT, in 40089ms problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 40095ms
Starting structural reductions in SI_LTL mode, iteration 1 : 65/66 places, 505/506 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 76310 ms. Remains : 65/66 places, 505/506 transitions.
Computed a total of 48 stabilizing places and 81 stable transitions
Graph (complete) has 1093 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 48 stabilizing places and 81 stable transitions
Detected a total of 48/65 stabilizing places and 81/505 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 9 factoid took 251 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 398 steps (0 resets) in 5 ms. (66 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 524 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
[2024-05-21 19:58:38] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-05-21 19:58:38] [INFO ] Invariant cache hit.
[2024-05-21 19:58:38] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-21 19:58:38] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 19:58:38] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2024-05-21 19:58:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 19:58:39] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-21 19:58:39] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 19:58:39] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-05-21 19:58:39] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 19:58:39] [INFO ] [Nat]Added 20 Read/Feed constraints in 17 ms returned sat
[2024-05-21 19:58:39] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 1 ms to minimize.
[2024-05-21 19:58:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2024-05-21 19:58:39] [INFO ] Computed and/alt/rep : 48/96/48 causal constraints (skipped 74 transitions) in 23 ms.
[2024-05-21 19:58:39] [INFO ] Added : 21 causal constraints over 6 iterations in 116 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Product exploration explored 100000 steps with 664 reset in 399 ms.
Product exploration explored 100000 steps with 663 reset in 348 ms.
Built C files in :
/tmp/ltsmin15105085345836918997
[2024-05-21 19:58:40] [INFO ] Computing symmetric may disable matrix : 505 transitions.
[2024-05-21 19:58:40] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:58:40] [INFO ] Computing symmetric may enable matrix : 505 transitions.
[2024-05-21 19:58:40] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:58:40] [INFO ] Computing Do-Not-Accords matrix : 505 transitions.
[2024-05-21 19:58:40] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:58:40] [INFO ] Built C files in 82ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15105085345836918997
Running compilation step : cd /tmp/ltsmin15105085345836918997;'/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'
Compilation finished in 1983 ms.
Running link step : cd /tmp/ltsmin15105085345836918997;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 74 ms.
Running LTSmin : cd /tmp/ltsmin15105085345836918997;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13125092853218996555.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 505/505 transitions.
Applied a total of 0 rules in 18 ms. Remains 65 /65 variables (removed 0) and now considering 505/505 (removed 0) transitions.
Running 502 sub problems to find dead transitions.
[2024-05-21 19:58:55] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-05-21 19:58:55] [INFO ] Invariant cache hit.
[2024-05-21 19:58:55] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-05-21 19:58:57] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 1/65 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-05-21 19:59:00] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-21 19:59:01] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (OVERLAPS) 125/190 variables, 65/75 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-05-21 19:59:06] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 11 (OVERLAPS) 0/190 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 96 constraints, problems are : Problem set: 0 solved, 502 unsolved in 14587 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 1/65 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (OVERLAPS) 125/190 variables, 65/76 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 502/598 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 190/190 variables, and 598 constraints, problems are : Problem set: 0 solved, 502 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 4/4 constraints]
After SMT, in 35645ms problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 35653ms
[2024-05-21 19:59:30] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-05-21 19:59:30] [INFO ] Invariant cache hit.
[2024-05-21 19:59:31] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-21 19:59:31] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-05-21 19:59:31] [INFO ] Invariant cache hit.
[2024-05-21 19:59:31] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 19:59:31] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
[2024-05-21 19:59:31] [INFO ] Redundant transitions in 2 ms returned []
Running 502 sub problems to find dead transitions.
[2024-05-21 19:59:31] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-05-21 19:59:31] [INFO ] Invariant cache hit.
[2024-05-21 19:59:31] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-05-21 19:59:33] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 1/65 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-05-21 19:59:36] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-21 19:59:36] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (OVERLAPS) 125/190 variables, 65/75 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-05-21 19:59:41] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 11 (OVERLAPS) 0/190 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 96 constraints, problems are : Problem set: 0 solved, 502 unsolved in 12928 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 1/65 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (OVERLAPS) 125/190 variables, 65/76 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 502/598 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 11 (OVERLAPS) 0/190 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 598 constraints, problems are : Problem set: 0 solved, 502 unsolved in 25293 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 4/4 constraints]
After SMT, in 39248ms problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 39254ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 75280 ms. Remains : 65/65 places, 505/505 transitions.
Built C files in :
/tmp/ltsmin12442012947976670128
[2024-05-21 20:00:10] [INFO ] Computing symmetric may disable matrix : 505 transitions.
[2024-05-21 20:00:10] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:00:10] [INFO ] Computing symmetric may enable matrix : 505 transitions.
[2024-05-21 20:00:10] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:00:10] [INFO ] Computing Do-Not-Accords matrix : 505 transitions.
[2024-05-21 20:00:10] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:00:10] [INFO ] Built C files in 74ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12442012947976670128
Running compilation step : cd /tmp/ltsmin12442012947976670128;'/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'
Compilation finished in 1436 ms.
Running link step : cd /tmp/ltsmin12442012947976670128;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 72 ms.
Running LTSmin : cd /tmp/ltsmin12442012947976670128;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16777778008819455323.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 20:00:25] [INFO ] Flatten gal took : 31 ms
[2024-05-21 20:00:25] [INFO ] Flatten gal took : 46 ms
[2024-05-21 20:00:25] [INFO ] Time to serialize gal into /tmp/LTL13065087611684476754.gal : 12 ms
[2024-05-21 20:00:25] [INFO ] Time to serialize properties into /tmp/LTL16388927148642817999.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/LTL13065087611684476754.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6585265847615042742.hoa' '-atoms' '/tmp/LTL16388927148642817999.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/LTL16388927148642817999.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6585265847615042742.hoa
Detected timeout of ITS tools.
[2024-05-21 20:00:40] [INFO ] Flatten gal took : 33 ms
[2024-05-21 20:00:40] [INFO ] Flatten gal took : 29 ms
[2024-05-21 20:00:40] [INFO ] Time to serialize gal into /tmp/LTL2953082419626937041.gal : 6 ms
[2024-05-21 20:00:40] [INFO ] Time to serialize properties into /tmp/LTL12620549732945458783.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2953082419626937041.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12620549732945458783.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...276
Read 1 LTL properties
Checking formula 0 : !((X(F(("(SORTI_A>=3)")&&(G("(ATTENTE_A<1)"))))))
Formula 0 simplified : XG(!"(SORTI_A>=3)" | F!"(ATTENTE_A<1)")
Detected timeout of ITS tools.
[2024-05-21 20:00:56] [INFO ] Flatten gal took : 18 ms
[2024-05-21 20:00:56] [INFO ] Applying decomposition
[2024-05-21 20:00:56] [INFO ] Flatten gal took : 17 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/graph14708356110455723392.txt' '-o' '/tmp/graph14708356110455723392.bin' '-w' '/tmp/graph14708356110455723392.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14708356110455723392.bin' '-l' '-1' '-v' '-w' '/tmp/graph14708356110455723392.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:00:56] [INFO ] Decomposing Gal with order
[2024-05-21 20:00:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:00:56] [INFO ] Removed a total of 1021 redundant transitions.
[2024-05-21 20:00:56] [INFO ] Flatten gal took : 92 ms
[2024-05-21 20:00:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 157 labels/synchronizations in 8 ms.
[2024-05-21 20:00:56] [INFO ] Time to serialize gal into /tmp/LTL11998939518195544900.gal : 4 ms
[2024-05-21 20:00:56] [INFO ] Time to serialize properties into /tmp/LTL13098027282175123770.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/LTL11998939518195544900.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13098027282175123770.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...256
Read 1 LTL properties
Checking formula 0 : !((X(F(("(i0.u1.SORTI_A>=3)")&&(G("(i0.u0.ATTENTE_A<1)"))))))
Formula 0 simplified : XG(!"(i0.u1.SORTI_A>=3)" | F!"(i0.u0.ATTENTE_A<1)")
Detected timeout of ITS tools.
Treatment of property BridgeAndVehicles-COL-V20P10N10-LTLCardinality-13 finished in 308807 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(((p0 U p1)||G(F(!p0)))))'
Support contains 4 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 506/506 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 66 transition count 506
Applied a total of 1 rules in 2 ms. Remains 66 /67 variables (removed 1) and now considering 506/506 (removed 0) transitions.
Running 503 sub problems to find dead transitions.
[2024-05-21 20:01:11] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
// Phase 1: matrix 126 rows 66 cols
[2024-05-21 20:01:11] [INFO ] Computed 7 invariants in 0 ms
[2024-05-21 20:01:11] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 20:01:13] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 1/66 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 20:01:17] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/192 variables, 66/75 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (OVERLAPS) 0/192 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 95 constraints, problems are : Problem set: 0 solved, 503 unsolved in 11401 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 66/66 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 1/66 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/192 variables, 66/75 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 503/598 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 20:01:31] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-05-21 20:01:33] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 2/600 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/192 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 192/192 variables, and 600 constraints, problems are : Problem set: 0 solved, 503 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 66/66 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 4/4 constraints]
After SMT, in 32596ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 32601ms
[2024-05-21 20:01:43] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-05-21 20:01:43] [INFO ] Invariant cache hit.
[2024-05-21 20:01:44] [INFO ] Implicit Places using invariants in 109 ms returned [24]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 113 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 65/67 places, 506/506 transitions.
Applied a total of 0 rules in 2 ms. Remains 65 /65 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 32719 ms. Remains : 65/67 places, 506/506 transitions.
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), p0, (AND (NOT p1) p0), p0]
Running random walk in product with property : BridgeAndVehicles-COL-V20P10N10-LTLCardinality-14
Product exploration explored 100000 steps with 50000 reset in 178 ms.
Product exploration explored 100000 steps with 50000 reset in 184 ms.
Computed a total of 48 stabilizing places and 82 stable transitions
Graph (complete) has 1052 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 48 stabilizing places and 82 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 11 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-COL-V20P10N10-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-COL-V20P10N10-LTLCardinality-14 finished in 33285 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(p0)||F(p1)))'
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(F((p0&&G(p1)))))'
Found a Shortening insensitive property : BridgeAndVehicles-COL-V20P10N10-LTLCardinality-13
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 2 out of 67 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 67/67 places, 506/506 transitions.
Graph (complete) has 1096 edges and 67 vertex of which 66 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 65 transition count 505
Applied a total of 3 rules in 21 ms. Remains 65 /67 variables (removed 2) and now considering 505/506 (removed 1) transitions.
Running 502 sub problems to find dead transitions.
[2024-05-21 20:01:45] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
// Phase 1: matrix 125 rows 65 cols
[2024-05-21 20:01:45] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 20:01:45] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-05-21 20:01:46] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 1/65 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-05-21 20:01:49] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-21 20:01:50] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (OVERLAPS) 125/190 variables, 65/75 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-05-21 20:01:53] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 0 ms to minimize.
[2024-05-21 20:01:53] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 11 (OVERLAPS) 0/190 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 97 constraints, problems are : Problem set: 0 solved, 502 unsolved in 13212 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 1/65 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (OVERLAPS) 125/190 variables, 65/77 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 502/599 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 11 (OVERLAPS) 0/190 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 599 constraints, problems are : Problem set: 0 solved, 502 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 5/5 constraints]
After SMT, in 34107ms problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 34114ms
[2024-05-21 20:02:19] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-05-21 20:02:19] [INFO ] Invariant cache hit.
[2024-05-21 20:02:19] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-21 20:02:19] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-05-21 20:02:19] [INFO ] Invariant cache hit.
[2024-05-21 20:02:19] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 20:02:19] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
Running 502 sub problems to find dead transitions.
[2024-05-21 20:02:19] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-05-21 20:02:19] [INFO ] Invariant cache hit.
[2024-05-21 20:02:19] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-05-21 20:02:21] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 1/65 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-05-21 20:02:24] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-21 20:02:24] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (OVERLAPS) 125/190 variables, 65/75 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-05-21 20:02:28] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 11 (OVERLAPS) 0/190 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 96 constraints, problems are : Problem set: 0 solved, 502 unsolved in 12993 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 1/65 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (OVERLAPS) 125/190 variables, 65/76 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 502/598 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 11 (OVERLAPS) 0/190 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 598 constraints, problems are : Problem set: 0 solved, 502 unsolved in 24548 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 4/4 constraints]
After SMT, in 38269ms problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 38275ms
Starting structural reductions in LI_LTL mode, iteration 1 : 65/67 places, 505/506 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 72771 ms. Remains : 65/67 places, 505/506 transitions.
Running random walk in product with property : BridgeAndVehicles-COL-V20P10N10-LTLCardinality-13
Product exploration explored 100000 steps with 663 reset in 338 ms.
Product exploration explored 100000 steps with 663 reset in 325 ms.
Computed a total of 48 stabilizing places and 81 stable transitions
Graph (complete) has 1093 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 48 stabilizing places and 81 stable transitions
Detected a total of 48/65 stabilizing places and 81/505 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 430 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 397 steps (0 resets) in 12 ms. (30 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 592 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
[2024-05-21 20:02:59] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-05-21 20:02:59] [INFO ] Invariant cache hit.
[2024-05-21 20:03:00] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-21 20:03:00] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 20:03:00] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2024-05-21 20:03:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:03:00] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-21 20:03:00] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 20:03:00] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2024-05-21 20:03:00] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 20:03:00] [INFO ] [Nat]Added 20 Read/Feed constraints in 18 ms returned sat
[2024-05-21 20:03:00] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 0 ms to minimize.
[2024-05-21 20:03:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2024-05-21 20:03:00] [INFO ] Computed and/alt/rep : 48/96/48 causal constraints (skipped 74 transitions) in 31 ms.
[2024-05-21 20:03:00] [INFO ] Added : 21 causal constraints over 6 iterations in 129 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 505/505 transitions.
Applied a total of 0 rules in 18 ms. Remains 65 /65 variables (removed 0) and now considering 505/505 (removed 0) transitions.
Running 502 sub problems to find dead transitions.
[2024-05-21 20:03:00] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-05-21 20:03:00] [INFO ] Invariant cache hit.
[2024-05-21 20:03:00] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-05-21 20:03:02] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 1/65 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-05-21 20:03:06] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-05-21 20:03:06] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (OVERLAPS) 125/190 variables, 65/75 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-05-21 20:03:11] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 11 (OVERLAPS) 0/190 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 96 constraints, problems are : Problem set: 0 solved, 502 unsolved in 14301 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 1/65 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (OVERLAPS) 125/190 variables, 65/76 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 502/598 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 190/190 variables, and 598 constraints, problems are : Problem set: 0 solved, 502 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 4/4 constraints]
After SMT, in 35360ms problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 35367ms
[2024-05-21 20:03:36] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-05-21 20:03:36] [INFO ] Invariant cache hit.
[2024-05-21 20:03:36] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-21 20:03:36] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-05-21 20:03:36] [INFO ] Invariant cache hit.
[2024-05-21 20:03:36] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 20:03:36] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
[2024-05-21 20:03:36] [INFO ] Redundant transitions in 4 ms returned []
Running 502 sub problems to find dead transitions.
[2024-05-21 20:03:36] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-05-21 20:03:36] [INFO ] Invariant cache hit.
[2024-05-21 20:03:36] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-05-21 20:03:38] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 1/65 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-05-21 20:03:41] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-21 20:03:41] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (OVERLAPS) 125/190 variables, 65/75 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-05-21 20:03:45] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 11 (OVERLAPS) 0/190 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 96 constraints, problems are : Problem set: 0 solved, 502 unsolved in 12695 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 1/65 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (OVERLAPS) 125/190 variables, 65/76 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 502/598 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 11 (OVERLAPS) 0/190 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 598 constraints, problems are : Problem set: 0 solved, 502 unsolved in 25124 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 4/4 constraints]
After SMT, in 38624ms problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 38631ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 74368 ms. Remains : 65/65 places, 505/505 transitions.
Computed a total of 48 stabilizing places and 81 stable transitions
Graph (complete) has 1093 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 48 stabilizing places and 81 stable transitions
Detected a total of 48/65 stabilizing places and 81/505 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 9 factoid took 404 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 602 steps (0 resets) in 8 ms. (66 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 629 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
[2024-05-21 20:04:16] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-05-21 20:04:16] [INFO ] Invariant cache hit.
[2024-05-21 20:04:16] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-21 20:04:16] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 20:04:16] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-05-21 20:04:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:04:17] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-21 20:04:17] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 20:04:17] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-05-21 20:04:17] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 20:04:17] [INFO ] [Nat]Added 20 Read/Feed constraints in 17 ms returned sat
[2024-05-21 20:04:17] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 1 ms to minimize.
[2024-05-21 20:04:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2024-05-21 20:04:17] [INFO ] Computed and/alt/rep : 48/96/48 causal constraints (skipped 74 transitions) in 37 ms.
[2024-05-21 20:04:17] [INFO ] Added : 21 causal constraints over 6 iterations in 150 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false]
Product exploration explored 100000 steps with 663 reset in 315 ms.
Product exploration explored 100000 steps with 663 reset in 325 ms.
Built C files in :
/tmp/ltsmin3253803434518923520
[2024-05-21 20:04:18] [INFO ] Computing symmetric may disable matrix : 505 transitions.
[2024-05-21 20:04:18] [INFO ] Computation of Complete disable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:04:18] [INFO ] Computing symmetric may enable matrix : 505 transitions.
[2024-05-21 20:04:18] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:04:18] [INFO ] Computing Do-Not-Accords matrix : 505 transitions.
[2024-05-21 20:04:18] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:04:18] [INFO ] Built C files in 142ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3253803434518923520
Running compilation step : cd /tmp/ltsmin3253803434518923520;'/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'
Compilation finished in 1590 ms.
Running link step : cd /tmp/ltsmin3253803434518923520;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin3253803434518923520;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15569316912067533001.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 505/505 transitions.
Applied a total of 0 rules in 16 ms. Remains 65 /65 variables (removed 0) and now considering 505/505 (removed 0) transitions.
Running 502 sub problems to find dead transitions.
[2024-05-21 20:04:33] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-05-21 20:04:33] [INFO ] Invariant cache hit.
[2024-05-21 20:04:33] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-05-21 20:04:35] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 1/65 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-05-21 20:04:38] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-05-21 20:04:38] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (OVERLAPS) 125/190 variables, 65/75 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-05-21 20:04:43] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 11 (OVERLAPS) 0/190 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 96 constraints, problems are : Problem set: 0 solved, 502 unsolved in 13970 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 1/65 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (OVERLAPS) 125/190 variables, 65/76 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 502/598 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 190/190 variables, and 598 constraints, problems are : Problem set: 0 solved, 502 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 4/4 constraints]
After SMT, in 34824ms problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 34829ms
[2024-05-21 20:05:08] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-05-21 20:05:08] [INFO ] Invariant cache hit.
[2024-05-21 20:05:08] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-21 20:05:08] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-05-21 20:05:08] [INFO ] Invariant cache hit.
[2024-05-21 20:05:08] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 20:05:08] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
[2024-05-21 20:05:08] [INFO ] Redundant transitions in 2 ms returned []
Running 502 sub problems to find dead transitions.
[2024-05-21 20:05:08] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-05-21 20:05:08] [INFO ] Invariant cache hit.
[2024-05-21 20:05:08] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-05-21 20:05:10] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 1/65 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-05-21 20:05:13] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-05-21 20:05:13] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (OVERLAPS) 125/190 variables, 65/75 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-05-21 20:05:18] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 11 (OVERLAPS) 0/190 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 96 constraints, problems are : Problem set: 0 solved, 502 unsolved in 13009 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 1/65 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (OVERLAPS) 125/190 variables, 65/76 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 502/598 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 11 (OVERLAPS) 0/190 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 598 constraints, problems are : Problem set: 0 solved, 502 unsolved in 24791 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 4/4 constraints]
After SMT, in 38498ms problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 38503ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 73687 ms. Remains : 65/65 places, 505/505 transitions.
Built C files in :
/tmp/ltsmin3429538966745332067
[2024-05-21 20:05:47] [INFO ] Computing symmetric may disable matrix : 505 transitions.
[2024-05-21 20:05:47] [INFO ] Computation of Complete disable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:05:47] [INFO ] Computing symmetric may enable matrix : 505 transitions.
[2024-05-21 20:05:47] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:05:47] [INFO ] Computing Do-Not-Accords matrix : 505 transitions.
[2024-05-21 20:05:47] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:05:47] [INFO ] Built C files in 141ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3429538966745332067
Running compilation step : cd /tmp/ltsmin3429538966745332067;'/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'
Compilation finished in 1627 ms.
Running link step : cd /tmp/ltsmin3429538966745332067;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin3429538966745332067;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5162259936325300229.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 20:06:02] [INFO ] Flatten gal took : 15 ms
[2024-05-21 20:06:02] [INFO ] Flatten gal took : 16 ms
[2024-05-21 20:06:02] [INFO ] Time to serialize gal into /tmp/LTL15091700767534996102.gal : 3 ms
[2024-05-21 20:06:02] [INFO ] Time to serialize properties into /tmp/LTL13094952689232965134.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15091700767534996102.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10107999781132919510.hoa' '-atoms' '/tmp/LTL13094952689232965134.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...320
Loading property file /tmp/LTL13094952689232965134.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10107999781132919510.hoa
Detected timeout of ITS tools.
[2024-05-21 20:06:17] [INFO ] Flatten gal took : 13 ms
[2024-05-21 20:06:17] [INFO ] Flatten gal took : 12 ms
[2024-05-21 20:06:17] [INFO ] Time to serialize gal into /tmp/LTL16867690870849844588.gal : 3 ms
[2024-05-21 20:06:17] [INFO ] Time to serialize properties into /tmp/LTL18131951219537082087.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/LTL16867690870849844588.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18131951219537082087.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...277
Read 1 LTL properties
Checking formula 0 : !((X(F(("(SORTI_A>=3)")&&(G("(ATTENTE_A<1)"))))))
Formula 0 simplified : XG(!"(SORTI_A>=3)" | F!"(ATTENTE_A<1)")
Detected timeout of ITS tools.
[2024-05-21 20:06:32] [INFO ] Flatten gal took : 29 ms
[2024-05-21 20:06:32] [INFO ] Applying decomposition
[2024-05-21 20:06:32] [INFO ] Flatten gal took : 25 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/graph8983399709456306893.txt' '-o' '/tmp/graph8983399709456306893.bin' '-w' '/tmp/graph8983399709456306893.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8983399709456306893.bin' '-l' '-1' '-v' '-w' '/tmp/graph8983399709456306893.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:06:32] [INFO ] Decomposing Gal with order
[2024-05-21 20:06:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:06:32] [INFO ] Removed a total of 1225 redundant transitions.
[2024-05-21 20:06:32] [INFO ] Flatten gal took : 75 ms
[2024-05-21 20:06:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 183 labels/synchronizations in 7 ms.
[2024-05-21 20:06:32] [INFO ] Time to serialize gal into /tmp/LTL1375336021301513526.gal : 1 ms
[2024-05-21 20:06:32] [INFO ] Time to serialize properties into /tmp/LTL13425592020921658782.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1375336021301513526.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13425592020921658782.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...255
Read 1 LTL properties
Checking formula 0 : !((X(F(("(i1.u5.SORTI_A>=3)")&&(G("(i1.u1.ATTENTE_A<1)"))))))
Formula 0 simplified : XG(!"(i1.u5.SORTI_A>=3)" | F!"(i1.u1.ATTENTE_A<1)")
Reverse transition relation is NOT exact ! Due to transitions t0, t41, t42, t44, t84, t85, t223, t283, t411, t420, t471, t480, t21_t43, t24_t43, t25_t43, t...272
Computing Next relation with stutter on 20 deadlock states
Detected timeout of ITS tools.
Treatment of property BridgeAndVehicles-COL-V20P10N10-LTLCardinality-13 finished in 302717 ms.
[2024-05-21 20:06:47] [INFO ] Flatten gal took : 30 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15359469472668211479
[2024-05-21 20:06:47] [INFO ] Computing symmetric may disable matrix : 506 transitions.
[2024-05-21 20:06:47] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:06:47] [INFO ] Applying decomposition
[2024-05-21 20:06:47] [INFO ] Computing symmetric may enable matrix : 506 transitions.
[2024-05-21 20:06:47] [INFO ] Computation of Complete enable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:06:47] [INFO ] Flatten gal took : 21 ms
[2024-05-21 20:06:47] [INFO ] Computing Do-Not-Accords matrix : 506 transitions.
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/graph2254745221994914134.txt' '-o' '/tmp/graph2254745221994914134.bin' '-w' '/tmp/graph2254745221994914134.weights'
[2024-05-21 20:06:47] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2254745221994914134.bin' '-l' '-1' '-v' '-w' '/tmp/graph2254745221994914134.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:06:47] [INFO ] Decomposing Gal with order
[2024-05-21 20:06:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:06:47] [INFO ] Built C files in 108ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15359469472668211479
Running compilation step : cd /tmp/ltsmin15359469472668211479;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' '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'
[2024-05-21 20:06:47] [INFO ] Removed a total of 139 redundant transitions.
[2024-05-21 20:06:47] [INFO ] Flatten gal took : 74 ms
[2024-05-21 20:06:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 102 labels/synchronizations in 2 ms.
[2024-05-21 20:06:47] [INFO ] Time to serialize gal into /tmp/LTLCardinality14094678907123819559.gal : 4 ms
[2024-05-21 20:06:47] [INFO ] Time to serialize properties into /tmp/LTLCardinality2480977599273163038.ltl : 11 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/LTLCardinality14094678907123819559.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality2480977599273163038.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...298
Read 2 LTL properties
Checking formula 0 : !(((G("(((gu2.SORTI_B>gu2.ROUTE_B)&&((gu1.CHOIX_0+gu1.CHOIX_1)>gu1.SORTI_A))||(gu0.CAPACITE<=gu0.ROUTE_A))"))||(F("(gu2.SORTI_B>gu2.RO...166
Formula 0 simplified : F!"(((gu2.SORTI_B>gu2.ROUTE_B)&&((gu1.CHOIX_0+gu1.CHOIX_1)>gu1.SORTI_A))||(gu0.CAPACITE<=gu0.ROUTE_A))" & G!"(gu2.SORTI_B>gu2.ROUTE_...158
Compilation finished in 2123 ms.
Running link step : cd /tmp/ltsmin15359469472668211479;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 88 ms.
Running LTSmin : cd /tmp/ltsmin15359469472668211479;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([]((LTLAPp0==true))||<>((LTLAPp1==true)))' '--buchi-type=spotba'
LTSmin run took 331397 ms.
FORMULA BridgeAndVehicles-COL-V20P10N10-LTLCardinality-06 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin15359469472668211479;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp2==true)&&[]((LTLAPp3==true)))))' '--buchi-type=spotba'
LTSmin run took 57143 ms.
FORMULA BridgeAndVehicles-COL-V20P10N10-LTLCardinality-13 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1649706 ms.

BK_STOP 1716322398565

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ 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 LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-COL-V20P10N10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is BridgeAndVehicles-COL-V20P10N10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r048-tajo-171620398600019"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V20P10N10.tgz
mv BridgeAndVehicles-COL-V20P10N10 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;