Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r472-tajo-171620398800100.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 ltsminxred
Input is BridgeAndVehicles-COL-V50P50N20, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620398800100
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 6.0K Apr 13 02:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K Apr 13 02:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 13 02:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 13 02:04 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.9K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 03:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 13 03:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 13 03:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 107K Apr 13 03:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:30 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 42K 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-V50P50N20-LTLFireability-00
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLFireability-01
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLFireability-02
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLFireability-03
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLFireability-04
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLFireability-05
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLFireability-06
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLFireability-07
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLFireability-08
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLFireability-09
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLFireability-10
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLFireability-11
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLFireability-12
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLFireability-13
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLFireability-14
FORMULA_NAME BridgeAndVehicles-COL-V50P50N20-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717218872109

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V50P50N20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:14:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 05:14:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:14:33] [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-06-01 05:14:33] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 05:14:33] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 522 ms
[2024-06-01 05:14:33] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 138 PT places and 218878.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 05:14:34] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 5 ms.
[2024-06-01 05:14:34] [INFO ] Skeletonized 7 HLPN properties in 1 ms. Removed 9 properties that had guard overlaps.
Initial state reduction rules removed 1 formulas.
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLFireability-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 2 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.
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 495 steps (0 resets) in 10 ms. (45 steps per ms) remains 0/2 properties
[2024-06-01 05:14:34] [INFO ] Flatten gal took : 11 ms
[2024-06-01 05:14:34] [INFO ] Flatten gal took : 2 ms
Arc [1:1*[(MOD (ADD $cA 1) 51)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 51) 51) 51)]] contains successor/predecessor on variables of sort voitureB
Arc [13:1*[(MOD (ADD $cpt 1) 21)]] contains successor/predecessor on variables of sort compteur
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2024-06-01 05:14:34] [INFO ] Unfolded HLPN to a Petri net with 138 places and 2348 transitions 18090 arcs in 115 ms.
[2024-06-01 05:14:34] [INFO ] Unfolded 15 HLPN properties in 2 ms.
Initial state reduction rules removed 1 formulas.
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 136 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 136 transition count 2348
Applied a total of 2 rules in 37 ms. Remains 136 /138 variables (removed 2) and now considering 2348/2348 (removed 0) transitions.
Running 2345 sub problems to find dead transitions.
[2024-06-01 05:14:34] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2024-06-01 05:14:34] [INFO ] Computed 5 invariants in 16 ms
[2024-06-01 05:14:34] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
[2024-06-01 05:15:01] [INFO ] Deduced a trap composed of 5 places in 344 ms of which 10 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/426 variables, and 6 constraints, problems are : Problem set: 0 solved, 2345 unsolved in 20084 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2345/2345 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2345 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
[2024-06-01 05:15:30] [INFO ] Deduced a trap composed of 25 places in 249 ms of which 3 ms to minimize.
Problem TDEAD1248 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1250 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1255 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1259 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1263 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1270 is UNSAT
Problem TDEAD1271 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1277 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1279 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1281 is UNSAT
Problem TDEAD1282 is UNSAT
Problem TDEAD1283 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1286 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1288 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1292 is UNSAT
Problem TDEAD1293 is UNSAT
Problem TDEAD1294 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1296 is UNSAT
Problem TDEAD1297 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 136/426 variables, and 7 constraints, problems are : Problem set: 50 solved, 2295 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2345 constraints, Known Traps: 2/2 constraints]
After SMT, in 57061ms problems are : Problem set: 50 solved, 2295 unsolved
Search for dead transitions found 50 dead transitions in 57119ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 50 transitions.
[2024-06-01 05:15:31] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
// Phase 1: matrix 289 rows 136 cols
[2024-06-01 05:15:31] [INFO ] Computed 5 invariants in 5 ms
[2024-06-01 05:15:31] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-06-01 05:15:31] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-06-01 05:15:31] [INFO ] Invariant cache hit.
[2024-06-01 05:15:31] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 05:15:31] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 136/138 places, 2298/2348 transitions.
Applied a total of 0 rules in 18 ms. Remains 136 /136 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57387 ms. Remains : 136/138 places, 2298/2348 transitions.
Support contains 136 out of 136 places after structural reductions.
[2024-06-01 05:15:32] [INFO ] Flatten gal took : 224 ms
[2024-06-01 05:15:33] [INFO ] Flatten gal took : 225 ms
[2024-06-01 05:15:34] [INFO ] Input system was already deterministic with 2298 transitions.
Reduction of identical properties reduced properties to check from 23 to 18
RANDOM walk for 40000 steps (92 resets) in 3324 ms. (12 steps per ms) remains 1/18 properties
BEST_FIRST walk for 40003 steps (32 resets) in 764 ms. (52 steps per ms) remains 1/1 properties
[2024-06-01 05:15:35] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-06-01 05:15:35] [INFO ] Invariant cache hit.
[2024-06-01 05:15:35] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp22 is UNSAT
After SMT solving in domain Real declared 82/425 variables, and 4 constraints, problems are : Problem set: 1 solved, 0 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 4/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 151ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 109 stabilizing places and 204 stable transitions
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F((!p0&&X((!p0 U (!p1||G(!p0)))))))) U G(p2)))'
Support contains 125 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 2298/2298 transitions.
Applied a total of 0 rules in 14 ms. Remains 136 /136 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
Running 2295 sub problems to find dead transitions.
[2024-06-01 05:15:36] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-06-01 05:15:36] [INFO ] Invariant cache hit.
[2024-06-01 05:15:36] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
[2024-06-01 05:15:59] [INFO ] Deduced a trap composed of 5 places in 239 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/425 variables, and 6 constraints, problems are : Problem set: 0 solved, 2295 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2295/2295 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 136/425 variables, and 6 constraints, problems are : Problem set: 0 solved, 2295 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2295 constraints, Known Traps: 1/1 constraints]
After SMT, in 56148ms problems are : Problem set: 0 solved, 2295 unsolved
Search for dead transitions found 0 dead transitions in 56177ms
[2024-06-01 05:16:32] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-06-01 05:16:32] [INFO ] Invariant cache hit.
[2024-06-01 05:16:32] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-06-01 05:16:32] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-06-01 05:16:32] [INFO ] Invariant cache hit.
[2024-06-01 05:16:32] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 05:16:33] [INFO ] Implicit Places using invariants and state equation in 560 ms returned [53, 107]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 748 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 134/136 places, 2298/2298 transitions.
Applied a total of 0 rules in 24 ms. Remains 134 /134 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 56971 ms. Remains : 134/136 places, 2298/2298 transitions.
Stuttering acceptance computed with spot in 448 ms :[(NOT p2), p0, (AND p0 (NOT p2)), p0, (AND p0 p1), false]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N20-LTLFireability-01
Product exploration explored 100000 steps with 24969 reset in 1049 ms.
Product exploration explored 100000 steps with 25028 reset in 747 ms.
Computed a total of 107 stabilizing places and 204 stable transitions
Computed a total of 107 stabilizing places and 204 stable transitions
Detected a total of 107/134 stabilizing places and 204/2298 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 217 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 277 ms :[(NOT p2), p0, (AND p0 (NOT p2)), p0, (AND p0 p1), false]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 30461 steps (70 resets) in 3219 ms. (9 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (OR p2 p0))), (F (NOT p2)), (F (NOT (OR (NOT p1) p0))), (F (NOT (OR (NOT p1) (NOT p0))))]
Knowledge based reduction with 7 factoid took 616 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 286 ms :[(NOT p2), p0, (AND p0 (NOT p2)), p0, (AND p0 p1), false]
Stuttering acceptance computed with spot in 232 ms :[(NOT p2), p0, (AND p0 (NOT p2)), p0, (AND p0 p1), false]
Support contains 125 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 2298/2298 transitions.
Applied a total of 0 rules in 12 ms. Remains 134 /134 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
Running 2295 sub problems to find dead transitions.
[2024-06-01 05:16:38] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
// Phase 1: matrix 289 rows 134 cols
[2024-06-01 05:16:38] [INFO ] Computed 5 invariants in 10 ms
[2024-06-01 05:16:38] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
[2024-06-01 05:17:01] [INFO ] Deduced a trap composed of 5 places in 253 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 134/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2295 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/134 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2295/2295 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 134/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2295 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/134 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2295 constraints, Known Traps: 1/1 constraints]
After SMT, in 55859ms problems are : Problem set: 0 solved, 2295 unsolved
Search for dead transitions found 0 dead transitions in 55887ms
[2024-06-01 05:17:34] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-06-01 05:17:34] [INFO ] Invariant cache hit.
[2024-06-01 05:17:34] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-06-01 05:17:34] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-06-01 05:17:34] [INFO ] Invariant cache hit.
[2024-06-01 05:17:34] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 05:17:35] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 538 ms to find 0 implicit places.
Running 2295 sub problems to find dead transitions.
[2024-06-01 05:17:35] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-06-01 05:17:35] [INFO ] Invariant cache hit.
[2024-06-01 05:17:35] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
[2024-06-01 05:18:00] [INFO ] Deduced a trap composed of 5 places in 242 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 134/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2295 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/134 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2295/2295 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD155 is UNSAT
At refinement iteration 3 (OVERLAPS) 289/423 variables, 134/140 constraints. Problems are: Problem set: 2 solved, 2293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/423 variables, 41/181 constraints. Problems are: Problem set: 2 solved, 2293 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 423/423 variables, and 2474 constraints, problems are : Problem set: 2 solved, 2293 unsolved in 34333 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 134/134 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 2293/2295 constraints, Known Traps: 1/1 constraints]
After SMT, in 81050ms problems are : Problem set: 2 solved, 2293 unsolved
Search for dead transitions found 2 dead transitions in 81090ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in LTL mode, iteration 1 : 134/134 places, 2296/2298 transitions.
Applied a total of 0 rules in 10 ms. Remains 134 /134 variables (removed 0) and now considering 2296/2296 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 137555 ms. Remains : 134/134 places, 2296/2298 transitions.
Computed a total of 107 stabilizing places and 202 stable transitions
Computed a total of 107 stabilizing places and 202 stable transitions
Detected a total of 107/134 stabilizing places and 202/2296 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 201 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 250 ms :[(NOT p2), p0, (AND p0 (NOT p2)), p0, (AND p0 p1), false]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 28612 steps (65 resets) in 2571 ms. (11 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (OR p2 p0))), (F (NOT p2)), (F (NOT (OR (NOT p1) p0))), (F (NOT (OR (NOT p1) (NOT p0))))]
Knowledge based reduction with 7 factoid took 548 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[(NOT p2), p0, (AND p0 (NOT p2)), p0, (AND p0 p1), false]
Stuttering acceptance computed with spot in 258 ms :[(NOT p2), p0, (AND p0 (NOT p2)), p0, (AND p0 p1), false]
Stuttering acceptance computed with spot in 256 ms :[(NOT p2), p0, (AND p0 (NOT p2)), p0, (AND p0 p1), false]
Product exploration explored 100000 steps with 24944 reset in 985 ms.
Product exploration explored 100000 steps with 25074 reset in 719 ms.
Support contains 125 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 2296/2296 transitions.
Applied a total of 0 rules in 12 ms. Remains 134 /134 variables (removed 0) and now considering 2296/2296 (removed 0) transitions.
Running 2293 sub problems to find dead transitions.
[2024-06-01 05:19:01] [INFO ] Flow matrix only has 287 transitions (discarded 2009 similar events)
// Phase 1: matrix 287 rows 134 cols
[2024-06-01 05:19:01] [INFO ] Computed 5 invariants in 4 ms
[2024-06-01 05:19:01] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2293 unsolved
[2024-06-01 05:19:24] [INFO ] Deduced a trap composed of 5 places in 251 ms of which 0 ms to minimize.
[2024-06-01 05:19:26] [INFO ] Deduced a trap composed of 24 places in 234 ms of which 2 ms to minimize.
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 134/421 variables, and 7 constraints, problems are : Problem set: 50 solved, 2243 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/134 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2293/2293 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 50 solved, 2243 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 50 solved, 2243 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 2/7 constraints. Problems are: Problem set: 50 solved, 2243 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 134/421 variables, and 7 constraints, problems are : Problem set: 50 solved, 2243 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/134 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2293 constraints, Known Traps: 2/2 constraints]
After SMT, in 55374ms problems are : Problem set: 50 solved, 2243 unsolved
Search for dead transitions found 50 dead transitions in 55404ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 50 transitions.
[2024-06-01 05:19:56] [INFO ] Flow matrix only has 286 transitions (discarded 1960 similar events)
// Phase 1: matrix 286 rows 134 cols
[2024-06-01 05:19:56] [INFO ] Computed 5 invariants in 4 ms
[2024-06-01 05:19:56] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-06-01 05:19:56] [INFO ] Flow matrix only has 286 transitions (discarded 1960 similar events)
[2024-06-01 05:19:56] [INFO ] Invariant cache hit.
[2024-06-01 05:19:56] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-01 05:19:56] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 134/134 places, 2246/2296 transitions.
Applied a total of 0 rules in 18 ms. Remains 134 /134 variables (removed 0) and now considering 2246/2246 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55901 ms. Remains : 134/134 places, 2246/2296 transitions.
Treatment of property BridgeAndVehicles-COL-V50P50N20-LTLFireability-01 finished in 261080 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X((G(p2)||p1))&&p0)))))'
Support contains 57 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 2298/2298 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 135 transition count 2297
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 135 transition count 2297
Applied a total of 2 rules in 31 ms. Remains 135 /136 variables (removed 1) and now considering 2297/2298 (removed 1) transitions.
Running 2294 sub problems to find dead transitions.
[2024-06-01 05:19:57] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
// Phase 1: matrix 288 rows 135 cols
[2024-06-01 05:19:57] [INFO ] Computed 5 invariants in 5 ms
[2024-06-01 05:19:57] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
[2024-06-01 05:20:27] [INFO ] Deduced a trap composed of 5 places in 327 ms of which 3 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 135/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 20074 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2294/2294 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2294 constraints, Known Traps: 1/1 constraints]
After SMT, in 60932ms problems are : Problem set: 0 solved, 2294 unsolved
Search for dead transitions found 0 dead transitions in 60954ms
[2024-06-01 05:20:58] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-06-01 05:20:58] [INFO ] Invariant cache hit.
[2024-06-01 05:20:58] [INFO ] Implicit Places using invariants in 226 ms returned []
[2024-06-01 05:20:58] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-06-01 05:20:58] [INFO ] Invariant cache hit.
[2024-06-01 05:20:58] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 05:20:59] [INFO ] Implicit Places using invariants and state equation in 610 ms returned [53]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 842 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 134/136 places, 2297/2298 transitions.
Applied a total of 0 rules in 18 ms. Remains 134 /134 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61851 ms. Remains : 134/136 places, 2297/2298 transitions.
Stuttering acceptance computed with spot in 216 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N20-LTLFireability-02
Entered a terminal (fully accepting) state of product in 144 steps with 0 reset in 2 ms.
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P50N20-LTLFireability-02 finished in 62100 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(((p1 U (p2||G(p1)))||p0)))))'
Support contains 53 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 2298/2298 transitions.
Applied a total of 0 rules in 18 ms. Remains 136 /136 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
Running 2295 sub problems to find dead transitions.
[2024-06-01 05:20:59] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
// Phase 1: matrix 289 rows 136 cols
[2024-06-01 05:20:59] [INFO ] Computed 5 invariants in 4 ms
[2024-06-01 05:20:59] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
[2024-06-01 05:21:24] [INFO ] Deduced a trap composed of 5 places in 243 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/425 variables, and 6 constraints, problems are : Problem set: 0 solved, 2295 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2295/2295 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 136/425 variables, and 6 constraints, problems are : Problem set: 0 solved, 2295 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2295 constraints, Known Traps: 1/1 constraints]
After SMT, in 56828ms problems are : Problem set: 0 solved, 2295 unsolved
Search for dead transitions found 0 dead transitions in 56850ms
[2024-06-01 05:21:56] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-06-01 05:21:56] [INFO ] Invariant cache hit.
[2024-06-01 05:21:56] [INFO ] Implicit Places using invariants in 295 ms returned []
[2024-06-01 05:21:56] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-06-01 05:21:56] [INFO ] Invariant cache hit.
[2024-06-01 05:21:56] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 05:21:57] [INFO ] Implicit Places using invariants and state equation in 691 ms returned [53, 107]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 991 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 134/136 places, 2298/2298 transitions.
Applied a total of 0 rules in 13 ms. Remains 134 /134 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 57880 ms. Remains : 134/136 places, 2298/2298 transitions.
Stuttering acceptance computed with spot in 149 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N20-LTLFireability-03
Entered a terminal (fully accepting) state of product in 145 steps with 0 reset in 3 ms.
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P50N20-LTLFireability-03 finished in 58061 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 (p1||G(!p0)))&&(!p2 U (p3||G(!p2)))))))'
Support contains 127 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 2298/2298 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 135 transition count 2297
Applied a total of 2 rules in 417 ms. Remains 135 /136 variables (removed 1) and now considering 2297/2298 (removed 1) transitions.
Running 2294 sub problems to find dead transitions.
[2024-06-01 05:21:58] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
// Phase 1: matrix 288 rows 135 cols
[2024-06-01 05:21:58] [INFO ] Computed 5 invariants in 3 ms
[2024-06-01 05:21:58] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
[2024-06-01 05:22:21] [INFO ] Deduced a trap composed of 5 places in 294 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 135/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2294/2294 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2294 constraints, Known Traps: 1/1 constraints]
After SMT, in 56606ms problems are : Problem set: 0 solved, 2294 unsolved
Search for dead transitions found 0 dead transitions in 56633ms
[2024-06-01 05:22:54] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-06-01 05:22:54] [INFO ] Invariant cache hit.
[2024-06-01 05:22:54] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-06-01 05:22:54] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-06-01 05:22:54] [INFO ] Invariant cache hit.
[2024-06-01 05:22:54] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 05:22:55] [INFO ] Implicit Places using invariants and state equation in 343 ms returned [53, 106]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 443 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 133/136 places, 2297/2298 transitions.
Applied a total of 0 rules in 316 ms. Remains 133 /133 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 57816 ms. Remains : 133/136 places, 2297/2298 transitions.
Stuttering acceptance computed with spot in 173 ms :[(OR (AND p0 (NOT p1)) (AND p2 (NOT p3))), (OR (AND p0 (NOT p1)) (AND p2 (NOT p3))), (AND p0 (NOT p1)), (AND p2 (NOT p3))]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N20-LTLFireability-04
Product exploration explored 100000 steps with 1506 reset in 3685 ms.
Product exploration explored 100000 steps with 1531 reset in 3482 ms.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 p3 (NOT p2)), (X (NOT p2)), (X p3), (X (NOT (OR (AND p1 (NOT p3) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2))))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p3) p2))), (X (NOT p1)), (X (X (NOT (OR (AND p1 (NOT p3) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2)))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (OR (AND (NOT p1) p0) (AND (NOT p3) p2))), (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p3) p2)))), (X (OR (AND (NOT p1) (NOT p0) p3) (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p0) p3) (AND (NOT p1) (NOT p0) (NOT p2))))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p3)), (X (X (NOT p3))), (X (X (OR (AND (NOT p1) p0) (AND (NOT p3) p2)))), (X (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p3) p2))))), (X (X (OR (AND (NOT p1) (NOT p0) p3) (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0) p3) (AND (NOT p1) (NOT p0) (NOT p2)))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p3) p2))), (X (X (NOT (AND (NOT p3) p2)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 10 factoid took 901 ms. Reduced automaton from 4 states, 11 edges and 4 AP (stutter insensitive) to 4 states, 11 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 175 ms :[(OR (AND p0 (NOT p1)) (AND p2 (NOT p3))), (OR (AND p0 (NOT p1)) (AND p2 (NOT p3))), (AND p0 (NOT p1)), (AND p2 (NOT p3))]
RANDOM walk for 842 steps (0 resets) in 141 ms. (5 steps per ms) remains 0/11 properties
Knowledge obtained : [(AND (NOT p1) p0 p3 (NOT p2)), (X (NOT p2)), (X p3), (X (NOT (OR (AND p1 (NOT p3) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2))))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p3) p2))), (X (NOT p1)), (X (X (NOT (OR (AND p1 (NOT p3) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2)))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (OR (AND (NOT p1) p0) (AND (NOT p3) p2))), (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p3) p2)))), (X (OR (AND (NOT p1) (NOT p0) p3) (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p0) p3) (AND (NOT p1) (NOT p0) (NOT p2))))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p3)), (X (X (NOT p3))), (X (X (OR (AND (NOT p1) p0) (AND (NOT p3) p2)))), (X (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p3) p2))))), (X (X (OR (AND (NOT p1) (NOT p0) p3) (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0) p3) (AND (NOT p1) (NOT p0) (NOT p2)))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p3) p2))), (X (X (NOT (AND (NOT p3) p2)))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND (OR p1 p2 p0) (OR p1 (NOT p3) p0)))), (F (NOT p3)), (F (NOT (AND (OR (NOT p1) p2 p3) (OR p2 p3 p0)))), (F (NOT (OR (NOT p2) p3))), (F p2), (F (NOT (OR p2 p3))), (F (NOT (AND (NOT p1) p0))), (F (NOT (OR p1 p0))), (F p1), (F (NOT (OR (AND (NOT p1) p0) (AND p2 (NOT p3))))), (F (NOT p0))]
Knowledge based reduction with 10 factoid took 1408 ms. Reduced automaton from 4 states, 11 edges and 4 AP (stutter insensitive) to 4 states, 11 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 204 ms :[(OR (AND p0 (NOT p1)) (AND p2 (NOT p3))), (OR (AND p0 (NOT p1)) (AND p2 (NOT p3))), (AND p0 (NOT p1)), (AND p2 (NOT p3))]
Stuttering acceptance computed with spot in 197 ms :[(OR (AND p0 (NOT p1)) (AND p2 (NOT p3))), (OR (AND p0 (NOT p1)) (AND p2 (NOT p3))), (AND p0 (NOT p1)), (AND p2 (NOT p3))]
[2024-06-01 05:23:05] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
// Phase 1: matrix 288 rows 133 cols
[2024-06-01 05:23:06] [INFO ] Computed 5 invariants in 3 ms
[2024-06-01 05:23:08] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-06-01 05:23:08] [INFO ] [Real]Absence check using state equation in 261 ms returned sat
[2024-06-01 05:23:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:23:09] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-06-01 05:23:10] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2024-06-01 05:23:10] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 05:23:10] [INFO ] [Nat]Added 41 Read/Feed constraints in 213 ms returned sat
[2024-06-01 05:23:10] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 165 transitions) in 137 ms.
[2024-06-01 05:23:10] [INFO ] Added : 59 causal constraints over 14 iterations in 476 ms. Result :sat
Could not prove EG (AND p0 (NOT p1))
Support contains 127 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 2297/2297 transitions.
Applied a total of 0 rules in 273 ms. Remains 133 /133 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
Running 2294 sub problems to find dead transitions.
[2024-06-01 05:23:11] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-06-01 05:23:11] [INFO ] Invariant cache hit.
[2024-06-01 05:23:11] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
[2024-06-01 05:23:34] [INFO ] Deduced a trap composed of 5 places in 201 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 133/421 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2294/2294 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 133/421 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2294 constraints, Known Traps: 1/1 constraints]
After SMT, in 55969ms problems are : Problem set: 0 solved, 2294 unsolved
Search for dead transitions found 0 dead transitions in 55996ms
[2024-06-01 05:24:07] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-06-01 05:24:07] [INFO ] Invariant cache hit.
[2024-06-01 05:24:07] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-01 05:24:07] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-06-01 05:24:07] [INFO ] Invariant cache hit.
[2024-06-01 05:24:07] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 05:24:07] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
[2024-06-01 05:24:07] [INFO ] Redundant transitions in 270 ms returned []
Running 2294 sub problems to find dead transitions.
[2024-06-01 05:24:07] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-06-01 05:24:07] [INFO ] Invariant cache hit.
[2024-06-01 05:24:07] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
[2024-06-01 05:24:31] [INFO ] Deduced a trap composed of 5 places in 305 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 133/421 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2294/2294 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 133/421 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2294 constraints, Known Traps: 1/1 constraints]
After SMT, in 76199ms problems are : Problem set: 0 solved, 2294 unsolved
Search for dead transitions found 0 dead transitions in 76221ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 133161 ms. Remains : 133/133 places, 2297/2297 transitions.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2) p3), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p3)))), (X p3), (X (NOT (AND p2 (NOT p3)))), (X (NOT (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p3) (NOT p0))))), (X (NOT p1)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p3) (NOT p0)))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p1) p3 (NOT p0)))), (X (NOT (OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p1) p3 (NOT p0))))), (X (OR (AND (NOT p1) p0) (AND p2 (NOT p3)))), (X (NOT (OR (AND (NOT p1) p0) (AND p2 (NOT p3))))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p3)), (X (X (NOT p3))), (X (X (OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p1) p3 (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p1) p3 (NOT p0)))))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (OR (AND (NOT p1) p0) (AND p2 (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) p0) (AND p2 (NOT p3)))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 10 factoid took 704 ms. Reduced automaton from 4 states, 11 edges and 4 AP (stutter insensitive) to 4 states, 11 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 183 ms :[(OR (AND p2 (NOT p3)) (AND p0 (NOT p1))), (OR (AND p2 (NOT p3)) (AND p0 (NOT p1))), (AND p0 (NOT p1)), (AND p2 (NOT p3))]
RANDOM walk for 1220 steps (0 resets) in 239 ms. (5 steps per ms) remains 0/11 properties
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2) p3), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p3)))), (X p3), (X (NOT (AND p2 (NOT p3)))), (X (NOT (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p3) (NOT p0))))), (X (NOT p1)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p3) (NOT p0)))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p1) p3 (NOT p0)))), (X (NOT (OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p1) p3 (NOT p0))))), (X (OR (AND (NOT p1) p0) (AND p2 (NOT p3)))), (X (NOT (OR (AND (NOT p1) p0) (AND p2 (NOT p3))))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p3)), (X (X (NOT p3))), (X (X (OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p1) p3 (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p1) p3 (NOT p0)))))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (OR (AND (NOT p1) p0) (AND p2 (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) p0) (AND p2 (NOT p3)))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND (OR p2 p1 p0) (OR (NOT p3) p1 p0)))), (F (NOT p3)), (F (NOT (AND (OR p2 p3 (NOT p1)) (OR p2 p3 p0)))), (F (NOT (OR (NOT p2) p3))), (F p2), (F (NOT (OR p2 p3))), (F (NOT (AND (NOT p1) p0))), (F (NOT p0)), (F p1), (F (NOT (OR p1 p0))), (F (NOT (OR (AND p2 (NOT p3)) (AND (NOT p1) p0))))]
Knowledge based reduction with 10 factoid took 1139 ms. Reduced automaton from 4 states, 11 edges and 4 AP (stutter insensitive) to 4 states, 11 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 242 ms :[(OR (AND p2 (NOT p3)) (AND p0 (NOT p1))), (OR (AND p2 (NOT p3)) (AND p0 (NOT p1))), (AND p0 (NOT p1)), (AND p2 (NOT p3))]
Stuttering acceptance computed with spot in 189 ms :[(OR (AND p2 (NOT p3)) (AND p0 (NOT p1))), (OR (AND p2 (NOT p3)) (AND p0 (NOT p1))), (AND p0 (NOT p1)), (AND p2 (NOT p3))]
[2024-06-01 05:25:26] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-06-01 05:25:26] [INFO ] Invariant cache hit.
[2024-06-01 05:25:28] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-06-01 05:25:29] [INFO ] [Real]Absence check using state equation in 300 ms returned sat
[2024-06-01 05:25:29] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:25:31] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-06-01 05:25:31] [INFO ] [Nat]Absence check using state equation in 179 ms returned sat
[2024-06-01 05:25:31] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 05:25:32] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 05:25:34] [INFO ] [Nat]Added 41 Read/Feed constraints in 3029 ms returned unknown
Could not prove EG (AND p0 (NOT p1))
Stuttering acceptance computed with spot in 229 ms :[(OR (AND p2 (NOT p3)) (AND p0 (NOT p1))), (OR (AND p2 (NOT p3)) (AND p0 (NOT p1))), (AND p0 (NOT p1)), (AND p2 (NOT p3))]
Product exploration timeout after 86450 steps with 1279 reset in 10001 ms.
Product exploration timeout after 89160 steps with 1335 reset in 10001 ms.
Support contains 127 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 2297/2297 transitions.
Applied a total of 0 rules in 308 ms. Remains 133 /133 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
Running 2294 sub problems to find dead transitions.
[2024-06-01 05:25:54] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-06-01 05:25:54] [INFO ] Invariant cache hit.
[2024-06-01 05:25:54] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
[2024-06-01 05:26:20] [INFO ] Deduced a trap composed of 5 places in 288 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 133/421 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2294/2294 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 133/421 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2294 constraints, Known Traps: 1/1 constraints]
After SMT, in 57147ms problems are : Problem set: 0 solved, 2294 unsolved
Search for dead transitions found 0 dead transitions in 57175ms
[2024-06-01 05:26:51] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-06-01 05:26:51] [INFO ] Invariant cache hit.
[2024-06-01 05:26:52] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-06-01 05:26:52] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-06-01 05:26:52] [INFO ] Invariant cache hit.
[2024-06-01 05:26:52] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 05:26:52] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
[2024-06-01 05:26:52] [INFO ] Redundant transitions in 41 ms returned []
Running 2294 sub problems to find dead transitions.
[2024-06-01 05:26:52] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-06-01 05:26:52] [INFO ] Invariant cache hit.
[2024-06-01 05:26:52] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
[2024-06-01 05:27:16] [INFO ] Deduced a trap composed of 5 places in 228 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 133/421 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2294/2294 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 133/421 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2294 constraints, Known Traps: 1/1 constraints]
After SMT, in 76155ms problems are : Problem set: 0 solved, 2294 unsolved
Search for dead transitions found 0 dead transitions in 76177ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 134143 ms. Remains : 133/133 places, 2297/2297 transitions.
Treatment of property BridgeAndVehicles-COL-V50P50N20-LTLFireability-04 finished in 371362 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)||((G(p3)||p2)&&p1))))'
Support contains 128 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 2298/2298 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 135 transition count 2297
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 135 transition count 2297
Applied a total of 2 rules in 288 ms. Remains 135 /136 variables (removed 1) and now considering 2297/2298 (removed 1) transitions.
Running 2294 sub problems to find dead transitions.
[2024-06-01 05:28:09] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
// Phase 1: matrix 288 rows 135 cols
[2024-06-01 05:28:09] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 05:28:09] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
[2024-06-01 05:28:33] [INFO ] Deduced a trap composed of 5 places in 238 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 135/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 20047 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2294/2294 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2294 constraints, Known Traps: 1/1 constraints]
After SMT, in 56490ms problems are : Problem set: 0 solved, 2294 unsolved
Search for dead transitions found 0 dead transitions in 56516ms
[2024-06-01 05:29:05] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-06-01 05:29:05] [INFO ] Invariant cache hit.
[2024-06-01 05:29:05] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-01 05:29:05] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-06-01 05:29:05] [INFO ] Invariant cache hit.
[2024-06-01 05:29:05] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 05:29:06] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
[2024-06-01 05:29:06] [INFO ] Redundant transitions in 182 ms returned []
Running 2294 sub problems to find dead transitions.
[2024-06-01 05:29:06] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-06-01 05:29:06] [INFO ] Invariant cache hit.
[2024-06-01 05:29:06] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
[2024-06-01 05:29:30] [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 135/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2294/2294 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2294 constraints, Known Traps: 1/1 constraints]
After SMT, in 76448ms problems are : Problem set: 0 solved, 2294 unsolved
Search for dead transitions found 0 dead transitions in 76469ms
Starting structural reductions in SI_LTL mode, iteration 1 : 135/136 places, 2297/2298 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 133848 ms. Remains : 135/136 places, 2297/2298 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N20-LTLFireability-05
Product exploration explored 100000 steps with 3464 reset in 2598 ms.
Product exploration explored 100000 steps with 3369 reset in 2303 ms.
Computed a total of 108 stabilizing places and 203 stable transitions
Computed a total of 108 stabilizing places and 203 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2) (NOT p3))))), (X (NOT (AND p0 p1 (NOT p2) p3))), (X (NOT (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p2) (NOT p3))))), (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p2) p3)))), (X (NOT (OR (AND p0 (NOT p1) p3) (AND p0 (NOT p2) p3)))), (X (NOT p0)), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p2) p3))), (X (X (NOT p3))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2) (NOT p3)))))), (X (X (NOT (AND p0 p1 (NOT p2) p3)))), (X (X (NOT (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p2) (NOT p3)))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p2) p3))))), (X (X (NOT (OR (AND p0 (NOT p1) p3) (AND p0 (NOT p2) p3))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) p3))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3)))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 20 factoid took 733 ms. Reduced automaton from 2 states, 8 edges and 4 AP (stutter insensitive) to 2 states, 8 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))]
RANDOM walk for 40000 steps (92 resets) in 1112 ms. (35 steps per ms) remains 2/12 properties
BEST_FIRST walk for 40003 steps (36 resets) in 2256 ms. (17 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (40 resets) in 1210 ms. (33 steps per ms) remains 2/2 properties
[2024-06-01 05:30:29] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-06-01 05:30:29] [INFO ] Invariant cache hit.
[2024-06-01 05:30:29] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf6 is UNSAT
Problem apf8 is UNSAT
After SMT solving in domain Real declared 133/423 variables, and 5 constraints, problems are : Problem set: 2 solved, 0 unsolved in 116 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 421ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2) (NOT p3))))), (X (NOT (AND p0 p1 (NOT p2) p3))), (X (NOT (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p2) (NOT p3))))), (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p2) p3)))), (X (NOT (OR (AND p0 (NOT p1) p3) (AND p0 (NOT p2) p3)))), (X (NOT p0)), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p2) p3))), (X (X (NOT p3))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2) (NOT p3)))))), (X (X (NOT (AND p0 p1 (NOT p2) p3)))), (X (X (NOT (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p2) (NOT p3)))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p2) p3))))), (X (X (NOT (OR (AND p0 (NOT p1) p3) (AND p0 (NOT p2) p3))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) p3)))), (G (AND (OR (NOT p0) p1 (NOT p3)) (OR (NOT p0) (NOT p3) p2))), (G (OR (NOT p0) (NOT p1) (NOT p3) p2))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3)))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (OR p0 p1 (NOT p3)) (OR p0 (NOT p3) p2)))), (F p0), (F (NOT (AND (OR (NOT p0) p1 p3) (OR (NOT p0) p3 p2)))), (F (NOT (OR p0 (NOT p1) (NOT p3) p2))), (F (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3) (NOT p2))))), (F p2), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2))))), (F p3), (F p1), (F (NOT (AND (OR (NOT p0) p1) (OR (NOT p0) p3 p2))))]
Knowledge based reduction with 22 factoid took 1160 ms. Reduced automaton from 2 states, 8 edges and 4 AP (stutter insensitive) to 2 states, 8 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(OR (AND p0 p1 p3 (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND p0 p1 p3 (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))]
Stuttering acceptance computed with spot in 122 ms :[(OR (AND p0 p1 p3 (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND p0 p1 p3 (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))]
[2024-06-01 05:30:31] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-06-01 05:30:31] [INFO ] Invariant cache hit.
[2024-06-01 05:30:34] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2024-06-01 05:30:35] [INFO ] [Real]Absence check using state equation in 245 ms returned sat
[2024-06-01 05:30:35] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:30:37] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-06-01 05:30:38] [INFO ] [Nat]Absence check using state equation in 214 ms returned sat
[2024-06-01 05:30:38] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 05:30:38] [INFO ] [Nat]Added 41 Read/Feed constraints in 308 ms returned sat
[2024-06-01 05:30:38] [INFO ] Deduced a trap composed of 26 places in 296 ms of which 2 ms to minimize.
[2024-06-01 05:30:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 443 ms
[2024-06-01 05:30:39] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 165 transitions) in 186 ms.
[2024-06-01 05:30:39] [INFO ] Added : 24 causal constraints over 7 iterations in 855 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2) (NOT p3))
[2024-06-01 05:30:39] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-06-01 05:30:39] [INFO ] Invariant cache hit.
[2024-06-01 05:30:41] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-06-01 05:30:42] [INFO ] [Real]Absence check using state equation in 244 ms returned sat
[2024-06-01 05:30:42] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:30:44] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-06-01 05:30:44] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2024-06-01 05:30:44] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 05:30:44] [INFO ] [Nat]Added 41 Read/Feed constraints in 86 ms returned sat
[2024-06-01 05:30:44] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 165 transitions) in 80 ms.
[2024-06-01 05:30:44] [INFO ] Added : 18 causal constraints over 5 iterations in 280 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 128 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 2297/2297 transitions.
Applied a total of 0 rules in 311 ms. Remains 135 /135 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
Running 2294 sub problems to find dead transitions.
[2024-06-01 05:30:45] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-06-01 05:30:45] [INFO ] Invariant cache hit.
[2024-06-01 05:30:45] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
[2024-06-01 05:31:09] [INFO ] Deduced a trap composed of 5 places in 236 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 135/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2294/2294 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2294 constraints, Known Traps: 1/1 constraints]
After SMT, in 56166ms problems are : Problem set: 0 solved, 2294 unsolved
Search for dead transitions found 0 dead transitions in 56192ms
[2024-06-01 05:31:41] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-06-01 05:31:41] [INFO ] Invariant cache hit.
[2024-06-01 05:31:41] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-01 05:31:41] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-06-01 05:31:41] [INFO ] Invariant cache hit.
[2024-06-01 05:31:41] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 05:31:41] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
[2024-06-01 05:31:41] [INFO ] Redundant transitions in 100 ms returned []
Running 2294 sub problems to find dead transitions.
[2024-06-01 05:31:41] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-06-01 05:31:41] [INFO ] Invariant cache hit.
[2024-06-01 05:31:41] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
[2024-06-01 05:32:05] [INFO ] Deduced a trap composed of 5 places in 255 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 135/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2294/2294 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2294 constraints, Known Traps: 1/1 constraints]
After SMT, in 76148ms problems are : Problem set: 0 solved, 2294 unsolved
Search for dead transitions found 0 dead transitions in 76177ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 133163 ms. Remains : 135/135 places, 2297/2297 transitions.
Computed a total of 108 stabilizing places and 203 stable transitions
Computed a total of 108 stabilizing places and 203 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (X (NOT p2)), (X (NOT p3)), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2)) (AND p0 p1 p3 (NOT p2)))), (X (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3) (NOT p2)) (AND p0 (NOT p1) p3) (AND p0 p3 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p3 (NOT p2)))), (X (NOT (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p3) (NOT p2))))), (X (NOT (AND p0 p1 p3 (NOT p2)))), (X (NOT (OR (AND (NOT p0) p3 (NOT p2)) (AND (NOT p1) p3)))), (X (NOT p0)), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p1 p3 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p3) (NOT p2)))))), (X (X (NOT (AND p0 p1 p3 (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) p3 (NOT p2)) (AND (NOT p1) p3))))), (X (X (NOT p0))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2))))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2)) (AND p0 p1 p3 (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2)) (AND p0 p1 p3 (NOT p2)))))), (X (X (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3) (NOT p2)) (AND p0 (NOT p1) p3) (AND p0 p3 (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3) (NOT p2)) (AND p0 (NOT p1) p3) (AND p0 p3 (NOT p2)))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 18 factoid took 669 ms. Reduced automaton from 2 states, 8 edges and 4 AP (stutter insensitive) to 2 states, 8 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(OR (AND p0 p1 (NOT p2) p3) (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND p0 p1 (NOT p2) p3) (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))]
RANDOM walk for 40000 steps (92 resets) in 966 ms. (41 steps per ms) remains 1/11 properties
BEST_FIRST walk for 40001 steps (36 resets) in 931 ms. (42 steps per ms) remains 1/1 properties
[2024-06-01 05:32:59] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-06-01 05:32:59] [INFO ] Invariant cache hit.
[2024-06-01 05:32:59] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf5 is UNSAT
After SMT solving in domain Real declared 133/423 variables, and 5 constraints, problems are : Problem set: 1 solved, 0 unsolved in 136 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 310ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (X (NOT p2)), (X (NOT p3)), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2)) (AND p0 p1 p3 (NOT p2)))), (X (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3) (NOT p2)) (AND p0 (NOT p1) p3) (AND p0 p3 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p3 (NOT p2)))), (X (NOT (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p3) (NOT p2))))), (X (NOT (AND p0 p1 p3 (NOT p2)))), (X (NOT (OR (AND (NOT p0) p3 (NOT p2)) (AND (NOT p1) p3)))), (X (NOT p0)), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p1 p3 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p3) (NOT p2)))))), (X (X (NOT (AND p0 p1 p3 (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) p3 (NOT p2)) (AND (NOT p1) p3))))), (X (X (NOT p0))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2)))))), (G (OR (NOT p0) (NOT p1) p2 (NOT p3)))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2)) (AND p0 p1 p3 (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2)) (AND p0 p1 p3 (NOT p2)))))), (X (X (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3) (NOT p2)) (AND p0 (NOT p1) p3) (AND p0 p3 (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3) (NOT p2)) (AND p0 (NOT p1) p3) (AND p0 p3 (NOT p2)))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (OR (NOT p0) p1) (OR (NOT p0) p2 p3)))), (F (NOT (AND (OR p0 p2 (NOT p3)) (OR p1 (NOT p3))))), (F (NOT (AND (OR (NOT p0) p1 p3) (OR (NOT p0) p2 p3)))), (F p2), (F (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)) (AND p0 (NOT p1) p3) (AND p0 (NOT p2) p3)))), (F p3), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p3)) (AND p0 p1 (NOT p2) p3)))), (F (NOT (OR p0 (NOT p1) p2 (NOT p3)))), (F p0), (F p1)]
Knowledge based reduction with 19 factoid took 1203 ms. Reduced automaton from 2 states, 8 edges and 4 AP (stutter insensitive) to 2 states, 7 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))]
Stuttering acceptance computed with spot in 128 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))]
[2024-06-01 05:33:01] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-06-01 05:33:01] [INFO ] Invariant cache hit.
[2024-06-01 05:33:04] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2024-06-01 05:33:04] [INFO ] [Real]Absence check using state equation in 260 ms returned sat
[2024-06-01 05:33:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:33:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-06-01 05:33:07] [INFO ] [Nat]Absence check using state equation in 320 ms returned sat
[2024-06-01 05:33:07] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 05:33:08] [INFO ] [Nat]Added 41 Read/Feed constraints in 449 ms returned sat
[2024-06-01 05:33:08] [INFO ] Deduced a trap composed of 26 places in 296 ms of which 1 ms to minimize.
[2024-06-01 05:33:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 543 ms
[2024-06-01 05:33:08] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 165 transitions) in 79 ms.
[2024-06-01 05:33:09] [INFO ] Added : 24 causal constraints over 7 iterations in 896 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2) (NOT p3))
[2024-06-01 05:33:09] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-06-01 05:33:09] [INFO ] Invariant cache hit.
[2024-06-01 05:33:11] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-06-01 05:33:11] [INFO ] [Real]Absence check using state equation in 238 ms returned sat
[2024-06-01 05:33:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:33:14] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-06-01 05:33:14] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2024-06-01 05:33:14] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 05:33:14] [INFO ] [Nat]Added 41 Read/Feed constraints in 85 ms returned sat
[2024-06-01 05:33:14] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 165 transitions) in 81 ms.
[2024-06-01 05:33:14] [INFO ] Added : 18 causal constraints over 5 iterations in 215 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 88 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))]
Product exploration explored 100000 steps with 3415 reset in 2576 ms.
Product exploration explored 100000 steps with 3531 reset in 2605 ms.
Support contains 128 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 2297/2297 transitions.
Applied a total of 0 rules in 202 ms. Remains 135 /135 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
Running 2294 sub problems to find dead transitions.
[2024-06-01 05:33:20] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-06-01 05:33:20] [INFO ] Invariant cache hit.
[2024-06-01 05:33:20] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
[2024-06-01 05:33:44] [INFO ] Deduced a trap composed of 5 places in 291 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 135/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2294/2294 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2294 constraints, Known Traps: 1/1 constraints]
After SMT, in 56027ms problems are : Problem set: 0 solved, 2294 unsolved
Search for dead transitions found 0 dead transitions in 56048ms
[2024-06-01 05:34:16] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-06-01 05:34:16] [INFO ] Invariant cache hit.
[2024-06-01 05:34:16] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-06-01 05:34:16] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-06-01 05:34:16] [INFO ] Invariant cache hit.
[2024-06-01 05:34:16] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 05:34:16] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
[2024-06-01 05:34:16] [INFO ] Redundant transitions in 144 ms returned []
Running 2294 sub problems to find dead transitions.
[2024-06-01 05:34:16] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-06-01 05:34:16] [INFO ] Invariant cache hit.
[2024-06-01 05:34:16] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
[2024-06-01 05:34:40] [INFO ] Deduced a trap composed of 5 places in 247 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 135/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2294/2294 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2294 constraints, Known Traps: 1/1 constraints]
After SMT, in 76502ms problems are : Problem set: 0 solved, 2294 unsolved
Search for dead transitions found 0 dead transitions in 76529ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 133353 ms. Remains : 135/135 places, 2297/2297 transitions.
Treatment of property BridgeAndVehicles-COL-V50P50N20-LTLFireability-05 finished in 444514 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((G(p0)||G(p1))) U !p2)))'
Support contains 56 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 2298/2298 transitions.
Applied a total of 0 rules in 7 ms. Remains 136 /136 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
Running 2295 sub problems to find dead transitions.
[2024-06-01 05:35:33] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
// Phase 1: matrix 289 rows 136 cols
[2024-06-01 05:35:33] [INFO ] Computed 5 invariants in 3 ms
[2024-06-01 05:35:33] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
[2024-06-01 05:35:57] [INFO ] Deduced a trap composed of 5 places in 263 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/425 variables, and 6 constraints, problems are : Problem set: 0 solved, 2295 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2295/2295 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 136/425 variables, and 6 constraints, problems are : Problem set: 0 solved, 2295 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2295 constraints, Known Traps: 1/1 constraints]
After SMT, in 56133ms problems are : Problem set: 0 solved, 2295 unsolved
Search for dead transitions found 0 dead transitions in 56154ms
[2024-06-01 05:36:29] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-06-01 05:36:29] [INFO ] Invariant cache hit.
[2024-06-01 05:36:29] [INFO ] Implicit Places using invariants in 280 ms returned []
[2024-06-01 05:36:29] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-06-01 05:36:29] [INFO ] Invariant cache hit.
[2024-06-01 05:36:29] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 05:36:30] [INFO ] Implicit Places using invariants and state equation in 888 ms returned [53, 107]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1173 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 134/136 places, 2298/2298 transitions.
Applied a total of 0 rules in 11 ms. Remains 134 /134 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 57351 ms. Remains : 134/136 places, 2298/2298 transitions.
Stuttering acceptance computed with spot in 122 ms :[p2, p2, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N20-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 640 ms.
Product exploration explored 100000 steps with 50000 reset in 647 ms.
Computed a total of 107 stabilizing places and 204 stable transitions
Computed a total of 107 stabilizing places and 204 stable transitions
Detected a total of 107/134 stabilizing places and 204/2298 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 24 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-COL-V50P50N20-LTLFireability-06 finished in 58830 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(!p0)))))'
Support contains 1 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 2298/2298 transitions.
Applied a total of 0 rules in 8 ms. Remains 136 /136 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
Running 2295 sub problems to find dead transitions.
[2024-06-01 05:36:32] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-06-01 05:36:32] [INFO ] Invariant cache hit.
[2024-06-01 05:36:32] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
[2024-06-01 05:36:56] [INFO ] Deduced a trap composed of 5 places in 322 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/425 variables, and 6 constraints, problems are : Problem set: 0 solved, 2295 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2295/2295 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 49)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 136/425 variables, and 6 constraints, problems are : Problem set: 0 solved, 2295 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2295 constraints, Known Traps: 1/1 constraints]
After SMT, in 55631ms problems are : Problem set: 0 solved, 2295 unsolved
Search for dead transitions found 0 dead transitions in 55651ms
[2024-06-01 05:37:27] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-06-01 05:37:27] [INFO ] Invariant cache hit.
[2024-06-01 05:37:28] [INFO ] Implicit Places using invariants in 357 ms returned []
[2024-06-01 05:37:28] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-06-01 05:37:28] [INFO ] Invariant cache hit.
[2024-06-01 05:37:28] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 05:37:29] [INFO ] Implicit Places using invariants and state equation in 1049 ms returned [53, 107]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1412 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 134/136 places, 2298/2298 transitions.
Applied a total of 0 rules in 8 ms. Remains 134 /134 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 57084 ms. Remains : 134/136 places, 2298/2298 transitions.
Stuttering acceptance computed with spot in 132 ms :[true, p0, p0, p0, p0]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N20-LTLFireability-07
Entered a terminal (fully accepting) state of product in 148 steps with 0 reset in 2 ms.
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P50N20-LTLFireability-07 finished in 57241 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((F((p1&&X(p2)))&&p0))))'
Support contains 127 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 2298/2298 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 135 transition count 2297
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 135 transition count 2297
Applied a total of 2 rules in 21 ms. Remains 135 /136 variables (removed 1) and now considering 2297/2298 (removed 1) transitions.
Running 2294 sub problems to find dead transitions.
[2024-06-01 05:37:29] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
// Phase 1: matrix 288 rows 135 cols
[2024-06-01 05:37:29] [INFO ] Computed 5 invariants in 4 ms
[2024-06-01 05:37:29] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
[2024-06-01 05:37:53] [INFO ] Deduced a trap composed of 5 places in 256 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 135/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2294/2294 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2294 constraints, Known Traps: 1/1 constraints]
After SMT, in 56489ms problems are : Problem set: 0 solved, 2294 unsolved
Search for dead transitions found 0 dead transitions in 56520ms
[2024-06-01 05:38:26] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-06-01 05:38:26] [INFO ] Invariant cache hit.
[2024-06-01 05:38:26] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-06-01 05:38:26] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-06-01 05:38:26] [INFO ] Invariant cache hit.
[2024-06-01 05:38:26] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 05:38:26] [INFO ] Implicit Places using invariants and state equation in 376 ms returned [106]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 488 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 134/136 places, 2297/2298 transitions.
Applied a total of 0 rules in 18 ms. Remains 134 /134 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 57056 ms. Remains : 134/136 places, 2297/2298 transitions.
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N20-LTLFireability-08
Entered a terminal (fully accepting) state of product in 26 steps with 2 reset in 4 ms.
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P50N20-LTLFireability-08 finished in 57308 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) U p2))))'
Support contains 107 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 2298/2298 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 135 transition count 2297
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 135 transition count 2297
Applied a total of 2 rules in 542 ms. Remains 135 /136 variables (removed 1) and now considering 2297/2298 (removed 1) transitions.
Running 2294 sub problems to find dead transitions.
[2024-06-01 05:38:27] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-06-01 05:38:27] [INFO ] Invariant cache hit.
[2024-06-01 05:38:27] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
[2024-06-01 05:38:51] [INFO ] Deduced a trap composed of 5 places in 278 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 135/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2294/2294 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2294 constraints, Known Traps: 1/1 constraints]
After SMT, in 55909ms problems are : Problem set: 0 solved, 2294 unsolved
Search for dead transitions found 0 dead transitions in 55935ms
[2024-06-01 05:39:23] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-06-01 05:39:23] [INFO ] Invariant cache hit.
[2024-06-01 05:39:23] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-06-01 05:39:23] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-06-01 05:39:23] [INFO ] Invariant cache hit.
[2024-06-01 05:39:23] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 05:39:23] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 563 ms to find 0 implicit places.
[2024-06-01 05:39:23] [INFO ] Redundant transitions in 79 ms returned []
Running 2294 sub problems to find dead transitions.
[2024-06-01 05:39:23] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-06-01 05:39:23] [INFO ] Invariant cache hit.
[2024-06-01 05:39:23] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
[2024-06-01 05:39:47] [INFO ] Deduced a trap composed of 5 places in 244 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 135/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2294/2294 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2294 constraints, Known Traps: 1/1 constraints]
After SMT, in 75684ms problems are : Problem set: 0 solved, 2294 unsolved
Search for dead transitions found 0 dead transitions in 75710ms
Starting structural reductions in SI_LTL mode, iteration 1 : 135/136 places, 2297/2298 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 132853 ms. Remains : 135/136 places, 2297/2298 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N20-LTLFireability-09
Stuttering criterion allowed to conclude after 1134 steps with 43 reset in 74 ms.
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P50N20-LTLFireability-09 finished in 133074 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(p1)))'
Support contains 55 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 2298/2298 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 135 transition count 2297
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 135 transition count 2297
Applied a total of 2 rules in 16 ms. Remains 135 /136 variables (removed 1) and now considering 2297/2298 (removed 1) transitions.
Running 2294 sub problems to find dead transitions.
[2024-06-01 05:40:39] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-06-01 05:40:39] [INFO ] Invariant cache hit.
[2024-06-01 05:40:39] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
[2024-06-01 05:41:03] [INFO ] Deduced a trap composed of 5 places in 248 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 135/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 20049 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2294/2294 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2294 constraints, Known Traps: 1/1 constraints]
After SMT, in 55986ms problems are : Problem set: 0 solved, 2294 unsolved
Search for dead transitions found 0 dead transitions in 56020ms
[2024-06-01 05:41:35] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-06-01 05:41:35] [INFO ] Invariant cache hit.
[2024-06-01 05:41:36] [INFO ] Implicit Places using invariants in 282 ms returned []
[2024-06-01 05:41:36] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-06-01 05:41:36] [INFO ] Invariant cache hit.
[2024-06-01 05:41:36] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 05:41:36] [INFO ] Implicit Places using invariants and state equation in 642 ms returned [53]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 928 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 134/136 places, 2297/2298 transitions.
Applied a total of 0 rules in 13 ms. Remains 134 /134 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 56984 ms. Remains : 134/136 places, 2297/2298 transitions.
Stuttering acceptance computed with spot in 204 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N20-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-COL-V50P50N20-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P50N20-LTLFireability-10 finished in 57210 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((!p0||F(!p1))) U (F(p2) U p3)))'
Support contains 129 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 2298/2298 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 135 transition count 2297
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 135 transition count 2297
Applied a total of 2 rules in 26 ms. Remains 135 /136 variables (removed 1) and now considering 2297/2298 (removed 1) transitions.
Running 2294 sub problems to find dead transitions.
[2024-06-01 05:41:37] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-06-01 05:41:37] [INFO ] Invariant cache hit.
[2024-06-01 05:41:37] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
[2024-06-01 05:42:01] [INFO ] Deduced a trap composed of 5 places in 265 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 135/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2294/2294 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2294 constraints, Known Traps: 1/1 constraints]
After SMT, in 55631ms problems are : Problem set: 0 solved, 2294 unsolved
Search for dead transitions found 0 dead transitions in 55668ms
[2024-06-01 05:42:32] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-06-01 05:42:32] [INFO ] Invariant cache hit.
[2024-06-01 05:42:32] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-01 05:42:32] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-06-01 05:42:32] [INFO ] Invariant cache hit.
[2024-06-01 05:42:33] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 05:42:33] [INFO ] Implicit Places using invariants and state equation in 294 ms returned [106]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 388 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 134/136 places, 2297/2298 transitions.
Applied a total of 0 rules in 15 ms. Remains 134 /134 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 56107 ms. Remains : 134/136 places, 2297/2298 transitions.
Stuttering acceptance computed with spot in 271 ms :[(NOT p3), (AND p3 (NOT p2) p0 p1), (AND (NOT p3) (NOT p2) p0 p1), (AND (NOT p2) p1), (AND (NOT p0) p1 (NOT p3))]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N20-LTLFireability-11
Product exploration explored 100000 steps with 17861 reset in 6462 ms.
Product exploration explored 100000 steps with 18108 reset in 6235 ms.
Computed a total of 107 stabilizing places and 203 stable transitions
Computed a total of 107 stabilizing places and 203 stable transitions
Detected a total of 107/134 stabilizing places and 203/2297 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p3) (NOT p2) p0 p1), (X (NOT p2)), (X (AND (NOT p3) (NOT p2))), (X (NOT p3)), (X (NOT (AND p3 (NOT p2) p0 p1))), (X p1), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND p3 (NOT p2) p0 p1)))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p3) p0 p1)), (X (NOT (AND (NOT p3) p0 p1))), (X (AND (NOT p3) (NOT p2) p0 p1)), (X (NOT (AND (NOT p3) (NOT p2) p0 p1))), (X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p3) p0 p1))), (X (X (NOT (AND (NOT p3) p0 p1)))), (X (X (AND (NOT p3) (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p3) (NOT p2) p0 p1)))), (X (X (AND (NOT p3) (NOT p0) p1))), (X (X (NOT (AND (NOT p3) (NOT p0) p1)))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT p3))), (X (X p3)), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1))))]
Knowledge based reduction with 10 factoid took 952 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 239 ms :[(NOT p3), (AND p3 (NOT p2) p0 p1), (AND (NOT p3) (NOT p2) p0 p1), (AND (NOT p2) p1), (AND (NOT p0) p1 (NOT p3))]
RANDOM walk for 40000 steps (92 resets) in 1161 ms. (34 steps per ms) remains 1/11 properties
BEST_FIRST walk for 40003 steps (44 resets) in 3906 ms. (10 steps per ms) remains 1/1 properties
[2024-06-01 05:42:48] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
// Phase 1: matrix 288 rows 134 cols
[2024-06-01 05:42:48] [INFO ] Computed 5 invariants in 4 ms
[2024-06-01 05:42:48] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf5 is UNSAT
After SMT solving in domain Real declared 133/422 variables, and 5 constraints, problems are : Problem set: 1 solved, 0 unsolved in 172 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/134 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 861ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) (NOT p2) p0 p1), (X (NOT p2)), (X (AND (NOT p3) (NOT p2))), (X (NOT p3)), (X (NOT (AND p3 (NOT p2) p0 p1))), (X p1), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND p3 (NOT p2) p0 p1)))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (G (OR (NOT p0) (NOT p1) p2 (NOT p3)))]
False Knowledge obtained : [(X (AND (NOT p3) p0 p1)), (X (NOT (AND (NOT p3) p0 p1))), (X (AND (NOT p3) (NOT p2) p0 p1)), (X (NOT (AND (NOT p3) (NOT p2) p0 p1))), (X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p3) p0 p1))), (X (X (NOT (AND (NOT p3) p0 p1)))), (X (X (AND (NOT p3) (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p3) (NOT p2) p0 p1)))), (X (X (AND (NOT p3) (NOT p0) p1))), (X (X (NOT (AND (NOT p3) (NOT p0) p1)))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT p3))), (X (X p3)), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (F p3), (F (NOT (AND p1 (NOT p2)))), (F (NOT (OR p0 (NOT p1) p3))), (F (NOT (AND (NOT p2) (NOT p3)))), (F (NOT (AND p0 p1 (NOT p2) (NOT p3)))), (F p2), (F (NOT (OR p0 (NOT p1) p2 p3))), (F (NOT (AND p0 p1 (NOT p3)))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 11 factoid took 1546 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[(NOT p3), (AND p0 p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) p1 (NOT p3))]
Stuttering acceptance computed with spot in 234 ms :[(NOT p3), (AND p0 p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) p1 (NOT p3))]
[2024-06-01 05:42:51] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-06-01 05:42:52] [INFO ] Invariant cache hit.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:828)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:584)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:619)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:252)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:958)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 05:43:11] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (NOT p3)
Could not prove EG (NOT p3)
Support contains 129 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 2297/2297 transitions.
Applied a total of 0 rules in 10 ms. Remains 134 /134 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
Running 2294 sub problems to find dead transitions.
[2024-06-01 05:43:11] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-06-01 05:43:11] [INFO ] Invariant cache hit.
[2024-06-01 05:43:11] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
[2024-06-01 05:43:35] [INFO ] Deduced a trap composed of 5 places in 241 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 134/422 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/134 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2294/2294 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 134/422 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/134 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2294 constraints, Known Traps: 1/1 constraints]
After SMT, in 55877ms problems are : Problem set: 0 solved, 2294 unsolved
Search for dead transitions found 0 dead transitions in 55908ms
[2024-06-01 05:44:07] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-06-01 05:44:07] [INFO ] Invariant cache hit.
[2024-06-01 05:44:07] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-01 05:44:07] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-06-01 05:44:07] [INFO ] Invariant cache hit.
[2024-06-01 05:44:07] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 05:44:07] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
Running 2294 sub problems to find dead transitions.
[2024-06-01 05:44:07] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-06-01 05:44:07] [INFO ] Invariant cache hit.
[2024-06-01 05:44:07] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
[2024-06-01 05:44:32] [INFO ] Deduced a trap composed of 5 places in 295 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 134/422 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/134 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2294/2294 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 134/422 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/134 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2294 constraints, Known Traps: 1/1 constraints]
After SMT, in 76526ms problems are : Problem set: 0 solved, 2294 unsolved
Search for dead transitions found 0 dead transitions in 76569ms
Finished structural reductions in LTL mode , in 1 iterations and 132822 ms. Remains : 134/134 places, 2297/2297 transitions.
Computed a total of 107 stabilizing places and 203 stable transitions
Computed a total of 107 stabilizing places and 203 stable transitions
Detected a total of 107/134 stabilizing places and 203/2297 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p3) p0 p1 (NOT p2)), (X (NOT p2)), (X (NOT p3)), (X p1), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X p0), (X (NOT p0)), (X (AND p0 p1 (NOT p3))), (X (NOT (AND p0 p1 (NOT p3)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT p3))), (X (X p3)), (X (X (AND (NOT p0) p1 (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 p1 (NOT p3)))), (X (X (NOT (AND p0 p1 (NOT p3)))))]
Knowledge based reduction with 7 factoid took 912 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 240 ms :[(NOT p3), (AND p0 p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) p1 (NOT p3))]
RANDOM walk for 974 steps (0 resets) in 79 ms. (12 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND (NOT p3) p0 p1 (NOT p2)), (X (NOT p2)), (X (NOT p3)), (X p1), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X p0), (X (NOT p0)), (X (AND p0 p1 (NOT p3))), (X (NOT (AND p0 p1 (NOT p3)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT p3))), (X (X p3)), (X (X (AND (NOT p0) p1 (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 p1 (NOT p3)))), (X (X (NOT (AND p0 p1 (NOT p3))))), (F (NOT (OR p0 (NOT p1) p3))), (F p3), (F (NOT (OR p0 (NOT p1) p2 p3))), (F (NOT p0)), (F p2), (F (NOT (AND p0 p1 (NOT p2)))), (F (NOT (AND p1 (NOT p2)))), (F (NOT (AND p0 p1 (NOT p3)))), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 1242 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[(NOT p3), (AND p0 p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) p1 (NOT p3))]
Stuttering acceptance computed with spot in 179 ms :[(NOT p3), (AND p0 p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) p1 (NOT p3))]
[2024-06-01 05:45:27] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-06-01 05:45:27] [INFO ] Invariant cache hit.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:828)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:584)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:619)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:262)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:958)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 05:45:47] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (NOT p3)
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 233 ms :[(NOT p3), (AND p0 p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) p1 (NOT p3))]
Product exploration explored 100000 steps with 12180 reset in 3378 ms.
Product exploration explored 100000 steps with 12779 reset in 3704 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 219 ms :[(NOT p3), (AND p0 p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) p1 (NOT p3))]
Support contains 129 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 2297/2297 transitions.
Applied a total of 0 rules in 325 ms. Remains 134 /134 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
Running 2294 sub problems to find dead transitions.
[2024-06-01 05:45:55] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-06-01 05:45:55] [INFO ] Invariant cache hit.
[2024-06-01 05:45:55] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
[2024-06-01 05:46:18] [INFO ] Deduced a trap composed of 5 places in 277 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 134/422 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/134 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2294/2294 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 134/422 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/134 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2294 constraints, Known Traps: 1/1 constraints]
After SMT, in 56121ms problems are : Problem set: 0 solved, 2294 unsolved
Search for dead transitions found 0 dead transitions in 56147ms
[2024-06-01 05:46:51] [INFO ] Redundant transitions in 41 ms returned []
Running 2294 sub problems to find dead transitions.
[2024-06-01 05:46:51] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-06-01 05:46:51] [INFO ] Invariant cache hit.
[2024-06-01 05:46:51] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
[2024-06-01 05:47:14] [INFO ] Deduced a trap composed of 5 places in 258 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 134/422 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/134 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2294/2294 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 134/422 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/134 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2294 constraints, Known Traps: 1/1 constraints]
After SMT, in 75956ms problems are : Problem set: 0 solved, 2294 unsolved
Search for dead transitions found 0 dead transitions in 75978ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 132507 ms. Remains : 134/134 places, 2297/2297 transitions.
Support contains 129 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 2297/2297 transitions.
Applied a total of 0 rules in 7 ms. Remains 134 /134 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
Running 2294 sub problems to find dead transitions.
[2024-06-01 05:48:07] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-06-01 05:48:07] [INFO ] Invariant cache hit.
[2024-06-01 05:48:07] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
[2024-06-01 05:48:31] [INFO ] Deduced a trap composed of 5 places in 271 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 134/422 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/134 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2294/2294 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 134/422 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/134 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2294 constraints, Known Traps: 1/1 constraints]
After SMT, in 56306ms problems are : Problem set: 0 solved, 2294 unsolved
Search for dead transitions found 0 dead transitions in 56328ms
[2024-06-01 05:49:03] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-06-01 05:49:03] [INFO ] Invariant cache hit.
[2024-06-01 05:49:03] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-01 05:49:03] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-06-01 05:49:03] [INFO ] Invariant cache hit.
[2024-06-01 05:49:03] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 05:49:04] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
Running 2294 sub problems to find dead transitions.
[2024-06-01 05:49:04] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-06-01 05:49:04] [INFO ] Invariant cache hit.
[2024-06-01 05:49:04] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
[2024-06-01 05:49:27] [INFO ] Deduced a trap composed of 5 places in 244 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 134/422 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/134 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2294/2294 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 134/422 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/134 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2294 constraints, Known Traps: 1/1 constraints]
After SMT, in 75848ms problems are : Problem set: 0 solved, 2294 unsolved
Search for dead transitions found 0 dead transitions in 75886ms
Finished structural reductions in LTL mode , in 1 iterations and 132569 ms. Remains : 134/134 places, 2297/2297 transitions.
Treatment of property BridgeAndVehicles-COL-V50P50N20-LTLFireability-11 finished in 523083 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))||(p0&&X(p1)))))'
Support contains 54 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 2298/2298 transitions.
Applied a total of 0 rules in 21 ms. Remains 136 /136 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
Running 2295 sub problems to find dead transitions.
[2024-06-01 05:50:20] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
// Phase 1: matrix 289 rows 136 cols
[2024-06-01 05:50:20] [INFO ] Computed 5 invariants in 6 ms
[2024-06-01 05:50:20] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
[2024-06-01 05:50:44] [INFO ] Deduced a trap composed of 5 places in 295 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/425 variables, and 6 constraints, problems are : Problem set: 0 solved, 2295 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2295/2295 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 136/425 variables, and 6 constraints, problems are : Problem set: 0 solved, 2295 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2295 constraints, Known Traps: 1/1 constraints]
After SMT, in 55902ms problems are : Problem set: 0 solved, 2295 unsolved
Search for dead transitions found 0 dead transitions in 55939ms
[2024-06-01 05:51:16] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-06-01 05:51:16] [INFO ] Invariant cache hit.
[2024-06-01 05:51:16] [INFO ] Implicit Places using invariants in 256 ms returned []
[2024-06-01 05:51:16] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-06-01 05:51:16] [INFO ] Invariant cache hit.
[2024-06-01 05:51:16] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 05:51:16] [INFO ] Implicit Places using invariants and state equation in 501 ms returned [107]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 761 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 135/136 places, 2298/2298 transitions.
Applied a total of 0 rules in 10 ms. Remains 135 /135 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 56737 ms. Remains : 135/136 places, 2298/2298 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N20-LTLFireability-14
Product exploration explored 100000 steps with 907 reset in 528 ms.
Product exploration explored 100000 steps with 880 reset in 492 ms.
Computed a total of 108 stabilizing places and 204 stable transitions
Computed a total of 108 stabilizing places and 204 stable transitions
Detected a total of 108/135 stabilizing places and 204/2298 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 246 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 362 steps (0 resets) in 9 ms. (36 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F p0)]
Knowledge based reduction with 4 factoid took 247 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 05:51:18] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
// Phase 1: matrix 289 rows 135 cols
[2024-06-01 05:51:18] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 05:51:19] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-06-01 05:51:19] [INFO ] [Real]Absence check using state equation in 247 ms returned sat
[2024-06-01 05:51:19] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:51:20] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-06-01 05:51:20] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2024-06-01 05:51:20] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 05:51:20] [INFO ] [Nat]Added 41 Read/Feed constraints in 143 ms returned sat
[2024-06-01 05:51:20] [INFO ] Deduced a trap composed of 25 places in 241 ms of which 1 ms to minimize.
[2024-06-01 05:51:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 333 ms
[2024-06-01 05:51:21] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 77 ms.
[2024-06-01 05:51:21] [INFO ] Added : 22 causal constraints over 5 iterations in 246 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 135 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 2298/2298 transitions.
Applied a total of 0 rules in 9 ms. Remains 135 /135 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
Running 2295 sub problems to find dead transitions.
[2024-06-01 05:51:21] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-06-01 05:51:21] [INFO ] Invariant cache hit.
[2024-06-01 05:51:21] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
[2024-06-01 05:51:44] [INFO ] Deduced a trap composed of 5 places in 242 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 135/424 variables, and 6 constraints, problems are : Problem set: 0 solved, 2295 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2295/2295 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/424 variables, and 6 constraints, problems are : Problem set: 0 solved, 2295 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2295 constraints, Known Traps: 1/1 constraints]
After SMT, in 55983ms problems are : Problem set: 0 solved, 2295 unsolved
Search for dead transitions found 0 dead transitions in 56008ms
[2024-06-01 05:52:17] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-06-01 05:52:17] [INFO ] Invariant cache hit.
[2024-06-01 05:52:17] [INFO ] Implicit Places using invariants in 306 ms returned []
[2024-06-01 05:52:17] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-06-01 05:52:17] [INFO ] Invariant cache hit.
[2024-06-01 05:52:17] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 05:52:18] [INFO ] Implicit Places using invariants and state equation in 1068 ms returned []
Implicit Place search using SMT with State Equation took 1376 ms to find 0 implicit places.
Running 2295 sub problems to find dead transitions.
[2024-06-01 05:52:18] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-06-01 05:52:18] [INFO ] Invariant cache hit.
[2024-06-01 05:52:18] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
[2024-06-01 05:52:43] [INFO ] Deduced a trap composed of 5 places in 254 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 135/424 variables, and 6 constraints, problems are : Problem set: 0 solved, 2295 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2295/2295 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/424 variables, and 6 constraints, problems are : Problem set: 0 solved, 2295 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2295 constraints, Known Traps: 1/1 constraints]
After SMT, in 76203ms problems are : Problem set: 0 solved, 2295 unsolved
Search for dead transitions found 0 dead transitions in 76228ms
Finished structural reductions in LTL mode , in 1 iterations and 133631 ms. Remains : 135/135 places, 2298/2298 transitions.
Computed a total of 108 stabilizing places and 204 stable transitions
Computed a total of 108 stabilizing places and 204 stable transitions
Detected a total of 108/135 stabilizing places and 204/2298 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 56 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 480 steps (0 resets) in 6 ms. (68 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 05:53:35] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-06-01 05:53:35] [INFO ] Invariant cache hit.
[2024-06-01 05:53:35] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 05:53:36] [INFO ] [Real]Absence check using state equation in 237 ms returned sat
[2024-06-01 05:53:36] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:53:36] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 05:53:36] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-06-01 05:53:36] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 05:53:36] [INFO ] [Nat]Added 41 Read/Feed constraints in 162 ms returned sat
[2024-06-01 05:53:36] [INFO ] Deduced a trap composed of 25 places in 176 ms of which 0 ms to minimize.
[2024-06-01 05:53:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 283 ms
[2024-06-01 05:53:37] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 64 ms.
[2024-06-01 05:53:37] [INFO ] Added : 22 causal constraints over 5 iterations in 201 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 911 reset in 503 ms.
Product exploration explored 100000 steps with 892 reset in 519 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 2298/2298 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 3 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 135 transition count 2298
Deduced a syphon composed of 1 places in 3 ms
Applied a total of 1 rules in 286 ms. Remains 135 /135 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
Running 2295 sub problems to find dead transitions.
[2024-06-01 05:53:38] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
// Phase 1: matrix 289 rows 135 cols
[2024-06-01 05:53:38] [INFO ] Computed 5 invariants in 4 ms
[2024-06-01 05:53:38] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
[2024-06-01 05:54:02] [INFO ] Deduced a trap composed of 5 places in 225 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 135/424 variables, and 6 constraints, problems are : Problem set: 0 solved, 2295 unsolved in 20056 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2295/2295 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/424 variables, and 6 constraints, problems are : Problem set: 0 solved, 2295 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2295 constraints, Known Traps: 1/1 constraints]
After SMT, in 55890ms problems are : Problem set: 0 solved, 2295 unsolved
Search for dead transitions found 0 dead transitions in 55911ms
[2024-06-01 05:54:34] [INFO ] Redundant transitions in 42 ms returned []
Running 2295 sub problems to find dead transitions.
[2024-06-01 05:54:34] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-06-01 05:54:34] [INFO ] Invariant cache hit.
[2024-06-01 05:54:34] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
[2024-06-01 05:54:58] [INFO ] Deduced a trap composed of 5 places in 246 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 135/424 variables, and 6 constraints, problems are : Problem set: 0 solved, 2295 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2295/2295 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/424 variables, and 6 constraints, problems are : Problem set: 0 solved, 2295 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2295 constraints, Known Traps: 1/1 constraints]
After SMT, in 76152ms problems are : Problem set: 0 solved, 2295 unsolved
Search for dead transitions found 0 dead transitions in 76171ms
Starting structural reductions in SI_LTL mode, iteration 1 : 135/135 places, 2298/2298 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 132426 ms. Remains : 135/135 places, 2298/2298 transitions.
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 2298/2298 transitions.
Applied a total of 0 rules in 10 ms. Remains 135 /135 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
Running 2295 sub problems to find dead transitions.
[2024-06-01 05:55:51] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
// Phase 1: matrix 289 rows 135 cols
[2024-06-01 05:55:51] [INFO ] Computed 5 invariants in 3 ms
[2024-06-01 05:55:51] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
[2024-06-01 05:56:15] [INFO ] Deduced a trap composed of 5 places in 249 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 135/424 variables, and 6 constraints, problems are : Problem set: 0 solved, 2295 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2295/2295 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/424 variables, and 6 constraints, problems are : Problem set: 0 solved, 2295 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2295 constraints, Known Traps: 1/1 constraints]
After SMT, in 56098ms problems are : Problem set: 0 solved, 2295 unsolved
Search for dead transitions found 0 dead transitions in 56123ms
[2024-06-01 05:56:47] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-06-01 05:56:47] [INFO ] Invariant cache hit.
[2024-06-01 05:56:47] [INFO ] Implicit Places using invariants in 349 ms returned []
[2024-06-01 05:56:47] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-06-01 05:56:47] [INFO ] Invariant cache hit.
[2024-06-01 05:56:47] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 05:56:48] [INFO ] Implicit Places using invariants and state equation in 832 ms returned [53]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1184 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 134/135 places, 2298/2298 transitions.
Applied a total of 0 rules in 10 ms. Remains 134 /134 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 57333 ms. Remains : 134/135 places, 2298/2298 transitions.
Treatment of property BridgeAndVehicles-COL-V50P50N20-LTLFireability-14 finished in 388480 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 2298/2298 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 135 transition count 2297
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 135 transition count 2297
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 133 transition count 2296
Applied a total of 5 rules in 403 ms. Remains 133 /136 variables (removed 3) and now considering 2296/2298 (removed 2) transitions.
[2024-06-01 05:56:49] [INFO ] Flow matrix only has 287 transitions (discarded 2009 similar events)
// Phase 1: matrix 287 rows 133 cols
[2024-06-01 05:56:49] [INFO ] Computed 4 invariants in 3 ms
[2024-06-01 05:56:49] [INFO ] Implicit Places using invariants in 370 ms returned []
[2024-06-01 05:56:49] [INFO ] Flow matrix only has 287 transitions (discarded 2009 similar events)
[2024-06-01 05:56:49] [INFO ] Invariant cache hit.
[2024-06-01 05:56:49] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 05:56:50] [INFO ] Implicit Places using invariants and state equation in 1037 ms returned [52, 104]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1411 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 131/136 places, 2296/2298 transitions.
Applied a total of 0 rules in 205 ms. Remains 131 /131 variables (removed 0) and now considering 2296/2296 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2021 ms. Remains : 131/136 places, 2296/2298 transitions.
Stuttering acceptance computed with spot in 78 ms :[p0, p0]
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N20-LTLFireability-15
Product exploration explored 100000 steps with 631 reset in 648 ms.
Product exploration explored 100000 steps with 666 reset in 477 ms.
Computed a total of 104 stabilizing places and 202 stable transitions
Computed a total of 104 stabilizing places and 202 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[p0, p0]
RANDOM walk for 506 steps (0 resets) in 7 ms. (63 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 117 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 82 ms :[p0, p0]
Stuttering acceptance computed with spot in 92 ms :[p0, p0]
Support contains 3 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 2296/2296 transitions.
Applied a total of 0 rules in 243 ms. Remains 131 /131 variables (removed 0) and now considering 2296/2296 (removed 0) transitions.
[2024-06-01 05:56:52] [INFO ] Flow matrix only has 287 transitions (discarded 2009 similar events)
// Phase 1: matrix 287 rows 131 cols
[2024-06-01 05:56:52] [INFO ] Computed 4 invariants in 4 ms
[2024-06-01 05:56:53] [INFO ] Implicit Places using invariants in 388 ms returned []
[2024-06-01 05:56:53] [INFO ] Flow matrix only has 287 transitions (discarded 2009 similar events)
[2024-06-01 05:56:53] [INFO ] Invariant cache hit.
[2024-06-01 05:56:53] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 05:56:53] [INFO ] Implicit Places using invariants and state equation in 785 ms returned []
Implicit Place search using SMT with State Equation took 1175 ms to find 0 implicit places.
[2024-06-01 05:56:53] [INFO ] Redundant transitions in 71 ms returned []
Running 2293 sub problems to find dead transitions.
[2024-06-01 05:56:53] [INFO ] Flow matrix only has 287 transitions (discarded 2009 similar events)
[2024-06-01 05:56:53] [INFO ] Invariant cache hit.
[2024-06-01 05:56:53] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2293 unsolved
[2024-06-01 05:57:17] [INFO ] Deduced a trap composed of 5 places in 221 ms of which 1 ms to minimize.
[2024-06-01 05:57:18] [INFO ] Deduced a trap composed of 24 places in 190 ms of which 0 ms to minimize.
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 131/418 variables, and 6 constraints, problems are : Problem set: 50 solved, 2243 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/131 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2293/2293 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 50 solved, 2243 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 4/4 constraints. Problems are: Problem set: 50 solved, 2243 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 2/6 constraints. Problems are: Problem set: 50 solved, 2243 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 131/418 variables, and 6 constraints, problems are : Problem set: 50 solved, 2243 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/131 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2293 constraints, Known Traps: 2/2 constraints]
After SMT, in 76239ms problems are : Problem set: 50 solved, 2243 unsolved
Search for dead transitions found 50 dead transitions in 76275ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 131/131 places, 2246/2296 transitions.
Applied a total of 0 rules in 215 ms. Remains 131 /131 variables (removed 0) and now considering 2246/2246 (removed 0) transitions.
[2024-06-01 05:58:10] [INFO ] Redundant transitions in 59 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 78063 ms. Remains : 131/131 places, 2246/2296 transitions.
Computed a total of 104 stabilizing places and 202 stable transitions
Computed a total of 104 stabilizing places and 202 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 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 76 ms :[p0, p0]
RANDOM walk for 487 steps (0 resets) in 8 ms. (54 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[p0, p0]
Stuttering acceptance computed with spot in 62 ms :[p0, p0]
Stuttering acceptance computed with spot in 61 ms :[p0, p0]
Product exploration explored 100000 steps with 648 reset in 584 ms.
Product exploration explored 100000 steps with 657 reset in 449 ms.
Support contains 3 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 2246/2246 transitions.
Applied a total of 0 rules in 150 ms. Remains 131 /131 variables (removed 0) and now considering 2246/2246 (removed 0) transitions.
[2024-06-01 05:58:12] [INFO ] Flow matrix only has 286 transitions (discarded 1960 similar events)
// Phase 1: matrix 286 rows 131 cols
[2024-06-01 05:58:12] [INFO ] Computed 4 invariants in 3 ms
[2024-06-01 05:58:12] [INFO ] Implicit Places using invariants in 360 ms returned []
[2024-06-01 05:58:12] [INFO ] Flow matrix only has 286 transitions (discarded 1960 similar events)
[2024-06-01 05:58:12] [INFO ] Invariant cache hit.
[2024-06-01 05:58:12] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-01 05:58:13] [INFO ] Implicit Places using invariants and state equation in 836 ms returned []
Implicit Place search using SMT with State Equation took 1200 ms to find 0 implicit places.
[2024-06-01 05:58:13] [INFO ] Redundant transitions in 59 ms returned []
Running 2243 sub problems to find dead transitions.
[2024-06-01 05:58:13] [INFO ] Flow matrix only has 286 transitions (discarded 1960 similar events)
[2024-06-01 05:58:13] [INFO ] Invariant cache hit.
[2024-06-01 05:58:13] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2243 unsolved
[2024-06-01 05:58:34] [INFO ] Deduced a trap composed of 5 places in 216 ms of which 0 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 131/417 variables, and 5 constraints, problems are : Problem set: 0 solved, 2243 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/131 constraints, ReadFeed: 0/40 constraints, PredecessorRefiner: 2243/2243 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2243 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2243 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2243 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 131/417 variables, and 5 constraints, problems are : Problem set: 0 solved, 2243 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/131 constraints, ReadFeed: 0/40 constraints, PredecessorRefiner: 0/2243 constraints, Known Traps: 1/1 constraints]
After SMT, in 74217ms problems are : Problem set: 0 solved, 2243 unsolved
Search for dead transitions found 0 dead transitions in 74242ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 75663 ms. Remains : 131/131 places, 2246/2246 transitions.
Treatment of property BridgeAndVehicles-COL-V50P50N20-LTLFireability-15 finished in 159311 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F((!p0&&X((!p0 U (!p1||G(!p0)))))))) U G(p2)))'
Found a Shortening insensitive property : BridgeAndVehicles-COL-V50P50N20-LTLFireability-01
Stuttering acceptance computed with spot in 222 ms :[(NOT p2), p0, (AND p0 (NOT p2)), p0, (AND p0 p1), false]
Support contains 125 out of 136 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 136/136 places, 2298/2298 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 135 transition count 2297
Applied a total of 2 rules in 35 ms. Remains 135 /136 variables (removed 1) and now considering 2297/2298 (removed 1) transitions.
Running 2294 sub problems to find dead transitions.
[2024-06-01 05:59:28] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
// Phase 1: matrix 288 rows 135 cols
[2024-06-01 05:59:28] [INFO ] Computed 5 invariants in 3 ms
[2024-06-01 05:59:28] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
[2024-06-01 05:59:52] [INFO ] Deduced a trap composed of 5 places in 248 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 135/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2294/2294 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/423 variables, and 6 constraints, problems are : Problem set: 0 solved, 2294 unsolved in 20056 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2294 constraints, Known Traps: 1/1 constraints]
After SMT, in 55890ms problems are : Problem set: 0 solved, 2294 unsolved
Search for dead transitions found 0 dead transitions in 55916ms
[2024-06-01 06:00:24] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-06-01 06:00:24] [INFO ] Invariant cache hit.
[2024-06-01 06:00:24] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-06-01 06:00:24] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
[2024-06-01 06:00:24] [INFO ] Invariant cache hit.
[2024-06-01 06:00:24] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 06:00:25] [INFO ] Implicit Places using invariants and state equation in 620 ms returned [53, 106]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 773 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 133/136 places, 2297/2298 transitions.
Applied a total of 0 rules in 47 ms. Remains 133 /133 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 56778 ms. Remains : 133/136 places, 2297/2298 transitions.
Running random walk in product with property : BridgeAndVehicles-COL-V50P50N20-LTLFireability-01
Product exploration explored 100000 steps with 24943 reset in 1053 ms.
Product exploration explored 100000 steps with 24976 reset in 846 ms.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Detected a total of 106/133 stabilizing places and 203/2297 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 169 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(NOT p2), p0, (AND p0 (NOT p2)), p0, (AND p0 p1), false]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 37094 steps (97 resets) in 3557 ms. (10 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (OR p2 p0))), (F (NOT p2)), (F (NOT (OR (NOT p1) p0))), (F (NOT (OR (NOT p1) (NOT p0))))]
Knowledge based reduction with 7 factoid took 603 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(NOT p2), p0, (AND p0 (NOT p2)), p0, (AND p0 p1), false]
Stuttering acceptance computed with spot in 225 ms :[(NOT p2), p0, (AND p0 (NOT p2)), p0, (AND p0 p1), false]
Support contains 125 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 2297/2297 transitions.
Applied a total of 0 rules in 7 ms. Remains 133 /133 variables (removed 0) and now considering 2297/2297 (removed 0) transitions.
Running 2294 sub problems to find dead transitions.
[2024-06-01 06:00:29] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
// Phase 1: matrix 288 rows 133 cols
[2024-06-01 06:00:29] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 06:00:29] [INFO ] State equation strengthened by 41 read => feed constraints.
Could not compute solution for formula : BridgeAndVehicles-COL-V50P50N20-LTLFireability-00
Could not compute solution for formula : BridgeAndVehicles-COL-V50P50N20-LTLFireability-01
Could not compute solution for formula : BridgeAndVehicles-COL-V50P50N20-LTLFireability-02
Could not compute solution for formula : BridgeAndVehicles-COL-V50P50N20-LTLFireability-03
Could not compute solution for formula : BridgeAndVehicles-COL-V50P50N20-LTLFireability-04
Could not compute solution for formula : BridgeAndVehicles-COL-V50P50N20-LTLFireability-05
Could not compute solution for formula : BridgeAndVehicles-COL-V50P50N20-LTLFireability-06
Could not compute solution for formula : BridgeAndVehicles-COL-V50P50N20-LTLFireability-07
Could not compute solution for formula : BridgeAndVehicles-COL-V50P50N20-LTLFireability-08
Could not compute solution for formula : BridgeAndVehicles-COL-V50P50N20-LTLFireability-09
Could not compute solution for formula : BridgeAndVehicles-COL-V50P50N20-LTLFireability-10
Could not compute solution for formula : BridgeAndVehicles-COL-V50P50N20-LTLFireability-11
Could not compute solution for formula : BridgeAndVehicles-COL-V50P50N20-LTLFireability-12
Could not compute solution for formula : BridgeAndVehicles-COL-V50P50N20-LTLFireability-13
Could not compute solution for formula : BridgeAndVehicles-COL-V50P50N20-LTLFireability-14
Could not compute solution for formula : BridgeAndVehicles-COL-V50P50N20-LTLFireability-15

BK_STOP 1717221643174

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name BridgeAndVehicles-COL-V50P50N20-LTLFireability-00
ltl formula formula --ltl=/tmp/3215/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 1/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
pnml2lts-mc( 0/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
pnml2lts-mc( 3/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
pnml2lts-mc( 2/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name BridgeAndVehicles-COL-V50P50N20-LTLFireability-01
ltl formula formula --ltl=/tmp/3215/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 1/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
pnml2lts-mc( 0/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name BridgeAndVehicles-COL-V50P50N20-LTLFireability-02
ltl formula formula --ltl=/tmp/3215/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 3/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
pnml2lts-mc( 2/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
pnml2lts-mc( 0/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
pnml2lts-mc( 1/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name BridgeAndVehicles-COL-V50P50N20-LTLFireability-03
ltl formula formula --ltl=/tmp/3215/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
ltl formula name BridgeAndVehicles-COL-V50P50N20-LTLFireability-04
ltl formula formula --ltl=/tmp/3215/ltl_4_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
ltl formula name BridgeAndVehicles-COL-V50P50N20-LTLFireability-05
ltl formula formula --ltl=/tmp/3215/ltl_5_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
ltl formula name BridgeAndVehicles-COL-V50P50N20-LTLFireability-06
ltl formula formula --ltl=/tmp/3215/ltl_6_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 1/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
ltl formula name BridgeAndVehicles-COL-V50P50N20-LTLFireability-07
ltl formula formula --ltl=/tmp/3215/ltl_7_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 1/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
ltl formula name BridgeAndVehicles-COL-V50P50N20-LTLFireability-08
ltl formula formula --ltl=/tmp/3215/ltl_8_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
pnml2lts-mc( 1/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name BridgeAndVehicles-COL-V50P50N20-LTLFireability-09
ltl formula formula --ltl=/tmp/3215/ltl_9_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
ltl formula name BridgeAndVehicles-COL-V50P50N20-LTLFireability-10
ltl formula formula --ltl=/tmp/3215/ltl_10_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
pnml2lts-mc( 1/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name BridgeAndVehicles-COL-V50P50N20-LTLFireability-11
ltl formula formula --ltl=/tmp/3215/ltl_11_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name BridgeAndVehicles-COL-V50P50N20-LTLFireability-12
ltl formula formula --ltl=/tmp/3215/ltl_12_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 3/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
pnml2lts-mc( 2/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
pnml2lts-mc( 1/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
ltl formula name BridgeAndVehicles-COL-V50P50N20-LTLFireability-13
ltl formula formula --ltl=/tmp/3215/ltl_13_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
ltl formula name BridgeAndVehicles-COL-V50P50N20-LTLFireability-14
ltl formula formula --ltl=/tmp/3215/ltl_14_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 1/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
ltl formula name BridgeAndVehicles-COL-V50P50N20-LTLFireability-15
ltl formula formula --ltl=/tmp/3215/ltl_15_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4), ** error **: pnml type "http://www.pnml.org/version-2009/grammar/symmetricnet" is not supported
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209

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-V50P50N20"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is BridgeAndVehicles-COL-V50P50N20, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r472-tajo-171620398800100"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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