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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9199.560 1277087.00 3747227.00 293.30 FFFFFTFTFTFTTFFT 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-171620398700051.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-V20P20N20, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620398700051
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 9.7K Apr 13 00:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 13 00:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 13 00:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 13 00:17 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.0K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 13 00:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 13 00:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 13 00:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K Apr 13 00:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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 40K 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-V20P20N20-LTLCardinality-00
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-LTLCardinality-01
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-LTLCardinality-02
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-LTLCardinality-03
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-LTLCardinality-04
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-LTLCardinality-05
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-LTLCardinality-06
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-LTLCardinality-07
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-LTLCardinality-08
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-LTLCardinality-09
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-LTLCardinality-10
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-LTLCardinality-11
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-LTLCardinality-12
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-LTLCardinality-13
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-LTLCardinality-14
FORMULA_NAME BridgeAndVehicles-COL-V20P20N20-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716321189742

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-V20P20N20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202405141337
[2024-05-21 19:53:11] [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:53:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 19:53:11] [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:53:11] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-21 19:53:12] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 598 ms
[2024-05-21 19:53:12] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 78 PT places and 37258.0 transition bindings in 15 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2024-05-21 19:53:12] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 5 ms.
[2024-05-21 19:53:12] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 4 formulas.
FORMULA BridgeAndVehicles-COL-V20P20N20-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N20-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N20-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N20-LTLCardinality-08 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.3 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-V20P20N20-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N20-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N20-LTLCardinality-14 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 1171 ms. (34 steps per ms) remains 4/19 properties
BEST_FIRST walk for 40002 steps (8 resets) in 317 ms. (125 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 251 ms. (158 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 76 ms. (519 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 93 ms. (425 steps per ms) remains 4/4 properties
// Phase 1: matrix 10 rows 12 cols
[2024-05-21 19:53:12] [INFO ] Computed 4 invariants in 11 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/12 variables, 1/4 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/22 variables, 12/16 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/16 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/22 variables, 0/16 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/22 variables, and 16 constraints, problems are : Problem set: 2 solved, 2 unsolved in 231 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/15 variables, 9/12 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 6/21 variables, 2/14 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/21 variables, 2/16 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/21 variables, 0/16 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/22 variables, 1/17 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/22 variables, 1/18 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/22 variables, 0/18 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/22 variables, 0/18 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/22 variables, and 18 constraints, problems are : Problem set: 2 solved, 2 unsolved in 81 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 375ms problems are : Problem set: 2 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 76 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=19 )
Parikh walk visited 2 properties in 7 ms.
Successfully simplified 2 atomic propositions for a total of 9 simplifications.
FORMULA BridgeAndVehicles-COL-V20P20N20-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 19:53:13] [INFO ] Flatten gal took : 13 ms
[2024-05-21 19:53:13] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA BridgeAndVehicles-COL-V20P20N20-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 19:53:13] [INFO ] Flatten gal took : 2 ms
Arc [13:1*[(MOD (ADD $cpt 1) 21)]] contains successor/predecessor on variables of sort compteur
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 [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2024-05-21 19:53:13] [INFO ] Unfolded HLPN to a Petri net with 78 places and 968 transitions 7350 arcs in 45 ms.
[2024-05-21 19:53:13] [INFO ] Unfolded 7 HLPN properties in 0 ms.
Support contains 12 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 968/968 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 77 transition count 968
Applied a total of 1 rules in 24 ms. Remains 77 /78 variables (removed 1) and now considering 968/968 (removed 0) transitions.
Running 965 sub problems to find dead transitions.
[2024-05-21 19:53:13] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 77 cols
[2024-05-21 19:53:13] [INFO ] Computed 6 invariants in 12 ms
[2024-05-21 19:53:13] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 965 unsolved
[2024-05-21 19:53:19] [INFO ] Deduced a trap composed of 5 places in 181 ms of which 13 ms to minimize.
[2024-05-21 19:53:21] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 3 ms to minimize.
Problem TDEAD528 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD927 is UNSAT
[2024-05-21 19:53:23] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 1 ms to minimize.
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 3/8 constraints. Problems are: Problem set: 40 solved, 925 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/8 constraints. Problems are: Problem set: 40 solved, 925 unsolved
At refinement iteration 3 (OVERLAPS) 1/77 variables, 1/9 constraints. Problems are: Problem set: 40 solved, 925 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/9 constraints. Problems are: Problem set: 40 solved, 925 unsolved
Problem TDEAD20 is UNSAT
Problem TDEAD65 is UNSAT
At refinement iteration 5 (OVERLAPS) 170/247 variables, 77/86 constraints. Problems are: Problem set: 42 solved, 923 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 42/128 constraints. Problems are: Problem set: 42 solved, 923 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 247/247 variables, and 128 constraints, problems are : Problem set: 42 solved, 923 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 77/77 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 965/965 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 42 solved, 923 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 5/5 constraints. Problems are: Problem set: 42 solved, 923 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 3/8 constraints. Problems are: Problem set: 42 solved, 923 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/8 constraints. Problems are: Problem set: 42 solved, 923 unsolved
At refinement iteration 3 (OVERLAPS) 1/77 variables, 1/9 constraints. Problems are: Problem set: 42 solved, 923 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/9 constraints. Problems are: Problem set: 42 solved, 923 unsolved
At refinement iteration 5 (OVERLAPS) 170/247 variables, 77/86 constraints. Problems are: Problem set: 42 solved, 923 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 42/128 constraints. Problems are: Problem set: 42 solved, 923 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 923/1051 constraints. Problems are: Problem set: 42 solved, 923 unsolved
[2024-05-21 19:53:57] [INFO ] Deduced a trap composed of 6 places in 180 ms of which 1 ms to minimize.
SMT process timed out in 43519ms, After SMT, problems are : Problem set: 42 solved, 923 unsolved
Search for dead transitions found 42 dead transitions in 43543ms
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:53:57] [INFO ] Flow matrix only has 166 transitions (discarded 760 similar events)
// Phase 1: matrix 166 rows 77 cols
[2024-05-21 19:53:57] [INFO ] Computed 8 invariants in 2 ms
[2024-05-21 19:53:57] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-21 19:53:57] [INFO ] Flow matrix only has 166 transitions (discarded 760 similar events)
[2024-05-21 19:53:57] [INFO ] Invariant cache hit.
[2024-05-21 19:53:57] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-21 19:53:57] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 77/78 places, 926/968 transitions.
Applied a total of 0 rules in 9 ms. Remains 77 /77 variables (removed 0) and now considering 926/926 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44003 ms. Remains : 77/78 places, 926/968 transitions.
Support contains 12 out of 77 places after structural reductions.
[2024-05-21 19:53:57] [INFO ] Flatten gal took : 77 ms
[2024-05-21 19:53:57] [INFO ] Flatten gal took : 112 ms
[2024-05-21 19:53:57] [INFO ] Input system was already deterministic with 926 transitions.
RANDOM walk for 40001 steps (228 resets) in 1161 ms. (34 steps per ms) remains 2/15 properties
BEST_FIRST walk for 1429 steps (0 resets) in 8 ms. (158 steps per ms) remains 0/2 properties
Computed a total of 50 stabilizing places and 82 stable transitions
Graph (complete) has 1638 edges and 77 vertex of which 76 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.13 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&&X(F(p1)))))'
Support contains 4 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 926/926 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 76 transition count 926
Applied a total of 1 rules in 17 ms. Remains 76 /77 variables (removed 1) and now considering 926/926 (removed 0) transitions.
Running 923 sub problems to find dead transitions.
[2024-05-21 19:53:58] [INFO ] Flow matrix only has 166 transitions (discarded 760 similar events)
// Phase 1: matrix 166 rows 76 cols
[2024-05-21 19:53:58] [INFO ] Computed 7 invariants in 2 ms
[2024-05-21 19:53:58] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 923 unsolved
[2024-05-21 19:54:03] [INFO ] Deduced a trap composed of 5 places in 122 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 4 (OVERLAPS) 166/242 variables, 76/84 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 40/124 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 923 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 242/242 variables, and 124 constraints, problems are : Problem set: 0 solved, 923 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 76/76 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 923/923 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 923 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 4 (OVERLAPS) 166/242 variables, 76/84 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 40/124 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 923/1047 constraints. Problems are: Problem set: 0 solved, 923 unsolved
[2024-05-21 19:54:37] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 242/242 variables, and 1048 constraints, problems are : Problem set: 0 solved, 923 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 76/76 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 923/923 constraints, Known Traps: 2/2 constraints]
After SMT, in 42893ms problems are : Problem set: 0 solved, 923 unsolved
Search for dead transitions found 0 dead transitions in 42909ms
[2024-05-21 19:54:41] [INFO ] Flow matrix only has 166 transitions (discarded 760 similar events)
[2024-05-21 19:54:41] [INFO ] Invariant cache hit.
[2024-05-21 19:54:41] [INFO ] Implicit Places using invariants in 189 ms returned [23, 47]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 193 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 74/77 places, 926/926 transitions.
Applied a total of 0 rules in 6 ms. Remains 74 /74 variables (removed 0) and now considering 926/926 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43130 ms. Remains : 74/77 places, 926/926 transitions.
Stuttering acceptance computed with spot in 264 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : BridgeAndVehicles-COL-V20P20N20-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 140 steps with 2 reset in 6 ms.
FORMULA BridgeAndVehicles-COL-V20P20N20-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V20P20N20-LTLCardinality-00 finished in 43487 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(X((p0&&G(p1))))))'
Support contains 2 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 926/926 transitions.
Applied a total of 0 rules in 6 ms. Remains 77 /77 variables (removed 0) and now considering 926/926 (removed 0) transitions.
Running 923 sub problems to find dead transitions.
[2024-05-21 19:54:42] [INFO ] Flow matrix only has 166 transitions (discarded 760 similar events)
// Phase 1: matrix 166 rows 77 cols
[2024-05-21 19:54:42] [INFO ] Computed 8 invariants in 3 ms
[2024-05-21 19:54:42] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 923 unsolved
[2024-05-21 19:54:47] [INFO ] Deduced a trap composed of 5 places in 143 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 4 (OVERLAPS) 1/77 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 923 unsolved
[2024-05-21 19:54:57] [INFO ] Deduced a trap composed of 6 places in 144 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 923 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 77/243 variables, and 10 constraints, problems are : Problem set: 0 solved, 923 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/77 constraints, ReadFeed: 0/40 constraints, PredecessorRefiner: 923/923 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 923 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 4 (OVERLAPS) 1/77 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 7 (OVERLAPS) 166/243 variables, 77/87 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 40/127 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/243 variables, 923/1050 constraints. Problems are: Problem set: 0 solved, 923 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 243/243 variables, and 1050 constraints, problems are : Problem set: 0 solved, 923 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 77/77 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 923/923 constraints, Known Traps: 2/2 constraints]
After SMT, in 43517ms problems are : Problem set: 0 solved, 923 unsolved
Search for dead transitions found 0 dead transitions in 43534ms
[2024-05-21 19:55:25] [INFO ] Flow matrix only has 166 transitions (discarded 760 similar events)
[2024-05-21 19:55:25] [INFO ] Invariant cache hit.
[2024-05-21 19:55:25] [INFO ] Implicit Places using invariants in 208 ms returned [23]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 229 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 76/77 places, 926/926 transitions.
Applied a total of 0 rules in 5 ms. Remains 76 /76 variables (removed 0) and now considering 926/926 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43778 ms. Remains : 76/77 places, 926/926 transitions.
Stuttering acceptance computed with spot in 181 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-COL-V20P20N20-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-COL-V20P20N20-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V20P20N20-LTLCardinality-04 finished in 43976 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&((p1 U p2)||X(!p0))))'
Support contains 4 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 926/926 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 76 transition count 926
Applied a total of 1 rules in 6 ms. Remains 76 /77 variables (removed 1) and now considering 926/926 (removed 0) transitions.
Running 923 sub problems to find dead transitions.
[2024-05-21 19:55:26] [INFO ] Flow matrix only has 166 transitions (discarded 760 similar events)
// Phase 1: matrix 166 rows 76 cols
[2024-05-21 19:55:26] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 19:55:26] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 923 unsolved
[2024-05-21 19:55:31] [INFO ] Deduced a trap composed of 5 places in 130 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 4 (OVERLAPS) 166/242 variables, 76/84 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 40/124 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 7 (OVERLAPS) 0/242 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 923 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 124 constraints, problems are : Problem set: 0 solved, 923 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 76/76 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 923/923 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 923 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 4 (OVERLAPS) 166/242 variables, 76/84 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 40/124 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 923/1047 constraints. Problems are: Problem set: 0 solved, 923 unsolved
[2024-05-21 19:56:04] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 242/242 variables, and 1048 constraints, problems are : Problem set: 0 solved, 923 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 76/76 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 923/923 constraints, Known Traps: 2/2 constraints]
After SMT, in 42567ms problems are : Problem set: 0 solved, 923 unsolved
Search for dead transitions found 0 dead transitions in 42576ms
[2024-05-21 19:56:08] [INFO ] Flow matrix only has 166 transitions (discarded 760 similar events)
[2024-05-21 19:56:08] [INFO ] Invariant cache hit.
[2024-05-21 19:56:08] [INFO ] Implicit Places using invariants in 239 ms returned [23, 47]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 245 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 74/77 places, 926/926 transitions.
Applied a total of 0 rules in 3 ms. Remains 74 /74 variables (removed 0) and now considering 926/926 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42837 ms. Remains : 74/77 places, 926/926 transitions.
Stuttering acceptance computed with spot in 212 ms :[(NOT p0), (OR (NOT p2) (NOT p0)), true, (OR (NOT p2) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-COL-V20P20N20-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-COL-V20P20N20-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V20P20N20-LTLCardinality-06 finished in 43072 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))'
Support contains 3 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 926/926 transitions.
Applied a total of 0 rules in 7 ms. Remains 77 /77 variables (removed 0) and now considering 926/926 (removed 0) transitions.
Running 923 sub problems to find dead transitions.
[2024-05-21 19:56:09] [INFO ] Flow matrix only has 166 transitions (discarded 760 similar events)
// Phase 1: matrix 166 rows 77 cols
[2024-05-21 19:56:09] [INFO ] Computed 8 invariants in 4 ms
[2024-05-21 19:56:09] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 923 unsolved
[2024-05-21 19:56:14] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 4 (OVERLAPS) 1/77 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 923 unsolved
[2024-05-21 19:56:24] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 923 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 77/243 variables, and 10 constraints, problems are : Problem set: 0 solved, 923 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/77 constraints, ReadFeed: 0/40 constraints, PredecessorRefiner: 923/923 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 923 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 4 (OVERLAPS) 1/77 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 7 (OVERLAPS) 166/243 variables, 77/87 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 40/127 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/243 variables, 923/1050 constraints. Problems are: Problem set: 0 solved, 923 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 243/243 variables, and 1050 constraints, problems are : Problem set: 0 solved, 923 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 77/77 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 923/923 constraints, Known Traps: 2/2 constraints]
After SMT, in 43377ms problems are : Problem set: 0 solved, 923 unsolved
Search for dead transitions found 0 dead transitions in 43395ms
[2024-05-21 19:56:52] [INFO ] Flow matrix only has 166 transitions (discarded 760 similar events)
[2024-05-21 19:56:52] [INFO ] Invariant cache hit.
[2024-05-21 19:56:52] [INFO ] Implicit Places using invariants in 214 ms returned [23, 47]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 230 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 75/77 places, 926/926 transitions.
Applied a total of 0 rules in 4 ms. Remains 75 /75 variables (removed 0) and now considering 926/926 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43640 ms. Remains : 75/77 places, 926/926 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : BridgeAndVehicles-COL-V20P20N20-LTLCardinality-09
Product exploration explored 100000 steps with 50000 reset in 515 ms.
Product exploration explored 100000 steps with 50000 reset in 404 ms.
Computed a total of 48 stabilizing places and 82 stable transitions
Graph (complete) has 1552 edges and 75 vertex of which 74 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.26 ms
Computed a total of 48 stabilizing places and 82 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 44 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-COL-V20P20N20-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-COL-V20P20N20-LTLCardinality-09 finished in 44742 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&&X(F((p1||X(p2)))))))'
Support contains 5 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 926/926 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 76 transition count 926
Applied a total of 1 rules in 5 ms. Remains 76 /77 variables (removed 1) and now considering 926/926 (removed 0) transitions.
Running 923 sub problems to find dead transitions.
[2024-05-21 19:56:53] [INFO ] Flow matrix only has 166 transitions (discarded 760 similar events)
// Phase 1: matrix 166 rows 76 cols
[2024-05-21 19:56:53] [INFO ] Computed 7 invariants in 4 ms
[2024-05-21 19:56:53] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 923 unsolved
[2024-05-21 19:56:58] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 4 (OVERLAPS) 166/242 variables, 76/84 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 40/124 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 923 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 242/242 variables, and 124 constraints, problems are : Problem set: 0 solved, 923 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 76/76 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 923/923 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 923 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 4 (OVERLAPS) 166/242 variables, 76/84 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 40/124 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 923/1047 constraints. Problems are: Problem set: 0 solved, 923 unsolved
[2024-05-21 19:57:34] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 242/242 variables, and 1048 constraints, problems are : Problem set: 0 solved, 923 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 76/76 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 923/923 constraints, Known Traps: 2/2 constraints]
After SMT, in 42531ms problems are : Problem set: 0 solved, 923 unsolved
Search for dead transitions found 0 dead transitions in 42545ms
[2024-05-21 19:57:36] [INFO ] Flow matrix only has 166 transitions (discarded 760 similar events)
[2024-05-21 19:57:36] [INFO ] Invariant cache hit.
[2024-05-21 19:57:36] [INFO ] Implicit Places using invariants in 144 ms returned [23, 47]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 159 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 74/77 places, 926/926 transitions.
Applied a total of 0 rules in 3 ms. Remains 74 /74 variables (removed 0) and now considering 926/926 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42714 ms. Remains : 74/77 places, 926/926 transitions.
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true]
Running random walk in product with property : BridgeAndVehicles-COL-V20P20N20-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-COL-V20P20N20-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V20P20N20-LTLCardinality-10 finished in 42900 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||F(p1)))))'
Support contains 1 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 926/926 transitions.
Graph (complete) has 1638 edges and 77 vertex of which 76 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 75 transition count 925
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 75 transition count 925
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 73 transition count 924
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 71 transition count 922
Applied a total of 10 rules in 164 ms. Remains 71 /77 variables (removed 6) and now considering 922/926 (removed 4) transitions.
[2024-05-21 19:57:37] [INFO ] Flow matrix only has 162 transitions (discarded 760 similar events)
// Phase 1: matrix 162 rows 71 cols
[2024-05-21 19:57:37] [INFO ] Computed 6 invariants in 2 ms
[2024-05-21 19:57:37] [INFO ] Implicit Places using invariants in 203 ms returned [22, 44]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 209 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/77 places, 922/926 transitions.
Applied a total of 0 rules in 80 ms. Remains 69 /69 variables (removed 0) and now considering 922/922 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 454 ms. Remains : 69/77 places, 922/926 transitions.
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-COL-V20P20N20-LTLCardinality-11
Product exploration explored 100000 steps with 1786 reset in 464 ms.
Product exploration explored 100000 steps with 1788 reset in 412 ms.
Computed a total of 44 stabilizing places and 80 stable transitions
Computed a total of 44 stabilizing places and 80 stable transitions
Detected a total of 44/69 stabilizing places and 80/922 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 293 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 194 steps (0 resets) in 6 ms. (27 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 11 factoid took 590 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-21 19:57:39] [INFO ] Flow matrix only has 162 transitions (discarded 760 similar events)
// Phase 1: matrix 162 rows 69 cols
[2024-05-21 19:57:39] [INFO ] Computed 4 invariants in 2 ms
[2024-05-21 19:57:39] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-21 19:57:39] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2024-05-21 19:57:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 19:57:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 19:57:40] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-05-21 19:57:40] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-21 19:57:40] [INFO ] [Nat]Added 40 Read/Feed constraints in 108 ms returned sat
[2024-05-21 19:57:40] [INFO ] Deduced a trap composed of 22 places in 151 ms of which 1 ms to minimize.
[2024-05-21 19:57:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 260 ms
[2024-05-21 19:57:40] [INFO ] Computed and/alt/rep : 58/116/58 causal constraints (skipped 101 transitions) in 93 ms.
[2024-05-21 19:57:40] [INFO ] Added : 17 causal constraints over 5 iterations in 285 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 1 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 922/922 transitions.
Applied a total of 0 rules in 64 ms. Remains 69 /69 variables (removed 0) and now considering 922/922 (removed 0) transitions.
[2024-05-21 19:57:40] [INFO ] Flow matrix only has 162 transitions (discarded 760 similar events)
[2024-05-21 19:57:40] [INFO ] Invariant cache hit.
[2024-05-21 19:57:41] [INFO ] Implicit Places using invariants in 376 ms returned []
[2024-05-21 19:57:41] [INFO ] Flow matrix only has 162 transitions (discarded 760 similar events)
[2024-05-21 19:57:41] [INFO ] Invariant cache hit.
[2024-05-21 19:57:41] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-21 19:57:41] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 715 ms to find 0 implicit places.
[2024-05-21 19:57:41] [INFO ] Redundant transitions in 58 ms returned []
Running 919 sub problems to find dead transitions.
[2024-05-21 19:57:41] [INFO ] Flow matrix only has 162 transitions (discarded 760 similar events)
[2024-05-21 19:57:41] [INFO ] Invariant cache hit.
[2024-05-21 19:57:41] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 919 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 919 unsolved
At refinement iteration 2 (OVERLAPS) 162/231 variables, 69/73 constraints. Problems are: Problem set: 0 solved, 919 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 40/113 constraints. Problems are: Problem set: 0 solved, 919 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 919 unsolved
At refinement iteration 5 (OVERLAPS) 0/231 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 919 unsolved
No progress, stopping.
After SMT solving in domain Real declared 231/231 variables, and 113 constraints, problems are : Problem set: 0 solved, 919 unsolved in 18235 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 69/69 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 919/919 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 919 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 919 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 919 unsolved
At refinement iteration 2 (OVERLAPS) 162/231 variables, 69/73 constraints. Problems are: Problem set: 0 solved, 919 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 40/113 constraints. Problems are: Problem set: 0 solved, 919 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 919/1032 constraints. Problems are: Problem set: 0 solved, 919 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 0/1032 constraints. Problems are: Problem set: 0 solved, 919 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 231/231 variables, and 1032 constraints, problems are : Problem set: 0 solved, 919 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 69/69 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 919/919 constraints, Known Traps: 0/0 constraints]
After SMT, in 51682ms problems are : Problem set: 0 solved, 919 unsolved
Search for dead transitions found 0 dead transitions in 51699ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 52551 ms. Remains : 69/69 places, 922/922 transitions.
Computed a total of 44 stabilizing places and 80 stable transitions
Computed a total of 44 stabilizing places and 80 stable transitions
Detected a total of 44/69 stabilizing places and 80/922 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 235 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 211 steps (0 resets) in 10 ms. (19 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 11 factoid took 531 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-21 19:58:34] [INFO ] Flow matrix only has 162 transitions (discarded 760 similar events)
[2024-05-21 19:58:34] [INFO ] Invariant cache hit.
[2024-05-21 19:58:34] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 19:58:34] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2024-05-21 19:58:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 19:58:34] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 19:58:35] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-05-21 19:58:35] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-21 19:58:35] [INFO ] [Nat]Added 40 Read/Feed constraints in 76 ms returned sat
[2024-05-21 19:58:35] [INFO ] Deduced a trap composed of 22 places in 151 ms of which 1 ms to minimize.
[2024-05-21 19:58:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2024-05-21 19:58:35] [INFO ] Computed and/alt/rep : 58/116/58 causal constraints (skipped 101 transitions) in 36 ms.
[2024-05-21 19:58:35] [INFO ] Added : 19 causal constraints over 4 iterations in 132 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1790 reset in 340 ms.
Product exploration explored 100000 steps with 1799 reset in 339 ms.
Built C files in :
/tmp/ltsmin15751827507710655479
[2024-05-21 19:58:36] [INFO ] Computing symmetric may disable matrix : 922 transitions.
[2024-05-21 19:58:36] [INFO ] Computation of Complete disable matrix. took 32 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:58:36] [INFO ] Computing symmetric may enable matrix : 922 transitions.
[2024-05-21 19:58:36] [INFO ] Computation of Complete enable matrix. took 33 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:58:36] [INFO ] Computing Do-Not-Accords matrix : 922 transitions.
[2024-05-21 19:58:36] [INFO ] Computation of Completed DNA matrix. took 47 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:58:36] [INFO ] Built C files in 349ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15751827507710655479
Running compilation step : cd /tmp/ltsmin15751827507710655479;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15751827507710655479;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15751827507710655479;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 1 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 922/922 transitions.
Applied a total of 0 rules in 73 ms. Remains 69 /69 variables (removed 0) and now considering 922/922 (removed 0) transitions.
[2024-05-21 19:58:39] [INFO ] Flow matrix only has 162 transitions (discarded 760 similar events)
[2024-05-21 19:58:39] [INFO ] Invariant cache hit.
[2024-05-21 19:58:39] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-05-21 19:58:39] [INFO ] Flow matrix only has 162 transitions (discarded 760 similar events)
[2024-05-21 19:58:39] [INFO ] Invariant cache hit.
[2024-05-21 19:58:39] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-21 19:58:40] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
[2024-05-21 19:58:40] [INFO ] Redundant transitions in 15 ms returned []
Running 919 sub problems to find dead transitions.
[2024-05-21 19:58:40] [INFO ] Flow matrix only has 162 transitions (discarded 760 similar events)
[2024-05-21 19:58:40] [INFO ] Invariant cache hit.
[2024-05-21 19:58:40] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 919 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 919 unsolved
At refinement iteration 2 (OVERLAPS) 162/231 variables, 69/73 constraints. Problems are: Problem set: 0 solved, 919 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 40/113 constraints. Problems are: Problem set: 0 solved, 919 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 919 unsolved
At refinement iteration 5 (OVERLAPS) 0/231 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 919 unsolved
No progress, stopping.
After SMT solving in domain Real declared 231/231 variables, and 113 constraints, problems are : Problem set: 0 solved, 919 unsolved in 18703 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 69/69 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 919/919 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 919 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 919 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 919 unsolved
At refinement iteration 2 (OVERLAPS) 162/231 variables, 69/73 constraints. Problems are: Problem set: 0 solved, 919 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 40/113 constraints. Problems are: Problem set: 0 solved, 919 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 919/1032 constraints. Problems are: Problem set: 0 solved, 919 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 0/1032 constraints. Problems are: Problem set: 0 solved, 919 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 231/231 variables, and 1032 constraints, problems are : Problem set: 0 solved, 919 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 69/69 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 919/919 constraints, Known Traps: 0/0 constraints]
After SMT, in 52440ms problems are : Problem set: 0 solved, 919 unsolved
Search for dead transitions found 0 dead transitions in 52450ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 53069 ms. Remains : 69/69 places, 922/922 transitions.
Built C files in :
/tmp/ltsmin311661333895158888
[2024-05-21 19:59:32] [INFO ] Computing symmetric may disable matrix : 922 transitions.
[2024-05-21 19:59:32] [INFO ] Computation of Complete disable matrix. took 43 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:59:32] [INFO ] Computing symmetric may enable matrix : 922 transitions.
[2024-05-21 19:59:32] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:59:33] [INFO ] Computing Do-Not-Accords matrix : 922 transitions.
[2024-05-21 19:59:33] [INFO ] Computation of Completed DNA matrix. took 51 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 19:59:33] [INFO ] Built C files in 403ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin311661333895158888
Running compilation step : cd /tmp/ltsmin311661333895158888;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin311661333895158888;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin311661333895158888;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-21 19:59:36] [INFO ] Flatten gal took : 86 ms
[2024-05-21 19:59:36] [INFO ] Flatten gal took : 85 ms
[2024-05-21 19:59:36] [INFO ] Time to serialize gal into /tmp/LTL8828475202817855912.gal : 42 ms
[2024-05-21 19:59:36] [INFO ] Time to serialize properties into /tmp/LTL5256890361345545022.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/LTL8828475202817855912.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3593831709635118582.hoa' '-atoms' '/tmp/LTL5256890361345545022.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...317
Loading property file /tmp/LTL5256890361345545022.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3593831709635118582.hoa
Detected timeout of ITS tools.
[2024-05-21 19:59:51] [INFO ] Flatten gal took : 44 ms
[2024-05-21 19:59:51] [INFO ] Flatten gal took : 49 ms
[2024-05-21 19:59:51] [INFO ] Time to serialize gal into /tmp/LTL695544537419230564.gal : 7 ms
[2024-05-21 19:59:51] [INFO ] Time to serialize properties into /tmp/LTL11741517076960149413.ltl : 3 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/LTL695544537419230564.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11741517076960149413.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G(("(ROUTE_A<3)")||(F("(ROUTE_A<2)"))))))
Formula 0 simplified : G(F!"(ROUTE_A<3)" & FG!"(ROUTE_A<2)")
Detected timeout of ITS tools.
[2024-05-21 20:00:06] [INFO ] Flatten gal took : 62 ms
[2024-05-21 20:00:06] [INFO ] Applying decomposition
[2024-05-21 20:00:06] [INFO ] Flatten gal took : 47 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/graph16575202695674830400.txt' '-o' '/tmp/graph16575202695674830400.bin' '-w' '/tmp/graph16575202695674830400.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16575202695674830400.bin' '-l' '-1' '-v' '-w' '/tmp/graph16575202695674830400.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:00:07] [INFO ] Decomposing Gal with order
[2024-05-21 20:00:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:00:07] [INFO ] Removed a total of 1676 redundant transitions.
[2024-05-21 20:00:07] [INFO ] Flatten gal took : 422 ms
[2024-05-21 20:00:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 175 labels/synchronizations in 18 ms.
[2024-05-21 20:00:07] [INFO ] Time to serialize gal into /tmp/LTL8867999313522356424.gal : 3 ms
[2024-05-21 20:00:07] [INFO ] Time to serialize properties into /tmp/LTL1226208519282022280.ltl : 3 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/LTL8867999313522356424.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1226208519282022280.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(G(("(u1.ROUTE_A<3)")||(F("(u1.ROUTE_A<2)"))))))
Formula 0 simplified : G(F!"(u1.ROUTE_A<3)" & FG!"(u1.ROUTE_A<2)")
Reverse transition relation is NOT exact ! Due to transitions t0, t44, t21_t20, t31_t20, t906_t20, t919_t20, t105_t41, t626_t41, t645_t41, t104_t42, i0.t49...273
Computing Next relation with stutter on 40 deadlock states
Detected timeout of ITS tools.
Treatment of property BridgeAndVehicles-COL-V20P20N20-LTLCardinality-11 finished in 165948 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' '!(((p0&&F(p1)) U G(!p2)))'
Support contains 5 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 926/926 transitions.
Graph (complete) has 1638 edges and 77 vertex of which 76 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 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 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 75 transition count 925
Applied a total of 3 rules in 62 ms. Remains 75 /77 variables (removed 2) and now considering 925/926 (removed 1) transitions.
Running 922 sub problems to find dead transitions.
[2024-05-21 20:00:22] [INFO ] Flow matrix only has 165 transitions (discarded 760 similar events)
// Phase 1: matrix 165 rows 75 cols
[2024-05-21 20:00:22] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 20:00:22] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-05-21 20:00:27] [INFO ] Deduced a trap composed of 5 places in 142 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 4 (OVERLAPS) 165/240 variables, 75/83 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 40/123 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-05-21 20:00:38] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 14 ms to minimize.
[2024-05-21 20:00:38] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 922 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 240/240 variables, and 125 constraints, problems are : Problem set: 0 solved, 922 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 922/922 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 922 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 4 (OVERLAPS) 165/240 variables, 75/85 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 40/125 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 922/1047 constraints. Problems are: Problem set: 0 solved, 922 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 240/240 variables, and 1047 constraints, problems are : Problem set: 0 solved, 922 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 922/922 constraints, Known Traps: 3/3 constraints]
After SMT, in 43050ms problems are : Problem set: 0 solved, 922 unsolved
Search for dead transitions found 0 dead transitions in 43058ms
[2024-05-21 20:01:05] [INFO ] Flow matrix only has 165 transitions (discarded 760 similar events)
[2024-05-21 20:01:05] [INFO ] Invariant cache hit.
[2024-05-21 20:01:06] [INFO ] Implicit Places using invariants in 198 ms returned [46]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 213 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 74/77 places, 925/926 transitions.
Applied a total of 0 rules in 58 ms. Remains 74 /74 variables (removed 0) and now considering 925/925 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 43396 ms. Remains : 74/77 places, 925/926 transitions.
Stuttering acceptance computed with spot in 206 ms :[p2, true, (NOT p1), p2]
Running random walk in product with property : BridgeAndVehicles-COL-V20P20N20-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 56 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-COL-V20P20N20-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V20P20N20-LTLCardinality-13 finished in 43629 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||F(p1)))))'
[2024-05-21 20:01:06] [INFO ] Flatten gal took : 59 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13761708120069815240
[2024-05-21 20:01:06] [INFO ] Computing symmetric may disable matrix : 926 transitions.
[2024-05-21 20:01:06] [INFO ] Applying decomposition
[2024-05-21 20:01:06] [INFO ] Computation of Complete disable matrix. took 29 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:01:06] [INFO ] Flatten gal took : 37 ms
[2024-05-21 20:01:06] [INFO ] Computing symmetric may enable matrix : 926 transitions.
[2024-05-21 20:01:06] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph4876736046732210287.txt' '-o' '/tmp/graph4876736046732210287.bin' '-w' '/tmp/graph4876736046732210287.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4876736046732210287.bin' '-l' '-1' '-v' '-w' '/tmp/graph4876736046732210287.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:01:06] [INFO ] Decomposing Gal with order
[2024-05-21 20:01:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:01:07] [INFO ] Computing Do-Not-Accords matrix : 926 transitions.
[2024-05-21 20:01:07] [INFO ] Computation of Completed DNA matrix. took 41 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:01:07] [INFO ] Built C files in 391ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13761708120069815240
Running compilation step : cd /tmp/ltsmin13761708120069815240;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' '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:01:07] [INFO ] Removed a total of 1790 redundant transitions.
[2024-05-21 20:01:07] [INFO ] Flatten gal took : 211 ms
[2024-05-21 20:01:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 271 labels/synchronizations in 12 ms.
[2024-05-21 20:01:07] [INFO ] Time to serialize gal into /tmp/LTLCardinality493469809563209354.gal : 2 ms
[2024-05-21 20:01:07] [INFO ] Time to serialize properties into /tmp/LTLCardinality3109016160173699559.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/LTLCardinality493469809563209354.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3109016160173699559.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...275
Read 1 LTL properties
Checking formula 0 : !((F(G(("(i0.u0.ROUTE_A<3)")||(F("(i0.u0.ROUTE_A<2)"))))))
Formula 0 simplified : G(F!"(i0.u0.ROUTE_A<3)" & FG!"(i0.u0.ROUTE_A<2)")
Compilation finished in 3756 ms.
Running link step : cd /tmp/ltsmin13761708120069815240;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 66 ms.
Running LTSmin : cd /tmp/ltsmin13761708120069815240;'/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 795610 ms.
FORMULA BridgeAndVehicles-COL-V20P20N20-LTLCardinality-11 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1275439 ms.

BK_STOP 1716322466829

--------------------
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-V20P20N20"
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-V20P20N20, 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-171620398700051"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V20P20N20.tgz
mv BridgeAndVehicles-COL-V20P20N20 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 ;