Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 6.5K Apr 13 02:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Apr 13 02:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 13 02:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 13 02:26 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.8K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 13 03:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Apr 13 03:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Apr 13 03:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 118K Apr 13 03:54 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 41K 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-V20P20N50-LTLCardinality-00
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-01
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-02
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-03
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-04
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-05
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-06
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-07
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-08
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-09
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-10
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-11
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-12
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-13
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-14
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716321767171

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-V20P20N50
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202405141337
[2024-05-21 20:02: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 20:02:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 20:02: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 20:02:49] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-21 20:02:49] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 639 ms
[2024-05-21 20:02:49] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 108 PT places and 90298.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2024-05-21 20:02:49] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 4 ms.
[2024-05-21 20:02:49] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 3 formulas.
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-13 TRUE 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.4 ms
Remains 13 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-V20P20N50-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-15 TRUE 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 1230 ms. (32 steps per ms) remains 2/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 298 ms. (133 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 1/2 properties
// Phase 1: matrix 10 rows 12 cols
[2024-05-21 20:02:50] [INFO ] Computed 4 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp2 is UNSAT
After SMT solving in domain Real declared 3/22 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 185 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 211ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
[2024-05-21 20:02:50] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2024-05-21 20:02:50] [INFO ] Flatten gal took : 12 ms
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 20:02:50] [INFO ] Flatten gal took : 2 ms
Arc [13:1*[(MOD (ADD $cpt 1) 51)]] 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 20:02:50] [INFO ] Unfolded HLPN to a Petri net with 108 places and 2228 transitions 17190 arcs in 64 ms.
[2024-05-21 20:02:50] [INFO ] Unfolded 6 HLPN properties in 0 ms.
Support contains 10 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 2228/2228 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 107 transition count 2228
Applied a total of 1 rules in 50 ms. Remains 107 /108 variables (removed 1) and now considering 2228/2228 (removed 0) transitions.
Running 2225 sub problems to find dead transitions.
[2024-05-21 20:02:50] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 107 cols
[2024-05-21 20:02:50] [INFO ] Computed 6 invariants in 13 ms
[2024-05-21 20:02:50] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
[2024-05-21 20:03:15] [INFO ] Deduced a trap composed of 5 places in 344 ms of which 11 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 106/397 variables, and 6 constraints, problems are : Problem set: 0 solved, 2225 unsolved in 20062 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/107 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2225/2225 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
[2024-05-21 20:03:45] [INFO ] Deduced a trap composed of 55 places in 188 ms of which 2 ms to minimize.
Problem TDEAD1188 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1392 is UNSAT
Problem TDEAD1443 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 106/397 variables, and 7 constraints, problems are : Problem set: 6 solved, 2219 unsolved in 20052 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/107 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2225 constraints, Known Traps: 2/2 constraints]
After SMT, in 58135ms problems are : Problem set: 6 solved, 2219 unsolved
Search for dead transitions found 6 dead transitions in 58205ms
Found 6 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 6 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 6 transitions.
[2024-05-21 20:03:49] [INFO ] Flow matrix only has 290 transitions (discarded 1932 similar events)
// Phase 1: matrix 290 rows 107 cols
[2024-05-21 20:03:49] [INFO ] Computed 6 invariants in 8 ms
[2024-05-21 20:03:49] [INFO ] Implicit Places using invariants in 344 ms returned []
[2024-05-21 20:03:49] [INFO ] Flow matrix only has 290 transitions (discarded 1932 similar events)
[2024-05-21 20:03:49] [INFO ] Invariant cache hit.
[2024-05-21 20:03:49] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-21 20:03:50] [INFO ] Implicit Places using invariants and state equation in 952 ms returned []
Implicit Place search using SMT with State Equation took 1315 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 107/108 places, 2222/2228 transitions.
Applied a total of 0 rules in 26 ms. Remains 107 /107 variables (removed 0) and now considering 2222/2222 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59636 ms. Remains : 107/108 places, 2222/2228 transitions.
Support contains 10 out of 107 places after structural reductions.
[2024-05-21 20:03:50] [INFO ] Flatten gal took : 195 ms
[2024-05-21 20:03:50] [INFO ] Flatten gal took : 180 ms
[2024-05-21 20:03:51] [INFO ] Input system was already deterministic with 2222 transitions.
RANDOM walk for 40000 steps (228 resets) in 2020 ms. (19 steps per ms) remains 1/9 properties
BEST_FIRST walk for 40002 steps (108 resets) in 388 ms. (102 steps per ms) remains 1/1 properties
[2024-05-21 20:03:51] [INFO ] Flow matrix only has 290 transitions (discarded 1932 similar events)
[2024-05-21 20:03:51] [INFO ] Invariant cache hit.
[2024-05-21 20:03:51] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp0 is UNSAT
After SMT solving in domain Real declared 6/397 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 33 ms.
Refiners :[Positive P Invariants (semi-flows): 1/6 constraints, State Equation: 0/107 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 105ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 5 simplifications.
Computed a total of 50 stabilizing places and 84 stable transitions
Graph (complete) has 3183 edges and 107 vertex of which 106 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.42 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)))'
Support contains 1 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 2222/2222 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 106 transition count 2222
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 105 transition count 2221
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 105 transition count 2221
Applied a total of 3 rules in 45 ms. Remains 105 /107 variables (removed 2) and now considering 2221/2222 (removed 1) transitions.
Running 2218 sub problems to find dead transitions.
[2024-05-21 20:03:52] [INFO ] Flow matrix only has 289 transitions (discarded 1932 similar events)
// Phase 1: matrix 289 rows 105 cols
[2024-05-21 20:03:52] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 20:03:52] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2218 unsolved
[2024-05-21 20:04:15] [INFO ] Deduced a trap composed of 5 places in 281 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 105/394 variables, and 6 constraints, problems are : Problem set: 0 solved, 2218 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2218/2218 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2218 unsolved
[2024-05-21 20:04:49] [INFO ] Deduced a trap composed of 55 places in 239 ms of which 1 ms to minimize.
Problem TDEAD1487 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 105/394 variables, and 7 constraints, problems are : Problem set: 1 solved, 2217 unsolved in 20067 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2218 constraints, Known Traps: 2/2 constraints]
After SMT, in 57806ms problems are : Problem set: 1 solved, 2217 unsolved
Search for dead transitions found 1 dead transitions in 57846ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1 transitions.
[2024-05-21 20:04:50] [INFO ] Flow matrix only has 289 transitions (discarded 1931 similar events)
[2024-05-21 20:04:50] [INFO ] Invariant cache hit.
[2024-05-21 20:04:50] [INFO ] Implicit Places using invariants in 451 ms returned []
[2024-05-21 20:04:50] [INFO ] Flow matrix only has 289 transitions (discarded 1931 similar events)
[2024-05-21 20:04:50] [INFO ] Invariant cache hit.
[2024-05-21 20:04:50] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-21 20:04:51] [INFO ] Implicit Places using invariants and state equation in 1425 ms returned [23]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1887 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/107 places, 2220/2222 transitions.
Applied a total of 0 rules in 20 ms. Remains 104 /104 variables (removed 0) and now considering 2220/2220 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 59819 ms. Remains : 104/107 places, 2220/2222 transitions.
Stuttering acceptance computed with spot in 265 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V20P20N50-LTLCardinality-04
Product exploration explored 100000 steps with 9355 reset in 994 ms.
Product exploration explored 100000 steps with 9393 reset in 662 ms.
Computed a total of 47 stabilizing places and 83 stable transitions
Computed a total of 47 stabilizing places and 83 stable transitions
Detected a total of 47/104 stabilizing places and 83/2220 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 129 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 45 steps (0 resets) in 12 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 153 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
[2024-05-21 20:04:54] [INFO ] Flow matrix only has 289 transitions (discarded 1931 similar events)
// Phase 1: matrix 289 rows 104 cols
[2024-05-21 20:04:54] [INFO ] Computed 5 invariants in 5 ms
[2024-05-21 20:04:55] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 20:04:55] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2024-05-21 20:04:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:04:56] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 20:04:56] [INFO ] [Nat]Absence check using state equation in 57 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 4 factoid took 194 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-COL-V20P20N50-LTLCardinality-04 finished in 64348 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 U p1))))'
Support contains 5 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 2222/2222 transitions.
Graph (complete) has 3183 edges and 107 vertex of which 106 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.18 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 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 105 transition count 2221
Applied a total of 3 rules in 495 ms. Remains 105 /107 variables (removed 2) and now considering 2221/2222 (removed 1) transitions.
Running 2218 sub problems to find dead transitions.
[2024-05-21 20:04:56] [INFO ] Flow matrix only has 289 transitions (discarded 1932 similar events)
// Phase 1: matrix 289 rows 105 cols
[2024-05-21 20:04:56] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 20:04:57] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2218 unsolved
[2024-05-21 20:05:22] [INFO ] Deduced a trap composed of 5 places in 311 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 105/394 variables, and 6 constraints, problems are : Problem set: 0 solved, 2218 unsolved in 20079 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2218/2218 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2218 unsolved
[2024-05-21 20:05:56] [INFO ] Deduced a trap composed of 55 places in 299 ms of which 2 ms to minimize.
SMT process timed out in 59468ms, After SMT, problems are : Problem set: 0 solved, 2218 unsolved
Search for dead transitions found 0 dead transitions in 59509ms
[2024-05-21 20:05:56] [INFO ] Flow matrix only has 289 transitions (discarded 1932 similar events)
[2024-05-21 20:05:56] [INFO ] Invariant cache hit.
[2024-05-21 20:05:56] [INFO ] Implicit Places using invariants in 269 ms returned []
[2024-05-21 20:05:56] [INFO ] Flow matrix only has 289 transitions (discarded 1932 similar events)
[2024-05-21 20:05:56] [INFO ] Invariant cache hit.
[2024-05-21 20:05:56] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-21 20:05:58] [INFO ] Implicit Places using invariants and state equation in 1412 ms returned [46]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1690 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/107 places, 2221/2222 transitions.
Applied a total of 0 rules in 671 ms. Remains 104 /104 variables (removed 0) and now considering 2221/2221 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62375 ms. Remains : 104/107 places, 2221/2222 transitions.
Stuttering acceptance computed with spot in 209 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-COL-V20P20N50-LTLCardinality-05
Product exploration explored 100000 steps with 684 reset in 1251 ms.
Product exploration explored 100000 steps with 685 reset in 1125 ms.
Computed a total of 47 stabilizing places and 83 stable transitions
Computed a total of 47 stabilizing places and 83 stable transitions
Detected a total of 47/104 stabilizing places and 83/2221 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 10 factoid took 456 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (NOT p1)]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 177 steps (0 resets) in 25 ms. (6 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 10 factoid took 561 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 160 ms :[(NOT p1), (NOT p1)]
Support contains 5 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 2221/2221 transitions.
Applied a total of 0 rules in 409 ms. Remains 104 /104 variables (removed 0) and now considering 2221/2221 (removed 0) transitions.
Running 2218 sub problems to find dead transitions.
[2024-05-21 20:06:03] [INFO ] Flow matrix only has 289 transitions (discarded 1932 similar events)
// Phase 1: matrix 289 rows 104 cols
[2024-05-21 20:06:03] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 20:06:03] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2218 unsolved
[2024-05-21 20:06:29] [INFO ] Deduced a trap composed of 5 places in 288 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 104/393 variables, and 6 constraints, problems are : Problem set: 0 solved, 2218 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/104 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2218/2218 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 104/393 variables, and 6 constraints, problems are : Problem set: 0 solved, 2218 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/104 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2218 constraints, Known Traps: 1/1 constraints]
After SMT, in 60343ms problems are : Problem set: 0 solved, 2218 unsolved
Search for dead transitions found 0 dead transitions in 60378ms
[2024-05-21 20:07:03] [INFO ] Flow matrix only has 289 transitions (discarded 1932 similar events)
[2024-05-21 20:07:03] [INFO ] Invariant cache hit.
[2024-05-21 20:07:04] [INFO ] Implicit Places using invariants in 358 ms returned []
[2024-05-21 20:07:04] [INFO ] Flow matrix only has 289 transitions (discarded 1932 similar events)
[2024-05-21 20:07:04] [INFO ] Invariant cache hit.
[2024-05-21 20:07:04] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-21 20:07:05] [INFO ] Implicit Places using invariants and state equation in 996 ms returned []
Implicit Place search using SMT with State Equation took 1357 ms to find 0 implicit places.
[2024-05-21 20:07:05] [INFO ] Redundant transitions in 121 ms returned []
Running 2218 sub problems to find dead transitions.
[2024-05-21 20:07:05] [INFO ] Flow matrix only has 289 transitions (discarded 1932 similar events)
[2024-05-21 20:07:05] [INFO ] Invariant cache hit.
[2024-05-21 20:07:05] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2218 unsolved
[2024-05-21 20:07:28] [INFO ] Deduced a trap composed of 5 places in 338 ms of which 2 ms to minimize.
[2024-05-21 20:07:46] [INFO ] Deduced a trap composed of 55 places in 234 ms of which 2 ms to minimize.
Problem TDEAD1487 is UNSAT
Problem TDEAD1538 is UNSAT
Problem TDEAD1589 is UNSAT
Problem TDEAD1640 is UNSAT
Problem TDEAD1691 is UNSAT
Problem TDEAD1742 is UNSAT
Problem TDEAD1793 is UNSAT
Problem TDEAD1844 is UNSAT
Problem TDEAD1895 is UNSAT
Problem TDEAD1946 is UNSAT
Problem TDEAD1997 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 104/393 variables, and 7 constraints, problems are : Problem set: 11 solved, 2207 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/104 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2218/2218 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 11 solved, 2207 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 11 solved, 2207 unsolved
Problem TDEAD2048 is UNSAT
Problem TDEAD2099 is UNSAT
Problem TDEAD2150 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 2/7 constraints. Problems are: Problem set: 14 solved, 2204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/7 constraints. Problems are: Problem set: 14 solved, 2204 unsolved
Problem TDEAD20 is UNSAT
Problem TDEAD64 is UNSAT
At refinement iteration 3 (OVERLAPS) 289/393 variables, 104/111 constraints. Problems are: Problem set: 16 solved, 2202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 102/213 constraints. Problems are: Problem set: 16 solved, 2202 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 393/393 variables, and 2415 constraints, problems are : Problem set: 16 solved, 2202 unsolved in 35344 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 104/104 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 2202/2218 constraints, Known Traps: 2/2 constraints]
After SMT, in 82877ms problems are : Problem set: 16 solved, 2202 unsolved
Search for dead transitions found 16 dead transitions in 82909ms
Found 16 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 16 transitions
Dead transitions reduction (with SMT) removed 16 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 104/104 places, 2205/2221 transitions.
Applied a total of 0 rules in 287 ms. Remains 104 /104 variables (removed 0) and now considering 2205/2205 (removed 0) transitions.
[2024-05-21 20:08:28] [INFO ] Redundant transitions in 119 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 145624 ms. Remains : 104/104 places, 2205/2221 transitions.
Computed a total of 47 stabilizing places and 81 stable transitions
Computed a total of 47 stabilizing places and 81 stable transitions
Detected a total of 47/104 stabilizing places and 81/2205 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 10 factoid took 378 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(NOT p1), (NOT p1)]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 155 steps (0 resets) in 8 ms. (17 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 10 factoid took 504 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 685 reset in 1186 ms.
Product exploration explored 100000 steps with 685 reset in 808 ms.
Built C files in :
/tmp/ltsmin9915721783551498641
[2024-05-21 20:08:32] [INFO ] Too many transitions (2205) to apply POR reductions. Disabling POR matrices.
[2024-05-21 20:08:32] [INFO ] Built C files in 63ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9915721783551498641
Running compilation step : cd /tmp/ltsmin9915721783551498641;'/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/ltsmin9915721783551498641;'/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/ltsmin9915721783551498641;'/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 5 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 2205/2205 transitions.
Applied a total of 0 rules in 293 ms. Remains 104 /104 variables (removed 0) and now considering 2205/2205 (removed 0) transitions.
Running 2202 sub problems to find dead transitions.
[2024-05-21 20:08:35] [INFO ] Flow matrix only has 286 transitions (discarded 1919 similar events)
// Phase 1: matrix 286 rows 104 cols
[2024-05-21 20:08:35] [INFO ] Computed 6 invariants in 4 ms
[2024-05-21 20:08:35] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2202 unsolved
[2024-05-21 20:09:01] [INFO ] Deduced a trap composed of 5 places in 315 ms of which 1 ms to minimize.
[2024-05-21 20:09:03] [INFO ] Deduced a trap composed of 54 places in 229 ms of which 2 ms to minimize.
Problem TDEAD165 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD879 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 104/390 variables, and 8 constraints, problems are : Problem set: 15 solved, 2187 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/104 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2202/2202 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 15 solved, 2187 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 15 solved, 2187 unsolved
Problem TDEAD930 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1134 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 2/8 constraints. Problems are: Problem set: 20 solved, 2182 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 104/390 variables, and 8 constraints, problems are : Problem set: 20 solved, 2182 unsolved in 20049 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/104 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 0/2202 constraints, Known Traps: 2/2 constraints]
After SMT, in 59014ms problems are : Problem set: 20 solved, 2182 unsolved
Search for dead transitions found 20 dead transitions in 59049ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 20 transitions.
[2024-05-21 20:09:34] [INFO ] Flow matrix only has 285 transitions (discarded 1900 similar events)
// Phase 1: matrix 285 rows 104 cols
[2024-05-21 20:09:34] [INFO ] Computed 6 invariants in 3 ms
[2024-05-21 20:09:34] [INFO ] Implicit Places using invariants in 333 ms returned []
[2024-05-21 20:09:34] [INFO ] Flow matrix only has 285 transitions (discarded 1900 similar events)
[2024-05-21 20:09:34] [INFO ] Invariant cache hit.
[2024-05-21 20:09:35] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-05-21 20:09:36] [INFO ] Implicit Places using invariants and state equation in 1637 ms returned []
Implicit Place search using SMT with State Equation took 1975 ms to find 0 implicit places.
[2024-05-21 20:09:36] [INFO ] Redundant transitions in 69 ms returned []
Starting structural reductions in SI_LTL mode, iteration 1 : 104/104 places, 2185/2205 transitions.
Applied a total of 0 rules in 251 ms. Remains 104 /104 variables (removed 0) and now considering 2185/2185 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61659 ms. Remains : 104/104 places, 2185/2205 transitions.
Built C files in :
/tmp/ltsmin11590558211131693991
[2024-05-21 20:09:36] [INFO ] Too many transitions (2185) to apply POR reductions. Disabling POR matrices.
[2024-05-21 20:09:36] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11590558211131693991
Running compilation step : cd /tmp/ltsmin11590558211131693991;'/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/ltsmin11590558211131693991;'/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/ltsmin11590558211131693991;'/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 20:09:40] [INFO ] Flatten gal took : 107 ms
[2024-05-21 20:09:40] [INFO ] Flatten gal took : 112 ms
[2024-05-21 20:09:40] [INFO ] Time to serialize gal into /tmp/LTL10398767883506214084.gal : 40 ms
[2024-05-21 20:09:40] [INFO ] Time to serialize properties into /tmp/LTL5964123512804024086.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/LTL10398767883506214084.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3592250605542155961.hoa' '-atoms' '/tmp/LTL5964123512804024086.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...318
Loading property file /tmp/LTL5964123512804024086.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3592250605542155961.hoa
Detected timeout of ITS tools.
[2024-05-21 20:09:55] [INFO ] Flatten gal took : 99 ms
[2024-05-21 20:09:55] [INFO ] Flatten gal took : 99 ms
[2024-05-21 20:09:55] [INFO ] Time to serialize gal into /tmp/LTL7221277299090155020.gal : 24 ms
[2024-05-21 20:09:55] [INFO ] Time to serialize properties into /tmp/LTL3191563100783909757.ltl : 14 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/LTL7221277299090155020.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3191563100783909757.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(("((CONTROLEUR_0+CONTROLEUR_1)<=SUR_PONT_B)")U("(ATTENTE_A<=ROUTE_B)")))))
Formula 0 simplified : GF(!"((CONTROLEUR_0+CONTROLEUR_1)<=SUR_PONT_B)" R !"(ATTENTE_A<=ROUTE_B)")
Detected timeout of ITS tools.
[2024-05-21 20:10:11] [INFO ] Flatten gal took : 98 ms
[2024-05-21 20:10:11] [INFO ] Applying decomposition
[2024-05-21 20:10:11] [INFO ] Flatten gal took : 81 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/graph7098299788250051480.txt' '-o' '/tmp/graph7098299788250051480.bin' '-w' '/tmp/graph7098299788250051480.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7098299788250051480.bin' '-l' '-1' '-v' '-w' '/tmp/graph7098299788250051480.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:10:11] [INFO ] Decomposing Gal with order
[2024-05-21 20:10:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:10:12] [INFO ] Removed a total of 6199 redundant transitions.
[2024-05-21 20:10:12] [INFO ] Flatten gal took : 657 ms
[2024-05-21 20:10:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 532 labels/synchronizations in 45 ms.
[2024-05-21 20:10:12] [INFO ] Time to serialize gal into /tmp/LTL2031701892455673298.gal : 5 ms
[2024-05-21 20:10:12] [INFO ] Time to serialize properties into /tmp/LTL16177045748737880111.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/LTL2031701892455673298.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16177045748737880111.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 : !((F(G(("((gu1.CONTROLEUR_0+gu1.CONTROLEUR_1)<=gu1.SUR_PONT_B)")U("(gu2.ATTENTE_A<=gu2.ROUTE_B)")))))
Formula 0 simplified : GF(!"((gu1.CONTROLEUR_0+gu1.CONTROLEUR_1)<=gu1.SUR_PONT_B)" R !"(gu2.ATTENTE_A<=gu2.ROUTE_B)")
Detected timeout of ITS tools.
Treatment of property BridgeAndVehicles-COL-V20P20N50-LTLCardinality-05 finished in 331123 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 2222/2222 transitions.
Graph (complete) has 3183 edges and 107 vertex of which 106 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 105 transition count 2221
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 105 transition count 2221
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 103 transition count 2220
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 101 transition count 2218
Applied a total of 10 rules in 469 ms. Remains 101 /107 variables (removed 6) and now considering 2218/2222 (removed 4) transitions.
[2024-05-21 20:10:28] [INFO ] Flow matrix only has 286 transitions (discarded 1932 similar events)
// Phase 1: matrix 286 rows 101 cols
[2024-05-21 20:10:28] [INFO ] Computed 4 invariants in 3 ms
[2024-05-21 20:10:28] [INFO ] Implicit Places using invariants in 393 ms returned []
[2024-05-21 20:10:28] [INFO ] Flow matrix only has 286 transitions (discarded 1932 similar events)
[2024-05-21 20:10:28] [INFO ] Invariant cache hit.
[2024-05-21 20:10:28] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-21 20:10:29] [INFO ] Implicit Places using invariants and state equation in 947 ms returned [44]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1346 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 100/107 places, 2218/2222 transitions.
Applied a total of 0 rules in 240 ms. Remains 100 /100 variables (removed 0) and now considering 2218/2218 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2058 ms. Remains : 100/107 places, 2218/2222 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V20P20N50-LTLCardinality-10
Product exploration explored 100000 steps with 26261 reset in 615 ms.
Product exploration explored 100000 steps with 26197 reset in 586 ms.
Computed a total of 45 stabilizing places and 82 stable transitions
Computed a total of 45 stabilizing places and 82 stable transitions
Detected a total of 45/100 stabilizing places and 82/2218 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 226 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
RANDOM walk for 17 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 202 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2024-05-21 20:10:31] [INFO ] Flow matrix only has 286 transitions (discarded 1932 similar events)
// Phase 1: matrix 286 rows 100 cols
[2024-05-21 20:10:31] [INFO ] Computed 4 invariants in 2 ms
[2024-05-21 20:10:32] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-21 20:10:32] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2024-05-21 20:10:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:10:32] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-21 20:10:32] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2024-05-21 20:10:32] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-21 20:10:32] [INFO ] [Nat]Added 102 Read/Feed constraints in 35 ms returned sat
[2024-05-21 20:10:33] [INFO ] Computed and/alt/rep : 90/178/90 causal constraints (skipped 193 transitions) in 145 ms.
[2024-05-21 20:10:33] [INFO ] Added : 31 causal constraints over 7 iterations in 403 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 2218/2218 transitions.
Applied a total of 0 rules in 221 ms. Remains 100 /100 variables (removed 0) and now considering 2218/2218 (removed 0) transitions.
[2024-05-21 20:10:33] [INFO ] Flow matrix only has 286 transitions (discarded 1932 similar events)
[2024-05-21 20:10:33] [INFO ] Invariant cache hit.
[2024-05-21 20:10:33] [INFO ] Implicit Places using invariants in 357 ms returned []
[2024-05-21 20:10:33] [INFO ] Flow matrix only has 286 transitions (discarded 1932 similar events)
[2024-05-21 20:10:33] [INFO ] Invariant cache hit.
[2024-05-21 20:10:34] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-21 20:10:34] [INFO ] Implicit Places using invariants and state equation in 733 ms returned []
Implicit Place search using SMT with State Equation took 1092 ms to find 0 implicit places.
[2024-05-21 20:10:34] [INFO ] Redundant transitions in 43 ms returned []
Running 2215 sub problems to find dead transitions.
[2024-05-21 20:10:34] [INFO ] Flow matrix only has 286 transitions (discarded 1932 similar events)
[2024-05-21 20:10:34] [INFO ] Invariant cache hit.
[2024-05-21 20:10:34] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2215 unsolved
[2024-05-21 20:11:04] [INFO ] Deduced a trap composed of 53 places in 264 ms of which 2 ms to minimize.
Problem TDEAD483 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD942 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1095 is UNSAT
Problem TDEAD1146 is UNSAT
[2024-05-21 20:11:15] [INFO ] Deduced a trap composed of 52 places in 200 ms of which 1 ms to minimize.
Problem TDEAD1198 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1351 is UNSAT
Problem TDEAD1402 is UNSAT
Problem TDEAD1453 is UNSAT
Problem TDEAD1504 is UNSAT
Problem TDEAD1555 is UNSAT
Problem TDEAD1606 is UNSAT
Problem TDEAD1657 is UNSAT
Problem TDEAD1708 is UNSAT
Problem TDEAD1759 is UNSAT
Problem TDEAD1810 is UNSAT
Problem TDEAD1861 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 100/386 variables, and 6 constraints, problems are : Problem set: 28 solved, 2187 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/100 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2215/2215 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 28 solved, 2187 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 4/4 constraints. Problems are: Problem set: 28 solved, 2187 unsolved
Problem TDEAD1912 is UNSAT
Problem TDEAD1963 is UNSAT
Problem TDEAD2014 is UNSAT
Problem TDEAD2065 is UNSAT
Problem TDEAD2116 is UNSAT
Problem TDEAD2167 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 2/6 constraints. Problems are: Problem set: 34 solved, 2181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 100/386 variables, and 6 constraints, problems are : Problem set: 34 solved, 2181 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/100 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2215 constraints, Known Traps: 2/2 constraints]
After SMT, in 78558ms problems are : Problem set: 34 solved, 2181 unsolved
Search for dead transitions found 34 dead transitions in 78580ms
Found 34 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 34 transitions
Dead transitions reduction (with SMT) removed 34 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 100/100 places, 2184/2218 transitions.
Applied a total of 0 rules in 189 ms. Remains 100 /100 variables (removed 0) and now considering 2184/2184 (removed 0) transitions.
[2024-05-21 20:11:53] [INFO ] Redundant transitions in 40 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 80201 ms. Remains : 100/100 places, 2184/2218 transitions.
Computed a total of 45 stabilizing places and 82 stable transitions
Computed a total of 45 stabilizing places and 82 stable transitions
Detected a total of 45/100 stabilizing places and 82/2184 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 252 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
RANDOM walk for 10 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 267 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2024-05-21 20:11:54] [INFO ] Flow matrix only has 284 transitions (discarded 1900 similar events)
// Phase 1: matrix 284 rows 100 cols
[2024-05-21 20:11:54] [INFO ] Computed 4 invariants in 2 ms
[2024-05-21 20:11:55] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-21 20:11:55] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2024-05-21 20:11:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:11:56] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-21 20:11:56] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2024-05-21 20:11:56] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-05-21 20:11:57] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-21 20:11:59] [INFO ] [Nat]Added 100 Read/Feed constraints in 2872 ms returned sat
[2024-05-21 20:11:59] [INFO ] Deduced a trap composed of 52 places in 337 ms of which 2 ms to minimize.
[2024-05-21 20:11:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 528 ms
[2024-05-21 20:11:59] [INFO ] Computed and/alt/rep : 90/178/90 causal constraints (skipped 191 transitions) in 141 ms.
[2024-05-21 20:12:00] [INFO ] Added : 39 causal constraints over 9 iterations in 659 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Product exploration explored 100000 steps with 26104 reset in 866 ms.
Product exploration explored 100000 steps with 26027 reset in 649 ms.
Built C files in :
/tmp/ltsmin2034892092673710437
[2024-05-21 20:12:01] [INFO ] Too many transitions (2184) to apply POR reductions. Disabling POR matrices.
[2024-05-21 20:12:01] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2034892092673710437
Running compilation step : cd /tmp/ltsmin2034892092673710437;'/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/ltsmin2034892092673710437;'/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/ltsmin2034892092673710437;'/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 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 2184/2184 transitions.
Applied a total of 0 rules in 265 ms. Remains 100 /100 variables (removed 0) and now considering 2184/2184 (removed 0) transitions.
[2024-05-21 20:12:05] [INFO ] Flow matrix only has 284 transitions (discarded 1900 similar events)
[2024-05-21 20:12:05] [INFO ] Invariant cache hit.
[2024-05-21 20:12:05] [INFO ] Implicit Places using invariants in 329 ms returned []
[2024-05-21 20:12:05] [INFO ] Flow matrix only has 284 transitions (discarded 1900 similar events)
[2024-05-21 20:12:05] [INFO ] Invariant cache hit.
[2024-05-21 20:12:05] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-05-21 20:12:07] [INFO ] Implicit Places using invariants and state equation in 1900 ms returned []
Implicit Place search using SMT with State Equation took 2236 ms to find 0 implicit places.
[2024-05-21 20:12:07] [INFO ] Redundant transitions in 69 ms returned []
Running 2181 sub problems to find dead transitions.
[2024-05-21 20:12:07] [INFO ] Flow matrix only has 284 transitions (discarded 1900 similar events)
[2024-05-21 20:12:07] [INFO ] Invariant cache hit.
[2024-05-21 20:12:07] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 100/384 variables, and 4 constraints, problems are : Problem set: 0 solved, 2181 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/100 constraints, ReadFeed: 0/100 constraints, PredecessorRefiner: 2181/2181 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 100/384 variables, and 4 constraints, problems are : Problem set: 0 solved, 2181 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/100 constraints, ReadFeed: 0/100 constraints, PredecessorRefiner: 0/2181 constraints, Known Traps: 0/0 constraints]
After SMT, in 78948ms problems are : Problem set: 0 solved, 2181 unsolved
Search for dead transitions found 0 dead transitions in 78980ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 81568 ms. Remains : 100/100 places, 2184/2184 transitions.
Built C files in :
/tmp/ltsmin10100743408845657536
[2024-05-21 20:13:26] [INFO ] Too many transitions (2184) to apply POR reductions. Disabling POR matrices.
[2024-05-21 20:13:26] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10100743408845657536
Running compilation step : cd /tmp/ltsmin10100743408845657536;'/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/ltsmin10100743408845657536;'/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/ltsmin10100743408845657536;'/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 20:13:29] [INFO ] Flatten gal took : 186 ms
[2024-05-21 20:13:30] [INFO ] Flatten gal took : 183 ms
[2024-05-21 20:13:30] [INFO ] Time to serialize gal into /tmp/LTL1081228018205686722.gal : 25 ms
[2024-05-21 20:13:30] [INFO ] Time to serialize properties into /tmp/LTL7432853606298912121.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/LTL1081228018205686722.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3946614440146925071.hoa' '-atoms' '/tmp/LTL7432853606298912121.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/LTL7432853606298912121.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3946614440146925071.hoa
Detected timeout of ITS tools.
[2024-05-21 20:13:45] [INFO ] Flatten gal took : 141 ms
[2024-05-21 20:13:45] [INFO ] Flatten gal took : 84 ms
[2024-05-21 20:13:45] [INFO ] Time to serialize gal into /tmp/LTL8680766369362865908.gal : 21 ms
[2024-05-21 20:13:45] [INFO ] Time to serialize properties into /tmp/LTL10854261428293321652.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/LTL8680766369362865908.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10854261428293321652.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 : !((F("(ATTENTE_A>=1)")))
Formula 0 simplified : G!"(ATTENTE_A>=1)"
Detected timeout of ITS tools.
[2024-05-21 20:14:00] [INFO ] Flatten gal took : 183 ms
[2024-05-21 20:14:00] [INFO ] Applying decomposition
[2024-05-21 20:14:00] [INFO ] Flatten gal took : 186 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/graph5758743165745616577.txt' '-o' '/tmp/graph5758743165745616577.bin' '-w' '/tmp/graph5758743165745616577.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5758743165745616577.bin' '-l' '-1' '-v' '-w' '/tmp/graph5758743165745616577.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:14:01] [INFO ] Decomposing Gal with order
[2024-05-21 20:14:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:14:02] [INFO ] Removed a total of 4196 redundant transitions.
[2024-05-21 20:14:02] [INFO ] Flatten gal took : 867 ms
[2024-05-21 20:14:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 295 labels/synchronizations in 35 ms.
[2024-05-21 20:14:02] [INFO ] Time to serialize gal into /tmp/LTL439280235259807664.gal : 19 ms
[2024-05-21 20:14:02] [INFO ] Time to serialize properties into /tmp/LTL351627372887871404.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/LTL439280235259807664.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL351627372887871404.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...252
Read 1 LTL properties
Checking formula 0 : !((F("(u0.ATTENTE_A>=1)")))
Formula 0 simplified : G!"(u0.ATTENTE_A>=1)"
Detected timeout of ITS tools.
Treatment of property BridgeAndVehicles-COL-V20P20N50-LTLCardinality-10 finished in 230026 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) U G(p1))))'
Support contains 2 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 2222/2222 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 106 transition count 2222
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 105 transition count 2221
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 105 transition count 2221
Applied a total of 3 rules in 48 ms. Remains 105 /107 variables (removed 2) and now considering 2221/2222 (removed 1) transitions.
Running 2218 sub problems to find dead transitions.
[2024-05-21 20:14:17] [INFO ] Flow matrix only has 289 transitions (discarded 1932 similar events)
// Phase 1: matrix 289 rows 105 cols
[2024-05-21 20:14:17] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 20:14:17] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2218 unsolved
[2024-05-21 20:14:44] [INFO ] Deduced a trap composed of 5 places in 290 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 105/394 variables, and 6 constraints, problems are : Problem set: 0 solved, 2218 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2218/2218 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 105/394 variables, and 6 constraints, problems are : Problem set: 0 solved, 2218 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2218 constraints, Known Traps: 1/1 constraints]
After SMT, in 59456ms problems are : Problem set: 0 solved, 2218 unsolved
Search for dead transitions found 0 dead transitions in 59486ms
[2024-05-21 20:15:17] [INFO ] Flow matrix only has 289 transitions (discarded 1932 similar events)
[2024-05-21 20:15:17] [INFO ] Invariant cache hit.
[2024-05-21 20:15:17] [INFO ] Implicit Places using invariants in 401 ms returned []
[2024-05-21 20:15:17] [INFO ] Flow matrix only has 289 transitions (discarded 1932 similar events)
[2024-05-21 20:15:17] [INFO ] Invariant cache hit.
[2024-05-21 20:15:17] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-21 20:15:19] [INFO ] Implicit Places using invariants and state equation in 1876 ms returned [23]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2310 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/107 places, 2221/2222 transitions.
Applied a total of 0 rules in 7 ms. Remains 104 /104 variables (removed 0) and now considering 2221/2221 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61863 ms. Remains : 104/107 places, 2221/2222 transitions.
Stuttering acceptance computed with spot in 333 ms :[(NOT p1), (NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-COL-V20P20N50-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 162 steps with 1 reset in 1 ms.
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V20P20N50-LTLCardinality-11 finished in 62252 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)) U p0))'
Support contains 1 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 2222/2222 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 106 transition count 2221
Applied a total of 2 rules in 394 ms. Remains 106 /107 variables (removed 1) and now considering 2221/2222 (removed 1) transitions.
Running 2218 sub problems to find dead transitions.
[2024-05-21 20:15:20] [INFO ] Flow matrix only has 289 transitions (discarded 1932 similar events)
// Phase 1: matrix 289 rows 106 cols
[2024-05-21 20:15:20] [INFO ] Computed 6 invariants in 6 ms
[2024-05-21 20:15:20] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2218 unsolved
[2024-05-21 20:15:48] [INFO ] Deduced a trap composed of 5 places in 321 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 105/395 variables, and 6 constraints, problems are : Problem set: 0 solved, 2218 unsolved in 20061 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/106 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2218/2218 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 105/395 variables, and 6 constraints, problems are : Problem set: 0 solved, 2218 unsolved in 20072 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/106 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2218 constraints, Known Traps: 1/1 constraints]
After SMT, in 61755ms problems are : Problem set: 0 solved, 2218 unsolved
Search for dead transitions found 0 dead transitions in 61803ms
[2024-05-21 20:16:22] [INFO ] Flow matrix only has 289 transitions (discarded 1932 similar events)
[2024-05-21 20:16:22] [INFO ] Invariant cache hit.
[2024-05-21 20:16:22] [INFO ] Implicit Places using invariants in 367 ms returned []
[2024-05-21 20:16:22] [INFO ] Flow matrix only has 289 transitions (discarded 1932 similar events)
[2024-05-21 20:16:22] [INFO ] Invariant cache hit.
[2024-05-21 20:16:22] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-21 20:16:24] [INFO ] Implicit Places using invariants and state equation in 1648 ms returned [23, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2047 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/107 places, 2221/2222 transitions.
Applied a total of 0 rules in 193 ms. Remains 104 /104 variables (removed 0) and now considering 2221/2221 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 64446 ms. Remains : 104/107 places, 2221/2222 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V20P20N50-LTLCardinality-14
Product exploration explored 100000 steps with 1485 reset in 744 ms.
Product exploration explored 100000 steps with 1492 reset in 755 ms.
Computed a total of 47 stabilizing places and 83 stable transitions
Graph (complete) has 3093 edges and 104 vertex of which 103 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 47 stabilizing places and 83 stable transitions
Detected a total of 47/104 stabilizing places and 83/2221 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 106 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 361 steps (0 resets) in 9 ms. (36 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 206 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-21 20:16:26] [INFO ] Flow matrix only has 289 transitions (discarded 1932 similar events)
// Phase 1: matrix 289 rows 104 cols
[2024-05-21 20:16:26] [INFO ] Computed 5 invariants in 4 ms
[2024-05-21 20:16:27] [INFO ] [Real]Absence check using 5 positive place invariants in 29 ms returned sat
[2024-05-21 20:16:27] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2024-05-21 20:16:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:16:28] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-21 20:16:28] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2024-05-21 20:16:28] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-21 20:16:28] [INFO ] [Nat]Added 102 Read/Feed constraints in 138 ms returned sat
[2024-05-21 20:16:28] [INFO ] Computed and/alt/rep : 90/178/90 causal constraints (skipped 196 transitions) in 146 ms.
[2024-05-21 20:16:29] [INFO ] Added : 15 causal constraints over 4 iterations in 617 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 2221/2221 transitions.
Applied a total of 0 rules in 204 ms. Remains 104 /104 variables (removed 0) and now considering 2221/2221 (removed 0) transitions.
Running 2218 sub problems to find dead transitions.
[2024-05-21 20:16:29] [INFO ] Flow matrix only has 289 transitions (discarded 1932 similar events)
[2024-05-21 20:16:29] [INFO ] Invariant cache hit.
[2024-05-21 20:16:29] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2218 unsolved
[2024-05-21 20:16:57] [INFO ] Deduced a trap composed of 5 places in 285 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 103/393 variables, and 6 constraints, problems are : Problem set: 0 solved, 2218 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/104 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2218/2218 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 103/393 variables, and 6 constraints, problems are : Problem set: 0 solved, 2218 unsolved in 20049 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/104 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2218 constraints, Known Traps: 1/1 constraints]
After SMT, in 60496ms problems are : Problem set: 0 solved, 2218 unsolved
Search for dead transitions found 0 dead transitions in 60529ms
[2024-05-21 20:17:30] [INFO ] Flow matrix only has 289 transitions (discarded 1932 similar events)
[2024-05-21 20:17:30] [INFO ] Invariant cache hit.
[2024-05-21 20:17:30] [INFO ] Implicit Places using invariants in 388 ms returned []
[2024-05-21 20:17:30] [INFO ] Flow matrix only has 289 transitions (discarded 1932 similar events)
[2024-05-21 20:17:30] [INFO ] Invariant cache hit.
[2024-05-21 20:17:30] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-05-21 20:17:31] [INFO ] Implicit Places using invariants and state equation in 1199 ms returned []
Implicit Place search using SMT with State Equation took 1594 ms to find 0 implicit places.
[2024-05-21 20:17:31] [INFO ] Redundant transitions in 69 ms returned []
Running 2218 sub problems to find dead transitions.
[2024-05-21 20:17:31] [INFO ] Flow matrix only has 289 transitions (discarded 1932 similar events)
[2024-05-21 20:17:31] [INFO ] Invariant cache hit.
[2024-05-21 20:17:31] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2218 unsolved
[2024-05-21 20:17:56] [INFO ] Deduced a trap composed of 5 places in 246 ms of which 1 ms to minimize.
[2024-05-21 20:18:15] [INFO ] Deduced a trap composed of 55 places in 272 ms of which 1 ms to minimize.
Problem TDEAD1487 is UNSAT
Problem TDEAD1538 is UNSAT
Problem TDEAD1589 is UNSAT
Problem TDEAD1640 is UNSAT
Problem TDEAD1691 is UNSAT
Problem TDEAD1742 is UNSAT
Problem TDEAD1793 is UNSAT
Problem TDEAD1844 is UNSAT
Error getting values : (error "ParserException while parsing response: ((s0 19.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 1.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
timeout
(s92 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 103/393 variables, and 7 constraints, problems are : Problem set: 8 solved, 2210 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/104 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2218/2218 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 8 solved, 2210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 5/5 constraints. Problems are: Problem set: 8 solved, 2210 unsolved
Problem TDEAD1895 is UNSAT
Problem TDEAD1946 is UNSAT
Problem TDEAD1997 is UNSAT
Problem TDEAD2048 is UNSAT
Problem TDEAD2099 is UNSAT
Problem TDEAD2150 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 2/7 constraints. Problems are: Problem set: 14 solved, 2204 unsolved
(s29 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 19)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 1)
(s23 1)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 103/393 variables, and 7 constraints, problems are : Problem set: 14 solved, 2204 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/104 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2218 constraints, Known Traps: 2/2 constraints]
After SMT, in 77845ms problems are : Problem set: 14 solved, 2204 unsolved
Search for dead transitions found 14 dead transitions in 77885ms
Found 14 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 14 transitions
Dead transitions reduction (with SMT) removed 14 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 104/104 places, 2207/2221 transitions.
Applied a total of 0 rules in 224 ms. Remains 104 /104 variables (removed 0) and now considering 2207/2207 (removed 0) transitions.
[2024-05-21 20:18:50] [INFO ] Redundant transitions in 55 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 140591 ms. Remains : 104/104 places, 2207/2221 transitions.
Computed a total of 47 stabilizing places and 83 stable transitions
Graph (complete) has 3077 edges and 104 vertex of which 103 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Computed a total of 47 stabilizing places and 83 stable transitions
Detected a total of 47/104 stabilizing places and 83/2207 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 125 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 222 steps (0 resets) in 8 ms. (24 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 150 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 201 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-21 20:18:50] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
// Phase 1: matrix 288 rows 104 cols
[2024-05-21 20:18:50] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 20:18:51] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-21 20:18:51] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2024-05-21 20:18:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 20:18:52] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-21 20:18:52] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2024-05-21 20:18:52] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-05-21 20:18:52] [INFO ] [Nat]Added 101 Read/Feed constraints in 150 ms returned sat
[2024-05-21 20:18:52] [INFO ] Computed and/alt/rep : 90/178/90 causal constraints (skipped 195 transitions) in 112 ms.
[2024-05-21 20:18:53] [INFO ] Added : 23 causal constraints over 6 iterations in 635 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1445 reset in 935 ms.
Product exploration explored 100000 steps with 1472 reset in 696 ms.
Built C files in :
/tmp/ltsmin15015357303348985908
[2024-05-21 20:18:55] [INFO ] Too many transitions (2207) to apply POR reductions. Disabling POR matrices.
[2024-05-21 20:18:55] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15015357303348985908
Running compilation step : cd /tmp/ltsmin15015357303348985908;'/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/ltsmin15015357303348985908;'/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/ltsmin15015357303348985908;'/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 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 2207/2207 transitions.
Applied a total of 0 rules in 235 ms. Remains 104 /104 variables (removed 0) and now considering 2207/2207 (removed 0) transitions.
Running 2204 sub problems to find dead transitions.
[2024-05-21 20:18:58] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-05-21 20:18:58] [INFO ] Invariant cache hit.
[2024-05-21 20:18:58] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
[2024-05-21 20:19:22] [INFO ] Deduced a trap composed of 5 places in 270 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 103/392 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/104 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2204/2204 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 103/392 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/104 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 0/2204 constraints, Known Traps: 1/1 constraints]
After SMT, in 58231ms problems are : Problem set: 0 solved, 2204 unsolved
Search for dead transitions found 0 dead transitions in 58258ms
[2024-05-21 20:19:56] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-05-21 20:19:56] [INFO ] Invariant cache hit.
[2024-05-21 20:19:57] [INFO ] Implicit Places using invariants in 606 ms returned []
[2024-05-21 20:19:57] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-05-21 20:19:57] [INFO ] Invariant cache hit.
[2024-05-21 20:19:57] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-05-21 20:19:59] [INFO ] Implicit Places using invariants and state equation in 1698 ms returned []
Implicit Place search using SMT with State Equation took 2315 ms to find 0 implicit places.
[2024-05-21 20:19:59] [INFO ] Redundant transitions in 38 ms returned []
Running 2204 sub problems to find dead transitions.
[2024-05-21 20:19:59] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-05-21 20:19:59] [INFO ] Invariant cache hit.
[2024-05-21 20:19:59] [INFO ] State equation strengthened by 101 read => feed constraints.

BK_STOP 1716322810878

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-V20P20N50"
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-V20P20N50, 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-171620398700059"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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